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:1309.1746 · Physical Review A

Quantum dynamics simulation with classical oscillators

J S Briggs, Alexander Eisfeld

Published Dec 16, 2013• 33 citations
arXivHTMLPDF

Abstract

In a previous paper [J. S. Briggs and A. Eisfeld, Phys. Rev. A 85, 052111 (2012)] we showed that the time development of the complex amplitudes of $N$ coupled quantum states can be mapped by the time development of positions and velocities of $N$ coupled classical oscillators. Here we examine to what extent this mapping can be realized to simulate the ``quantum,'' properties of entanglement and qubit manipulation. By working through specific examples, e.g., of quantum gate operation, we seek to illuminate quantum and classical differences which hitherto have been treated more mathematically. In addition, we show that important quantum coupled phenomena, such as the Landau-Zener transition and the occurrence of Fano resonances can be simulated by classical oscillators.

DOI
10.1103/physreva.88.062104

Related papers

Quantum Simulations

Antti Regelin

Quantum simulation involves using a quantum system to study another quantum system. The proposal to simulate quantum physics using quantum mechanical devices, as outlined by Richard Feynman in 1982, stems from classical computers' challenges in simulating quantum systems. The pursuit of simulating complex quantum systems has led to the intersection of quantum mechanics and quantum computing. This offers new opportunities to understand and manipulate the quantum world. Central to describing quantum dynamics is the Hamiltonian operator $\hat{H}$, which governs the time evolution of physical systems and serves as the mathematical foundation for quantum simulations. This thesis explores the methodologies and advancements in simulating Hamiltonian operators on quantum computers, focusing on decomposing these operators into quantum gates and the efficiency gains over classical computational approaches. Initially, the thesis explains the fundamental theory and basics of quantum computing. Further it dives into the foundations of the Hamiltonian operator within quantum mechanics, highlighting its role in describing the dynamics of quantum systems. The complexity and high-dimensional nature of Hamiltonian matrices necessitate using quantum computers to simulate quantum phenomena accurately and efficiently. The process of simulating the Hamiltonian operator on a quantum computer involves a detailed examination of the strategies for decomposing the operator into a sequence of quantum gates. This decomposition is crucial for translating the abstract mathematical description of quantum systems into the physical operations of a quantum computer. By utilizing the principles of quantum mechanics, such as superposition and entanglement, quantum gates manipulate qubits to mimic the evolution of quantum states as the Hamiltonian operator dictates. Latter portions of the thesis are dedicated to comparing the efficiency of quantum simulations against traditional classical simulations and inspecting efficient quantum simulations. Quantum computers offer a polynomial or an exponential speedup for certain classes of problems, such as those involving highly entangled quantum states or requiring the simulation of complex quantum dynamics. This advantage is due to the quantum computer's ability to naturally represent and process quantum information - a task for which classical computers require exponential resources as the system size increases. The efficiency of simulating the Hamiltonian operator on a quantum computer is further enhanced through optimization techniques and algorithmic improvements. These include error mitigation strategies and the development of quantum algorithms tailored to specific types of Hamiltonian operators. The thesis presents a comprehensive analysis of these methods, demonstrating how they make quantum simulations more practical and accessible for scientific research and technological development. In conclusion this thesis is a literature review that examines the transformative potential of quantum simulations. By efficiently simulating the Hamiltonian operator on quantum computers researchers can explore quantum phenomena with precision, paving the way for breakthroughs in quantum physics, materials science, and beyond. The advancements in quantum computing technology and algorithmic approaches discussed here highlight the current capabilities and future explorations in the quantum realm.

•Sep 9, 2026•0 citations

Simulating quantum dynamical phenomena using classical oscillators: Landau-Zener-Stückelberg-Majorana interferometry, latching modulation, and motional averaging

O. V. Ivakhnenko, S. N. Shevchenko, Franco Nori

A quantum system can be driven by either sinusoidal, rectangular, or noisy signals. In the literature, these regimes are referred to as Landau-Zener-Stückelberg-Majorana (LZSM) interferometry, latching modulation, and motional averaging, respectively. We demonstrate that these pronounced and interesting effects are also inherent in the dynamics of classical two-state systems. We discuss how such classical systems are realized using either mechanical, electrical, or optical resonators. In addition to the fundamental interest of such dynamical phenomena linking classical and quantum physics, we believe that these are attractive for the classical analogue simulation of quantum systems.

