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

Simulating Noisy Quantum Algorithms and Low Depth Quantum State Preparation using Matrix Product States

Azar C. Nakhl

Published Jan 1, 2021• 0 citations
OpenAlex

Related papers

Matrix product state simulations on a quantum computer

Michael Foss‐Feig, Andrew C. Potter, David Hayes

Bulletin of the American Physical Society•Jun 4, 2020•1 citation

Quantum state preparation for probability distributions with reflection symmetry using matrix-product states

Yuichi Sano, Ikko Hamamura

Quantum circuits for loading probability distributions into quantum states are essential subroutines in quantum algorithms used in physics, finance engineering, and machine learning. The ability to implement these with high accuracy in low-depth quantum circuits is a critical issue. We propose a novel quantum state preparation method for probability distribution with reflection symmetry using matrix product states. By considering reflection symmetry, our method reduces the entanglement of probability distributions and improves the accuracy of approximations by matrix product states. As a result, we improved the accuracy by two orders of magnitude over existing methods using matrix product states. Our approach, characterized by linear scalability with qubit count, is highly advantageous for noisy quantum devices. Also, our demonstration results reveal that the approximation accuracy in tensor networks depends heavily on the bond dimension, with minimal reliance on the number of qubits. Our method is demonstrated for a normal distribution encoded into 10 and 20 qubits on a real quantum processor.

arXiv:2403.16729•Physical Review Applied•Aug 25, 2025•8 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

Quantum simulations with noisy quantum computers

Jay Gambetta

Bulletin of the American Physical Society•Mar 13, 2017•0 citations

Implementation of an Optimally Bounded Algorithm for Quantum State Preparation

Giacomo Belli, Andrea Bersellini, Michele Amoretti

Lecture notes in computer science•Jan 1, 2025•0 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 circuits for loading probability distributions into quantum states are essential subroutines in quantum algorithms used in physics, finance engineering, and machine learning. The ability to implement these with high accuracy in low-depth quantum circuits is a critical issue. We propose a novel quantum state preparation method for probability distribution with reflection symmetry using matrix product states. By considering reflection symmetry, our method reduces the entanglement of probability distributions and improves the accuracy of approximations by matrix product states. As a result, we improved the accuracy by two orders of magnitude over existing methods using matrix product states. Our approach, characterized by linear scalability with qubit count, is highly advantageous for noisy quantum devices. Also, our demonstration results reveal that the approximation accuracy in tensor networks depends heavily on the bond dimension, with minimal reliance on the number of qubits. Our method is demonstrated for a normal distribution encoded into 10 and 20 qubits on a real quantum processor.
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.
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.