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

Improving quantum computer simulations

G. W. Arnold, Binh Trieu, Hans A. De Raedt, Mark Richter, Kristel F. L. Michielsen, Thomas Lippert

Published Jan 1, 2008• 1 citation
OpenAlex

Related papers

Faster quantum chemistry simulation on fault-tolerant quantum computers

N. Cody Jones, James Daniel Whitfield, Peter L. McMahon +4 more

Quantum computers can in principle simulate quantum physics exponentially faster than their classical counterparts, but some technical hurdles remain.We propose methods which substantially improve the performance of a particular form of simulation, ab initio quantum chemistry, on faulttolerant quantum computers; these methods generalize readily to other quantum simulation problems.Quantum teleportation plays a key role in these improvements and is used extensively as a computing resource.To improve execution time, we examine techniques for constructing arbitrary gates which perform substantially faster than circuits based on the conventional Solovay-Kitaev algorithm (Dawson and Nielsen 2006 Quantum Inform.Comput.6 81).For a given approximation error , arbitrary single-qubit gates can be 7

arXiv:1204.0567•New Journal of Physics•Nov 27, 2012•162 citations

Simulation of Quantum Computers

Hans A. De Raedt, Kristel F. L. Michielsen, Anthony Hams +2 more

Springer proceedings in physics•Jan 1, 2001•2 citations

Geometric Quantum Simulation Algorithm Improvements

Jincheng Zhang

Geometric Quantum Simulation (GQS) is a novel quantum simulation technique that leverages the unique properties of quantum mechanics, specifically quantum entanglement and superposition, to significantly accelerate the simulation of complex geometric systems. This paper presents an improved GQS algorithm designed to overcome the computational bottlenecks inherent in traditional methods, offering substantial improvements in simulation speed and accuracy for a range of geometric models. The core of the algorithm centers around a refined quantum state preparation strategy, incorporating entanglement manipulation to reduce the number of necessary quantum gates, and a novel optimization loop to enhance the fidelity of the resulting quantum states. We demonstrate the effectiveness of this improved approach through rigorous analysis and comparison with established quantum simulation methods, showcasing its potential to revolutionize the simulation of intricate geometric phenomena. This work contributes significantly to the advancement of quantum computing by providing a practical and efficient method for tackling computationally demanding geometric simulations.

•Sep 1, 2026•0 citations

Quantum Computer Simulation

Kluwer Academic Publishers eBooks•Jan 14, 2006•1 citation

Quantum Computer Simulation

Springer eBooks•Dec 10, 2006•5 citations

Towards scalability improvements of HybriD-GM quantum simulator

João Vítor Venceslau Coelho, Anderson Ávila, Samuel Xavier‐de‐Souza +1 more

Currently quantum computers require specialized hardware to be used, until they become more feasibly the testing of quantum algorithms is done by simulation, which is a task of high temporal and spacial complexity. To address this issue, the HybriD-GM simulator, and many others around the world, are under research and improvement, this paper is an ongoing work on improvements for the multi-core support of the HybriD-GM simulator, the experiments are done with the Shor and Grover algorithms, while varying the number of cores and qubits for each, to improve the scalability the removal of critical regions by the usage of tasks and other OpenMP resources is exploited, and the study about the impact of others variables on the simulator is already planned, as well improvements for future works on the GPU, and GPU-CPU approaches and expansion to distributed computing for horizontal scalability of the system.

•Oct 9, 2023•0 citations
Quantum computers can in principle simulate quantum physics exponentially faster than their classical counterparts, but some technical hurdles remain.We propose methods which substantially improve the performance of a particular form of simulation, ab initio quantum chemistry, on faulttolerant quantum computers; these methods generalize readily to other quantum simulation problems.Quantum teleportation plays a key role in these improvements and is used extensively as a computing resource.To improve execution time, we examine techniques for constructing arbitrary gates which perform substantially faster than circuits based on the conventional Solovay-Kitaev algorithm (Dawson and Nielsen 2006 Quantum Inform.Comput.6 81).For a given approximation error , arbitrary single-qubit gates can be 7
Geometric Quantum Simulation (GQS) is a novel quantum simulation technique that leverages the unique properties of quantum mechanics, specifically quantum entanglement and superposition, to significantly accelerate the simulation of complex geometric systems. This paper presents an improved GQS algorithm designed to overcome the computational bottlenecks inherent in traditional methods, offering substantial improvements in simulation speed and accuracy for a range of geometric models. The core of the algorithm centers around a refined quantum state preparation strategy, incorporating entanglement manipulation to reduce the number of necessary quantum gates, and a novel optimization loop to enhance the fidelity of the resulting quantum states. We demonstrate the effectiveness of this improved approach through rigorous analysis and comparison with established quantum simulation methods, showcasing its potential to revolutionize the simulation of intricate geometric phenomena. This work contributes significantly to the advancement of quantum computing by providing a practical and efficient method for tackling computationally demanding geometric simulations.
Currently quantum computers require specialized hardware to be used, until they become more feasibly the testing of quantum algorithms is done by simulation, which is a task of high temporal and spacial complexity. To address this issue, the HybriD-GM simulator, and many others around the world, are under research and improvement, this paper is an ongoing work on improvements for the multi-core support of the HybriD-GM simulator, the experiments are done with the Shor and Grover algorithms, while varying the number of cores and qubits for each, to improve the scalability the removal of critical regions by the usage of tasks and other OpenMP resources is exploited, and the study about the impact of others variables on the simulator is already planned, as well improvements for future works on the GPU, and GPU-CPU approaches and expansion to distributed computing for horizontal scalability of the system.