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

Quantum Complexity of Ancilla-Free Unitary Embeddings for Nonlinear Dynamics via Generalized State-Dependent Double-Bracket Flows

Yuki Ito, Hideaki Hakoshima, Keisuke Fujii

quant-phSubmitted Sep 29, 2026• Announced Sep 30, 2026• 1 citation
arXivHTMLPDF

Abstract

Simulating nonlinear dynamics with quantum computers has gained increasing attention. In general, such simulations require additional quantum resources because unitary quantum evolution is linear. A fundamental question is how nonlinear dynamics can be embedded into fully coherent, ancilla-free unitary circuits and how the complexity of the dynamics governs the required quantum resources. In this work, we generalize the ancilla-free double-bracket quantum algorithm for imaginary-time evolution by replacing its state-independent Hamiltonian with a state-dependent Hermitian operator. Our framework recursively calls an initial state preparation oracle and its inverse, and prepares the target solution to any prescribed accuracy using a fully coherent, ancilla-free unitary embedding. We relate the query cost to the complexity of the nonlinear dynamics, specifically their sensitivity to initial conditions. We obtain query upper bounds of $\exp(O(T))$, $\exp(O(T^2))$, and $\exp(\exp(O(T)))$ when the distance between solutions contracts at least exponentially (contractive), does not increase (nonexpansive), or grows at most exponentially (expansive), respectively, where $T$ is the target evolution time. For the discrete Gross--Pitaevskii equation, our ancilla-free double-bracket circuit achieves optimal worst-case query complexity $Θ(e^{gT/2})$ over a specified family of single-qubit initial states, where $g>0$ is the nonlinearity strength. These results connect the complexity of nonlinear dynamics to the query cost of coherent quantum simulation and provide a foundation for designing ancilla-free unitary embeddings with optimal query complexity.

AI Summary

The paper asks how nonlinear pure-state dynamics can be simulated by fully coherent, ancilla-free circuits, and how sensitivity to initial conditions affects state-preparation query costs. It extends double-bracket quantum imaginary-time evolution to state-dependent Hermitian generators, $\dot\rho=[[\rho,G(\rho)],\rho]$, including nonlinear Schrödinger equations. The construction recursively uses a current state-preparation circuit and its inverse to implement projector exponentials and approximate one-step propagators. Boundedness and Lipschitz assumptions yield $O(\tau^2)$ local error; a trace-norm stability bound controls error accumulation. With fixed model parameters and constant subroutine query cost per update, the initial-oracle query upper bounds are $\exp(O(T/\epsilon))$ for exponentially contractive dynamics, $\exp(O(T^2/\epsilon))$ for nonexpansive dynamics, and $\exp(O(Te^{\lambda T}/\epsilon))$ when distances grow at most as $e^{\lambda t}$. For the discrete Gross–Pitaevskii equation, a small-bias-set approximation to dephasing gives query complexity polynomial in $n=\log_2N$ at fixed time, accuracy, and bounded model parameters. For a specified single-qubit initial-state family, distinguishability amplification establishes an $\Omega(e^{gT/2})$ worst-case lower bound. Trajectory-dependent error estimates improve the recursive simulator’s upper bound to $\exp(O(T^2))$ at fixed strength and accuracy. A separate exact-solution-tailored, Grover-type reflection circuit achieves $\Theta(e^{gT/2})$ worst-case queries. The general bounds assume ancilla-free access to suitable state-dependent operator exponentials and count initial-state oracle queries rather than total gates. Optimality is restricted to the specified two-candidate family with a known family parameter; broader optimal constructions and explicitly time-dependent generators remain open.

Almost certainly largely AI-generatedAI use disclosedIncrementalStrong assumptions
They were also used extensively to draft and revise the entire manuscript, including the mathematical proofs.

Error found: The abstract omits the general framework's essential assumption that suitable state-dependent generator exponentials can be implemented coherently without ancillas using preparation-oracle access. The abstract's time-only query bounds require fixed accuracy, fixed model constants, and uniformly bounded per-update oracle usage, conditions explicitly imposed in the body but absent from the abstract. The improved imaginary-time query bound additionally assumes, without proving, that the implemented iterates remain in the subset on which contraction is established.

Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.

Comments
23 pages, 1 figure

Related papers

A quantum double-bracket algorithm for imaginary-time evolution with exponentially shorter depth

Ioannis Kolotouros, Raul Garcia-Patron

