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

IEEE International Conference on Quantum Software (QSW)

Bounding Rounding Errors in the Simulation of Quantum Circuits

Jonas Klamroth, Bernhard Beckert

Published Jul 7, 2024• 1 citation
Publisher

Abstract

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.

DOI
10.1109/qsw62656.2024.00024

Related papers

Hamiltonian simulation algorithms for near-term quantum hardware

Laura Clinton, Johannes Bausch, Toby S. Cubitt

The quantum circuit model is the de-facto way of designing quantum algorithms. Yet any level of abstraction away from the underlying hardware incurs overhead. In this work, we develop quantum algorithms for Hamiltonian simulation "one level below" the circuit model, exploiting the underlying control over qubit interactions available in most quantum hardware and deriving analytic circuit identities for synthesising multi-qubit evolutions from two-qubit interactions. We then analyse the impact of these techniques under the standard error model where errors occur per gate, and an error model with a constant error rate per unit time. To quantify the benefits of this approach, we apply it to time-dynamics simulation of the 2D spin Fermi-Hubbard model. Combined with new error bounds for Trotter product formulas tailored to the non-asymptotic regime and an analysis of error propagation, we find that e.g. for a 5 × 5 Fermi-Hubbard lattice we reduce the circuit depth from 1, 243, 586 using the best previous fermion encoding and error bounds in the literature, to 3, 209 in the per-gate error model, or the circuit-depth-equivalent to 259 in the per-time error model. This brings Hamiltonian simulation, previously beyond reach of current hardware for non-trivial examples, significantly closer to being feasible in the NISQ era.

arXiv:2003.06886•Nature Communications•Aug 17, 2021•95 citations

Quantum Rounding

Rajiv Krishnakumar, William J. Zeng

We introduce new rounding methods to improve the accuracy of finite precision quantum arithmetic. These quantum rounding methods are applicable when multiple samples are being taken from a quantum program. We show how to use multiple samples to stochastically suppress arithmetic error from rounding. We benchmark these methods on the multiplication of fixed-point numbers stored in quantum registers. We show that the gate counts and depths for multiplying to a target accuracy can be reduced by approximately 2-3X over state of the art methods while using roughly the same number of qubits.

arXiv:2108.05949•Aug 12, 2021•3 citations

High-Round QAOA for MAX kkk-SAT on Trapped Ion NISQ Devices

Elijah Pelofske, Andreas Bärtschi, John K. Golden +1 more

The Quantum Alternating Operator Ansatz (QAOA) is a hybrid classical-quantum algorithm that aims to sample the optimal solution(s) of discrete combinatorial optimization problems. We present optimized QAOA circuit constructions for sampling MAX$k$-SAT problems, specifically for$k=3$and$k=4$. The novel 4-SAT QAOA circuit construction we present uses measurement based uncomputation, followed by classical feed forward conditional operations. The QAOA circuit parameters for 3-SAT are optimized via exact classical (noise-free) simulation, using HPC resources to simulate up to 20 rounds on 10 qubits. In order to explore the limits of current NISQ devices we execute these optimized QAOA circuits for random 3-SAT test instances with clause-to-variable ratio 4 on four trapped ion quantum computers: Quantinuum H1-1 (20 qubits), IonQ Harmony (11 qubits), IonQ Aria 1 (25 qubits), and IonQ Forte (30 qubits). The QAOA circuits that are executed include$n=10$up to$p=20$, and$n=22$for$p=1$and$p=2$. The high round circuits use upwards of 9,000 individual gate instructions, making these some of the largest QAOA circuits executed on NISQ devices. Our main finding is that current NISQ devices perform best at low round counts (i.e.,$p=1, \ldots, 5$) and then – as expected due to noise – gradually start returning satisfiability truth assignments that are no better than randomly picked solutions as the number of QAOA rounds are further increased.

arXiv:2306.03238•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•22 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

Noise-aware Token Swapping for Qubit Routing

Asim Sharma, Avah Banerjee

