Blind Oracular Quantum Computation

Abstract

In the standard oracle model, an oracle efficiently evaluates an unknown classical function independent of the quantum algorithm itself. Quantum algorithms have a complex interrelationship to their oracles; for example the possibility of quantum speedup is affected by the manner by which oracles are implemented. Therefore, it is physically meaningful to separate oracles from their quantum algorithms, and we introduce one such separation here. We define the Blind Oracular Quantum Computation (BOQC) scheme, in which the oracle is a distinct node in a quantum network. Our work augments the client-server setting of quantum computing, in which a powerful quantum computer server is available on the network for discreet use by clients on the network with low quantum power. In BOQC, an oracle is another client that cooperates with the main client so that an oracular quantum algorithm is run on the server. The cooperation between the main client and the oracle takes place (almost) without communication. We prove BOQC to be blind: the server cannot learn anything about the clients' computation. This proof is performed within the composable security definitions provided by the formalism of Abstract Cryptography. We enhance the BOQC scheme to be runnable with minimal physical qubits when run on a solid-state quantum network; we prove that this scheme, which we refer to as BOQCo (BOQC-optimized), possesses the same security as BOQC.

arXiv comment26 main pages, 8 figures, 8 pages of appendix

References in corpus (23)

• Measurement-based quantum computation with cluster states
• Experimental One-Way Quantum Computing
• Measurement-based quantum computation
• Remote State Preparation
• Entanglement of atoms via cold controlled collisions
• Experimental Demonstration of Blind Quantum Computing
• Quantum Circuits Architecture
• Security in Quantum Cryptography
• High-speed linear optics quantum computing using active feed-forward
• Unconditionally verifiable blind computation
• Experimental realization of one-way quantum computing with two-photon four-qubit cluster states
• Experimental verification of quantum computations
• Determinism in the one-way model
• Generalized Flow and Determinism in Measurement-based Quantum Computation
• Blind topological measurement-based quantum computation
• Experimental Realization of Deutsch's Algorithm in a One-way Quantum Computer
• Experimental Blind Quantum Computing for a Classical Client
• Demonstration of measurement-only blind quantum computing
• Composable security of delegated quantum computation
• Non-malleable encryption of quantum information
• Minimal physical resources for the realisation of measurement-based quantum computation
• Single query learning from abelian and non-abelian Hamming distance oracles
• Three-qubit exact Grover within the blind oracular quantum computation scheme