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

The limits of quantum circuit simulation with low precision arithmetic

S. Betelú

Published May 27, 2020• 0 citations
arXivHTMLPDF

Abstract

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.

DOI
10.48550/arxiv.2005.13392

Related papers

What Limits the Simulation of Quantum Computers?

Yiqing Zhou, E. Miles Stoudenmire, Xavier Waintal

An ultimate goal of quantum computing is to perform calculations beyond the reach of any classical computer.It is therefore imperative that useful quantum computers be very difficult to simulate classically, otherwise classical computers could be used for the applications envisioned for the quantum ones.Perfect quantum computers are unarguably exponentially difficult to simulate: the classical resources required grow exponentially with the number of qubits N or the depth D of the circuit.This difficulty has triggered recent experiments on deep, random circuits that aim to demonstrate that quantum devices may already perform tasks beyond the reach of classical computing.These real quantum computing devices, however, suffer from many sources of decoherence and imprecision which limit the degree of entanglement that can actually be reached to a fraction of its theoretical maximum.They are characterized by an exponentially decaying fidelity F ∼ ð1 -ϵÞ ND with an error rate ϵ per operation as small as ≈1% for current devices with several dozen qubits or even smaller for smaller devices.In this work, we provide new insight on the computing capabilities of real quantum computers by demonstrating that they can be simulated at a tiny fraction of the cost that would be needed for a perfect quantum computer.Our algorithms compress the representations of quantum wave functions using matrix product states, which are able to capture states with low to moderate entanglement very accurately.This compression introduces a finite error rate ϵ so that the algorithms closely mimic the behavior of real quantum computing devices.The computing time of our algorithm increases only linearly with N and D in sharp contrast with exact simulation algorithms.We illustrate our algorithms with simulations of random circuits for qubits connected in both one-and twodimensional lattices.We find that ϵ can be decreased at a polynomial cost in computing power down to a minimum error ϵ ∞ .Getting below ϵ ∞ requires computing resources that increase exponentially with ϵ ∞ =ϵ.For a two-dimensional array of N ¼ 54 qubits and a circuit with control-Z gates, error rates better than state-of-the-art devices can be obtained on a laptop in a few hours.For more complex gates such as a SWAP gate followed by a controlled rotation, the error rate increases by a factor 3 for similar computing time.Our results suggest that, despite the high fidelity reached by quantum devices, only a tiny fraction ð∼10 -8 Þ of the system Hilbert space is actually being exploited.

arXiv:2002.07730•Physical Review X•Nov 23, 2020•254 citations

Quantum Circuit-Width Reduction through Parameterisation and Specialisation

Youssef Moawad, Wim A. Vanderbauwhede, R. Steijl

As quantum computing technology continues to develop, the need for research into novel quantum algorithms is growing. However, such algorithms cannot yet be reliably tested on actual quantum hardware, which is still limited in several ways, including qubit coherence times, connectivity, and available qubits. To facilitate the development of novel algorithms despite this, simulators on classical computing systems are used to verify the correctness of an algorithm, and study its behaviour under different error models. In general, this involves operating on a memory space that grows exponentially with the number of qubits. In this work, we introduce quantum circuit transformations that allow for the construction of parameterised circuits for quantum algorithms. The parameterised circuits are in an ideal form to be processed by quantum compilation tools, such that the circuit can be partially evaluated prior to simulation, and a smaller specialised circuit can be constructed by eliminating fixed input qubits. We show significant reduction in the number of qubits for various quantum arithmetic circuits. Divide-by-n-bits quantum integer dividers are used as an example demonstration. It is shown that the complexity reduces from 4n+2 to 3n+2 qubits in the specialised versions. For quantum algorithms involving divide-by-8 arithmetic operations, a reduction by 28=256 in required memory is achieved for classical simulation, reducing the memory required from 137 GB to 0.53 GB.

Algorithms•May 5, 2023•0 citations

Lossy Compression for Schrödinger-style Quantum Simulations

Noah Huffman, Dmitri S. Pavlichin, Tsachy Weissman

Simulating quantum circuits on classical hardware is a powerful and necessary tool for developing and testing quantum algorithms and hardware as well as evaluating claims of quantum supremacy in the Noisy Intermediate-Scale Quantum (NISQ) regime. Schrödinger-style simulations are limited by the exponential growth of the number of state amplitudes which need to be stored. In this work, we apply scalar and vector quantization to Schrödinger-style quantum circuit simulations as lossy compression schemes to reduce the number of bits needed to simulate quantum circuits. Using quantization, we can maintain simulation fidelities $>0.99$ when simulating the Quantum Fourier Transform, while using only 7 significand bits in a floating-point number to characterize the real and imaginary components of each amplitude. Furthermore, using vector quantization, we propose a method to bound the number of bits/amplitude needed to store state vectors in a simulation of a circuit that achieves a desired fidelity, and show that for a 6 qubit simulation of the Quantum Fourier Transform, 15 bits/amplitude is sufficient to maintain fidelity $>0.9$ at $10^4$ depth.

