Efficient Verification of Ground States of Frustration-Free Hamiltonians

Abstract

Ground states of local Hamiltonians are of key interest in many-body physics and also in quantum information processing. Efficient verification of these states are crucial to many applications, but very challenging. Here we propose a simple, but powerful recipe for verifying the ground states of general frustration-free Hamiltonians based on local measurements. Moreover, we derive rigorous bounds on the sample complexity by virtue of the quantum detectability lemma (with improvement) and quantum union bound. Notably, the number of samples required does not increase with the system size when the underlying Hamiltonian is local and gapped, which is the case of most interest. As an application, we propose a general approach for verifying Affleck-Kennedy-Lieb-Tasaki (AKLT) states on arbitrary graphs based on local spin measurements, which requires only a constant number of samples for AKLT states defined on various lattices. Our work is of interest not only to many tasks in quantum information processing, but also to the study of many-body physics.

17+5 pages and 2 figures; accepted by Quantum

References in corpus (17)

• Matrix Product States and Projected Entangled Pair States: Concepts, Symmetries, and Theorems
• Efficient quantum state tomography
• Computational advantage of quantum random sampling
• Theory of quantum system certification: a tutorial
• 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 spin systems for measurement-based quantum computation
• Robust and efficient verification of graph states in blind measurement-based quantum computation
• Quantum verification and estimation with few copies
• Efficient verification of continuous-variable quantum states and devices without assuming identical and independent operations
• Preparation and verification of tensor network states
• Efficient verification of Affleck-Kennedy-Lieb-Tasaki states
• Some aspects of Affleck-Kennedy-Lieb-Tasaki models: tensor network, physical properties, spectral gap, deformation, and quantum computation

Cited by in corpus (7)

• Models of interacting bosons with exact ground states: a unified approach
• Quantum subspace verification for error correction codes
• Experimental Verification of Entangled States in the Adversarial Scenario
• Relative-belief inference in quantum information theory
• Universal and Efficient Quantum State Verification via Schmidt Decomposition and Mutually Unbiased Bases
• Prescriptive preparation and verification of nonstabilizer states
• Beating the Optimal Verification of Entangled States via Collective Strategies