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• 2 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

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•13 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•29 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•20 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•11 citations

Selection and Improvement of Product Formulae for Best Performance of Quantum Simulation

Mauro E. S. Morales, Pedro C. S. Costa, Giacomo Pantaleoni +3 more

Abstract Quantum algorithms for simulation of Hamiltonian evolution are often based on product formulae. The fractal methods give a systematic way to find arbitrarily high-order product formulae, but result in a large number of exponentials. On the other hand, product formulae with fewer exponentials can be found by numerical solution of simultaneous non-linear equations. It is also possible to reduce the cost of long-time simulations by processing, where a kernel is repeated and a processor need only be applied at the beginning and end of the simulation. In this work, we found thousands of new product formulae, and numerically tested these formulae, together with many formulae from prior literature. We provide methods to fairly compare product formulae of different lengths and different orders. For the case of 8th order, we have found new product formulae with exceptional performance, about two orders of magnitude better accuracy than prior work, both in the processed and non-processed cases. The processed product formula provides the best performance due to being shorter than the non-processed product formula. It outperforms all other tested product formulae over a range of many orders of magnitude in system parameters T (time) and ε (allowable error). That includes reasonable combinations of parameters to be used in quantum algorithms, where the size of the simulation is large enough to be classically intractable, but not so large it takes an impractically long time on a quantum computer.

arXiv:2210.15817•Quantum Information and Computation•Jan 31, 2025•32 citations

Operator learning for efficient quantum computation

Paul Over, Sergio Bengoechea, Leonardo Borello Busilacchi +3 more

An efficient implementation of quantum algorithms is often hindered by the lack of efficient primitives for operators and state preparation. This limits both the ability of near-term quantum hardware to simulate complex problems and the potential of fault-tolerant algorithms to achieve practical quantum advantage. To address this, we propose a framework that maps discrete operators onto compact, structured quantum circuits. The resulting variational circuits can be tailored to the connectivity and long-range interaction of the target hardware. The learning process employs backpropagation together with a cost function that efficiently optimizes unitary operators and non-unitary --dense or sparse-- operators using only a single ancilla qubit for block encoding. Additionally, we introduce a regularization term that reduces the approximation error. The approach is validated for both quantum mechanical and engineering applications. In the former case, we learn propagators that arise in native quantum problems --such as quantum simulation and quantum chemistry-- and achieve improved resource scaling in comparison to standard Suzuki--Trotter expansions. In the latter case, we demonstrate the approach's ability to implement the second-order central finite difference approximation of the Laplace operator --relevant for solving partial differential equations-- while improving upon current error metrics. The final example deals with learning a dense, non-unitary operator that arises in the analysis of inviscid potential flow around an airfoil. These results motivate the extension of the framework to a broader class of operator-synthesis problems beyond the prototypical engineering and quantum applications considered here.

quant-pharXiv:2606.20184•Quantum Science and Technology•Jun 19, 2026•2 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 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.
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.
Abstract Quantum algorithms for simulation of Hamiltonian evolution are often based on product formulae. The fractal methods give a systematic way to find arbitrarily high-order product formulae, but result in a large number of exponentials. On the other hand, product formulae with fewer exponentials can be found by numerical solution of simultaneous non-linear equations. It is also possible to reduce the cost of long-time simulations by processing, where a kernel is repeated and a processor need only be applied at the beginning and end of the simulation. In this work, we found thousands of new product formulae, and numerically tested these formulae, together with many formulae from prior literature. We provide methods to fairly compare product formulae of different lengths and different orders. For the case of 8th order, we have found new product formulae with exceptional performance, about two orders of magnitude better accuracy than prior work, both in the processed and non-processed cases. The processed product formula provides the best performance due to being shorter than the non-processed product formula. It outperforms all other tested product formulae over a range of many orders of magnitude in system parameters T (time) and ε (allowable error). That includes reasonable combinations of parameters to be used in quantum algorithms, where the size of the simulation is large enough to be classically intractable, but not so large it takes an impractically long time on a quantum computer.
An efficient implementation of quantum algorithms is often hindered by the lack of efficient primitives for operators and state preparation. This limits both the ability of near-term quantum hardware to simulate complex problems and the potential of fault-tolerant algorithms to achieve practical quantum advantage. To address this, we propose a framework that maps discrete operators onto compact, structured quantum circuits. The resulting variational circuits can be tailored to the connectivity and long-range interaction of the target hardware. The learning process employs backpropagation together with a cost function that efficiently optimizes unitary operators and non-unitary --dense or sparse-- operators using only a single ancilla qubit for block encoding. Additionally, we introduce a regularization term that reduces the approximation error. The approach is validated for both quantum mechanical and engineering applications. In the former case, we learn propagators that arise in native quantum problems --such as quantum simulation and quantum chemistry-- and achieve improved resource scaling in comparison to standard Suzuki--Trotter expansions. In the latter case, we demonstrate the approach's ability to implement the second-order central finite difference approximation of the Laplace operator --relevant for solving partial differential equations-- while improving upon current error metrics. The final example deals with learning a dense, non-unitary operator that arises in the analysis of inviscid potential flow around an airfoil. These results motivate the extension of the framework to a broader class of operator-synthesis problems beyond the prototypical engineering and quantum applications considered here.