Imaginary-time evolution (ITE) is a widely used technique for preparing the ground state of a target Hamiltonian. Building on the recently proposed framework of Double-Bracket quantum ITE (DB-QITE), we introduce a probabilistic variant (PDBQITE) that achieves an exponential reduction in circuit depth. Our algorithm requires only a single ancilla qubit and a quantum circuit that consists of one controlled real-time evolution and one mid-circuit measurement per iteration. The trade-off is an exponential decay of the total success probability with the number of iterations, for which we derive an analytical lower bound that is independent of system size. Our numerical simulations show that the per-step success probability remains close to unity, making it realistic to execute many iterations, thus providing a substantial improvement over prior constructions. We show that PDBQITE outperforms the near-term probabilistic algorithm PITE for ground-state preparation of molecular Hamiltonians, and that a hybrid QAOA-PDBQITE scheme achieves higher approximation ratios than QAOA at the same circuit depth on random regular graphs for the MaxCut problem.

quant-pharXiv:2609.37095•Sep 30, 2026•1 citation

Quantum imaginary-time evolution with polynomial resources in evolution time

Lei Zhang, Jizhe Lai, Xian Wu +1 more

Abstract Imaginary-time evolution is fundamental for analyzing quantum many-body systems, with applications spanning quantum chemistry, condensed matter physics, and quantum field theory, yet classical simulation requires exponentially growing resources in both system size and evolution time. While quantum approaches reduce the system-size scaling, existing methods rely on heuristic techniques with measurement precision or success probability that deteriorates as evolution time increases. We present a quantum algorithm that prepares normalized imaginary-time evolved states using an adaptive normalization factor to maintain a stable success probability over long imaginary-time intervals. Our algorithm approximates the target state with error polynomially small in the inverse imaginary time using a polynomial number of elementary quantum gates and a single ancilla qubit, with success probability close to one. When the initial state has reasonable overlap with the ground state, this algorithm also achieves polynomial query complexity in the system size. To our knowledge, this is the first quantum algorithm for imaginary-time evolution with provably polynomial resource scaling in evolution time. Numerical experiments validate our theoretical analysis for evolution time up to 50, demonstrating the algorithm’s effectiveness for long-time evolution. Building on this technique, we further develop imaginary-time-evolution-based algorithms for ground-state-related problems and for simulating open quantum systems. These algorithms can reduce circuit depth in certain regimes compared with existing methods, at the expense of higher total query complexity, advancing the practical feasibility of quantum simulation on early fault-tolerant devices.

arXiv:2507.00908•Quantum Science and Technology•Jun 10, 2026•6 citations

Efficient quantum algorithm for linear matrix differential equations and applications to open quantum systems

Sophia Simon, Dominic W. Berry, Rolando D. Somma

We present an efficient, nearly optimal quantum algorithm for solving linear matrix differential equations, with applications to the simulation of open quantum systems and beyond. For unitary or dissipative dynamics, the algorithm computes an entry of the solution matrix with query complexity $\widetilde{\mathcal{O}}(ν\mathcal{L} t/ε)$, where the constant $ν$ depends on the problem parameters, $\mathcal{L}$ involves a time integral of upper bounds on the norms of evolution operators, and $ε$ is the error. In particular, $ν\mathcal{L}$ is linear in $t$ for unitary dynamics and can be a constant for dissipative dynamics. Our result contrasts prior quantum approaches for differential equations that typically require exponential time for this problem due to the encoding in a quantum state, which can lead to exponentially small amplitudes. We demonstrate the utility of the algorithm through an end-to-end application, namely the simulation of dissipative dynamics for non-interacting fermions, which can be extended to other quantum and classical systems. We compare with classical algorithms and give evidence of polynomial quantum speedups for systems in a lattice, which become more pronounced for systems with long-range interactions and can be shown to be exponential in general. We also provide a lower bound of $Ω(ν\mathcal{L} t/ε)$ for unitary or dissipative dynamics that proves our algorithm is optimal up to logarithmic factors.

quant-pharXiv:2605.16195•May 18, 2026•2 citations

Double-Bracket Quantum Algorithms for Quantum Imaginary-Time Evolution

Marek Gluza, Jeongrak Son, Bi Hong Tiang +5 more