In Noisy Intermediate-Scale Quantum (NISQ) era devices, the output fidelity of a quantum circuit, under plausible assumptions, decreases exponentially with its size and depth. As such, optimizing these aspects becomes paramount. This is especially true for sparsely connected physical architectures where added swap gates are essential to meet device connectivity requirements. In this work, we adapt the Approximate Token Swapping (ATS) algorithm, traditionally used for routing qubits, to handle noisy settings by giving priority to specific swap sequences over others. This priority is partially determined by the error rates of the couplings in the qubit connectivity graph. We refer to this algorithm as Priority-ATS (PATS). We provide theoretical justification for PATS's effectiveness over the ATS algorithm and experimentally demonstrate its ability to improve the output state's fidelity. In our simulations, we employ a depolarizing channel to represent two-qubit gate errors, with each neighboring qubit pair having a distinct CNOT gate error rate. By applying realistic error rates, our results prominently highlight an enhanced output fidelity of the quantum circuit when PATS is employed.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 17, 2023•6 citations

Quantum Circuit Synthesis Using Genetic Algorithms Combined with Fuzzy Logic

Ishraq Islam

Quantum computing emerges as a promising direction for high-performance computing in the post-Moore era. Leveraging quantum mechanical properties, quantum devices can theoretically provide significant speedup over classical computers in certain problem domains. Quantum algorithms are typically expressed as quantum circuits composed of quantum gates, or as unitary matrices. Execution of quantum algorithms on physical devices requires translation to machine-compatible circuits -- a process referred to as quantum compilation or synthesis. Quantum synthesis is a challenging problem. Physical quantum devices support a limited number of native basis gates, requiring synthesized circuits to be composed of only these gates. Moreover, quantum devices typically have specific qubit topologies, which constrain how and where gates can be applied. Consequently, logical qubits in input circuits and unitaries may need to be mapped to and routed between physical qubits on the device. Current Noisy Intermediate-Scale Quantum (NISQ) devices present additional constraints, through their gate errors and high susceptibility to noise. NISQ devices are vulnerable to errors during gate application and their short decoherence times leads to qubits rapidly succumbing to accumulated noise and possibly corrupting computations. Therefore, circuits synthesized for NISQ devices need to have a low number of gates to reduce gate errors, and short execution times to avoid qubit decoherence. The problem of synthesizing device-compatible quantum circuits, while optimizing for low gate count and short execution times, can be shown to be computationally intractable using analytical methods. Therefore, interest has grown towards heuristics-based compilation techniques, which are able to produce approximations of the desired algorithm to a required degree of precision. In this work, we investigate using Genetic Algorithms (GAs) -- a proven gradient-free optimization technique based on natural selection -- for circuit synthesis. In particular, we formulate the quantum synthesis problem as a multi-objective optimization (MOO) problem, with the objectives of minimizing the approximation error, number of multi-qubit gates, and circuit depth. We also employ fuzzy logic for runtime parameter adaptation of GA to enhance search efficiency and solution quality of our proposed quantum synthesis method.

