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

MSV

Effective Quantum Simulator for Many 64-qubit Circuits.

Anh Quoc Nguyen, Michael Anshel

Published Jan 1, 2005• 0 citations
OpenAlex

Related papers

Building an effective general-purpose quantum simulator for the design and analysis of quantum circuits

Michael Anshel, Anh Quoc Nguyen

Recently quantum computing has achieved significant results both in theoretical and experimental areas and quantum algorithms have drawn the attention of many scientists. At the present there exist several experiments that realized some parts of certain important quantum algorithms. While those experiments work with only up to seven qubits, quantum simulators allow scientists to design algorithms with many more qubits. The existing simulators have one or more of the following restrictions: either they require powerful computers and additional computation packages such as Matlab or Mathematica or they don't provide an easy method for interacting between the classical and quantum parts of an algorithm. More importantly, none of them can simulate a generic 64-qubit circuit. It is important at this stage of quantum computing development to investigate technological improvements in simulating quantum circuit design. In this thesis we developed a specialized data structure, QSV, for quantum simulators along with new method for calculation of the new state vector after application of a quantum gate in a quantum simulator. We also developed a technique that speeds up the simulation time with our QSV vectors. With those results we built a quantum simulator that overcomes many shortcomings in other simulators and it has many advanced features. Our simulator can simulate many 64-qubit circuits and it can directly simulate multiple qubit gates as well as allows users to define gates with up to 10 qubits. The simulation time is much less in comparison with other simulators we tested. The simulator defines specifications so that users can easily design and test quantum circuits. With the simulator we also developed some new quantum circuits and verified many designs and constructions.

•Jan 1, 2006•0 citations

64-qubit quantum circuit simulation

Zhaoyun Chen, Qi Zhou, Cheng Xue +3 more

arXiv:1802.06952•中国科学通报:英文版•Jun 20, 2018•147 citations

QUANTUM CIRCUIT OPTIMIZATION (FOR 3 QUBITS)

International Journal of Advance Engineering and Research Development•Jun 30, 2015•0 citations

Empirical Characterization of Quantum Workloads on Heterogeneous Resources for Quantum Simulation

Jiwon Ha, 박숙영, Hyeonsang Eom +1 more

Quantum cloud platforms increasingly provide access to heterogeneous execution backends including real QPUs and quantum simulators. Effective backend selection is challenging because runtime and output quality vary with workload structure, backend characteristics, and noise conditions. This paper presents an empirical characterization study of how quantum workload properties shape execution across heterogeneous classical simulator backends, focusing on a CPU/GPU-based statevector simulation method. The workload characteristics examined in this study include qubit count, circuit depth, two-qubit gate density, workload class, and noise sensitivity. The experiments show qubit count and circuit depth are primary factors for simulation cost. Two-qubit gate density and workload class affect backend affinity. For example, CPU/GPU affinity in Grover varies with the depth of circuits. Shallow circuits have lower runtime on CPUs, whereas deep circuits have lower runtime on GPUs. Four backend-selection criteria (BS1-BS4) provide analytical bases to examine the effects of circuit structure, workload class, noise tiers, and measurement-derived profiles. The results show characterization-driven backend selection performs better than relying on coarse-grained workload information alone in heterogeneous quantum simulation environments.

IEEE International Conference on Cluster Computing (CLUSTER)•Sep 1, 2026•0 citations

Quantum Circuit Simulator

Md Ahsan Habib

•Jan 1, 2026•0 citations

Gate-Based Quantum Simulation of Gaussian Bosonic Circuits on Exponentially Many Modes

Alice Barthe, Marco Cerezo, Andrew T. Sornborger +2 more

