Complexity-Theoretic Limitations on Blind Delegated Quantum Computation
- Submitting institution
-
University of Edinburgh
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 162838133
- Type
- E - Conference contribution
- DOI
-
10.4230/LIPIcs.ICALP.2019.6
- Title of conference / published proceedings
- 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019)
- First page
- 6:1
- Volume
- 132
- Issue
- -
- ISSN
- 1868-8969
- Open access status
- Compliant
- Month of publication
- July
- Year of publication
- 2019
- URL
-
-
- Supplementary information
-
-
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
3
- Research group(s)
-
C - Foundations of Computation
- Citation count
- -
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Blind Quantum Computing enables a client with minimal quantum capacity to delegate the costly quantum computation to a remote untrusted server without revealing any information. This paper shows this functionality can not be obtained with a purely classical client unless some computational assumptions are made. The consequence of this theoretical result is that a quantum Internet is essential if we ever aim to achieve unconditional security for our quantum cloud platforms. It is rare that a purely complexity basis assumption could have such profound consequences that it establishes the need for a particular new branch of technology.
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -