Verifiable measurement-only blind quantum computing with stabilizer testing

Abstract

We introduce a simple protocol for verifiable measurement-only blind quantum computing. Alice, a client, can perform only single-qubit measurements, whereas Bob, a server, can generate and store entangled many-qubit states. Bob generates copies of a graph state, which is a universal resource state for measurement-based quantum computing, and sends Alice each qubit of them one by one. Alice adaptively measures each qubit according to her program. If Bob is honest, he generates the correct graph state, and therefore Alice can obtain the correct computation result. Regarding the security, whatever Bob does, Bob cannot learn any information about Alice's computation because of the no-signaling principle. Furthermore, evil Bob does not necessarily send the copies of the correct graph state, but Alice can check the correctness of Bob's state by directly verifying stabilizers of some copies.

14 pages, 3 figures

References in corpus (8)

• Topological fault-tolerance in cluster state quantum computation
• Novel schemes for measurement-based quantum computation
• Measurement-based quantum computer in the gapped ground state of a two-body Hamiltonian
• Robustness and device independence of verifiable blind quantum computing
• Overcoming efficiency constraints on blind quantum computation
• Group theoretical study of LOCC-detection of maximally entangled state using hypothesis testing
• Device-Independent Verifiable Blind Quantum Computation
• Mapping the spatial distribution of entanglement in optical lattices

Cited by in corpus (107)