Efficiently preparing approximate ground states of large, strongly correlated systems on quantum hardware is challenging, and yet, nature is innately adept at this. This has motivated the study of thermodynamically inspired approaches to ground-state preparation that aim to replicate cooling processes via imaginary-time evolution. However, synthesizing quantum circuits that efficiently implement imaginary-time evolution is itself difficult, with prior proposals generally adopting heuristic variational approaches or using deep block encodings. Here, we use the insight that quantum imaginary-time evolution is a solution of Brockett's double-bracket flow and synthesize circuits that implement double-bracket flows coherently on the quantum computer. We prove that our double-bracket quantum imaginary-time evolution (DB-QITE) algorithm inherits the cooling guarantees of imaginary-time evolution. Concretely, each step is guaranteed to (i) decrease the energy of an initial approximate ground state by an amount proportional to the energy fluctuations of the initial state and (ii) increase the fidelity with the ground state. We provide gate counts for DB-QITE through numerical simulations in qrisp that demonstrate scenarios where DB-QITE outperforms quantum phase estimation. Thus, DB-QITE provides a means to systematically improve the approximation of a ground state using shallow circuits.

arXiv:2412.04554•Physical Review Letters•Nov 19, 2025•39 citations

Quantum Homotopy Algorithm for Solving Nonlinear PDEs and Flow Problems

Sachin S. Bharadwaj, Balasubramanya Nadiga, Stephan Eidenbenz +1 more

Quantum algorithms to integrate nonlinear PDEs governing flow problems are challenging to discover but critical to enhancing the practical usefulness of quantum computing. We present a near-optimal, robust, and end-to-end quantum algorithm to solve time-dependent, dissipative, nonlinear PDEs. We embed the PDEs in a truncated, high-dimensional linear space on the basis of quantum homotopy analysis. The linearized system is discretized and integrated using finite-difference methods with a compact quantum algorithm. The present approach can adapt its input to the nature of nonlinearity and underlying physics. The complexity estimates improve existing approaches in terms of the time-marching system size, simulation time, accuracy parameters, and post-selection parameters. We provide a general embedding strategy, bounds on stability criteria, accuracy, gate counts, and query complexity. A physically motivated measure of nonlinearity is connected to a parameter similar to the flow Reynolds number $Re_{\textrm{H}}$, whose inverse marks the allowed integration window, for given accuracy and complexity. We illustrate the embedding scheme with numerical simulations of Burgers, Fisher--KPP, damped Kuramoto--Sivashinsky, and real Ginzburg--Landau/Allen--Cahn equations. Together, these examples encompass cubic nonlinearity and saturation, quadratic transport, and fourth-order dissipative stiffness. This work shows the potential of hybrid quantum algorithms for simulating nonlinear problems on near-term and fault-tolerant devices.

quant-pharXiv:2512.21033•Dec 25, 2025•4 citations

Quantum Algorithm for Linear Non-unitary Dynamics with Near-Optimal Dependence on All Parameters

Dong An, Andrew M. Childs, Lin Lin

Abstract We introduce a family of identities that express general linear non-unitary evolution operators as a linear combination of unitary evolution operators, each solving a Hamiltonian simulation problem. This formulation can exponentially enhance the accuracy of the recently introduced linear combination of Hamiltonian simulation (LCHS) method [An, Liu, and Lin, Physical Review Letters, 2023]. For the first time, this approach enables quantum algorithms to solve linear differential equations with both optimal state preparation cost and near-optimal scaling in matrix queries on all parameters.

