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

Quantum State Preparation via Schmidt Spectrum Optimisation

Josh Green, Joshua Snow, Jingbo B Wang

On Aqora:Jingbo WangJingbo Wang
quant-phSubmitted Dec 23, 2025• Announced Dec 24, 2025• 5 citations• Revised Jun 1, 2026 (v2)
v1 · Dec 23, 2025v2 · Jun 1, 2026
arXivHTMLPDF

Abstract

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.

Related papers

Preparation circuits for matrix product states by classical variational disentanglement

Refik Mansuroglu, Norbert Schuch

We study the classical compilation of quantum circuits for the preparation of matrix product states (MPS), which are quantum states of low entanglement with an efficient classical description. Our algorithm represents a near-term alternative to previous sequential approaches by reverse application of a disentangler, which can be found by minimizing bipartite entanglement measures after the application of a layer of parametrized disentangling gates. Since a successful disentangler is expected to decrease the bond dimension on average, such a layer-by-layer optimization remains classically efficient even for deep circuits. Additionally, as the Schmidt coefficients of all bonds are locally accessible through the canonical Γ − Λ form of an MPS, the optimization algorithm can be heavily parallelized. We discuss guarantees and limitations to trainability and show numerical results for ground states of one-dimensional, local Hamiltonians as well as artificially spread out entanglement among multiple qubits using error-correcting codes.

arXiv:2504.21298•Physical Review A•Mar 26, 2026•8 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

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•8 citations

Tensor Network Efficiently Representing Schmidt Decomposition of Quantum Many-Body States

Peng-Fei Zhou, Ying Lu, Jiahao Wang +1 more

Efficient methods to access the entanglement of a quantum many-body state, where the complexity generally scales exponentially with the system size N, have long been a concern. Here we propose the Schmidt tensor network state (Schmidt TNS) that efficiently represents the Schmidt decomposition of finite- and even infinite-size quantum states with nontrivial bipartition boundary. The key idea is to represent the Schmidt coefficients (i.e., entanglement spectrum) and transformations in the decomposition to tensor networks (TNs) with linearly scaled complexity versus N. Specifically, the transformations are written as the TNs formed by local unitary tensors, and the Schmidt coefficients are encoded in a positive-definite matrix product state (MPS). Translational invariance can be imposed on the TNs and MPS for the infinite-size cases. The validity of Schmidt TNS is demonstrated by simulating the ground state of the quasi-one-dimensional spin model with geometrical frustration. Our results show that the MPS encoding the Schmidt coefficients is weakly entangled even when the entanglement entropy of the decomposed state is strong. This justifies the efficiency of using MPS to encode the Schmidt coefficients, and promises an exponential speedup on the full-state sampling tasks.

arXiv:2210.08166•Physical Review Letters•Jul 13, 2023•2 citations

Scalable Quantum State Preparation for Encoding Genomic Data with Matrix Product States

Floyd M. Creevey, Hassan, Hitham T., James McCafferty +2 more

As quantum computing hardware advances, the need for algorithms that facilitate the loading of classical data into the quantum states of these devices has become increasingly important. This study presents a method for producing scalable quantum circuits to encode genomic data using the Matrix Product State (MPS) formalism. The method is illustrated by encoding the genome of the bacteriophage $ΦX174$ into a 15-qubit state, and analysing the trade-offs between MPS bond dimension, reconstruction error, and the resulting circuit complexity. This study proposes methods for optimising encoding circuits with standard benchmark datasets for the emerging field of quantum bioinformatics. The results for circuit generation and simulation on HPC and on current quantum hardware demonstrate the viability and utility of the encoding.

arXiv:2508.06184•Aug 8, 2025•2 citations

Exact log-depth preparation of highly entangled matrix product states

Keisuke Murota, Frédéric Sauvage, Marco Ballarin +2 more

Preparing matrix product states (MPS) on a quantum device is a key subroutine in many quantum algorithms. The most competitive methods, based on the renormalisation group, prepare translationally invariant MPS of size $L$ and bond dimension $χ$, up to an error $\varepsilon$, in circuit depth $\tilde O(χ^{4}\log(L/\varepsilon))$ or $\tilde O(χ^{6}\log\log(L/\varepsilon))$. We improve multiple aspects of these methods. First, using block-encoded correction maps, whose post-selection succeeds with constant probability, we render the preparation exact without sacrificing the scaling in $L$. Second, through a generalisation of oblivious amplitude amplification to isometries, we reduce the bond-dimension dependence, improving the depth to $\tilde O(χ^{2}\log L + χ^{4})$ or $\tilde O(χ^{2}\log\log L + χ^{4})$, and even to $\tilde O(χ^{3}\log L)$ for incoherent preparations. Finally, we extend the framework to non-translationally invariant MPS and prove logarithmic-depth exact preparation for independent and identically distributed random tensor sequences. Confirmed by numerical studies, these results constitute, to the best of our knowledge, the most efficient exact MPS preparation protocols in the relevant parameter regimes.

