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

Bulletin of the American Physical Society

Matrix product state simulations on a quantum computer

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

Published Jun 4, 2020• 1 citation
OpenAlex

Related papers

Simulation on a quantum computer

Rüdiger Schack

Informatik - Forschung und Entwicklung•Sep 15, 2006•4 citations

A multiprecision C++ library for matrix-product-state simulation of quantum computing: Evaluation of numerical errors

Akira SaiToh

The time-dependent matrix-product-state (TDMPS) simulation method has been used for numerically simulating quantum computing for a decade. We introduce our C++ library ZKCM_QC developed for multiprecision TDMPS simulations of quantum circuits. Besides its practical usability, the library is useful for evaluation of the method itself. With the library, we can capture two types of numerical errors in the TDMPS simulations: one due to rounding errors caused by the shortage in mantissa portions of floating-point numbers; the other due to truncations of nonnegligible Schmidt coefficients and their corresponding Schmidt vectors. We numerically analyze these errors in TDMPS simulations of quantum computing.

arXiv:1211.4086•Journal of Physics Conference Series•Aug 12, 2013•6 citations

Neurocomputing approach to matrix product state using quantum dynamics

Amandeep Singh Bhatia, Ajay Kumar

Quantum Information Processing•Sep 7, 2018•4 citations

MPS-VQE: A variational quantum computational chemistry simulator with matrix product states

Zhiqian Xu, Yi Fan, Chu Guo +1 more

Computer Physics Communications•Sep 3, 2023•7 citations

From Quantum Spin Models to Matrix Product States

J. P. Santos Pires

•Oct 10, 2017•0 citations

Tangent-space methods for truncating uniform MPS

Bram Vanhecke, Maarten Van Damme, Jutho Haegeman +2 more

An essential primitive in quantum tensor network simulations is the problem of approximating a matrix product state with one of a smaller bond dimension. This problem forms the central bottleneck in algorithms for time evolution and for contracting projected entangled pair states. We formulate a tangent-space based variational algorithm to achieve this goal for uniform (infinite) matrix product states. The algorithm exhibits a favourable scaling of the computational cost, and we demonstrate its usefulness by several examples involving the multiplication of a matrix product state with a matrix product operator.

arXiv:2001.11882•SciPost Physics Core•Feb 19, 2021•26 citations
The time-dependent matrix-product-state (TDMPS) simulation method has been used for numerically simulating quantum computing for a decade. We introduce our C++ library ZKCM_QC developed for multiprecision TDMPS simulations of quantum circuits. Besides its practical usability, the library is useful for evaluation of the method itself. With the library, we can capture two types of numerical errors in the TDMPS simulations: one due to rounding errors caused by the shortage in mantissa portions of floating-point numbers; the other due to truncations of nonnegligible Schmidt coefficients and their corresponding Schmidt vectors. We numerically analyze these errors in TDMPS simulations of quantum computing.
An essential primitive in quantum tensor network simulations is the problem of approximating a matrix product state with one of a smaller bond dimension. This problem forms the central bottleneck in algorithms for time evolution and for contracting projected entangled pair states. We formulate a tangent-space based variational algorithm to achieve this goal for uniform (infinite) matrix product states. The algorithm exhibits a favourable scaling of the computational cost, and we demonstrate its usefulness by several examples involving the multiplication of a matrix product state with a matrix product operator.