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

IMA Journal of Numerical Analysis

Lax dynamics for Cartan decomposition with applications to Hamiltonian simulation

Moody T. Chu

Published Apr 25, 2023• 4 citations
Publisher

Abstract

Abstract Simulating the time evolution of a Hamiltonian system on a classical computer is hard—The computational power required to even describe a quantum system scales exponentially with the number of its constituents, let alone integrate its equations of motion. Hamiltonian simulation on a quantum machine is a possible solution to this challenge—Assuming that a quantum system composing of spin-½ particles can be manipulated at will, then it is tenable to engineer the interaction between those particles according to the one that is to be simulated, and thus predict the value of physical quantities by simply performing the appropriate measurements on the system. Establishing a linkage between the unitary operators described mathematically as a logic solution and the unitary operators recognizable as quantum circuits for execution, is therefore essential for algorithm design and circuit implementation. Most current techniques are fallible because of truncation errors or the stagnation at local solutions. This work offers an innovative avenue by tackling the Cartan decomposition with the notion of Lax dynamics. Within the integration errors that is controllable, this approach gives rise to a genuine unitary synthesis that not only is numerically feasible, but also can be utilized to gauge the quality of results produced by other means, and extend the knowledge to a wide range of applications. This paper aims at establishing the theoretic and algorithmic foundations by exploiting the geometric properties of Hamiltonian subalgebras and describing a common mechanism for deriving the Lax dynamics.

DOI
10.1093/imanum/drad018

Related papers

Preparing Hamiltonians for quantum simulation: A computational framework for Cartan decomposition via Lax dynamics

Moody T. Chu

Quantum algorithms usually are described via quantum circuits representable as unitary operators. Synthesizing the unitary operators described mathematically in terms of the unitary operators recognizable as quantum circuits is essential. One such a challenge lies in the Hamiltonian simulation problem, where the matrix exponential of a large-scale skew-Hermitian matrix is to be computed. Most current techniques are prone to approximation errors, whereas the parametrization of the underlying Hamiltonian via the Cartan decomposition is more promising. To prepare for such a simulation, this work proposes to tackle the Cartan decomposition by means of the Lax dynamics. The advantages include not only that it is numerically feasible with no matrices involved, but also that this approach offers a genuine unitary synthesis within the integration errors. This work contributes to the theoretic and algorithmic foundations in three aspects: exploiting the quaternary representation of Hamiltonian subalgebras; describing a common mechanism for deriving the Lax dynamics; and providing a mathematical theory of convergence.

Mathematics of Computation•Dec 11, 2024•3 citations

RedCarD: A Quantum Assisted Algorithm for Fixed-Depth Unitary Synthesis via Cartan Decomposition

Omar Alsheikh, Efekan Kökcü, Bojko N. Bakalov +1 more

A critical step in developing circuits for quantum simulation is to synthesize a desired unitary operator using the circuit building blocks. Studying unitaries and their generators from the Lie algebraic perspective has given rise to several algorithms for synthesis based on a Cartan decomposition of the dynamical Lie algebra. For unitaries of the form $e^{-itH}$, such as time-independent Hamiltonian simulation, the resulting circuits have depth that does not depend on simulation time $t$. However, finding such circuits has a large classical overhead in the cost function evaluation and the high dimensional optimization problem. In this work, by further partitioning the dynamical Lie algebra, we break down the optimization problem into smaller independent subproblems. Moreover, the resulting algebraic structure allows us to easily shift the evaluation of the cost function to the quantum computer, further cutting the classical overhead of the algorithm. As an application of the new hybrid algorithm, we synthesize the time evolution unitary for the 4-site transverse field Ising model on several IBM devices and Quantinuum's H1-1 quantum computer.

quant-pharXiv:2512.06070•Dec 9, 2025•3 citations

Fixed Depth Hamiltonian Simulation via Cartan Decomposition

Efekan Kökcü, Thomas Steckmann, Yan Wang +3 more

Simulating quantum dynamics on classical computers is challenging for large systems due to the significant memory requirements. Simulation on quantum computers is a promising alternative, but fully optimizing quantum circuits to minimize limited quantum resources remains an open problem. We tackle this problem by presenting a constructive algorithm, based on Cartan decomposition of the Lie algebra generated by the Hamiltonian, which generates quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one-dimensional transverse field XY model, where O(n^{2})-gate circuits naturally emerge. Compared to product formulas with significantly larger gate counts, our algorithm drastically improves simulation precision. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.

