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:2611.07300

Quantum simulation of classical RCL circuits via complexification and Schrödingerization

Huner Fanchiotti A, Carlos A. García Canal, Miguel Angel Mayosky, Alejandro L. Veiga, Armando Pérez, Rafael Gómez-Lurbe, Vicente Vento

Published Nov 5, 2026• 0 citations
arXivHTMLPDF

Abstract

The decomplexification procedure establishes a mathematical equivalence between finite dimensional quantum dynamics and classical dynamics by mapping the complex quantum domain onto the real classical one. Its inverse process, complexification --- which lifts a classical dynamics to an equivalent quantum formulation --- is of great interest, particularly because it enables the quantum simulation of equations that are of classical relevance. In this way, one can prepare the solution of classical differential equations to be implemented using quantum computation tools. In the present work, we recall the decomplexification procedure and also discuss several distinct strategies for performing the complexification of classical equations, so as to obtain the corresponding quantum-equivalent dynamics.

DOI
10.48550/arxiv.2611.07300

Related papers

Quantum and classical dynamics correspondence and the brachistochrone problem

Huner Fanchiotti A, Carlos A. García Canal, Miguel Angel Mayosky +2 more

The decomplexification procedure, which allows showing mathematically the isomorphism between classical and quantum dynamics of systems with a finite number of basis states, is exploited to propose resonant electric circuits with gyrator-based couplings and to experimentally study the quantum brachistochrone problem, particularly the passage time in Hermitian and parity-time-symmetric cases.

Physical Review A•Oct 22, 2024•2 citations

Analog classical simulation of closed quantum systems

Ka-Wa Yip

We develop an analog classical simulation algorithm of noiseless quantum dynamics. By formulating the Schrödinger equation into a linear system of real-valued ordinary differential equations (ODEs), the probability amplitudes of a complex state vector can be encoded in the continuous physical variables of an analog computer. Our algorithm reveals the full dynamics of complex probability amplitudes. Such real-time simulation is impossible in quantum simulation approaches without collapsing the state vector, and it is relatively computationally expensive for digital classical computers. For a real symmetric time-independent Hamiltonian, the ODEs may be solved by a simple analog mechanical device such as a one-dimensional spring-mass system. Since the underlying dynamics of quantum computers is governed by the Schrödinger equation, our findings imply that analog computers can also perform quantum algorithms. We illustrate how to simulate the Schrödinger equation in such a paradigm, with an application to quantum approximate optimization algorithm. This may pave the way to emulate quantum algorithms with physical computing devices, including analog, continuous-time circuits.

arXiv:2502.06311•Feb 10, 2025•0 citations

Quantum Simulation of Partial Differential Equations via Schrödingerization

Shi Jin, Nana Liu, Yue Yu

We present a novel new way-called Schrödingerization-to simulate general (quantum and nonquantum) systems of linear ordinary and partial differential equations (PDEs) via quantum simulation. We introduce a new transform, referred to as the warped phase transformation, where any linear-including nonautonamous-system of ordinary or partial differential equation can be recast into a system of Schrödinger's equations, in real time, in a straightforward way. This approach is not only applicable to PDEs for classical problems but is also useful for quantum problems, including the preparation of quantum ground states and Gibbs thermal states, the simulation of quantum states in random media in the semiclassical limit, simulation of Schrödinger's equation in a bounded domain with artificial boundary conditions, and other non-Hermitian physics. This formulation is versatile enough to be applicable in a simple way to both digital quantum simulation as well as to analog quantum simulation, and using either qubits or continuous-variable quantum systems (qumodes).

arXiv:2212.13969•Physical Review Letters•Dec 4, 2024•141 citations

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

The Geometric Phase in Classical Systems and in the Equivalent Quantum Hermitian and Non-Hermitian PT-Symmetric Systems

Huner Fanchiotti A, Carlos A. García Canal, Miguel Angel Mayosky +2 more

Abstract The decomplexification procedure allows one to show mathematically (stricto sensu) the equivalence (isomorphism) between the quantum dynamics of a system with a finite number of basis states and a classical dynamics system. This unique way of connecting different dynamics was used in the past to analyze the relationship between the well-known geometric phase present in the quantum evolution discovered by Berry and its generalizations, with their analogs, the Hannay phases, in the classical domain. In here, this analysis is carried out for several quantum hermitian and non-hermitian PT-symmetric Hamiltonians and compared with the Hannay phase analysis in their classical isomorphic equivalent systems. As the equivalence ends in the classical domain with oscillator dynamics, we exploit the analogy to propose resonant electric circuits coupled with a gyrator, to reproduce the geometric phase coming from the theoretical solutions, in simulated laboratory experiments.

