Universal and Efficient Quantum State Verification via Schmidt Decomposition and Mutually Unbiased Bases

Abstract

Efficient verification of multipartite quantum states is crucial to many applications in quantum information processing. By virtue of Schmidt decomposition and mutually unbiased bases, here we propose a universal protocol to verify arbitrary multipartite pure quantum states using adaptive local projective measurements. Moreover, we establish a universal upper bound on the sample complexity that is independent of the local dimensions. Numerical calculations further indicate that Haar-random pure states can be verified with a constant sample cost, irrespective of the qudit number and local dimensions, even in the adversarial scenario in which the source cannot be trusted. As alternatives, we provide several simpler variants that can achieve similar high efficiencies without using Schmidt decomposition. The simplest variant consists of only two distinct tests.

11+15 pages, 7+13 figures, and 0+5 tables; accepted in Quantum

References in corpus (44)

• Quantum entanglement
• Entanglement detection
• On mutually unbiased bases
• Universal blind quantum computation
• Detecting Genuine Multipartite Entanglement with Two Local Measurements
• Measurements in two bases are sufficient for certifying high-dimensional entanglement
• Verifiable measurement-only blind quantum computing with stabilizer testing
• Improving Quantum State Estimation with Mutually Unbiased Bases
• Optimal verification of entangled states with local measurements
• Reliable quantum certification for photonic quantum technologies
• Efficient Verification of Pure Quantum States in the Adversarial Scenario
• Theoretical and Experimental Perspectives of Quantum Verification
• Verification of Many-Qubit States
• Weighted complex projective 2-designs from bases: optimal state determination by orthogonal measurements
• A study of LOCC-detection of a maximally entangled state using hypothesis testing
• General framework for verifying pure quantum states in the adversarial scenario
• Efficient Verification of Hypergraph States
• Three-dimensional entanglement on a silicon chip
• Direct certification of a class of quantum simulations
• Quantum state estimation with informationally overcomplete measurements
• Statistical Methods for Quantum State Verification and Fidelity Estimation
• Optimal Verification of Two-Qubit Pure States
• Optimal verification and fidelity estimation of maximally entangled states
• Self-guaranteed measurement-based quantum computation
• Efficient verification of bipartite pure states
• Optimal verification of general bipartite pure states
• Verifiable fault-tolerance in measurement-based quantum computation
• Efficient verification of Dicke states
• 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
• Towards the standardization of quantum state verification using optimal strategies
• Verification of phased Dicke states
• Sample-efficient device-independent quantum state verification and certification
• Robust and efficient verification of graph states in blind measurement-based quantum computation
• Quantum verification and estimation with few copies
• Universally Optimal Verification of Entangled States with Nondemolition Measurements
• Efficient verification of continuous-variable quantum states and devices without assuming identical and independent operations
• How many mutually unbiased bases are needed to detect bound entangled states?
• Efficient verification of Affleck-Kennedy-Lieb-Tasaki states
• Efficient Verification of Ground States of Frustration-Free Hamiltonians
• Efficient verification of arbitrary entangled states with homogeneous local measurements
• Projective toric designs, quantum state designs, and mutually unbiased bases
• Cyclic measurements and simplified quantum state tomography