Robust and efficient verification of graph states in blind measurement-based quantum computation
arXiv:2305.10742 · doi:10.1038/s41534-023-00783-9
Abstract
Blind quantum computation (BQC) is a secure quantum computation method that protects the privacy of clients. Measurement-based quantum computation (MBQC) is a promising approach for realizing BQC. To obtain reliable results in blind MBQC, it is crucial to verify whether the resource graph states are accurately prepared in the adversarial scenario. However, previous verification protocols for this task are too resource consuming or noise susceptible to be applied in practice. Here, we propose a robust and efficient protocol for verifying arbitrary graph states with any prime local dimension in the adversarial scenario, which leads to a robust and efficient protocol for verifying the resource state in blind MBQC. Our protocol requires only local Pauli measurements and is thus easy to realize with current technologies. Nevertheless, it can achieve the optimal scaling behaviors with respect to the system size and the target precision as quantified by the infidelity and significance level, which has never been achieved before. Notably, our protocol can exponentially enhance the scaling behavior with the significance level.
arXiv comment14+32 pages, 8+5 figures, and 1 table; published in npj Quantum Information
References in corpus (48)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum computational advantage using photons
- Measurement-based quantum computation with cluster states
- Measurement-based quantum computation
- Experimental Demonstration of Blind Quantum Computing
- Universal blind quantum computation
- Self-testing of quantum systems: a review
- Quantum certification and benchmarking
- Unconditionally verifiable blind computation
- Verifiable measurement-only blind quantum computing with stabilizer testing
- Blind quantum computation protocol in which Alice only makes measurements
- Quantum secret sharing with qudit graph states
- Verification of quantum computation: An overview of existing approaches
- Experimental verification of quantum computations
- Theory of quantum system certification: a tutorial
- Optimal verification of entangled states with local measurements
- Robustness and device independence of verifiable blind quantum computing
- Efficient Verification of Pure Quantum States in the Adversarial Scenario
- Theoretical and Experimental Perspectives of Quantum Verification
- Optimal Blind Quantum Computation
- Demonstration of measurement-only blind quantum computing
- A study of LOCC-detection of a maximally entangled state using hypothesis testing
- Efficient Verification of Hypergraph States
- General framework for verifying pure quantum states in the adversarial scenario
- Verified measurement-based quantum computing with hypergraph states
- Statistical Methods for Quantum State Verification and Fidelity Estimation
- Optimal verification and fidelity estimation of maximally entangled states
- Optimal Verification of Two-Qubit Pure States
- Self-guaranteed measurement-based quantum computation
- Resource-efficient verification of quantum computing using Serfling's bound
- Efficient verification of bipartite pure states
- Efficient verification of Dicke states
- Verifiable fault-tolerance in measurement-based quantum computation
- Experimental Optimal Verification of Entangled States using Local Measurements
- Group theoretical study of LOCC-detection of maximally entangled state using hypothesis testing
- Optimal Verification of Greenberger-Horne-Zeilinger States
- Optimal verification of stabilizer states
- Towards the standardization of quantum state verification using optimal strategies
- Verification of phased Dicke states
- Sample-efficient device-independent quantum state verification and certification
- Verifying commuting quantum computations via fidelity estimation of weighted graph states
- Remote blind state preparation with weak coherent pulses in the field
- Efficient verification of Affleck-Kennedy-Lieb-Tasaki states
- Efficient verification of entangled continuous-variable quantum states with local measurements
- Collective Operations Can Exponentially Enhance Quantum State Verification
- Experimental optimal verification of three-dimensional entanglement on a silicon chip
- Efficient verification of arbitrary entangled states with homogeneous local measurements
Cited by in corpus (8)
- Efficient Verification of Ground States of Frustration-Free Hamiltonians
- Symmetric quantum states: a review of recent progress
- Learning Properties of Quantum States Without the I.I.D. Assumption
- Measuring quantum relative entropy with finite-size effect
- Experimental Verification of Entangled States in the Adversarial Scenario
- Universal and Efficient Quantum State Verification via Schmidt Decomposition and Mutually Unbiased Bases
- Blind quantum computing with different qudit resource state architectures
- Phase Transitions and Noise Robustness of Quantum Graph States