• Photonic quantum information processing: a review
• Verification of quantum computation: An overview of existing approaches
• Theory of quantum system certification: a tutorial
• Optimal verification of entangled states with local measurements
• Schur-Weyl Duality for the Clifford Group with Applications: Property Testing, a Robust Hudson Theorem, and de Finetti Representations
• Experimental Blind Quantum Computing for a Classical Client
• Post hoc verification with a single prover
• Efficient Verification of Pure Quantum States in the Adversarial Scenario
• Post hoc verification of quantum computation
• Theoretical and Experimental Perspectives of Quantum Verification
• Verification of Many-Qubit States
• Rigidity of quantum steering and one-sided device-independent verifiable quantum computation
• Quantum homomorphic encryption from quantum codes
• General framework for verifying pure quantum states in the adversarial scenario
• Efficient Verification of Hypergraph States
• Verified measurement-based quantum computing with hypergraph states
• Optimal Verification of Two-Qubit Pure States
• Optimal verification and fidelity estimation of maximally entangled states
• How to Verify a Quantum Computation
• Self-guaranteed measurement-based quantum computation
• Resource-efficient verification of quantum computing using Serfling's bound
• Efficient verification of bipartite pure states
• Semiquantum key distribution with secure delegated quantum computation
• Verifiable fault-tolerance in measurement-based quantum computation
• Optimal Verification of Greenberger-Horne-Zeilinger States
• Optimal verification of stabilizer states
• Optimised resource construction for verifiable quantum computation
• Accrediting outputs of noisy intermediate-scale quantum computing devices
• Measurement-only verifiable blind quantum computing with quantum input verification
• Towards the standardization of quantum state verification using optimal strategies
• Quantum remote sensing with asymmetric information gain
• Quantum proofs can be verified using only single qubit measurements
• Verification of phased Dicke states
• Multi-client distributed blind quantum computation with the Qline architecture
• Verifying commuting quantum computations via fidelity estimation of weighted graph states
• Robust and efficient verification of graph states in blind measurement-based quantum computation
• Flow Ambiguity: A Path Towards Classically Driven Blind Quantum Computation
• Quantum verification and estimation with few copies
• Computing on quantum shared secrets
• Experimental accreditation of outputs of noisy quantum computers
• Garbled Quantum Computation
• Universally Optimal Verification of Entangled States with Nondemolition Measurements
• Reducing resources for verification of quantum computations
• Blind quantum computation for a user who only performs single-qubit gates
• QEnclave -- A practical solution for secure quantum cloud computing
• A Hybrid and Universal Blind Quantum Computation
• Graph-Theoretic Framework for Self-Testing in Bell Scenarios
• Verification of graph states in an untrusted network
• Deploying hybrid quantum-secured infrastructure for applications: When quantum and post-quantum can work together
• Fidelity measurement of a multiqubit cluster state with minimal effort
• Security Limitations of Classical-Client Delegated Quantum Computing
• Dense Coding with Locality Restriction for Decoder: Quantum Encoders vs. Super-Quantum Encoders
• Nonadaptive fault-tolerant verification of quantum supremacy with noise
• Efficient verification of Affleck-Kennedy-Lieb-Tasaki states
• Verifiable Quantum Secure Modulo Summation
• Unifying Quantum Verification and Error-Detection: Theory and Tools for Optimisations
• Client-friendly continuous-variable blind and verifiable quantum computing
• Experimental verifiable multi-client blind quantum computing on a Qline architecture
• Efficient verification of entangled continuous-variable quantum states with local measurements
• Efficient Verification of Ground States of Frustration-Free Hamiltonians
• Classical verification of quantum circuits containing few basis changes
• Measurement-based universal blind quantum computation with minor resources
• The Quantum Cut-and-Choose Technique and Quantum Two-Party Computation
• Authenticated teleportation and verification in a noisy network
• Cross-verification of independent quantum devices
• Merlin-Arthur with efficient quantum Merlin and quantum supremacy for the second level of the Fourier hierarchy
• On optimising quantum communication in verifiable quantum computing
• Hardware requirements for trapped-ion based verifiable blind quantum computing with a measurement-only client
• Collective Operations Can Exponentially Enhance Quantum State Verification
• Pseudo standard entanglement structure cannot be distinguished from standard entanglement structure
• Ancilla-driven instantaneous quantum polynomial time circuit for quantum supremacy
• A Specification Format and a Verification Method of Fault-Tolerant Quantum Circuits
• Blind Quantum Computation Using a Circuit-Based Quantum Computer
• Divide-and-conquer verification method for noisy intermediate-scale quantum computation
• Improving entanglement purification through coherent superposition of roles
• Experimental optimal verification of three-dimensional entanglement on a silicon chip
• Learning Properties of Quantum States Without the I.I.D. Assumption
• Quantum Merlin-Arthur with noisy channel
• Finding resource states of measurement-based quantum computing is harder than quantum computing
• Multi-server Blind Quantum Computation Protocol With Limited Classical Communication Among Servers
• Quantum Arthur-Merlin with single-qubit measurements
• Public verifiable measurement-only blind quantum computation based on entanglement witnesses
• Sumcheck-based delegation of quantum computing to rational server
• Nondestructive Verification of Entangled States via Fidelity Witnessing
• Information-theoretically-sound non-interactive classical verification of quantum computing with trusted center
• Multi-agent blind quantum computation without universal cluster states
• Measuring quantum relative entropy with finite-size effect
• Two-Server Oblivious Transfer for Quantum Messages
• Passive verification protocol for thermal graph states
• Parallel remote state preparation for fully device-independent verifiable blind quantum computation
• Quantum security computation on shared secrets
• Quantum state and circuit distinguishability with single-qubit measurements
• Impossibility of blind quantum sampling for classical client
• Blind quantum computing can always be made verifiable
• Experimental Verification of Entangled States in the Adversarial Scenario
• Gate Teleportation-based Universal Blind Quantum Computation
• Maximally nonlocal subspaces
• Efficient verification and fidelity estimation of discrete bipartite squeezed states
• Dissipative engineering a tripartite Greenberger-Horne-Zeilinger state for neutral atoms
• Equivalence of Single-server and Multiple-servers Blind Quantum Computation Protocols
• Universal and Efficient Quantum State Verification via Schmidt Decomposition and Mutually Unbiased Bases
• Unifying communication paradigms in measurement-based delegated quantum computing
• Prescriptive preparation and verification of nonstabilizer states
• Blind quantum computing with different qudit resource state architectures
• Beating the Optimal Verification of Entangled States via Collective Strategies
• Phase Transitions and Noise Robustness of Quantum Graph States
• Why cut-and-choose quantum state verification cannot be both efficient and secure