arXiv:2401.11088•Jan 20, 2024•0 citations

The Decoherence of Schrödinger’s State: A Quantitative Analysis of Fidelity in Noisy Quantum Simulations

William Wallace Teodoro Rodrigues, Jo�ão Fabrício Filho

The viability of algorithms on Noisy Intermediate-Scale Quantum (NISQ) computers is limited by operational errors and decoherence. To optimize execution, it is crucial to understand how circuit complexity (depth and number of gates), statistical sampling (shots), and result fidelity interact. This work investigates that relationship through large-scale simulations of 100,000 random circuits under a physically motivated noise model with temporal decoherence (T1/T2) and gate errors. The analysis shows a strong negative correlation between circuit complexity and Hellinger fidelity, revealing a “fidelity ceiling” where increasing shots reduces statistical error but cannot overcome noise. For complex circuits, the number of gates is identified as a stronger predictor of error than circuit depth.

•Nov 5, 2025•0 citations

General-Purpose Quantum Circuit Simulator with Projected Entangled-Pair States and the Quantum Supremacy Frontier

Chu Guo, Yong Liu, Min Xiong +12 more

Recent advances on quantum computing hardware have pushed quantum computing to the verge of quantum supremacy. Here, we bring together many-body quantum physics and quantum computing by using a method for strongly interacting two-dimensional systems, the projected entangled-pair states, to realize an effective general-purpose simulator of quantum algorithms. The classical computing complexity of this simulator is directly related to the entanglement generation of the underlying quantum circuit rather than the number of qubits or gate operations. We apply our method to study random quantum circuits, which allows us to quantify precisely the memory usage and the time requirements of random quantum circuits. We demonstrate our method by computing one amplitude for a 7×7 lattice of qubits with depth (1+40+1) on the Tianhe-2 supercomputer.

arXiv:1905.08394•Physical Review Letters•Nov 4, 2019•80 citations

A Stochastic-Computing-Based Framework for Quantum Circuit Simulation

Martin Lukáč, Naoya Onizawa, Shinobu Nagayama

Quantum computing is considered a promising platform for next-generation large-scale computing. Although fully scalable quantum computers are still under development, quantum accelerators already offer a practical means to test, evaluate, and better understand quantum computation. Existing simulators provide valuable tools, but they typically rely on deterministic arithmetic and often incur significant computational overhead. To address these limitations, we developed a quantum computing simulator based on bipolar stochastic arithmetic, designed with two goals in mind. First, stochastic computation enables flexible, on-demand control of simulation precision and runtime. Second, stochastic circuits generally require significantly less hardware area than their deterministic counterparts. In our approach, quantum states and operations are encoded using bipolar stochastic bitstreams, allowing quantum circuits to be simulated using lightweight stochastic logic. We implement a representative set of quantum circuits and evaluate the simulator with respect to accuracy and required stream length. The results demonstrate that stochastic simulation yields satisfactory accuracy for small quantum circuits in software, and with improved error-correction techniques, it has the potential to serve as an efficient alternative to conventional quantum simulators.

