Multi-agent blind quantum computation without universal cluster states
arXiv:2206.13330 · doi:10.1088/1367-2630/acfab6
Abstract
Blind quantum computation (BQC) protocols enable quantum algorithms to be executed on third-party quantum agents while keeping the data and algorithm confidential. The previous proposals for measurement-based BQC require preparing a highly entangled cluster state. In this paper, we show that such a requirement is not necessary. Our protocol only requires pre-shared bell pairs between delegated quantum agents, and there is no requirement for any classical or quantum information exchange between agents during the execution. Our proposal requires fewer quantum resources than previous proposals by eliminating the need for a universal cluster state.
References in corpus (34)
- A Quantum Engineer's Guide to Superconducting Qubits
- Improved Simulation of Stabilizer Circuits
- Trapped-Ion Quantum Computing: Progress and Challenges
- Measurement-based quantum computation
- Distance measures to compare real and ideal quantum processes
- Photonic quantum information processing: a concise review
- Prospects for Spin-Based Quantum Computing
- A fault-tolerant one-way quantum computer
- Cluster-state quantum computation
- Unconditionally verifiable blind computation
- Simulating Large Quantum Circuits on a Small Quantum Computer
- Measurement-based quantum computation beyond the one-way model
- Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus
- Verifiable measurement-only blind quantum computing with stabilizer testing
- Blind quantum computation protocol in which Alice only makes measurements
- The SWAP test and the Hong-Ou-Mandel effect are equivalent
- Verification of quantum computation: An overview of existing approaches
- Quantum computing on encrypted data
- Determinism in the one-way model
- Generalized Flow and Determinism in Measurement-based Quantum Computation
- Tensor Networks in a Nutshell
- The ZX-calculus is complete for stabilizer quantum mechanics
- Robustness and device independence of verifiable blind quantum computing
- Interactive proofs for BQP via self-tested graph states
- Benchmarking gate-based quantum computers
- There and back again: A circuit extraction tale
- How to Verify a Quantum Computation
- Delegating Private Quantum Computations
- The ZX-calculus is incomplete for quantum mechanics
- QFactory: classically-instructed remote secret qubits preparation
- Universal MBQC with generalised parity-phase interactions and Pauli measurements
- Completeness of the ZX-Calculus
- Complete Flow-Preserving Rewrite Rules for MBQC Patterns with Pauli Measurements
- Flow-preserving ZX-calculus Rewrite Rules for Optimisation and Obfuscation