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

High-Order Splitting of Non-Unitary Operators on Quantum Computers

Peter Brearley, Philipp Pfeffer

quant-phSubmitted Nov 24, 2025• Announced Nov 26, 2025• 0 citations
v1 · Nov 24, 2025v2 · Feb 12, 2026v3 · Feb 16, 2026v4 · Aug 18, 2026
arXivHTMLPDF

Abstract

We present a high-order splitting method for simulating non-unitary dynamics by sequential real- and imaginary-time Hamiltonian evolutions. Complex-coefficient splitting methods with positive real parts are chosen for stable integration in a quantum circuit, avoiding the unstable, norm-amplifying negative steps that arise from real-coefficient splitting at high orders. The method is most beneficial for dynamics that naturally separate into unitary and dissipative components, with broad applications across science and engineering. These systems frequently admit compact spectral representations of the split operators, which we demonstrate by deriving efficient quantum circuits for simulating the damped-wave equation with up to sixth-order accuracy in time. A single sixth-order step in three dimensions on 35 trillion cells requires 1,562 CNOT gates, which can be executed within the coherence time of modern quantum processors.

Related papers

High order non-unitary split-step decomposition of unitary operators

Prosen, T, Pizorn, I

We propose a high order numerical decomposition of exponentials of hermitean operators in terms of a product of exponentials of simple terms, following an idea which has been pioneered by M. Suzuki, however implementing it for complex coefficients. We outline a convenient fourth order formula which can be written compactly for arbitrary number of noncommuting terms in the Hamiltonian and which is superiour to the optimal formula with real coefficients, both in complexity and accuracy. We show asymptotic stability of our method for sufficiently small time step and demonstrate its efficiency and accuracy in different numerical models.

•Feb 7, 2006•10 citations

High order non-unitary split-step decomposition of unitary operators

Tomaž Prosen, Iztok Pižorn

We propose a high order numerical decomposition of exponentials of Hermitian operators in terms of a product of exponentials of simple terms, following an idea which has been pioneered by M Suzuki, implementing it for complex coefficients. We outline a convenient fourth-order formula which can be written compactly for an arbitrary number of non-commuting terms in the Hamiltonian and which is superior to the optimal formula with real coefficients, both in complexity and accuracy. We show asymptotic stability of our method for a sufficiently small time step and demonstrate its efficiency and accuracy in different numerical models.

arXiv:quant-ph/0602074•Journal of Physics A Mathematical and General•May 3, 2006•12 citations

Efficient and practical Hamiltonian simulation from time-dependent product formulas

Jan Lukas Bosse, Andrew M. Childs, Charles Derby +3 more

In this work we propose an approach for implementing time-evolution of a quantum system using product formulas. The quantum algorithms we develop have provably better scaling (in terms of gate complexity and circuit depth) than a naive application of well-known Trotter formulas, for systems where the evolution is determined by a Hamiltonian with different energy scales (i.e., one part is "large" and another part is "small"). Our algorithms generate a decomposition of the evolution operator into a product of simple unitaries that are directly implementable on a quantum computer. Although the theoretical scaling is suboptimal compared with state-of-the-art algorithms (e.g., quantum signal processing), the performance of the algorithms we propose is highly competitive in practice. We illustrate this via extensive numerical simulations for several models. For instance, in the strong-field regime of the 1D transverse-field Ising model, our algorithms achieve an improvement of one order of magnitude in both the system size and evolution time that can be simulated with a fixed budget of 1000 arbitrary 2-qubit gates, compared with standard Trotter formulas.

arXiv:2403.08729•Nature Communications•Mar 26, 2025•12 citations

Efficient geometric integrators for nonadiabatic quantum dynamics in the adiabatic basis

Seonghoon Choi, Jiří J. L. Vaníček

The split-operator algorithm combined with the dynamic Fourier method is a popular approach for quantum dynamics in systems with separable kinetic and potential energies because it is explicit, easy to implement, and preserves many geometric invariants of the exact evolution. Although the standard version has only second-order accuracy, it can be recursively symmetrically composed to obtain geometric integrators of arbitrary even order of accuracy in the time step. We have implemented such integrators for nonadiabatic quantum dynamics in the diabatic basis using the triple-jump, Suzuki-fractal, and several non-recursive optimal compositions of the second-order split-operator algorithm. Because the automatically generated splitting coefficients are redundant, we reduce the computational cost by pruning these coefficients and lower memory requirements by identifying unique coefficients. The composed integrators are exactly unitary, symplectic, symmetric, time-reversible, and stable regardless of the accuracy of the solution. The order of convergence and preservation of geometric properties are justified analytically and confirmed numerically on a two-surface NaI model in the diabatic representation. Efficiency of higher-order algorithms is sometimes questioned because the number of splitting steps grows exponentially with the order. Yet, we show that, if higher accuracy is desired, higher-order integrators become the most efficient; a 600-fold speedup compared to the second-order split-operator method and a 17000-fold speedup compared to the trapezoidal rule (the Crank-Nicolson method) was observed for convergence error of 10$^{-10}$.