arXiv:2104.00728•Physical Review Letters•Aug 9, 2022•79 citations

Efficient quantum simulation of unitary gates based on atomic ensembles

Manish Chaudhary, Tim Byrnes

We develop a technique to perform efficient unitary time evolution of a general spin Hamiltonian based on the system with identical qubits, as naturally realized by permutation symmetric atomic ensembles. We employ Cartan decomposition method to the associated Hamiltonian Lie algebra and construct the symmetry adapted generators to implement unitary operator of the ensemble Hamiltonian. This enables the compact circuit representations of the system dynamics in terms of experimentally accessible collective spin operations and exploits the Dicke basis structure of the ensembles as an effective qudit representation. We benchmark Cartan based evolution against both exact time evolution and the Suzuki Trotter product formula. Our results show that the Cartan protocol accurately reproduces the operator dynamics, spin expectation values, and fluctuation observables with zero error that are substantially smaller than those obtained through Trotterization while maintaining an optimized circuit structure. In addition, scaling analysis with the ensemble size demonstrates that the Cartan error remains independent of the atom number while the corresponding Trotter error increases with the system size, highlighting the improved efficiency of the Cartan approach for a larger system size.

quant-pharXiv:2610.22207•Oct 16, 2026•0 citations

Floquet-Universal Hamiltonian Simulation

Emilio Onorati, Harriet Apel, Michael M. Wolf +1 more

Analogue and digital Hamiltonian simulation represent two distinct approaches to making one quantum system replicate the physical properties of another, with consequences ranging from practical applications to complexity theory and quantum gravity. They are rooted in two distinct regimes of quantum dynamics: time-independent Hamiltonians for the former; fully controllable time-dependent quantum circuits in the latter. Time-periodic Hamiltonians represent an intermediate regime. In this work, we establish a theory of Floquet simulation where we use periodically driven Hamiltonians to synthesise time-independent ones. We show that a set of interactions $S$ can Floquet-simulate every Hamiltonian in the Lie algebra $\mathrm{Lie}(S)$, and consequently we give a complete and constructive characterisation of Floquet-universal Hamiltonians that are able to produce any target Hamiltonian. Notably, our construction uses only $O(1)$ local interaction strengths and ratios thereof, avoiding the impractical multi-scale local interaction strengths often required in analogue simulation via time-independent Hamiltonians. Instead, the construction requires a range of driving frequencies which scales polynomially with system size for important classes such as $k$-local lattice Hamiltonians. This has immediate complexity-theoretic implications, including numerous BQP-completeness and QMA-hardness results for natural physical properties and quantities studied in Floquet physics.

