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

Quantum simulations with noisy quantum computers

Jay Gambetta

Published Mar 13, 2017• 0 citations
OpenAlex

Related papers

The classical simulation of noisy quantum computers : a polyhedral approach

N. Ratanje

•Jan 1, 2017•0 citations

Digital Quantum Simulation of Few-body Hamiltonians on a Noisy Quantum Computer

Pedro M. Q. Cruz

•Dec 17, 2018•0 citations

Quantum simulation and quantum computation of noisy-intermediate scale

Kai Xu, Heng Fan

In the past years, great progresses have been made on quantum computation and quantum simulation. Increasing the number of qubits in the quantum processors is expected to be one of the main motivations in the next years, while noises in manipulation of quantum states may still be inevitable even the precision will improve. For research in this direction, it is necessary to review the available results about noisy multiqubit quantum computation and quantum simulation. The review focuses on multiqubit state generations, quantum computational advantage, and simulating physics of quantum many-body systems. Perspectives of near term noisy intermediate-quantum processors will be discussed.

Chinese Physics B•Aug 16, 2022•5 citations

Mitigating errors in noisy quantum computers

Samuele Ferracin, nate stemen, Joel J. Wallman

Bulletin of the American Physical Society•Mar 16, 2021•0 citations

TUSQ: Tracking, Uncomputation, and Sampling for Noisy Quantum Simulation

Siddharth Dangwal, Tina Oberoi, Ajay Sailopal +2 more

Quantum computers have improved in size and quality in recent years, enabling the execution of complex circuits. However, for most researchers, access to compute time is limited. This necessitates the development of simulators that mimic noisy quantum hardware accurately and scalably. The ideal way to simulate noisy systems is via Density Matrix Simulation (DMS). However, its high memory footprint limits its scalability. Consequently, noisy simulations are performed in two steps: (a) sampling multiple circuits with fixed noisy gates from the stochastic noise channels, (b) performing the State Vector Simulations (SVS) of these circuits and averaging their output to obtain the effective noisy simulation result. This often leads to a substantial increase in compute overhead, slowing down the simulation. Existing methods solve this problem by caching critical intermediate results in memory and reusing them. However, when a simulation task is both compute and memory-intensive, we need to eliminate computational overheads without incurring extra memory overheads. To enable fast simulation in the compute and memory bound regime, we propose TUSQ - Tracking, Uncomputation, and Sampling for Noisy Quantum Simulation. TUSQ is composed of two modules: the Error Characterization Module (ECM), and Depth First Tree Traversal (DFTT). The ECM characterizes errors so that the simulator can eliminate redundant circuit instances (via ER Tallying and ER Commutation), followed by importance sampling (in the Pruning stage), significantly reducing the number of circuits to be simulated relative to the baseline strategy of simulating all circuits. This is followed by DFTT, which computes the statevectors for these sampled circuits efficiently by taking advantage of circuit similarity, representing similar circuits in a tree and using computation and uncomputation to traverse the tree efficiently. TUSQ is evaluated for a total of 198 benchmarks, executed for 1 million shots and reports an average speedup of$59.06 \times$and$13.38 \times$over Qiskit and CUDA-Q, with a maximum speedup of$7878.03 \times$and$439.38 \times$respectively. We also compare TUSQ against TQSim in the time and memory critical regime. We observe an average and maximum speedup of$39.32 \times$and 3134.31×, respectively.

Proceedings - International Symposium on Computer Architecture/Proceedings•Jun 1, 2026•0 citations

Quantum Simulation with a Quantum Computer

Colin P. Williams

Texts in computer science•Dec 6, 2010•2 citations
In the past years, great progresses have been made on quantum computation and quantum simulation. Increasing the number of qubits in the quantum processors is expected to be one of the main motivations in the next years, while noises in manipulation of quantum states may still be inevitable even the precision will improve. For research in this direction, it is necessary to review the available results about noisy multiqubit quantum computation and quantum simulation. The review focuses on multiqubit state generations, quantum computational advantage, and simulating physics of quantum many-body systems. Perspectives of near term noisy intermediate-quantum processors will be discussed.
Quantum computers have improved in size and quality in recent years, enabling the execution of complex circuits. However, for most researchers, access to compute time is limited. This necessitates the development of simulators that mimic noisy quantum hardware accurately and scalably. The ideal way to simulate noisy systems is via Density Matrix Simulation (DMS). However, its high memory footprint limits its scalability. Consequently, noisy simulations are performed in two steps: (a) sampling multiple circuits with fixed noisy gates from the stochastic noise channels, (b) performing the State Vector Simulations (SVS) of these circuits and averaging their output to obtain the effective noisy simulation result. This often leads to a substantial increase in compute overhead, slowing down the simulation. Existing methods solve this problem by caching critical intermediate results in memory and reusing them. However, when a simulation task is both compute and memory-intensive, we need to eliminate computational overheads without incurring extra memory overheads. To enable fast simulation in the compute and memory bound regime, we propose TUSQ - Tracking, Uncomputation, and Sampling for Noisy Quantum Simulation. TUSQ is composed of two modules: the Error Characterization Module (ECM), and Depth First Tree Traversal (DFTT). The ECM characterizes errors so that the simulator can eliminate redundant circuit instances (via ER Tallying and ER Commutation), followed by importance sampling (in the Pruning stage), significantly reducing the number of circuits to be simulated relative to the baseline strategy of simulating all circuits. This is followed by DFTT, which computes the statevectors for these sampled circuits efficiently by taking advantage of circuit similarity, representing similar circuits in a tree and using computation and uncomputation to traverse the tree efficiently. TUSQ is evaluated for a total of 198 benchmarks, executed for 1 million shots and reports an average speedup of59.06×59.06 \times59.06×and13.38×13.38 \times13.38×over Qiskit and CUDA-Q, with a maximum speedup of7878.03×7878.03 \times7878.03×and439.38×439.38 \times439.38×respectively. We also compare TUSQ against TQSim in the time and memory critical regime. We observe an average and maximum speedup of39.32×39.32 \times39.32×and 3134.31×, respectively.