quant-pharXiv:2606.24475•Jun 24, 2026•5 citations
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.
We study the classical compilation of quantum circuits for the preparation of matrix product states (MPS), which are quantum states of low entanglement with an efficient classical description. Our algorithm represents a near-term alternative to previous sequential approaches by reverse application of a disentangler, which can be found by minimizing bipartite entanglement measures after the application of a layer of parametrized disentangling gates. Since a successful disentangler is expected to decrease the bond dimension on average, such a layer-by-layer optimization remains classically efficient even for deep circuits. Additionally, as the Schmidt coefficients of all bonds are locally accessible through the canonical Γ − Λ form of an MPS, the optimization algorithm can be heavily parallelized. We discuss guarantees and limitations to trainability and show numerical results for ground states of one-dimensional, local Hamiltonians as well as artificially spread out entanglement among multiple qubits using error-correcting codes.
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.
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.
Efficient methods to access the entanglement of a quantum many-body state, where the complexity generally scales exponentially with the system size N, have long been a concern. Here we propose the Schmidt tensor network state (Schmidt TNS) that efficiently represents the Schmidt decomposition of finite- and even infinite-size quantum states with nontrivial bipartition boundary. The key idea is to represent the Schmidt coefficients (i.e., entanglement spectrum) and transformations in the decomposition to tensor networks (TNs) with linearly scaled complexity versus N. Specifically, the transformations are written as the TNs formed by local unitary tensors, and the Schmidt coefficients are encoded in a positive-definite matrix product state (MPS). Translational invariance can be imposed on the TNs and MPS for the infinite-size cases. The validity of Schmidt TNS is demonstrated by simulating the ground state of the quasi-one-dimensional spin model with geometrical frustration. Our results show that the MPS encoding the Schmidt coefficients is weakly entangled even when the entanglement entropy of the decomposed state is strong. This justifies the efficiency of using MPS to encode the Schmidt coefficients, and promises an exponential speedup on the full-state sampling tasks.
As quantum computing hardware advances, the need for algorithms that facilitate the loading of classical data into the quantum states of these devices has become increasingly important. This study presents a method for producing scalable quantum circuits to encode genomic data using the Matrix Product State (MPS) formalism. The method is illustrated by encoding the genome of the bacteriophage ΦX174ΦX174ΦX174 into a 15-qubit state, and analysing the trade-offs between MPS bond dimension, reconstruction error, and the resulting circuit complexity. This study proposes methods for optimising encoding circuits with standard benchmark datasets for the emerging field of quantum bioinformatics. The results for circuit generation and simulation on HPC and on current quantum hardware demonstrate the viability and utility of the encoding.
Preparing matrix product states (MPS) on a quantum device is a key subroutine in many quantum algorithms. The most competitive methods, based on the renormalisation group, prepare translationally invariant MPS of size LLL and bond dimension χχχ, up to an error ε\varepsilonε, in circuit depth O~(χ4log⁡(L/ε))\tilde O(χ^{4}\log(L/\varepsilon))O~(χ4log(L/ε)) or O~(χ6log⁡log⁡(L/ε))\tilde O(χ^{6}\log\log(L/\varepsilon))O~(χ6loglog(L/ε)). We improve multiple aspects of these methods. First, using block-encoded correction maps, whose post-selection succeeds with constant probability, we render the preparation exact without sacrificing the scaling in LLL. Second, through a generalisation of oblivious amplitude amplification to isometries, we reduce the bond-dimension dependence, improving the depth to O~(χ2log⁡L+χ4)\tilde O(χ^{2}\log L + χ^{4})O~(χ2logL+χ4) or O~(χ2log⁡log⁡L+χ4)\tilde O(χ^{2}\log\log L + χ^{4})O~(χ2loglogL+χ4), and even to O~(χ3log⁡L)\tilde O(χ^{3}\log L)O~(χ3logL) for incoherent preparations. Finally, we extend the framework to non-translationally invariant MPS and prove logarithmic-depth exact preparation for independent and identically distributed random tensor sequences. Confirmed by numerical studies, these results constitute, to the best of our knowledge, the most efficient exact MPS preparation protocols in the relevant parameter regimes.