•Feb 14, 2019•0 citations

Simulating non-unitary dynamics using quantum signal processing with unitary block encoding

Hans Hon Sang Chan, David Muñoz Ramo, Nathan Fitzpatrick

We adapt a recent advance in resource-frugal quantum signal processing - the Quantum Eigenvalue Transform with Unitary matrices (QET-U) - to explore non-unitary imaginary time evolution on early fault-tolerant quantum computers using exactly emulated quantum circuits. We test strategies for optimising the circuit depth and the probability of successfully preparing the desired imaginary-time evolved states. For the task of ground state preparation, we confirm that the probability of successful post-selection is quadratic in the initial reference state overlap $γ$ as $O(γ^2)$. When applied instead to thermal state preparation, we show QET-U can directly estimate partition functions at exponential cost. Finally, we combine QET-U with Trotter product formula to perform non-normal Hamiltonian simulation in the propagation of Lindbladian open quantum system dynamics. We find that QET-U for non-unitary dynamics is flexible, intuitive and straightforward to use, and suggest ways for delivering quantum advantage in simulation tasks.

arXiv:2303.06161•Mar 10, 2023•3 citations

An efficient explicit implementation of a near-optimal quantum algorithm for simulating linear dissipative differential equations

I. Novikau, Ilon Joseph

We propose an efficient block-encoding technique for the implementation of the Linear Combination of Hamiltonian Simulations (LCHS) for simulating dissipative initial-value problems. This algorithm approximates a target nonunitary operator as a weighted sum of Hamiltonian evolutions, thereby emulating a dissipative problem by mixing various time scales. We introduce an efficient encoding of the LCHS into a quantum circuit based on a simple coordinate transformation that turns the dependence on the summation index into a trigonometric function. Classically, this method is equivalent to the use of a highly accurate Fejér-Clenshaw-Curtis quadrature formula. Quantumly, this significantly simplifies block-encoding of a dissipative problem and allows one to perform an exponential number of Hamiltonian simulations by a single Quantum Signal Processing (QSP) circuit. The resulting LCHS circuit has high success probability and the selector scales logarithmically with the number of terms in the LCHS sum and linearly with time. Careful analysis of error convergence proves that this method is more efficient than other LCHS circuits that have recently appeared in the literature. We verify the quantum circuit and its scaling by simulating it on a digital emulator of fault-tolerant quantum computers and, as a test problem, solve the advection-diffusion equation. The proposed algorithm can be used for modeling a wide class of nonunitary initial-value problems including the Liouville equation with added dissipation and linear embeddings of nonlinear systems, such as the Koopman-von Neumann and Carleman embeddings.