IEEE International Symposium on Multiple-Valued Logic (ISMVL)•May 19, 2026•1 citation
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.
An ultimate goal of quantum computing is to perform calculations beyond the reach of any classical computer.It is therefore imperative that useful quantum computers be very difficult to simulate classically, otherwise classical computers could be used for the applications envisioned for the quantum ones.Perfect quantum computers are unarguably exponentially difficult to simulate: the classical resources required grow exponentially with the number of qubits N or the depth D of the circuit.This difficulty has triggered recent experiments on deep, random circuits that aim to demonstrate that quantum devices may already perform tasks beyond the reach of classical computing.These real quantum computing devices, however, suffer from many sources of decoherence and imprecision which limit the degree of entanglement that can actually be reached to a fraction of its theoretical maximum.They are characterized by an exponentially decaying fidelity F ∼ ð1 -ϵÞ ND with an error rate ϵ per operation as small as ≈1% for current devices with several dozen qubits or even smaller for smaller devices.In this work, we provide new insight on the computing capabilities of real quantum computers by demonstrating that they can be simulated at a tiny fraction of the cost that would be needed for a perfect quantum computer.Our algorithms compress the representations of quantum wave functions using matrix product states, which are able to capture states with low to moderate entanglement very accurately.This compression introduces a finite error rate ϵ so that the algorithms closely mimic the behavior of real quantum computing devices.The computing time of our algorithm increases only linearly with N and D in sharp contrast with exact simulation algorithms.We illustrate our algorithms with simulations of random circuits for qubits connected in both one-and twodimensional lattices.We find that ϵ can be decreased at a polynomial cost in computing power down to a minimum error ϵ ∞ .Getting below ϵ ∞ requires computing resources that increase exponentially with ϵ ∞ =ϵ.For a two-dimensional array of N ¼ 54 qubits and a circuit with control-Z gates, error rates better than state-of-the-art devices can be obtained on a laptop in a few hours.For more complex gates such as a SWAP gate followed by a controlled rotation, the error rate increases by a factor 3 for similar computing time.Our results suggest that, despite the high fidelity reached by quantum devices, only a tiny fraction ð∼10 -8 Þ of the system Hilbert space is actually being exploited.
As quantum computing technology continues to develop, the need for research into novel quantum algorithms is growing. However, such algorithms cannot yet be reliably tested on actual quantum hardware, which is still limited in several ways, including qubit coherence times, connectivity, and available qubits. To facilitate the development of novel algorithms despite this, simulators on classical computing systems are used to verify the correctness of an algorithm, and study its behaviour under different error models. In general, this involves operating on a memory space that grows exponentially with the number of qubits. In this work, we introduce quantum circuit transformations that allow for the construction of parameterised circuits for quantum algorithms. The parameterised circuits are in an ideal form to be processed by quantum compilation tools, such that the circuit can be partially evaluated prior to simulation, and a smaller specialised circuit can be constructed by eliminating fixed input qubits. We show significant reduction in the number of qubits for various quantum arithmetic circuits. Divide-by-n-bits quantum integer dividers are used as an example demonstration. It is shown that the complexity reduces from 4n+2 to 3n+2 qubits in the specialised versions. For quantum algorithms involving divide-by-8 arithmetic operations, a reduction by 28=256 in required memory is achieved for classical simulation, reducing the memory required from 137 GB to 0.53 GB.
Simulating quantum circuits on classical hardware is a powerful and necessary tool for developing and testing quantum algorithms and hardware as well as evaluating claims of quantum supremacy in the Noisy Intermediate-Scale Quantum (NISQ) regime. Schrödinger-style simulations are limited by the exponential growth of the number of state amplitudes which need to be stored. In this work, we apply scalar and vector quantization to Schrödinger-style quantum circuit simulations as lossy compression schemes to reduce the number of bits needed to simulate quantum circuits. Using quantization, we can maintain simulation fidelities >0.99>0.99>0.99 when simulating the Quantum Fourier Transform, while using only 7 significand bits in a floating-point number to characterize the real and imaginary components of each amplitude. Furthermore, using vector quantization, we propose a method to bound the number of bits/amplitude needed to store state vectors in a simulation of a circuit that achieves a desired fidelity, and show that for a 6 qubit simulation of the Quantum Fourier Transform, 15 bits/amplitude is sufficient to maintain fidelity >0.9>0.9>0.9 at 10410^4104 depth.
The viability of algorithms on Noisy Intermediate-Scale Quantum (NISQ) computers is limited by operational errors and decoherence. To optimize execution, it is crucial to understand how circuit complexity (depth and number of gates), statistical sampling (shots), and result fidelity interact. This work investigates that relationship through large-scale simulations of 100,000 random circuits under a physically motivated noise model with temporal decoherence (T1/T2) and gate errors. The analysis shows a strong negative correlation between circuit complexity and Hellinger fidelity, revealing a “fidelity ceiling” where increasing shots reduces statistical error but cannot overcome noise. For complex circuits, the number of gates is identified as a stronger predictor of error than circuit depth.
Recent advances on quantum computing hardware have pushed quantum computing to the verge of quantum supremacy. Here, we bring together many-body quantum physics and quantum computing by using a method for strongly interacting two-dimensional systems, the projected entangled-pair states, to realize an effective general-purpose simulator of quantum algorithms. The classical computing complexity of this simulator is directly related to the entanglement generation of the underlying quantum circuit rather than the number of qubits or gate operations. We apply our method to study random quantum circuits, which allows us to quantify precisely the memory usage and the time requirements of random quantum circuits. We demonstrate our method by computing one amplitude for a 7×7 lattice of qubits with depth (1+40+1) on the Tianhe-2 supercomputer.
Quantum computing is considered a promising platform for next-generation large-scale computing. Although fully scalable quantum computers are still under development, quantum accelerators already offer a practical means to test, evaluate, and better understand quantum computation. Existing simulators provide valuable tools, but they typically rely on deterministic arithmetic and often incur significant computational overhead. To address these limitations, we developed a quantum computing simulator based on bipolar stochastic arithmetic, designed with two goals in mind. First, stochastic computation enables flexible, on-demand control of simulation precision and runtime. Second, stochastic circuits generally require significantly less hardware area than their deterministic counterparts. In our approach, quantum states and operations are encoded using bipolar stochastic bitstreams, allowing quantum circuits to be simulated using lightweight stochastic logic. We implement a representative set of quantum circuits and evaluate the simulator with respect to accuracy and required stream length. The results demonstrate that stochastic simulation yields satisfactory accuracy for small quantum circuits in software, and with improved error-correction techniques, it has the potential to serve as an efficient alternative to conventional quantum simulators.