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

University of Illinois Press eBooks

Computational hurdles in chemistry—classical simulations, quantum simulations, and beyond

Peter Guy Wolynes

Published Jun 30, 1988• 0 citations
OpenAlex

Related papers

Problem Limitations and Cost Effectiveness Considerations in Computational Quantum Chemistry

John Stephen Binkley

Springer eBooks•Jan 1, 1984•0 citations

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

Computational Imperatives in Quantum Chemistry

BuhmSoon Park

•Jul 2, 2007•1 citation

Using Quantum Computers for Quantum Simulation

Katherine L. Brown, William J. Munro, Vivien M. Kendon

Numerical simulation of quantum systems is crucial to further our understanding of natural phenomena. Many systems of key interest and importance, in areas such as superconducting materials and quantum chemistry, are thought to be described by models which we cannot solve with sufficient accuracy, neither analytically nor numerically with classical computers. Using a quantum computer to simulate such quantum systems has been viewed as a key application of quantum computation from the very beginning of the field in the 1980s. Moreover, useful results beyond the reach of classical computation are expected to be accessible with fewer than a hundred qubits, making quantum simulation potentially one of the earliest practical applications of quantum computers. In this paper we survey the theoretical and experimental development of quantum simulation using quantum computers, from the first ideas to the intense research efforts currently underway.

arXiv:1004.5528•Entropy•Nov 15, 2010•164 citations

Computational studies of quantum chemical problems

Richard L. Lozes

•Jan 1, 1977•0 citations

Hybrid Method of Efficient Simulation of Physics Applications for a Quantum Computer

Carla Rieger, Albert T. Schmitz, Gehad Salem +5 more

Quantum chemistry and materials science are among the most promising areas for demonstrating algorithmic quantum advantage and quantum utility due to their inherent quantum mechanical nature. Still, large-scale simulations of quantum circuits are essential for determining the problem size at which quantum solutions outperform classical methods. In this work, we present a novel hybrid simulation approach, forming a hybrid of a fullstate and a Clifford simulator, specifically designed to address the computational challenges associated with the time evolution of quantum chemistry Hamiltonians. Our method focuses on the efficient emulation of multi-qubit rotations, a critical component of Trotterized Hamiltonian evolution. By optimizing the representation and execution of multi-qubit operations leveraging the Pauli frame, our approach significantly reduces the computational cost of simulating quantum circuits, enabling more efficient simulations. Beyond its impact on chemistry applications, our emulation strategy has broad implications for any computational workload that relies heavily on multi-qubit rotations. By increasing the efficiency of quantum simulations, our method facilitates more accurate and cost-effective studies of complex quantum systems. We quantify the performance improvements and computational savings for this emulation strategy, and we obtain a speedup of a factor $\approx 18$ ($\approx 22$ with MPI) for our evaluated chemistry Hamiltonians with 24 qubits. Thus, we evaluate our integration of this emulation strategy into the Intel Quantum SDK, further bridging the gap between theoretical algorithm development and practical quantum software implementations.

quant-pharXiv:2602.09020•Feb 10, 2026•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
Numerical simulation of quantum systems is crucial to further our understanding of natural phenomena. Many systems of key interest and importance, in areas such as superconducting materials and quantum chemistry, are thought to be described by models which we cannot solve with sufficient accuracy, neither analytically nor numerically with classical computers. Using a quantum computer to simulate such quantum systems has been viewed as a key application of quantum computation from the very beginning of the field in the 1980s. Moreover, useful results beyond the reach of classical computation are expected to be accessible with fewer than a hundred qubits, making quantum simulation potentially one of the earliest practical applications of quantum computers. In this paper we survey the theoretical and experimental development of quantum simulation using quantum computers, from the first ideas to the intense research efforts currently underway.
Quantum chemistry and materials science are among the most promising areas for demonstrating algorithmic quantum advantage and quantum utility due to their inherent quantum mechanical nature. Still, large-scale simulations of quantum circuits are essential for determining the problem size at which quantum solutions outperform classical methods. In this work, we present a novel hybrid simulation approach, forming a hybrid of a fullstate and a Clifford simulator, specifically designed to address the computational challenges associated with the time evolution of quantum chemistry Hamiltonians. Our method focuses on the efficient emulation of multi-qubit rotations, a critical component of Trotterized Hamiltonian evolution. By optimizing the representation and execution of multi-qubit operations leveraging the Pauli frame, our approach significantly reduces the computational cost of simulating quantum circuits, enabling more efficient simulations. Beyond its impact on chemistry applications, our emulation strategy has broad implications for any computational workload that relies heavily on multi-qubit rotations. By increasing the efficiency of quantum simulations, our method facilitates more accurate and cost-effective studies of complex quantum systems. We quantify the performance improvements and computational savings for this emulation strategy, and we obtain a speedup of a factor ≈18\approx 18≈18 (≈22\approx 22≈22 with MPI) for our evaluated chemistry Hamiltonians with 24 qubits. Thus, we evaluate our integration of this emulation strategy into the Intel Quantum SDK, further bridging the gap between theoretical algorithm development and practical quantum software implementations.