arXiv:2501.11146•Journal of Computational Physics•Jun 15, 2026•0 citations
We present a high-order splitting method for simulating non-unitary dynamics by sequential real- and imaginary-time Hamiltonian evolutions. Complex-coefficient splitting methods with positive real parts are chosen for stable integration in a quantum circuit, avoiding the unstable, norm-amplifying negative steps that arise from real-coefficient splitting at high orders. The method is most beneficial for dynamics that naturally separate into unitary and dissipative components, with broad applications across science and engineering. These systems frequently admit compact spectral representations of the split operators, which we demonstrate by deriving efficient quantum circuits for simulating the damped-wave equation with up to sixth-order accuracy in time. A single sixth-order step in three dimensions on 35 trillion cells requires 1,562 CNOT gates, which can be executed within the coherence time of modern quantum processors.
We propose a high order numerical decomposition of exponentials of hermitean operators in terms of a product of exponentials of simple terms, following an idea which has been pioneered by M. Suzuki, however implementing it for complex coefficients. We outline a convenient fourth order formula which can be written compactly for arbitrary number of noncommuting terms in the Hamiltonian and which is superiour to the optimal formula with real coefficients, both in complexity and accuracy. We show asymptotic stability of our method for sufficiently small time step and demonstrate its efficiency and accuracy in different numerical models.
We propose a high order numerical decomposition of exponentials of Hermitian operators in terms of a product of exponentials of simple terms, following an idea which has been pioneered by M Suzuki, implementing it for complex coefficients. We outline a convenient fourth-order formula which can be written compactly for an arbitrary number of non-commuting terms in the Hamiltonian and which is superior to the optimal formula with real coefficients, both in complexity and accuracy. We show asymptotic stability of our method for a sufficiently small time step and demonstrate its efficiency and accuracy in different numerical models.
In this work we propose an approach for implementing time-evolution of a quantum system using product formulas. The quantum algorithms we develop have provably better scaling (in terms of gate complexity and circuit depth) than a naive application of well-known Trotter formulas, for systems where the evolution is determined by a Hamiltonian with different energy scales (i.e., one part is "large" and another part is "small"). Our algorithms generate a decomposition of the evolution operator into a product of simple unitaries that are directly implementable on a quantum computer. Although the theoretical scaling is suboptimal compared with state-of-the-art algorithms (e.g., quantum signal processing), the performance of the algorithms we propose is highly competitive in practice. We illustrate this via extensive numerical simulations for several models. For instance, in the strong-field regime of the 1D transverse-field Ising model, our algorithms achieve an improvement of one order of magnitude in both the system size and evolution time that can be simulated with a fixed budget of 1000 arbitrary 2-qubit gates, compared with standard Trotter formulas.
The split-operator algorithm combined with the dynamic Fourier method is a popular approach for quantum dynamics in systems with separable kinetic and potential energies because it is explicit, easy to implement, and preserves many geometric invariants of the exact evolution. Although the standard version has only second-order accuracy, it can be recursively symmetrically composed to obtain geometric integrators of arbitrary even order of accuracy in the time step. We have implemented such integrators for nonadiabatic quantum dynamics in the diabatic basis using the triple-jump, Suzuki-fractal, and several non-recursive optimal compositions of the second-order split-operator algorithm. Because the automatically generated splitting coefficients are redundant, we reduce the computational cost by pruning these coefficients and lower memory requirements by identifying unique coefficients. The composed integrators are exactly unitary, symplectic, symmetric, time-reversible, and stable regardless of the accuracy of the solution. The order of convergence and preservation of geometric properties are justified analytically and confirmed numerically on a two-surface NaI model in the diabatic representation. Efficiency of higher-order algorithms is sometimes questioned because the number of splitting steps grows exponentially with the order. Yet, we show that, if higher accuracy is desired, higher-order integrators become the most efficient; a 600-fold speedup compared to the second-order split-operator method and a 17000-fold speedup compared to the trapezoidal rule (the Crank-Nicolson method) was observed for convergence error of 10−10^{-10}−10.
We adapt a recent advance in resource-frugal quantum signal processing - the Quantum Eigenvalue Transform with Unitary matrices (QET-U) - to explore non-unitary imaginary time evolution on early fault-tolerant quantum computers using exactly emulated quantum circuits. We test strategies for optimising the circuit depth and the probability of successfully preparing the desired imaginary-time evolved states. For the task of ground state preparation, we confirm that the probability of successful post-selection is quadratic in the initial reference state overlap γγγ as O(γ2)O(γ^2)O(γ2). When applied instead to thermal state preparation, we show QET-U can directly estimate partition functions at exponential cost. Finally, we combine QET-U with Trotter product formula to perform non-normal Hamiltonian simulation in the propagation of Lindbladian open quantum system dynamics. We find that QET-U for non-unitary dynamics is flexible, intuitive and straightforward to use, and suggest ways for delivering quantum advantage in simulation tasks.
We propose an efficient block-encoding technique for the implementation of the Linear Combination of Hamiltonian Simulations (LCHS) for simulating dissipative initial-value problems. This algorithm approximates a target nonunitary operator as a weighted sum of Hamiltonian evolutions, thereby emulating a dissipative problem by mixing various time scales. We introduce an efficient encoding of the LCHS into a quantum circuit based on a simple coordinate transformation that turns the dependence on the summation index into a trigonometric function. Classically, this method is equivalent to the use of a highly accurate Fejér-Clenshaw-Curtis quadrature formula. Quantumly, this significantly simplifies block-encoding of a dissipative problem and allows one to perform an exponential number of Hamiltonian simulations by a single Quantum Signal Processing (QSP) circuit. The resulting LCHS circuit has high success probability and the selector scales logarithmically with the number of terms in the LCHS sum and linearly with time. Careful analysis of error convergence proves that this method is more efficient than other LCHS circuits that have recently appeared in the literature. We verify the quantum circuit and its scaling by simulating it on a digital emulator of fault-tolerant quantum computers and, as a test problem, solve the advection-diffusion equation. The proposed algorithm can be used for modeling a wide class of nonunitary initial-value problems including the Liouville equation with added dissipation and linear embeddings of nonlinear systems, such as the Koopman-von Neumann and Carleman embeddings.