•Jan 1, 2024•0 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.
The quantum circuit model is the de-facto way of designing quantum algorithms. Yet any level of abstraction away from the underlying hardware incurs overhead. In this work, we develop quantum algorithms for Hamiltonian simulation "one level below" the circuit model, exploiting the underlying control over qubit interactions available in most quantum hardware and deriving analytic circuit identities for synthesising multi-qubit evolutions from two-qubit interactions. We then analyse the impact of these techniques under the standard error model where errors occur per gate, and an error model with a constant error rate per unit time. To quantify the benefits of this approach, we apply it to time-dynamics simulation of the 2D spin Fermi-Hubbard model. Combined with new error bounds for Trotter product formulas tailored to the non-asymptotic regime and an analysis of error propagation, we find that e.g. for a 5 × 5 Fermi-Hubbard lattice we reduce the circuit depth from 1, 243, 586 using the best previous fermion encoding and error bounds in the literature, to 3, 209 in the per-gate error model, or the circuit-depth-equivalent to 259 in the per-time error model. This brings Hamiltonian simulation, previously beyond reach of current hardware for non-trivial examples, significantly closer to being feasible in the NISQ era.
We introduce new rounding methods to improve the accuracy of finite precision quantum arithmetic. These quantum rounding methods are applicable when multiple samples are being taken from a quantum program. We show how to use multiple samples to stochastically suppress arithmetic error from rounding. We benchmark these methods on the multiplication of fixed-point numbers stored in quantum registers. We show that the gate counts and depths for multiplying to a target accuracy can be reduced by approximately 2-3X over state of the art methods while using roughly the same number of qubits.
The Quantum Alternating Operator Ansatz (QAOA) is a hybrid classical-quantum algorithm that aims to sample the optimal solution(s) of discrete combinatorial optimization problems. We present optimized QAOA circuit constructions for sampling MAXkkk-SAT problems, specifically fork=3k=3k=3andk=4k=4k=4. The novel 4-SAT QAOA circuit construction we present uses measurement based uncomputation, followed by classical feed forward conditional operations. The QAOA circuit parameters for 3-SAT are optimized via exact classical (noise-free) simulation, using HPC resources to simulate up to 20 rounds on 10 qubits. In order to explore the limits of current NISQ devices we execute these optimized QAOA circuits for random 3-SAT test instances with clause-to-variable ratio 4 on four trapped ion quantum computers: Quantinuum H1-1 (20 qubits), IonQ Harmony (11 qubits), IonQ Aria 1 (25 qubits), and IonQ Forte (30 qubits). The QAOA circuits that are executed includen=10n=10n=10up top=20p=20p=20, andn=22n=22n=22forp=1p=1p=1andp=2p=2p=2. The high round circuits use upwards of 9,000 individual gate instructions, making these some of the largest QAOA circuits executed on NISQ devices. Our main finding is that current NISQ devices perform best at low round counts (i.e.,p=1,…,5p=1, \ldots, 5p=1,…,5) and then – as expected due to noise – gradually start returning satisfiability truth assignments that are no better than randomly picked solutions as the number of QAOA rounds are further increased.
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.
In Noisy Intermediate-Scale Quantum (NISQ) era devices, the output fidelity of a quantum circuit, under plausible assumptions, decreases exponentially with its size and depth. As such, optimizing these aspects becomes paramount. This is especially true for sparsely connected physical architectures where added swap gates are essential to meet device connectivity requirements. In this work, we adapt the Approximate Token Swapping (ATS) algorithm, traditionally used for routing qubits, to handle noisy settings by giving priority to specific swap sequences over others. This priority is partially determined by the error rates of the couplings in the qubit connectivity graph. We refer to this algorithm as Priority-ATS (PATS). We provide theoretical justification for PATS's effectiveness over the ATS algorithm and experimentally demonstrate its ability to improve the output state's fidelity. In our simulations, we employ a depolarizing channel to represent two-qubit gate errors, with each neighboring qubit pair having a distinct CNOT gate error rate. By applying realistic error rates, our results prominently highlight an enhanced output fidelity of the quantum circuit when PATS is employed.
Quantum computing emerges as a promising direction for high-performance computing in the post-Moore era. Leveraging quantum mechanical properties, quantum devices can theoretically provide significant speedup over classical computers in certain problem domains. Quantum algorithms are typically expressed as quantum circuits composed of quantum gates, or as unitary matrices. Execution of quantum algorithms on physical devices requires translation to machine-compatible circuits -- a process referred to as quantum compilation or synthesis. Quantum synthesis is a challenging problem. Physical quantum devices support a limited number of native basis gates, requiring synthesized circuits to be composed of only these gates. Moreover, quantum devices typically have specific qubit topologies, which constrain how and where gates can be applied. Consequently, logical qubits in input circuits and unitaries may need to be mapped to and routed between physical qubits on the device. Current Noisy Intermediate-Scale Quantum (NISQ) devices present additional constraints, through their gate errors and high susceptibility to noise. NISQ devices are vulnerable to errors during gate application and their short decoherence times leads to qubits rapidly succumbing to accumulated noise and possibly corrupting computations. Therefore, circuits synthesized for NISQ devices need to have a low number of gates to reduce gate errors, and short execution times to avoid qubit decoherence. The problem of synthesizing device-compatible quantum circuits, while optimizing for low gate count and short execution times, can be shown to be computationally intractable using analytical methods. Therefore, interest has grown towards heuristics-based compilation techniques, which are able to produce approximations of the desired algorithm to a required degree of precision. In this work, we investigate using Genetic Algorithms (GAs) -- a proven gradient-free optimization technique based on natural selection -- for circuit synthesis. In particular, we formulate the quantum synthesis problem as a multi-objective optimization (MOO) problem, with the objectives of minimizing the approximation error, number of multi-qubit gates, and circuit depth. We also employ fuzzy logic for runtime parameter adaptation of GA to enhance search efficiency and solution quality of our proposed quantum synthesis method.