Three-qubit exact Grover within the blind oracular quantum computation scheme
arXiv:1902.05534
Abstract
Here we extend the concept of blind client-server quantum computation, in which a client with limited quantum power controls the execution of a quantum computation on a powerful server, without revealing any details of the computation. Our extension is to introduce a three-node setting in which an oracular quantum computation can be executed blindly. In this Blind Oracular Quantum Computation (BOQC), the oracle (Oscar) is another node, with limited power, who acts in cooperation with the client (Alice) to supply quantum information to the server so that the oracle part of the quantum computation can also be executed blindly. We develop tests of this protocol using two- and three-qubit versions of the exact Grover algorithm (i.e., with database sizes ), obtaining optimal implementations of these algorithms within a gate array scheme and the blinded cluster-state scheme. We discuss the feasibility of executing these protocols in state-of-the-art three-node experiments using NV-diamond electronic and nuclear qubits.
arXiv comment20 pages, 7 figures
References in corpus (29)
- Experimental loophole-free violation of a Bell inequality using entangled electron spins separated by 1.3 km
- Measurement-based quantum computation with cluster states
- Experimental One-Way Quantum Computing
- Heralded entanglement between solid-state qubits separated by 3 meters
- Demonstration of Two-Qubit Algorithms with a Superconducting Quantum Processor
- Remote State Preparation
- Demonstration of a small programmable quantum computer with atomic qubits
- Classical Communication Cost in Distributed Quantum Information Processing - A generalization of Quantum Communication Complexity
- Grover's quantum searching algorithm is optimal
- Efficient high-fidelity quantum computation using matter qubits and linear optics
- Implementation of a Quantum Search Algorithm on a Nuclear Magnetic Resonance Quantum Computer
- Experimental Demonstration of Blind Quantum Computing
- Room temperature entanglement between distant single spins in diamond
- Grover Algorithm with zero theoretical failure rate
- Universal control and error correction in multi-qubit spin registers in diamond
- Cluster-state quantum computation
- A universal quantum circuit for two-qubit transformations with three CNOT gates
- Repeated quantum error correction on a continuously encoded qubit by real-time feedback
- Complete 3-Qubit Grover Search on a Programmable Quantum Computer
- Experimental realization of one-way quantum computing with two-photon four-qubit cluster states
- Implementation of Grover's Quantum Search Algorithm in a Scalable System
- On Arbitrary Phases in Quantum Amplitude Amplification
- Determinism in the one-way model
- Grover search with pairs of trapped ions
- Finding Optimal Flows Efficiently
- Quantum Entanglement and the Communication Complexity of the Inner Product Function
- Implementation of three-qubit Grover search in cavity QED
- Implementing Grover's Quantum Search on a Para-Hydrogen based Pure State NMR Quantum Computer
- Minimal physical resources for the realisation of measurement-based quantum computation