Blind Quantum Computation Using a Circuit-Based Quantum Computer
arXiv:2006.06255 · doi:10.7566/JPSJ.90.124001
Abstract
When a universal quantum computer is used by the public, it is assumed that it will be in the form of a quantum cloud server that exists in a few bases due to its cost. In this cloud server, privacy will be a crucial issue, and a blind quantum computation protocol will be necessary so that each user can use the server without the details of the calculations being revealed. It is also important to be able to verify that the server is performing calculations as instructed by the user, since quantum calculations cannot be verified by classical computation. In this paper, we put forward a protocol that achieves blindness using the quantum one-time pad for encryption and a T-like gate, and while verifying computation using trap qubits.
arXiv comment14 pages, 11 figures
References in corpus (17)
- Measurement-based quantum computation with cluster states
- Universal Quantum Computation with ideal Clifford gates and noisy ancillas
- Experimental One-Way Quantum Computing
- Instantaneous non-local computation of low T-depth quantum circuits
- The Heisenberg Representation of Quantum Computers
- Universal blind quantum computation
- Restrictions on Transversal Encoded Quantum Gate Sets
- Fault-Tolerant Error Correction with Efficient Quantum Codes
- Unconditionally verifiable blind computation
- Verifiable measurement-only blind quantum computing with stabilizer testing
- Blind quantum computation protocol in which Alice only makes measurements
- Surface code implementation of block code state distillation
- Interactive Proofs For Quantum Computations
- Delegating Private Quantum Computations
- Subsystem stabilizer codes cannot have a universal set of transversal gates for even one encoded qudit
- Device-Independent Verifiable Blind Quantum Computation
- Blind quantum computing can always be made verifiable