arXiv:2312.03916•Communications in Mathematical Physics•Dec 8, 2025•117 citations
Simulating nonlinear dynamics with quantum computers has gained increasing attention. In general, such simulations require additional quantum resources because unitary quantum evolution is linear. A fundamental question is how nonlinear dynamics can be embedded into fully coherent, ancilla-free unitary circuits and how the complexity of the dynamics governs the required quantum resources. In this work, we generalize the ancilla-free double-bracket quantum algorithm for imaginary-time evolution by replacing its state-independent Hamiltonian with a state-dependent Hermitian operator. Our framework recursively calls an initial state preparation oracle and its inverse, and prepares the target solution to any prescribed accuracy using a fully coherent, ancilla-free unitary embedding. We relate the query cost to the complexity of the nonlinear dynamics, specifically their sensitivity to initial conditions. We obtain query upper bounds of exp⁡(O(T))\exp(O(T))exp(O(T)), exp⁡(O(T2))\exp(O(T^2))exp(O(T2)), and exp⁡(exp⁡(O(T)))\exp(\exp(O(T)))exp(exp(O(T))) when the distance between solutions contracts at least exponentially (contractive), does not increase (nonexpansive), or grows at most exponentially (expansive), respectively, where TTT is the target evolution time. For the discrete Gross--Pitaevskii equation, our ancilla-free double-bracket circuit achieves optimal worst-case query complexity Θ(egT/2)Θ(e^{gT/2})Θ(egT/2) over a specified family of single-qubit initial states, where g>0g>0g>0 is the nonlinearity strength. These results connect the complexity of nonlinear dynamics to the query cost of coherent quantum simulation and provide a foundation for designing ancilla-free unitary embeddings with optimal query complexity.
The paper asks how nonlinear pure-state dynamics can be simulated by fully coherent, ancilla-free circuits, and how sensitivity to initial conditions affects state-preparation query costs. It extends double-bracket quantum imaginary-time evolution to state-dependent Hermitian generators, ρ˙=[[ρ,G(ρ)],ρ]\dot\rho=[[\rho,G(\rho)],\rho]ρ˙​=[[ρ,G(ρ)],ρ], including nonlinear Schrödinger equations.
The construction recursively uses a current state-preparation circuit and its inverse to implement projector exponentials and approximate one-step propagators. Boundedness and Lipschitz assumptions yield O(τ2)O(\tau^2)O(τ2) local error; a trace-norm stability bound controls error accumulation. With fixed model parameters and constant subroutine query cost per update, the initial-oracle query upper bounds are exp⁡(O(T/ϵ))\exp(O(T/\epsilon))exp(O(T/ϵ)) for exponentially contractive dynamics, exp⁡(O(T2/ϵ))\exp(O(T^2/\epsilon))exp(O(T2/ϵ)) for nonexpansive dynamics, and exp⁡(O(TeλT/ϵ))\exp(O(Te^{\lambda T}/\epsilon))exp(O(TeλT/ϵ)) when distances grow at most as eλte^{\lambda t}eλt.
For the discrete Gross–Pitaevskii equation, a small-bias-set approximation to dephasing gives query complexity polynomial in n=log⁡2Nn=\log_2Nn=log2​N at fixed time, accuracy, and bounded model parameters. For a specified single-qubit initial-state family, distinguishability amplification establishes an Ω(egT/2)\Omega(e^{gT/2})Ω(egT/2) worst-case lower bound. Trajectory-dependent error estimates improve the recursive simulator’s upper bound to exp⁡(O(T2))\exp(O(T^2))exp(O(T2)) at fixed strength and accuracy. A separate exact-solution-tailored, Grover-type reflection circuit achieves Θ(egT/2)\Theta(e^{gT/2})Θ(egT/2) worst-case queries.
The general bounds assume ancilla-free access to suitable state-dependent operator exponentials and count initial-state oracle queries rather than total gates. Optimality is restricted to the specified two-candidate family with a known family parameter; broader optimal constructions and explicitly time-dependent generators remain open.
Imaginary-time evolution (ITE) is a widely used technique for preparing the ground state of a target Hamiltonian. Building on the recently proposed framework of Double-Bracket quantum ITE (DB-QITE), we introduce a probabilistic variant (PDBQITE) that achieves an exponential reduction in circuit depth. Our algorithm requires only a single ancilla qubit and a quantum circuit that consists of one controlled real-time evolution and one mid-circuit measurement per iteration. The trade-off is an exponential decay of the total success probability with the number of iterations, for which we derive an analytical lower bound that is independent of system size. Our numerical simulations show that the per-step success probability remains close to unity, making it realistic to execute many iterations, thus providing a substantial improvement over prior constructions. We show that PDBQITE outperforms the near-term probabilistic algorithm PITE for ground-state preparation of molecular Hamiltonians, and that a hybrid QAOA-PDBQITE scheme achieves higher approximation ratios than QAOA at the same circuit depth on random regular graphs for the MaxCut problem.
Abstract Imaginary-time evolution is fundamental for analyzing quantum many-body systems, with applications spanning quantum chemistry, condensed matter physics, and quantum field theory, yet classical simulation requires exponentially growing resources in both system size and evolution time. While quantum approaches reduce the system-size scaling, existing methods rely on heuristic techniques with measurement precision or success probability that deteriorates as evolution time increases. We present a quantum algorithm that prepares normalized imaginary-time evolved states using an adaptive normalization factor to maintain a stable success probability over long imaginary-time intervals. Our algorithm approximates the target state with error polynomially small in the inverse imaginary time using a polynomial number of elementary quantum gates and a single ancilla qubit, with success probability close to one. When the initial state has reasonable overlap with the ground state, this algorithm also achieves polynomial query complexity in the system size. To our knowledge, this is the first quantum algorithm for imaginary-time evolution with provably polynomial resource scaling in evolution time. Numerical experiments validate our theoretical analysis for evolution time up to 50, demonstrating the algorithm’s effectiveness for long-time evolution. Building on this technique, we further develop imaginary-time-evolution-based algorithms for ground-state-related problems and for simulating open quantum systems. These algorithms can reduce circuit depth in certain regimes compared with existing methods, at the expense of higher total query complexity, advancing the practical feasibility of quantum simulation on early fault-tolerant devices.
We present an efficient, nearly optimal quantum algorithm for solving linear matrix differential equations, with applications to the simulation of open quantum systems and beyond. For unitary or dissipative dynamics, the algorithm computes an entry of the solution matrix with query complexity O~(νLt/ε)\widetilde{\mathcal{O}}(ν\mathcal{L} t/ε)O(νLt/ε), where the constant ννν depends on the problem parameters, L\mathcal{L}L involves a time integral of upper bounds on the norms of evolution operators, and εεε is the error. In particular, νLν\mathcal{L}νL is linear in ttt for unitary dynamics and can be a constant for dissipative dynamics. Our result contrasts prior quantum approaches for differential equations that typically require exponential time for this problem due to the encoding in a quantum state, which can lead to exponentially small amplitudes. We demonstrate the utility of the algorithm through an end-to-end application, namely the simulation of dissipative dynamics for non-interacting fermions, which can be extended to other quantum and classical systems. We compare with classical algorithms and give evidence of polynomial quantum speedups for systems in a lattice, which become more pronounced for systems with long-range interactions and can be shown to be exponential in general. We also provide a lower bound of Ω(νLt/ε)Ω(ν\mathcal{L} t/ε)Ω(νLt/ε) for unitary or dissipative dynamics that proves our algorithm is optimal up to logarithmic factors.
Efficiently preparing approximate ground states of large, strongly correlated systems on quantum hardware is challenging, and yet, nature is innately adept at this. This has motivated the study of thermodynamically inspired approaches to ground-state preparation that aim to replicate cooling processes via imaginary-time evolution. However, synthesizing quantum circuits that efficiently implement imaginary-time evolution is itself difficult, with prior proposals generally adopting heuristic variational approaches or using deep block encodings. Here, we use the insight that quantum imaginary-time evolution is a solution of Brockett's double-bracket flow and synthesize circuits that implement double-bracket flows coherently on the quantum computer. We prove that our double-bracket quantum imaginary-time evolution (DB-QITE) algorithm inherits the cooling guarantees of imaginary-time evolution. Concretely, each step is guaranteed to (i) decrease the energy of an initial approximate ground state by an amount proportional to the energy fluctuations of the initial state and (ii) increase the fidelity with the ground state. We provide gate counts for DB-QITE through numerical simulations in qrisp that demonstrate scenarios where DB-QITE outperforms quantum phase estimation. Thus, DB-QITE provides a means to systematically improve the approximation of a ground state using shallow circuits.
Quantum algorithms to integrate nonlinear PDEs governing flow problems are challenging to discover but critical to enhancing the practical usefulness of quantum computing. We present a near-optimal, robust, and end-to-end quantum algorithm to solve time-dependent, dissipative, nonlinear PDEs. We embed the PDEs in a truncated, high-dimensional linear space on the basis of quantum homotopy analysis. The linearized system is discretized and integrated using finite-difference methods with a compact quantum algorithm. The present approach can adapt its input to the nature of nonlinearity and underlying physics. The complexity estimates improve existing approaches in terms of the time-marching system size, simulation time, accuracy parameters, and post-selection parameters. We provide a general embedding strategy, bounds on stability criteria, accuracy, gate counts, and query complexity. A physically motivated measure of nonlinearity is connected to a parameter similar to the flow Reynolds number ReHRe_{\textrm{H}}ReH​, whose inverse marks the allowed integration window, for given accuracy and complexity. We illustrate the embedding scheme with numerical simulations of Burgers, Fisher--KPP, damped Kuramoto--Sivashinsky, and real Ginzburg--Landau/Allen--Cahn equations. Together, these examples encompass cubic nonlinearity and saturation, quadratic transport, and fourth-order dissipative stiffness. This work shows the potential of hybrid quantum algorithms for simulating nonlinear problems on near-term and fault-tolerant devices.
Abstract We introduce a family of identities that express general linear non-unitary evolution operators as a linear combination of unitary evolution operators, each solving a Hamiltonian simulation problem. This formulation can exponentially enhance the accuracy of the recently introduced linear combination of Hamiltonian simulation (LCHS) method [An, Liu, and Lin, Physical Review Letters, 2023]. For the first time, this approach enables quantum algorithms to solve linear differential equations with both optimal state preparation cost and near-optimal scaling in matrix queries on all parameters.