Flow Ambiguity: A Path Towards Classically Driven Blind Quantum Computation
arXiv:1608.04633 · doi:10.1103/PhysRevX.7.031004
Abstract
Blind quantum computation protocols allow a user to delegate a computation to a remote quantum computer in such a way that the privacy of their computation is preserved, even from the device implementing the computation. To date, such protocols are only known for settings involving at least two quantum devices: either a user with some quantum capabilities and a remote quantum server or two or more entangled but noncommunicating servers. In this work, we take the first step towards the construction of a blind quantum computing protocol with a completely classical client and single quantum server. Specifically, we show how a classical client can exploit the ambiguity in the flow of information in measurement-based quantum computing to construct a protocol for hiding critical aspects of a computation delegated to a remote quantum computer. This ambiguity arises due to the fact that, for a fixed graph, there exist multiple choices of the input and output vertex sets that result in deterministic measurement patterns consistent with the same fixed total ordering of vertices. This allows a classical user, computing only measurement angles, to drive a measurement-based computation performed on a remote device while hiding critical aspects of the computation.
arXiv comment(v3) 14 pages, 6 figures. expands introduction and definition of flow, corrects typos to increase readability; contains a new figure to illustrate example run of CDBQC protocol; minor changes to match the published version.(v2) 12 pages, 5 figures. Corrects motivation for quantities used in blindness analysis
References in corpus (25)
- Quantum Teleportation is a Universal Computational Primitive
- Measurement-based quantum computation with cluster states
- Efficient quantum state tomography
- Experimental Demonstration of Blind Quantum Computing
- Methodology for quantum logic gate constructions
- Can One Trust Quantum Simulators?
- Verifiable measurement-only blind quantum computing with stabilizer testing
- Blind quantum computation protocol in which Alice only makes measurements
- 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
- Reliable quantum certification for photonic quantum technologies
- Universal Blind Quantum Computing with Weak Coherent Pulses
- Robustness and device independence of verifiable blind quantum computing
- Efficient universal blind computation
- Optimal Blind Quantum Computation
- A Statistical Benchmark for BosonSampling
- Interactive proofs for BQP via self-tested graph states
- Demonstration of measurement-only blind quantum computing
- Ancilla-Driven Universal Blind Quantum Computation
- Continuous-variable blind quantum computation
- Direct certification of a class of quantum simulations
- Overcoming efficiency constraints on blind quantum computation
- Fault-tolerant Operations for Universal Blind Quantum Computation
Cited by in corpus (14)
- Photonic quantum information processing: a review
- Subsystem symmetries, quantum cellular automata, and computational phases of quantum matter
- Self-guaranteed measurement-based quantum computation
- Quantum cryptography beyond key distribution: theory and experiment
- Client-friendly continuous-variable blind and verifiable quantum computing
- Classical verification of quantum circuits containing few basis changes
- Cross-verification of independent quantum devices
- Privacy and correctness trade-offs for information-theoretically secure quantum homomorphic encryption
- Outcome determinism in measurement-based quantum computation with qudits
- Flow conditions for continuous variable measurement-based quantum computing
- The Min-Entropy of Classical-Quantum Combs for Measurement-Based Applications
- Minimally Universal Parity Quantum Computing
- Blind quantum computing with different qudit resource state architectures
- Information-Theoretic Limits of Quantum Learning via Data Compression