Constant-depth preparation of matrix product states with adaptive quantum circuits

Abstract

Adaptive quantum circuits, which combine local unitary gates, midcircuit measurements, and feedforward operations, have recently emerged as a promising avenue for efficient state preparation, particularly on near-term quantum devices limited to shallow-depth circuits. Matrix product states (MPS) comprise a significant class of many-body entangled states, efficiently describing the ground states of one-dimensional gapped local Hamiltonians and finding applications in a number of recent quantum algorithms. Recently, it was shown that the AKLT state -- a paradigmatic example of an MPS -- can be exactly prepared with an adaptive quantum circuit of constant-depth, an impossible feat with local unitary gates due to its nonzero correlation length [Smith et al., PRX Quantum 4, 020315 (2023)]. In this work, we broaden the scope of this approach and demonstrate that a diverse class of MPS can be exactly prepared using constant-depth adaptive quantum circuits, outperforming optimal preparation protocols that rely on unitary circuits alone. We show that this class includes short- and long-ranged entangled MPS, symmetry-protected topological (SPT) and symmetry-broken states, MPS with finite Abelian, non-Abelian, and continuous symmetries, resource states for MBQC, and families of states with tunable correlation length. Moreover, we illustrate the utility of our framework for designing constant-depth sampling protocols, such as for random MPS or for generating MPS in a particular SPT phase. We present sufficient conditions for particular MPS to be preparable in constant time, with global on-site symmetry playing a pivotal role. Altogether, this work demonstrates the immense promise of adaptive quantum circuits for efficiently preparing many-body entangled states and provides explicit algorithms that outperform known protocols to prepare an essential class of states.

25 pages, 5 figures

References in corpus (31)

• The density-matrix renormalization group in the age of matrix product states
• Quantum metrology from a quantum information science perspective
• Matrix product states represent ground states faithfully
• Lieb-Robinson bounds and the generation of correlations and topological quantum order
• A Race Track Trapped-Ion Quantum Processor
• Valence Bond Solids for Quantum Computation
• String order and symmetries in quantum spin lattices
• Novel schemes for measurement-based quantum computation
• Non-Abelian Topological Order and Anyons on a Trapped-Ion Processor
• Measurement as a shortcut to long-range entangled quantum matter
• Hierarchy of topological order from finite-depth unitaries, measurement and feedforward
• Valence bond solids for SU(n) spin chains: exact models, spinon confinement, and the Haldane gap
• Long-range entanglement from measuring symmetry-protected topological phases
• Nishimori's cat: stable long-range entanglement from finite-depth unitaries and weak measurements
• Class of exactly solvable SO(n) symmetric spin chains with matrix product ground states
• Matrix Product States: Symmetries and Two-Body Hamiltonians
• Preparation of matrix product states with log-depth quantum circuits
• Shortest Route to Non-Abelian Topological Order on a Quantum Processor
• Deterministic constant-depth preparation of the AKLT state on a quantum processor using fusion measurements
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage
• Non-Abelian braiding of Fibonacci anyons with a superconducting processor
• Sequential Quantum Circuits as Maps between Gapped Phases
• Qudit quantum computation on matrix product states with global symmetry
• The matrix product representations for all valence bond states
• Measurement-based quantum computation in finite one-dimensional systems: string order implies computational power
• Symmetry-enriched topological order from partially gauging symmetry-protected topologically ordered states assisted by measurements
• Novel families of $\mathrm{SU}(N)$ AKLT states with arbitrary self-conjugate edge states
• Barren plateaus from learning scramblers with local cost functions
• Magic of Random Matrix Product States
• The minimal canonical form of a tensor network
• Identifying quantum phases from injectivity of symmetric matrix product states

Cited by in corpus (34)

• Hybrid Oscillator-Qubit Quantum Processors: Instruction Set Architectures, Abstract Machine Models, and Applications
• Measurement-Based Long-Range Entangling Gates in Constant Depth
• Classifying One-Dimensional Quantum States Prepared by a Single Round of Measurements
• Anticoncentration and state design of random tensor networks
• Taming quantum systems: A tutorial for using shortcuts-to-adiabaticity, quantum optimal control, and reinforcement learning
• Characterizing MPS and PEPS Preparable via Measurement and Feedback
• Efficient MPS representations and quantum circuits from the Fourier modes of classical image data
• Exactly solvable many-body dynamics from space-time duality
• Entanglement swapping in critical quantum spin chains
• Early Fault-Tolerant Quantum Algorithms in Practice: Application to Ground-State Energy Estimation
• Double-bracket quantum algorithms for quantum imaginary-time evolution
• Reducing Circuit Depth in Quantum State Preparation for Quantum Simulation Using Measurements and Feedforward
• Preparing matrix product states via fusion: constraints and extensions
• Measuring multipartite quantum correlations by thermodynamic work extraction
• Sequency Hierarchy Truncation (SeqHT) for Adiabatic State Preparation and Time Evolution in Quantum Simulations
• Tensor-Programmable Quantum Circuits for Solving Differential Equations
• Variational LOCC-assisted quantum circuits for long-range entangled states
• Preparation Circuits for Matrix Product States by Classical Variational Disentanglement
• Simulating Quantum Turbulence with Matrix Product States
• Free-Fermion Dynamics with Measurements: Topological Classification and Adaptive Preparation of Topological States
• Efficient Generation of Multi-partite Entanglement between Non-local Superconducting Qubits using Classical Feedback
• Exploration of Design Alternatives for Reducing Idle Time in Shor's Algorithm: A Study on Monolithic and Distributed Quantum Systems
• Non-onsite symmetry breaking: topological phase coexistence and criticality
• Simulating Quantum Circuits with Tree Tensor Networks using Density-Matrix Renormalization Group Algorithm
• High-expressibility Quantum Neural Networks using only classical resources
• Comment on arXiv:2307.08384 "Efficient Quantum State Preparation with Walsh Series"
• Error Mitigation in Dynamic Circuits for Hamiltonian Simulation
• Learning Feedback Mechanisms for Measurement-Based Variational Quantum State Preparation
• Preparing the Gutzwiller wave function for attractive SU(3) fermions on a quantum computer
• Quantum Encoding of Structured Data with Matrix Product States
• Scaling Laws of Quantum Information Lifetime in Monitored Quantum Dynamics
• Long-ranged gates in quantum computation architectures with limited connectivity
• Quantum Circuits for Matrix-Product Unitaries
• Resource complexity of Symmetry Protected Topological phases