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:2510.07125

Preparation of initial states with open and periodic boundary conditions on quantum devices using matrix product states

Yibin Guo, Manuel Schneider, Takis Angelides, Karl Jansen, C.-J. David Lin, Su, Yao Ting

Published Jan 1, 2025• 4 citations
arXivHTMLPDF

Abstract

We present a framework for preparing quantum states from matrix product states (MPS) with open and periodic boundary conditions on quantum devices. The MPS tensors are mapped to unitary gates, which are subsequently decomposed into native gates on quantum hardware. States with periodic boundary conditions (pbc) can be represented efficiently as quantum circuits using ancilla qubits and post-selection after measurement. We derive an exact expression for the success rate of this probabilistic approach, which can be evaluated a priori. The applicability of the method is demonstrated in two examples. First, we prepare the ground state of the Heisenberg model with pbc and simulate dynamics under a quenched Hamiltonian. The volume-law entanglement growth in the time evolution challenges classical algorithms but can potentially be overcome on quantum hardware. Second, we construct quantum circuits that generate excited states of the Schwinger model with high fidelities. Our approach provides a scalable method for preparing states on a quantum device, enabling efficient simulations of strongly correlated systems on near-term quantum computers.

DOI
10.3204/pubdb-2025-04269

Related papers

Encoding of matrix product states into quantum circuits of one- and two-qubit gates

Shi-Ju Ran

The matrix product state (MPS) belongs to the most important models in, for example, quantum information sciences and condensed-matter physics. However, realizing an $N$-qubit MPS with large $N$ and large entanglement on a quantum platform is extremely challenging, since it requires high-level qudits or $n$-qubit gates with $n\ensuremath{\gg}2$ to carry or produce the entanglement. In this work, an efficient method that accurately encodes a given MPS into a quantum circuit with only one- and two-qubit gates is proposed. Essentially different from the existing compiling methods, our idea is to construct the unitary matrix product operators that optimally disentangle the MPS to a product state. These matrix product operators form the quantum circuit that evolves a product state to the targeted MPS with a high fidelity. Our benchmark on the ground-state MPSs of the strongly correlated spin models show that the constructed quantum circuits can simulate the MPSs with much fewer qubits than the sizes of the MPSs themselves. This method paves a feasible and efficient path to realizing useful and/or exotic quantum states and MPS-based models as quantum circuits on near-term quantum platforms.

arXiv:1908.07958•Physical Review A•Mar 9, 2020•173 citations

Scalable Preparation of Matrix Product States with Sequential and Brick Wall Quantum Circuits

Tomasz Szołdra, Rick Mukherjee, Peter Schmelcher

Preparing arbitrary quantum states requires exponential resources. Matrix Product States (MPS) admit more efficient constructions, particularly when accuracy is traded for circuit complexity. Existing approaches to MPS preparation mostly rely on heuristic circuits that are deterministic but quickly saturate in accuracy, or on variational optimization methods that reach high fidelities but scale poorly. This work introduces an end-to-end MPS preparation framework that combines the strengths of both strategies within a single pipeline. Heuristic staircase-like and brick wall disentangler circuits provide warm-start initializations for variational optimization, enabling high-fidelity state preparation for large systems. Target MPSs are either specified as physical quantum states or constructed from classical datasets via amplitude encoding, using step-by-step singular value decompositions or tensor cross interpolation. The framework incorporates entanglement-based qubit reordering, reformulated as a quadratic assignment problem, and low-level optimizations that reduce depths by up to 50% and CNOT counts by 33%. We evaluate the full pipeline on datasets of varying complexity across systems of 19-50 qubits and identify trade-offs between fidelity, gate count, and circuit depth. Optimized brick wall circuits typically achieve the lowest depths, while the optimized staircase-like circuits minimize gate counts. Overall, our results provide principled and scalable protocols for preparing MPSs as quantum circuits, supporting utility-scale applications on near-term quantum devices.

quant-pharXiv:2602.12042•Quantum Science and Technology•Feb 13, 2026•7 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•20 citations

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

Kevin C. Smith, Abid Khan, Bryan K. Clark +2 more

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

arXiv:2404.16083•PRX Quantum•Sep 4, 2024•85 citations

Efficient matrix-product state method for periodic boundary conditions

Peter Pippan, Steven R. White, Hans Gerd Evertz

We introduce an efficient method to calculate the ground state of one-dimensional lattice models with periodic boundary conditions. The method works in the representation of matrix product states (MPS), related to the density matrix renormalization group (DMRG) method. It improves on a previous approach by Verstraete et al. We introduce a factorization procedure for long products of MPS matrices, which reduces the computational effort from ${m}^{5}$ to ${m}^{3}$, where $m$ is the matrix dimension, and $m\ensuremath{\simeq}100--1000$ in typical cases. We test the method on the $S=\frac{1}{2}$ and $S=1$ Heisenberg chains. It is also applicable to nontranslationally invariant cases. The method makes ground-state calculations with periodic boundary conditions about as efficient as traditional DMRG calculations for systems with open boundaries.

arXiv:0801.1947•Physical Review B•Feb 12, 2010•102 citations

Quantum State Preparation via Schmidt Spectrum Optimisation

Josh Green, Joshua Snow, Jingbo B Wang