Brazilian Journal of Physics•Aug 30, 2023•2 citations

Quantum Circuit and Tensor Network Implementation of the 2D Acoustic Wave Equation

Tamas Nemeth, Gabor Vattay

We present a cohesive framework for simulating seismic wave propagation utilizing quantum computing paradigms and their classical tensor network equivalents. We detail a quantum circuit-based formulation for the explicit finite-difference time-domain (FDTD) solution of the two-dimensional acoustic wave equation and map this quantum architecture onto a tensor train representation, namely for Matrix Product State (MPS). The MPS solver enables deterministic simulation of large-scale wavefield dynamics on classical high-performance computing systems. We demonstrate the MPS representation by computing 2D seismic wavefields on the Marmousi model. Our results indicate that the MPS representation is a viable direction for computing and scaling wavefield propagation.

quant-pharXiv:2609.01904•Sep 3, 2026•0 citations
The decomplexification procedure establishes a mathematical equivalence between finite dimensional quantum dynamics and classical dynamics by mapping the complex quantum domain onto the real classical one. Its inverse process, complexification --- which lifts a classical dynamics to an equivalent quantum formulation --- is of great interest, particularly because it enables the quantum simulation of equations that are of classical relevance. In this way, one can prepare the solution of classical differential equations to be implemented using quantum computation tools. In the present work, we recall the decomplexification procedure and also discuss several distinct strategies for performing the complexification of classical equations, so as to obtain the corresponding quantum-equivalent dynamics.
We develop an analog classical simulation algorithm of noiseless quantum dynamics. By formulating the Schrödinger equation into a linear system of real-valued ordinary differential equations (ODEs), the probability amplitudes of a complex state vector can be encoded in the continuous physical variables of an analog computer. Our algorithm reveals the full dynamics of complex probability amplitudes. Such real-time simulation is impossible in quantum simulation approaches without collapsing the state vector, and it is relatively computationally expensive for digital classical computers. For a real symmetric time-independent Hamiltonian, the ODEs may be solved by a simple analog mechanical device such as a one-dimensional spring-mass system. Since the underlying dynamics of quantum computers is governed by the Schrödinger equation, our findings imply that analog computers can also perform quantum algorithms. We illustrate how to simulate the Schrödinger equation in such a paradigm, with an application to quantum approximate optimization algorithm. This may pave the way to emulate quantum algorithms with physical computing devices, including analog, continuous-time circuits.
We present a novel new way-called Schrödingerization-to simulate general (quantum and nonquantum) systems of linear ordinary and partial differential equations (PDEs) via quantum simulation. We introduce a new transform, referred to as the warped phase transformation, where any linear-including nonautonamous-system of ordinary or partial differential equation can be recast into a system of Schrödinger's equations, in real time, in a straightforward way. This approach is not only applicable to PDEs for classical problems but is also useful for quantum problems, including the preparation of quantum ground states and Gibbs thermal states, the simulation of quantum states in random media in the semiclassical limit, simulation of Schrödinger's equation in a bounded domain with artificial boundary conditions, and other non-Hermitian physics. This formulation is versatile enough to be applicable in a simple way to both digital quantum simulation as well as to analog quantum simulation, and using either qubits or continuous-variable quantum systems (qumodes).
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.
Abstract The decomplexification procedure allows one to show mathematically (stricto sensu) the equivalence (isomorphism) between the quantum dynamics of a system with a finite number of basis states and a classical dynamics system. This unique way of connecting different dynamics was used in the past to analyze the relationship between the well-known geometric phase present in the quantum evolution discovered by Berry and its generalizations, with their analogs, the Hannay phases, in the classical domain. In here, this analysis is carried out for several quantum hermitian and non-hermitian PT-symmetric Hamiltonians and compared with the Hannay phase analysis in their classical isomorphic equivalent systems. As the equivalence ends in the classical domain with oscillator dynamics, we exploit the analogy to propose resonant electric circuits coupled with a gyrator, to reproduce the geometric phase coming from the theoretical solutions, in simulated laboratory experiments.
We present a cohesive framework for simulating seismic wave propagation utilizing quantum computing paradigms and their classical tensor network equivalents. We detail a quantum circuit-based formulation for the explicit finite-difference time-domain (FDTD) solution of the two-dimensional acoustic wave equation and map this quantum architecture onto a tensor train representation, namely for Matrix Product State (MPS). The MPS solver enables deterministic simulation of large-scale wavefield dynamics on classical high-performance computing systems. We demonstrate the MPS representation by computing 2D seismic wavefields on the Marmousi model. Our results indicate that the MPS representation is a viable direction for computing and scaling wavefield propagation.