arXiv:1801.01863•Scientific Reports•Aug 9, 2018•30 citations

Practical Quantum Circuit Implementation for Simulating Coupled Classical Oscillators

Natt Luangsirapornchai, Peeranat Sanglaor, Apimuk Sornsaeng +4 more

Simulating large-scale coupled-oscillator systems presents substantial computational challenges for classical algorithms, particularly when pursuing first-principles analyses in the thermodynamic limit. Motivated by the quantum algorithm framework proposed by Babbush et al. (2023), we present and implement a detailed quantum circuit construction for simulating one-dimensional spring–mass systems. Our approach incorporates key quantum subroutines, including block encoding, quantum singular value transformation (QSVT), and amplitude amplification, to realize the unitary time-evolution operator associated with simulating classical oscillators dynamics. In the uniform mass–spring setting, our circuit construction requires a gate complexity of$\mathcal {O}\bigl (\log _{2}^{2} N\,\log _{2}(1/\varepsilon )\bigr )$, where N is the number of oscillators and$\varepsilon $is the target accuracy of the approximation. For more general, heterogeneous mass–spring systems, the total gate complexity is$\mathcal {O}\bigl (N\log _{2} N\,\log _{2}(1/\varepsilon )\bigr )$. Both settings require$\mathcal {O}(\log _{2} N)$qubits. Numerical simulations agree with classical solvers across all tested configurations, indicating that this circuit-based Hamiltonian simulation approach can substantially reduce computational costs and potentially enable larger-scale many-body studies on future quantum hardware.

arXiv:2501.06100•IEEE Access•Jan 1, 2025•4 citations

Exponential Quantum Speedup in Simulating Coupled Classical Oscillators

Ryan Babbush, Dominic William Berry, Robin Kothari +2 more

We present a quantum algorithm for simulating the classical dynamics of 2 n coupled oscillators (e.g., 2 n masses coupled by springs).Our approach leverages a mapping between the Schrödinger equation and Newton's equation for harmonic potentials such that the amplitudes of the evolved quantum state encode the momenta and displacements of the classical oscillators.When individual masses and spring constants can be efficiently queried, and when the initial state can be efficiently prepared, the complexity of our quantum algorithm is polynomial in n, almost linear in the evolution time, and sublinear in the sparsity.As an example application, we apply our quantum algorithm to efficiently estimate the kinetic energy of an oscillator at any time.We show that any classical algorithm solving this same problem is inefficient and must make 2 ΩðnÞ queries to the oracle, and when the oracles are instantiated by efficient quantum circuits, the problem is bounded-error quantum polynomial time complete.Thus, our approach solves a potentially practical application with an exponential speedup over classical computers.Finally, we show that under similar conditions our approach can efficiently simulate more general classical harmonic systems with 2 n modes.

arXiv:2303.13012•Physical Review X•Dec 4, 2023•104 citations

Classical analogue to driven quantum bits based on macroscopic pendula

Heribert Lorenz, Sigmund Kohler, Anton V. Parafilo +2 more

Quantum mechanics increasingly penetrates modern technologies but, due to its non-deterministic nature seemingly contradicting our classical everyday world, our comprehension often stays elusive. Arguing along the correspondence principle, classical mechanics is often seen as a theory for large systems where quantum coherence is completely averaged out. Surprisingly, it is still possible to reconstruct the coherent dynamics of a quantum bit (qubit) by using a classical model system. This classical-to-quantum analogue is based on wave mechanics, which applies to both, the classical and the quantum world. In this spirit we investigate the dynamics of macroscopic physical pendula with a modulated coupling. As a proof of principle, we demonstrate full control of our one-to-one analogue to a qubit by realizing Rabi oscillations, Landau-Zener transitions and Landau-Zener-Stückelberg-Majorana interferometry. Our classical qubit demonstrator can help comprehending and developing useful quantum technologies.

arXiv:2207.09296•Scientific Reports•Oct 26, 2023•7 citations

Exponential quantum speedup in simulating coupled classical oscillators*

Ryan Babbush, Dominic William Berry, Robin Kothari +2 more