Quantum state preparation represents a critical bottleneck for a broad class of quantum algorithms. In this work, we introduce the Schmidt Spectrum Optimisation (SSO) algorithm as an efficient and scalable approach for preparing quantum states described by Matrix Product States (MPS). The SSO algorithm employs a preparation-by-disentangling strategy by optimising circuit layers of two-qubit gates to progressively remove entanglement from a target state. Each circuit layer is computed sequentially and efficiently on a classical computer using tensor network optimisation techniques. Once the target state has been successfully disentangled, a quantum state-preparation circuit is formed by reversing the sequence of optimised disentangling layers. Across benchmarks including random MPS and MPS approximations to the ground-states of local Hamiltonians, we find that the SSO algorithm significantly improves upon prior variational and disentangling-based approaches, highlighting its potential as a scalable framework for quantum state preparation.

quant-pharXiv:2512.20537•Dec 24, 2025•5 citations
We present a framework for preparing quantum states from matrix product states (MPS) with open and periodic boundary conditions on quantum devices. The MPS tensors are mapped to unitary gates, which are subsequently decomposed into native gates on quantum hardware. States with periodic boundary conditions (pbc) can be represented efficiently as quantum circuits using ancilla qubits and post-selection after measurement. We derive an exact expression for the success rate of this probabilistic approach, which can be evaluated a priori. The applicability of the method is demonstrated in two examples. First, we prepare the ground state of the Heisenberg model with pbc and simulate dynamics under a quenched Hamiltonian. The volume-law entanglement growth in the time evolution challenges classical algorithms but can potentially be overcome on quantum hardware. Second, we construct quantum circuits that generate excited states of the Schwinger model with high fidelities. Our approach provides a scalable method for preparing states on a quantum device, enabling efficient simulations of strongly correlated systems on near-term quantum computers.
The matrix product state (MPS) belongs to the most important models in, for example, quantum information sciences and condensed-matter physics. However, realizing an NNN-qubit MPS with large NNN and large entanglement on a quantum platform is extremely challenging, since it requires high-level qudits or nnn-qubit gates with $n\ensuremath{\gg}2$ to carry or produce the entanglement. In this work, an efficient method that accurately encodes a given MPS into a quantum circuit with only one- and two-qubit gates is proposed. Essentially different from the existing compiling methods, our idea is to construct the unitary matrix product operators that optimally disentangle the MPS to a product state. These matrix product operators form the quantum circuit that evolves a product state to the targeted MPS with a high fidelity. Our benchmark on the ground-state MPSs of the strongly correlated spin models show that the constructed quantum circuits can simulate the MPSs with much fewer qubits than the sizes of the MPSs themselves. This method paves a feasible and efficient path to realizing useful and/or exotic quantum states and MPS-based models as quantum circuits on near-term quantum platforms.
Preparing arbitrary quantum states requires exponential resources. Matrix Product States (MPS) admit more efficient constructions, particularly when accuracy is traded for circuit complexity. Existing approaches to MPS preparation mostly rely on heuristic circuits that are deterministic but quickly saturate in accuracy, or on variational optimization methods that reach high fidelities but scale poorly. This work introduces an end-to-end MPS preparation framework that combines the strengths of both strategies within a single pipeline. Heuristic staircase-like and brick wall disentangler circuits provide warm-start initializations for variational optimization, enabling high-fidelity state preparation for large systems. Target MPSs are either specified as physical quantum states or constructed from classical datasets via amplitude encoding, using step-by-step singular value decompositions or tensor cross interpolation. The framework incorporates entanglement-based qubit reordering, reformulated as a quadratic assignment problem, and low-level optimizations that reduce depths by up to 50% and CNOT counts by 33%. We evaluate the full pipeline on datasets of varying complexity across systems of 19-50 qubits and identify trade-offs between fidelity, gate count, and circuit depth. Optimized brick wall circuits typically achieve the lowest depths, while the optimized staircase-like circuits minimize gate counts. Overall, our results provide principled and scalable protocols for preparing MPSs as quantum circuits, supporting utility-scale applications on near-term quantum devices.
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.
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
We introduce an efficient method to calculate the ground state of one-dimensional lattice models with periodic boundary conditions. The method works in the representation of matrix product states (MPS), related to the density matrix renormalization group (DMRG) method. It improves on a previous approach by Verstraete et al. We introduce a factorization procedure for long products of MPS matrices, which reduces the computational effort from m5{m}^{5}m5 to m3{m}^{3}m3, where mmm is the matrix dimension, and $m\ensuremath{\simeq}100--1000$ in typical cases. We test the method on the S=12S=\frac{1}{2}S=21​ and S=1S=1S=1 Heisenberg chains. It is also applicable to nontranslationally invariant cases. The method makes ground-state calculations with periodic boundary conditions about as efficient as traditional DMRG calculations for systems with open boundaries.
Quantum state preparation represents a critical bottleneck for a broad class of quantum algorithms. In this work, we introduce the Schmidt Spectrum Optimisation (SSO) algorithm as an efficient and scalable approach for preparing quantum states described by Matrix Product States (MPS). The SSO algorithm employs a preparation-by-disentangling strategy by optimising circuit layers of two-qubit gates to progressively remove entanglement from a target state. Each circuit layer is computed sequentially and efficiently on a classical computer using tensor network optimisation techniques. Once the target state has been successfully disentangled, a quantum state-preparation circuit is formed by reversing the sequence of optimised disentangling layers. Across benchmarks including random MPS and MPS approximations to the ground-states of local Hamiltonians, we find that the SSO algorithm significantly improves upon prior variational and disentangling-based approaches, highlighting its potential as a scalable framework for quantum state preparation.