quant-pharXiv:2610.01878•Oct 2, 2026•1 citation

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
Abstract Simulating the time evolution of a Hamiltonian system on a classical computer is hard—The computational power required to even describe a quantum system scales exponentially with the number of its constituents, let alone integrate its equations of motion. Hamiltonian simulation on a quantum machine is a possible solution to this challenge—Assuming that a quantum system composing of spin-½ particles can be manipulated at will, then it is tenable to engineer the interaction between those particles according to the one that is to be simulated, and thus predict the value of physical quantities by simply performing the appropriate measurements on the system. Establishing a linkage between the unitary operators described mathematically as a logic solution and the unitary operators recognizable as quantum circuits for execution, is therefore essential for algorithm design and circuit implementation. Most current techniques are fallible because of truncation errors or the stagnation at local solutions. This work offers an innovative avenue by tackling the Cartan decomposition with the notion of Lax dynamics. Within the integration errors that is controllable, this approach gives rise to a genuine unitary synthesis that not only is numerically feasible, but also can be utilized to gauge the quality of results produced by other means, and extend the knowledge to a wide range of applications. This paper aims at establishing the theoretic and algorithmic foundations by exploiting the geometric properties of Hamiltonian subalgebras and describing a common mechanism for deriving the Lax dynamics.
Quantum algorithms usually are described via quantum circuits representable as unitary operators. Synthesizing the unitary operators described mathematically in terms of the unitary operators recognizable as quantum circuits is essential. One such a challenge lies in the Hamiltonian simulation problem, where the matrix exponential of a large-scale skew-Hermitian matrix is to be computed. Most current techniques are prone to approximation errors, whereas the parametrization of the underlying Hamiltonian via the Cartan decomposition is more promising. To prepare for such a simulation, this work proposes to tackle the Cartan decomposition by means of the Lax dynamics. The advantages include not only that it is numerically feasible with no matrices involved, but also that this approach offers a genuine unitary synthesis within the integration errors. This work contributes to the theoretic and algorithmic foundations in three aspects: exploiting the quaternary representation of Hamiltonian subalgebras; describing a common mechanism for deriving the Lax dynamics; and providing a mathematical theory of convergence.
A critical step in developing circuits for quantum simulation is to synthesize a desired unitary operator using the circuit building blocks. Studying unitaries and their generators from the Lie algebraic perspective has given rise to several algorithms for synthesis based on a Cartan decomposition of the dynamical Lie algebra. For unitaries of the form e−itHe^{-itH}e−itH, such as time-independent Hamiltonian simulation, the resulting circuits have depth that does not depend on simulation time ttt. However, finding such circuits has a large classical overhead in the cost function evaluation and the high dimensional optimization problem. In this work, by further partitioning the dynamical Lie algebra, we break down the optimization problem into smaller independent subproblems. Moreover, the resulting algebraic structure allows us to easily shift the evaluation of the cost function to the quantum computer, further cutting the classical overhead of the algorithm. As an application of the new hybrid algorithm, we synthesize the time evolution unitary for the 4-site transverse field Ising model on several IBM devices and Quantinuum's H1-1 quantum computer.
Simulating quantum dynamics on classical computers is challenging for large systems due to the significant memory requirements. Simulation on quantum computers is a promising alternative, but fully optimizing quantum circuits to minimize limited quantum resources remains an open problem. We tackle this problem by presenting a constructive algorithm, based on Cartan decomposition of the Lie algebra generated by the Hamiltonian, which generates quantum circuits with time-independent depth. We highlight our algorithm for special classes of models, including Anderson localization in one-dimensional transverse field XY model, where O(n^{2})-gate circuits naturally emerge. Compared to product formulas with significantly larger gate counts, our algorithm drastically improves simulation precision. In addition to providing exact circuits for a broad set of spin and fermionic models, our algorithm provides broad analytic and numerical insight into optimal Hamiltonian simulations.
We develop a technique to perform efficient unitary time evolution of a general spin Hamiltonian based on the system with identical qubits, as naturally realized by permutation symmetric atomic ensembles. We employ Cartan decomposition method to the associated Hamiltonian Lie algebra and construct the symmetry adapted generators to implement unitary operator of the ensemble Hamiltonian. This enables the compact circuit representations of the system dynamics in terms of experimentally accessible collective spin operations and exploits the Dicke basis structure of the ensembles as an effective qudit representation. We benchmark Cartan based evolution against both exact time evolution and the Suzuki Trotter product formula. Our results show that the Cartan protocol accurately reproduces the operator dynamics, spin expectation values, and fluctuation observables with zero error that are substantially smaller than those obtained through Trotterization while maintaining an optimized circuit structure. In addition, scaling analysis with the ensemble size demonstrates that the Cartan error remains independent of the atom number while the corresponding Trotter error increases with the system size, highlighting the improved efficiency of the Cartan approach for a larger system size.
Analogue and digital Hamiltonian simulation represent two distinct approaches to making one quantum system replicate the physical properties of another, with consequences ranging from practical applications to complexity theory and quantum gravity. They are rooted in two distinct regimes of quantum dynamics: time-independent Hamiltonians for the former; fully controllable time-dependent quantum circuits in the latter. Time-periodic Hamiltonians represent an intermediate regime. In this work, we establish a theory of Floquet simulation where we use periodically driven Hamiltonians to synthesise time-independent ones. We show that a set of interactions SSS can Floquet-simulate every Hamiltonian in the Lie algebra Lie(S)\mathrm{Lie}(S)Lie(S), and consequently we give a complete and constructive characterisation of Floquet-universal Hamiltonians that are able to produce any target Hamiltonian. Notably, our construction uses only O(1)O(1)O(1) local interaction strengths and ratios thereof, avoiding the impractical multi-scale local interaction strengths often required in analogue simulation via time-independent Hamiltonians. Instead, the construction requires a range of driving frequencies which scales polynomially with system size for important classes such as kkk-local lattice Hamiltonians. This has immediate complexity-theoretic implications, including numerous BQP-completeness and QMA-hardness results for natural physical properties and quantities studied in Floquet physics.
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.