We introduce a framework for simulating, on an (n+1)-qubit quantum computer, the action of a Gaussian bosonic (GB) circuit on a state over 2^{n} modes. Specifically, we encode the initial bosonic state's expectation values over quadrature operators (and their covariance matrix) as an input qubit state. This is then evolved by a quantum circuit that effectively implements the symplectic propagators induced by the GB gates. We find families of GB circuits and initial states leading to efficient quantum simulations. For this purpose, we introduce a dictionary that maps between GB and qubit gates such that particle- (non-particle-) preserving GB gates lead to real- (imaginary-) time evolutions at the qubit level. For the special case of particle-preserving circuits, we present a bounded-error-quantum-polynomial time (BQP)-complete GB decision problem, indicating that GB evolutions of Gaussian states on exponentially many modes are as powerful as universal quantum computers. We also perform numerical simulations of an interferometer on ∼8×10^{9} modes, illustrating the power of our framework.

arXiv:2407.06290•Physical Review Letters•Feb 20, 2025•13 citations
Recently quantum computing has achieved significant results both in theoretical and experimental areas and quantum algorithms have drawn the attention of many scientists. At the present there exist several experiments that realized some parts of certain important quantum algorithms. While those experiments work with only up to seven qubits, quantum simulators allow scientists to design algorithms with many more qubits. The existing simulators have one or more of the following restrictions: either they require powerful computers and additional computation packages such as Matlab or Mathematica or they don't provide an easy method for interacting between the classical and quantum parts of an algorithm. More importantly, none of them can simulate a generic 64-qubit circuit. It is important at this stage of quantum computing development to investigate technological improvements in simulating quantum circuit design. In this thesis we developed a specialized data structure, QSV, for quantum simulators along with new method for calculation of the new state vector after application of a quantum gate in a quantum simulator. We also developed a technique that speeds up the simulation time with our QSV vectors. With those results we built a quantum simulator that overcomes many shortcomings in other simulators and it has many advanced features. Our simulator can simulate many 64-qubit circuits and it can directly simulate multiple qubit gates as well as allows users to define gates with up to 10 qubits. The simulation time is much less in comparison with other simulators we tested. The simulator defines specifications so that users can easily design and test quantum circuits. With the simulator we also developed some new quantum circuits and verified many designs and constructions.
Quantum cloud platforms increasingly provide access to heterogeneous execution backends including real QPUs and quantum simulators. Effective backend selection is challenging because runtime and output quality vary with workload structure, backend characteristics, and noise conditions. This paper presents an empirical characterization study of how quantum workload properties shape execution across heterogeneous classical simulator backends, focusing on a CPU/GPU-based statevector simulation method. The workload characteristics examined in this study include qubit count, circuit depth, two-qubit gate density, workload class, and noise sensitivity. The experiments show qubit count and circuit depth are primary factors for simulation cost. Two-qubit gate density and workload class affect backend affinity. For example, CPU/GPU affinity in Grover varies with the depth of circuits. Shallow circuits have lower runtime on CPUs, whereas deep circuits have lower runtime on GPUs. Four backend-selection criteria (BS1-BS4) provide analytical bases to examine the effects of circuit structure, workload class, noise tiers, and measurement-derived profiles. The results show characterization-driven backend selection performs better than relying on coarse-grained workload information alone in heterogeneous quantum simulation environments.
We introduce a framework for simulating, on an (n+1)-qubit quantum computer, the action of a Gaussian bosonic (GB) circuit on a state over 2^{n} modes. Specifically, we encode the initial bosonic state's expectation values over quadrature operators (and their covariance matrix) as an input qubit state. This is then evolved by a quantum circuit that effectively implements the symplectic propagators induced by the GB gates. We find families of GB circuits and initial states leading to efficient quantum simulations. For this purpose, we introduce a dictionary that maps between GB and qubit gates such that particle- (non-particle-) preserving GB gates lead to real- (imaginary-) time evolutions at the qubit level. For the special case of particle-preserving circuits, we present a bounded-error-quantum-polynomial time (BQP)-complete GB decision problem, indicating that GB evolutions of Gaussian states on exponentially many modes are as powerful as universal quantum computers. We also perform numerical simulations of an interferometer on ∼8×10^{9} modes, illustrating the power of our framework.