Efficient verification of Affleck-Kennedy-Lieb-Tasaki states

Abstract

Affleck-Kennedy-Lieb-Tasaki (AKLT) states are an important class of many-body quantum states that are useful in quantum information processing, including measurement-based quantum computation in particular. Here we propose a general approach for constructing efficient verification protocols for AKLT states on arbitrary graphs with local spin measurements. Our verification protocols build on bond verification protocols and matching covers (including edge coloring) of the underlying graphs, which have a simple geometric and graphic picture. We also provide rigorous performance guarantee that is required for practical applications. With our approach, most AKLT states of wide interest, including those defined on 1D and 2D lattices, can be verified with a constant sample cost, which is independent of the system size and is dramatically more efficient than all previous approaches. As an illustration, we construct concrete verification protocols for AKLT states on various lattices and on arbitrary graphs up to five vertices.

18+7 pages, 15 figures, and 4+1 tables; see also the companion paper on the verification of ground states. Comments and suggestions are very welcome!

References in corpus (14)

• Efficient quantum state tomography
• Direct Fidelity Estimation from Few Pauli Measurements
• Quantum computational capability of a 2D valence bond solid phase
• Theoretical and Experimental Perspectives of Quantum Verification
• Optical one-way quantum computing with a simulated valence-bond solid
• Statistical Methods for Quantum State Verification and Fidelity Estimation
• Group theoretical study of LOCC-detection of maximally entangled state using hypothesis testing
• Sample-efficient device-independent quantum state verification and certification
• Quantum verification and estimation with few copies
• Preparation and verification of tensor network states
• Efficient verification of bosonic quantum channels via benchmarking
• Efficient Experimental Verification of Quantum Gates with Local Operations
• Proof-of-principle experimental demonstration of quantum gate verification
• Entanglement of Valence-Bond-Solid on an Arbitrary Graph

Cited by in corpus (8)

• Robust and efficient verification of graph states in blind measurement-based quantum computation
• Efficient Verification of Ground States of Frustration-Free Hamiltonians
• Efficient verification of arbitrary entangled states with homogeneous local measurements
• Experimental Verification of Entangled States in the Adversarial Scenario
• Quantum subspace verification for error correction codes
• Beating the Optimal Verification of Entangled States via Collective Strategies
• Universal and Efficient Quantum State Verification via Schmidt Decomposition and Mutually Unbiased Bases
• Prescriptive preparation and verification of nonstabilizer states