We study the problem of simulating the time evolution of a system of 2nclassical coupled oscillators (e.g., 2nballs connected by springs) on a quantum computer. We map Newton’s equation for harmonic potentials to Schrödinger’s equation, such that the amplitudes of an $\mathcal{O}(n)$-qubit quantum state encode the momenta and displacements of the 2nclassical oscillators. Given oracle access to the masses and spring constants, we describe a quantum algorithm with query and time complexity poly (n) that solves this problem when certain parameters are polynomially bounded and the initial state is easy to prepare. As an example application, we apply our quantum algorithm to efficiently estimate the normalized kinetic energy of an oscillator at any time. We then show that any classical algorithm solving the same problem must make $2^{\Omega(n)}$ queries to the oracle and we also show that when the oracles are instantiated by poly (n)-size circuits, the problem is BQP-complete. Thus, our approach solves a potentially practical application with an exponential speedup over classical computers.

Annual Symposium on Foundations of Computer Science•Nov 6, 2023•7 citations
In a previous paper [J. S. Briggs and A. Eisfeld, Phys. Rev. A 85, 052111 (2012)] we showed that the time development of the complex amplitudes of NNN coupled quantum states can be mapped by the time development of positions and velocities of NNN coupled classical oscillators. Here we examine to what extent this mapping can be realized to simulate the ``quantum,'' properties of entanglement and qubit manipulation. By working through specific examples, e.g., of quantum gate operation, we seek to illuminate quantum and classical differences which hitherto have been treated more mathematically. In addition, we show that important quantum coupled phenomena, such as the Landau-Zener transition and the occurrence of Fano resonances can be simulated by classical oscillators.
Quantum simulation involves using a quantum system to study another quantum system. The proposal to simulate quantum physics using quantum mechanical devices, as outlined by Richard Feynman in 1982, stems from classical computers' challenges in simulating quantum systems. The pursuit of simulating complex quantum systems has led to the intersection of quantum mechanics and quantum computing. This offers new opportunities to understand and manipulate the quantum world. Central to describing quantum dynamics is the Hamiltonian operator H^\hat{H}H^, which governs the time evolution of physical systems and serves as the mathematical foundation for quantum simulations. This thesis explores the methodologies and advancements in simulating Hamiltonian operators on quantum computers, focusing on decomposing these operators into quantum gates and the efficiency gains over classical computational approaches. Initially, the thesis explains the fundamental theory and basics of quantum computing. Further it dives into the foundations of the Hamiltonian operator within quantum mechanics, highlighting its role in describing the dynamics of quantum systems. The complexity and high-dimensional nature of Hamiltonian matrices necessitate using quantum computers to simulate quantum phenomena accurately and efficiently. The process of simulating the Hamiltonian operator on a quantum computer involves a detailed examination of the strategies for decomposing the operator into a sequence of quantum gates. This decomposition is crucial for translating the abstract mathematical description of quantum systems into the physical operations of a quantum computer. By utilizing the principles of quantum mechanics, such as superposition and entanglement, quantum gates manipulate qubits to mimic the evolution of quantum states as the Hamiltonian operator dictates. Latter portions of the thesis are dedicated to comparing the efficiency of quantum simulations against traditional classical simulations and inspecting efficient quantum simulations. Quantum computers offer a polynomial or an exponential speedup for certain classes of problems, such as those involving highly entangled quantum states or requiring the simulation of complex quantum dynamics. This advantage is due to the quantum computer's ability to naturally represent and process quantum information - a task for which classical computers require exponential resources as the system size increases. The efficiency of simulating the Hamiltonian operator on a quantum computer is further enhanced through optimization techniques and algorithmic improvements. These include error mitigation strategies and the development of quantum algorithms tailored to specific types of Hamiltonian operators. The thesis presents a comprehensive analysis of these methods, demonstrating how they make quantum simulations more practical and accessible for scientific research and technological development. In conclusion this thesis is a literature review that examines the transformative potential of quantum simulations. By efficiently simulating the Hamiltonian operator on quantum computers researchers can explore quantum phenomena with precision, paving the way for breakthroughs in quantum physics, materials science, and beyond. The advancements in quantum computing technology and algorithmic approaches discussed here highlight the current capabilities and future explorations in the quantum realm.
A quantum system can be driven by either sinusoidal, rectangular, or noisy signals. In the literature, these regimes are referred to as Landau-Zener-Stückelberg-Majorana (LZSM) interferometry, latching modulation, and motional averaging, respectively. We demonstrate that these pronounced and interesting effects are also inherent in the dynamics of classical two-state systems. We discuss how such classical systems are realized using either mechanical, electrical, or optical resonators. In addition to the fundamental interest of such dynamical phenomena linking classical and quantum physics, we believe that these are attractive for the classical analogue simulation of quantum systems.
Simulating large-scale coupled-oscillator systems presents substantial computational challenges for classical algorithms, particularly when pursuing first-principles analyses in the thermodynamic limit. Motivated by the quantum algorithm framework proposed by Babbush et al. (2023), we present and implement a detailed quantum circuit construction for simulating one-dimensional spring–mass systems. Our approach incorporates key quantum subroutines, including block encoding, quantum singular value transformation (QSVT), and amplitude amplification, to realize the unitary time-evolution operator associated with simulating classical oscillators dynamics. In the uniform mass–spring setting, our circuit construction requires a gate complexity ofO(log⁡22N log⁡2(1/ε))\mathcal {O}\bigl (\log _{2}^{2} N\,\log _{2}(1/\varepsilon )\bigr )O(log22​Nlog2​(1/ε)), where N is the number of oscillators and$\varepsilon isthetargetaccuracyoftheapproximation.Formoregeneral,heterogeneousmass–springsystems,thetotalgatecomplexityisis the target accuracy of the approximation. For more general, heterogeneous mass–spring systems, the total gate complexity isisthetargetaccuracyoftheapproximation.Formoregeneral,heterogeneousmass–springsystems,thetotalgatecomplexityis\mathcal {O}\bigl (N\log _{2} N\,\log _{2}(1/\varepsilon )\bigr ).Bothsettingsrequire. Both settings require.Bothsettingsrequire\mathcal {O}(\log _{2} N)$qubits. Numerical simulations agree with classical solvers across all tested configurations, indicating that this circuit-based Hamiltonian simulation approach can substantially reduce computational costs and potentially enable larger-scale many-body studies on future quantum hardware.
We present a quantum algorithm for simulating the classical dynamics of 2 n coupled oscillators (e.g., 2 n masses coupled by springs).Our approach leverages a mapping between the Schrödinger equation and Newton's equation for harmonic potentials such that the amplitudes of the evolved quantum state encode the momenta and displacements of the classical oscillators.When individual masses and spring constants can be efficiently queried, and when the initial state can be efficiently prepared, the complexity of our quantum algorithm is polynomial in n, almost linear in the evolution time, and sublinear in the sparsity.As an example application, we apply our quantum algorithm to efficiently estimate the kinetic energy of an oscillator at any time.We show that any classical algorithm solving this same problem is inefficient and must make 2 ΩðnÞ queries to the oracle, and when the oracles are instantiated by efficient quantum circuits, the problem is bounded-error quantum polynomial time complete.Thus, our approach solves a potentially practical application with an exponential speedup over classical computers.Finally, we show that under similar conditions our approach can efficiently simulate more general classical harmonic systems with 2 n modes.
Quantum mechanics increasingly penetrates modern technologies but, due to its non-deterministic nature seemingly contradicting our classical everyday world, our comprehension often stays elusive. Arguing along the correspondence principle, classical mechanics is often seen as a theory for large systems where quantum coherence is completely averaged out. Surprisingly, it is still possible to reconstruct the coherent dynamics of a quantum bit (qubit) by using a classical model system. This classical-to-quantum analogue is based on wave mechanics, which applies to both, the classical and the quantum world. In this spirit we investigate the dynamics of macroscopic physical pendula with a modulated coupling. As a proof of principle, we demonstrate full control of our one-to-one analogue to a qubit by realizing Rabi oscillations, Landau-Zener transitions and Landau-Zener-Stückelberg-Majorana interferometry. Our classical qubit demonstrator can help comprehending and developing useful quantum technologies.
We study the problem of simulating the time evolution of a system of 2nclassical coupled oscillators (e.g., 2nballs connected by springs) on a quantum computer. We map Newton’s equation for harmonic potentials to Schrödinger’s equation, such that the amplitudes of an O(n)\mathcal{O}(n)O(n)-qubit quantum state encode the momenta and displacements of the 2nclassical oscillators. Given oracle access to the masses and spring constants, we describe a quantum algorithm with query and time complexity poly (n) that solves this problem when certain parameters are polynomially bounded and the initial state is easy to prepare. As an example application, we apply our quantum algorithm to efficiently estimate the normalized kinetic energy of an oscillator at any time. We then show that any classical algorithm solving the same problem must make 2Ω(n)2^{\Omega(n)}2Ω(n) queries to the oracle and we also show that when the oracles are instantiated by poly (n)-size circuits, the problem is BQP-complete. Thus, our approach solves a potentially practical application with an exponential speedup over classical computers.