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

Lecture notes in computer science

On Rounding Errors in the Simulation of Quantum Circuits

Jonas Klamroth, Bernhard Beckert

Published Jan 1, 2024• 0 citations
Publisher
DOI
10.1007/978-981-97-0989-2_11

Related papers

Improving Gate-Level Simulation of Quantum Circuits

George F. Viamontes, Igor L. Markov, John P. Hayes

arXiv:quant-ph/0309060•Quantum Information Processing•Oct 1, 2003•110 citations

Bounding Rounding Errors in the Simulation of Quantum Circuits

Jonas Klamroth, Bernhard Beckert

Quantum simulators are a ubiquitous part of quantum software development. This is especially true for the current NISQ-era but will probably remain true for a long time as error-free controlled testing is hardly possible on real devices. However, quantum simulators are implemented in classical languages and thus fall prey to rounding errors. We present bounds on these errors based on the number of gates and qubits alone. This can be crucial to rule out rounding errors prior to executing the circuit. Additionally, we show that these theoretical bounds are sufficient to essentially rule out relevant rounding errors for the simulation of small to medium-sized circuits and even for larger circuits under the assumption that only 1- and 2-qubit gates are used.

IEEE International Conference on Quantum Software (QSW)•Jul 7, 2024•1 citation

A lower bound method for quantum circuits

Debajyoti Bera

Information Processing Letters•May 10, 2011•8 citations

The limits of quantum circuit simulation with low precision arithmetic

S. Betelú

This is an investigation of the limits of quantum circuit simulation with Schrodinger's formulation and low precision arithmetic. The goal is to estimate how much memory can be saved in simulations that involve random, maximally entangled quantum states. An arithmetic polar representation of $B$ bits is defined for each quantum amplitude and a normalization procedure is developed to minimize rounding errors. Then a model is developed to quantify the cumulative errors on a circuit of $Q$ qubits and $G$ gates. Depending on which regime the circuit operates, the model yields explicit expressions for the maximum number of effective gates that can be simulated before rounding errors dominate the computation. The results are illustrated with random circuits and the quantum Fourier transform.

arXiv:2005.13392•May 27, 2020•0 citations

Optimized Matrix-Product State Simulations of Quantum Error Correction Circuits

Asier Piñeiro Orioli, Chen Zhao, Guido Masella +3 more

Simulating quantum error correction (QEC) circuits including non-Clifford gates at scale is important to accelerate progress toward fault-tolerant quantum computing. Here we demonstrate that matrix product state (MPS) techniques can handle many QEC circuits exactly and without restriction on gate types. Crucially, we find that MPS efficiency depends sensitively on implementation choices, and we introduce a series of targeted optimizations that reduce bond dimensions and simulation time by several orders of magnitude compared to naive approaches. We illustrate this with examples including: (a) a rotated surface code quantum memory up to distance 11, (b) logical Bell-state preparation up to distance 9, (c) a 15-to-1 magic-state distillation circuit including hundreds of QEC rounds that we optimize to be simulated with only 11 logical qubits (187 physical qubits) and a maximal bond dimension of 64 in under 40 seconds, and (d) a narrow, deep random circuit that scales linearly with the number of T gates. These results demonstrate the importance of circuit-level optimizations and position MPS as a valuable complement to near-Clifford simulators for QEC circuits.

quant-pharXiv:2609.03073•Sep 4, 2026•2 citations

Classical Simulation of Quantum Circuits by Half Gauss Sums

Kaifeng Bu, Dax Enshan Koh

arXiv:1812.00224•Communications in Mathematical Physics•Jan 31, 2022•18 citations
Quantum simulators are a ubiquitous part of quantum software development. This is especially true for the current NISQ-era but will probably remain true for a long time as error-free controlled testing is hardly possible on real devices. However, quantum simulators are implemented in classical languages and thus fall prey to rounding errors. We present bounds on these errors based on the number of gates and qubits alone. This can be crucial to rule out rounding errors prior to executing the circuit. Additionally, we show that these theoretical bounds are sufficient to essentially rule out relevant rounding errors for the simulation of small to medium-sized circuits and even for larger circuits under the assumption that only 1- and 2-qubit gates are used.
This is an investigation of the limits of quantum circuit simulation with Schrodinger's formulation and low precision arithmetic. The goal is to estimate how much memory can be saved in simulations that involve random, maximally entangled quantum states. An arithmetic polar representation of BBB bits is defined for each quantum amplitude and a normalization procedure is developed to minimize rounding errors. Then a model is developed to quantify the cumulative errors on a circuit of QQQ qubits and GGG gates. Depending on which regime the circuit operates, the model yields explicit expressions for the maximum number of effective gates that can be simulated before rounding errors dominate the computation. The results are illustrated with random circuits and the quantum Fourier transform.
Simulating quantum error correction (QEC) circuits including non-Clifford gates at scale is important to accelerate progress toward fault-tolerant quantum computing. Here we demonstrate that matrix product state (MPS) techniques can handle many QEC circuits exactly and without restriction on gate types. Crucially, we find that MPS efficiency depends sensitively on implementation choices, and we introduce a series of targeted optimizations that reduce bond dimensions and simulation time by several orders of magnitude compared to naive approaches. We illustrate this with examples including: (a) a rotated surface code quantum memory up to distance 11, (b) logical Bell-state preparation up to distance 9, (c) a 15-to-1 magic-state distillation circuit including hundreds of QEC rounds that we optimize to be simulated with only 11 logical qubits (187 physical qubits) and a maximal bond dimension of 64 in under 40 seconds, and (d) a narrow, deep random circuit that scales linearly with the number of T gates. These results demonstrate the importance of circuit-level optimizations and position MPS as a valuable complement to near-Clifford simulators for QEC circuits.