Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2404.16083 · PRX Quantum

Constant-Depth Preparation of Matrix Product States with Adaptive Quantum Circuits

Kevin C. Smith, Abid Khan, Bryan K. Clark, S. M. Girvin, Tzu-Chieh Wei

Published Sep 4, 2024• 51 citations
arXivHTMLPDF

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 has been shown that the Affleck-Kennedy-Lieb-Tasaki 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 alone due to its nonzero correlation length [Smith , 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 theoretically optimal preparation with unitary circuits. 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. Published by the American Physical Society 2024

DOI
10.1103/prxquantum.5.030344

Related papers

Preparing matrix product states via fusion: Constraints and extensions

David T. Stephen, Oliver Hart

In the era of noisy, intermediate-scale quantum (NISQ) devices, the efficient preparation of many-body resource states is a task of paramount importance. In this paper we focus on the deterministic preparation of matrix-product states (MPS) in constant depth by utilizing measurements and classical communication to fuse smaller states into larger ones. We place strong constraints on the MPS that can be prepared using this method, which we refer to as MPS fusion. Namely, we establish that it is necessary for the MPS to have a flat entanglement spectrum. Using the recently introduced split-index MPS (SIMPS) representation, we then introduce a family of states that belong to interesting phases of matter protected by non-onsite symmetries, including anomalous and non-invertible symmetries, and also serve as resources for long-range quantum teleportation, but which lie beyond the scope of ordinary MPS fusion. It is shown constructively that these states can be prepared in constant depth using a broader class of measurement-assisted protocols, which we dub SIMPS fusion. Even in cases when MPS fusion is possible, using SIMPS fusion can give rise to significantly reduced resource overhead. We also discuss constraints on SIMPS fusion and propose a general framework for fusion that encompasses the MPS and SIMPS protocols. Our results therefore simultaneously establish the boundaries of conventional MPS fusion and push the envelope of which states can be prepared using measurement-assisted protocols.

arXiv:2404.16360•Physical review. B./Physical review. B•May 12, 2025•5 citations

Characterizing Matrix-Product States and Projected Entangled-Pair States Preparable via Measurement and Feedback

Y. Zhang, Sarang Gopalakrishnan, Georgios Styliaris

Preparing long-range entangled states poses significant challenges for near-term quantum devices. It is known that measurement and feedback (MF) can aid this task by allowing the preparation of certain paradigmatic long-range entangled states with only constant circuit depth. Here, we systematically explore the structure of states that can be prepared using constant-depth local circuits and a single MF round. Using the framework of tensor networks, the preparability under MF translates to tensor symmetries. We detail the structure of matrix-product states (MPSs) and projected entangled-pair states (PEPSs) that can be prepared using MF, revealing the coexistence of Clifford-like properties and magic. In one dimension, we show that states with Abelian-symmetry-protected topological order are a restricted class of MF-preparable states. In two dimensions, we parametrize a subset of states with Abelian topological order that are MF preparable. Finally, we discuss the analogous implementation of operators via MF, providing a structural theorem that connects to the well-known Clifford teleportation. Published by the American Physical Society 2024

arXiv:2405.09615•PRX Quantum•Oct 10, 2024•14 citations

Variational preparation of normal matrix product states on quantum computers

Ben Jaderberg, George Pennington, Kate V. Marshall +6 more

Preparing matrix product states (MPSs) on quantum computers is an essential routine in the simulation of many-body physics. However, widely used schemes based on staircase circuits are often too deep to execute on current hardware. Here, we demonstrate that MPSs with short-range correlations can be prepared with shallow circuits by leveraging heuristics from approximate quantum compiling (AQC). We achieve this with ADAPT-AQC, an adaptive-ansatz preparation algorithm, and introduce a generalized initialization procedure for the existing AQC-Tensor algorithm. We first compare these methods for the task of preparing a molecular electronic structure ground state. We then use them to prepare an antiferromagnetic (AFM) ground state of the 50-site Heisenberg XXZ spin chain near the AFM-XY phase boundary. Through the execution of circuits with up to 59 depth and 1251 gates, we perform a global quench and observe the relaxation of magnetic ordering in a parameter regime previously inaccessible due to deep ground-state preparation circuits. Our results demonstrate how the integration of quantum and classical resources can push the boundary of what can be studied on quantum computers.

arXiv:2503.09683•Physical Review Research•Dec 10, 2025•3 citations

Nonlocal Finite-Depth Circuits for Constructing Symmetry-Protected Topological States and Quantum Cellular Automata

David T. Stephen, Arpit Dua, Ali Lavasani +1 more

Whether a given target state can be prepared by starting with a simple product state and acting with a finite-depth quantum circuit is a key question in condensed matter physics and quantum information science. It underpins classifications of topological phases, as well as the understanding of topological quantum codes, and has obvious relevance for device implementations. Traditionally, this question assumes that the quantum circuit is made up of unitary gates that are . Inspired by the advent of noisy intermediate-scale quantum devices, we reconsider this question with k - gates, i.e., gates that act on no more than k degrees of freedom but are not restricted to be geometrically local. First, we construct explicit finite-depth circuits of symmetric k -local gates that create symmetry-protected topological (SPT) states from an initial product state. Our construction applies to SPT states protected by global symmetries or subsystem symmetries but not to those with higher-form symmetries, which we conjecture remain nontrivial. Next, we show how to implement arbitrary translationally invariant quantum cellular automata in any dimension using finite-depth circuits of k -local gates. These results imply that the topological classifications of SPT phases and quantum cellular automata both collapse to a single trivial phase in the presence of k -local interactions. We furthermore argue that SPT phases are fragile to k -local symmetric perturbations. We conclude by discussing the implications for other phases, such as fracton phases, and surveying future directions. Our analysis opens a new experimentally motivated conceptual direction examining the stability of phases and the feasibility of state preparation without the assumption of geometric locality. Published by the American Physical Society 2024

arXiv:2212.06844•PRX Quantum•Jan 11, 2024•7 citations

Quantum State Preparation by Improved MPS Method

Chao Wang, Zhou, Pengrui, Xi‐Ning Zhuang +4 more

Efficient encoding of classical information plays a fundamental role in numerous practical quantum algorithms. However, the preparation of an arbitrary amplitude-encoded state has been proven to be time-consuming, and its deployment on current noisy devices can be challenging. In this work, we propose an improved Matrix Product State(MPS) method preparation protocol with an exponential reduction on the circuit depth, as well as topological adaptability. By refined utilization of the disentangling principle, we also reduce approximately 33% two-qubit gate count. To validate our method, we study various families of functions and distributions with provably bounded MPS rank. Numerical experiments show that our method significantly reduces circuit depth while achieving higher fidelity for states arising in financial and other applications.

arXiv:2508.12821•Aug 18, 2025•1 citation

State preparation via measurement and feedback: pushing relations, state structures, and non-invertible symmetries

Yabo Li, Aditi Mitra, Tsung-Cheng Lu

Quantum circuits with measurements and unitary feedback (MF) can prepare long-range entangled states in constant depth, but a systematic construction of the MF preparation circuit for a given target state remains underexplored. We develop such a scheme for one-dimensional states, based on the notion of pushable defects: virtual-bond operators of a matrix product state that can be pushed through the tensor at the price of a physical feedback unitary. We show that the set of pushable defects, together with their pushing relations classifies finite-depth MF-preparable states and dictates their preparation circuits. To each class of the target state $|A\rangle$, we associate a state $|B\rangle$ from which $|A\rangle$ can be prepared using a 1-round MF circuit; in particular, $|A\rangle$ is preparable from a product state using a circuit with 1 round of MF whenever $|B\rangle$ is preparable by a finite-depth local unitary (FDLU) circuit. For a general target state, the scheme is obtained by iterating this procedure until the associated state is FDLU-preparable. For open-boundary matrix product states, the scheme is complete: it constructs a preparation circuit whenever finite-depth MF preparation with left-conditioned feedback corrections is possible. Pushable defects and pushing relations thus emerge as a unifying principle for quantum state preparation via measurements and feedback. This characterization further reveals an intrinsic connection between MF circuits and non-invertible symmetries: states with certain classes of pushing relations are related to a product state by Tambara-Yamagami duality operators, or by continuous cosine symmetry operators with fusion rules $L_α L_{α'} = L_{α+α'} + L_{α-α'}$, together with their generalizations up to (not necessarily transversal) gates.

quant-pharXiv:2608.08821•Aug 11, 2026•0 citations
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 has been shown that the Affleck-Kennedy-Lieb-Tasaki 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 alone due to its nonzero correlation length [Smith , 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 theoretically optimal preparation with unitary circuits. 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. Published by the American Physical Society 2024
In the era of noisy, intermediate-scale quantum (NISQ) devices, the efficient preparation of many-body resource states is a task of paramount importance. In this paper we focus on the deterministic preparation of matrix-product states (MPS) in constant depth by utilizing measurements and classical communication to fuse smaller states into larger ones. We place strong constraints on the MPS that can be prepared using this method, which we refer to as MPS fusion. Namely, we establish that it is necessary for the MPS to have a flat entanglement spectrum. Using the recently introduced split-index MPS (SIMPS) representation, we then introduce a family of states that belong to interesting phases of matter protected by non-onsite symmetries, including anomalous and non-invertible symmetries, and also serve as resources for long-range quantum teleportation, but which lie beyond the scope of ordinary MPS fusion. It is shown constructively that these states can be prepared in constant depth using a broader class of measurement-assisted protocols, which we dub SIMPS fusion. Even in cases when MPS fusion is possible, using SIMPS fusion can give rise to significantly reduced resource overhead. We also discuss constraints on SIMPS fusion and propose a general framework for fusion that encompasses the MPS and SIMPS protocols. Our results therefore simultaneously establish the boundaries of conventional MPS fusion and push the envelope of which states can be prepared using measurement-assisted protocols.
Preparing long-range entangled states poses significant challenges for near-term quantum devices. It is known that measurement and feedback (MF) can aid this task by allowing the preparation of certain paradigmatic long-range entangled states with only constant circuit depth. Here, we systematically explore the structure of states that can be prepared using constant-depth local circuits and a single MF round. Using the framework of tensor networks, the preparability under MF translates to tensor symmetries. We detail the structure of matrix-product states (MPSs) and projected entangled-pair states (PEPSs) that can be prepared using MF, revealing the coexistence of Clifford-like properties and magic. In one dimension, we show that states with Abelian-symmetry-protected topological order are a restricted class of MF-preparable states. In two dimensions, we parametrize a subset of states with Abelian topological order that are MF preparable. Finally, we discuss the analogous implementation of operators via MF, providing a structural theorem that connects to the well-known Clifford teleportation. Published by the American Physical Society 2024
Preparing matrix product states (MPSs) on quantum computers is an essential routine in the simulation of many-body physics. However, widely used schemes based on staircase circuits are often too deep to execute on current hardware. Here, we demonstrate that MPSs with short-range correlations can be prepared with shallow circuits by leveraging heuristics from approximate quantum compiling (AQC). We achieve this with ADAPT-AQC, an adaptive-ansatz preparation algorithm, and introduce a generalized initialization procedure for the existing AQC-Tensor algorithm. We first compare these methods for the task of preparing a molecular electronic structure ground state. We then use them to prepare an antiferromagnetic (AFM) ground state of the 50-site Heisenberg XXZ spin chain near the AFM-XY phase boundary. Through the execution of circuits with up to 59 depth and 1251 gates, we perform a global quench and observe the relaxation of magnetic ordering in a parameter regime previously inaccessible due to deep ground-state preparation circuits. Our results demonstrate how the integration of quantum and classical resources can push the boundary of what can be studied on quantum computers.
Whether a given target state can be prepared by starting with a simple product state and acting with a finite-depth quantum circuit is a key question in condensed matter physics and quantum information science. It underpins classifications of topological phases, as well as the understanding of topological quantum codes, and has obvious relevance for device implementations. Traditionally, this question assumes that the quantum circuit is made up of unitary gates that are . Inspired by the advent of noisy intermediate-scale quantum devices, we reconsider this question with k - gates, i.e., gates that act on no more than k degrees of freedom but are not restricted to be geometrically local. First, we construct explicit finite-depth circuits of symmetric k -local gates that create symmetry-protected topological (SPT) states from an initial product state. Our construction applies to SPT states protected by global symmetries or subsystem symmetries but not to those with higher-form symmetries, which we conjecture remain nontrivial. Next, we show how to implement arbitrary translationally invariant quantum cellular automata in any dimension using finite-depth circuits of k -local gates. These results imply that the topological classifications of SPT phases and quantum cellular automata both collapse to a single trivial phase in the presence of k -local interactions. We furthermore argue that SPT phases are fragile to k -local symmetric perturbations. We conclude by discussing the implications for other phases, such as fracton phases, and surveying future directions. Our analysis opens a new experimentally motivated conceptual direction examining the stability of phases and the feasibility of state preparation without the assumption of geometric locality. Published by the American Physical Society 2024
Efficient encoding of classical information plays a fundamental role in numerous practical quantum algorithms. However, the preparation of an arbitrary amplitude-encoded state has been proven to be time-consuming, and its deployment on current noisy devices can be challenging. In this work, we propose an improved Matrix Product State(MPS) method preparation protocol with an exponential reduction on the circuit depth, as well as topological adaptability. By refined utilization of the disentangling principle, we also reduce approximately 33% two-qubit gate count. To validate our method, we study various families of functions and distributions with provably bounded MPS rank. Numerical experiments show that our method significantly reduces circuit depth while achieving higher fidelity for states arising in financial and other applications.
Quantum circuits with measurements and unitary feedback (MF) can prepare long-range entangled states in constant depth, but a systematic construction of the MF preparation circuit for a given target state remains underexplored. We develop such a scheme for one-dimensional states, based on the notion of pushable defects: virtual-bond operators of a matrix product state that can be pushed through the tensor at the price of a physical feedback unitary. We show that the set of pushable defects, together with their pushing relations classifies finite-depth MF-preparable states and dictates their preparation circuits. To each class of the target state ∣A⟩|A\rangle∣A⟩, we associate a state ∣B⟩|B\rangle∣B⟩ from which ∣A⟩|A\rangle∣A⟩ can be prepared using a 1-round MF circuit; in particular, ∣A⟩|A\rangle∣A⟩ is preparable from a product state using a circuit with 1 round of MF whenever ∣B⟩|B\rangle∣B⟩ is preparable by a finite-depth local unitary (FDLU) circuit. For a general target state, the scheme is obtained by iterating this procedure until the associated state is FDLU-preparable. For open-boundary matrix product states, the scheme is complete: it constructs a preparation circuit whenever finite-depth MF preparation with left-conditioned feedback corrections is possible. Pushable defects and pushing relations thus emerge as a unifying principle for quantum state preparation via measurements and feedback. This characterization further reveals an intrinsic connection between MF circuits and non-invertible symmetries: states with certain classes of pushing relations are related to a product state by Tambara-Yamagami duality operators, or by continuous cosine symmetry operators with fusion rules LαLα′=Lα+α′+Lα−α′L_α L_{α'} = L_{α+α'} + L_{α-α'}Lα​Lα′​=Lα+α′​+Lα−α′​, together with their generalizations up to (not necessarily transversal) gates.