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

Products of unitaries as continuous evolutions at finite precision

Michael Jarret

quant-phmath-phSubmitted Oct 5, 2026• Announced Oct 6, 2026• 0 citations
arXivHTMLPDF

Abstract

I present a short approach to discretizing continuous unitary evolution. It gives a correspondence in both directions between continuous unitary evolutions and products of unitaries in finite dimensions, and I use it to reduce discrete adiabatic theorems to continuous ones. At fine steps, holding truncated samples of a regulated Hamiltonian on a suitable finite partition gives an approximating product. Conversely, rounding the clock identifies a product of $T$ unit-step samples with a continuous evolution, up to two half-step phases. I bound its operator-norm distance from the original evolution by $O(1/T)$ through cancellation within each time step. This assumes bounded first and second derivatives, bounded spectral width, and eigenvalue differences bounded away from nonzero multiples of $2π$, uniformly in $T$. For a unitary walk with these derivative bounds, a fixed common free spectral arc supplies a Hermitian logarithm path satisfying the comparison hypotheses. Continuous simulation guarantees then transfer to the phase-corrected product, and continuous adiabatic bounds to the product itself, with an explicit additive $O(1/T)$ error and each adiabatic theorem's hypotheses retained. For positive definite quantum linear systems of condition number $κ$, this comparison and continuous adiabatic theory give a rescaled qubitized walk with $O(κ/δ)$ steps for leakage $δ$, matching the scaling previously obtained through a discrete adiabatic theorem. These products need no discrete adiabatic theorem.

AI Summary

The paper asks when sampled products of unitaries can be compared with continuous evolution closely enough to transfer continuous adiabatic bounds. It treats both fine-step discretization and products whose factors represent unit-time steps. For a regulated, $k$-sparse Hamiltonian on $[0,T]$, piecewise-constant entrywise $b$-bit truncation gives operator-norm evolution error at most $\sqrt{2}k2^{-b}T$. Holding truncated midpoint samples between equal-variation checkpoints instead gives error $\varepsilon$ using $O(TV/\varepsilon)$ factors, where $V$ is operator-norm total variation. These estimates use Duhamel’s formula; Davis–Kahan bounds account for replacing endpoint spectral projectors by truncated ones. The main converse result compares $W_T=e^{-iH((T-1)/T)}\cdots e^{-iH(0)}$ with evolution $U(T)$ generated by $H(t/T)$. After endpoint half-step phases, their distance is $O((L+L^2+M)/T)$, with constants depending on spectral width and separation from nonzero $2\pi$ resonances; $L$ and $M$ bound first and second derivatives. A cellwise correction cancels linear drift and nearly cancels between neighboring cells. Continuous adiabatic leakage bounds therefore transfer with additive $O(1/T)$ error. A common spectral-free arc supplies a logarithm path for unitary walks. Applications recover $O(\kappa/\delta)$ steps or controlled block-encoding queries for positive-definite quantum linear systems, matching previously obtained scaling. The comparison requires uniform regularity and nonresonance conditions. It does not preserve faster-than-$1/T$ continuous leakage decay. Checkpoint computation, factor implementation, and endpoint state preparation or testing entail costs outside the comparison bounds.

No sign of AI-generated textStrong assumptions

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

Comments
26 pages, 0 figures

Related papers

Sigma-Time Quantum Dynamics I: Unitary BV-Clock Evolutions with Gates and Pulses

Ben F.T. Tibola

Quantum dynamics is usually written relative to a smooth external time parameter, while actual control schedules often contain waits, pulses, gates, resets, and event-like interventions. This paper develops the first unitary part of a sigma-time quantum dynamics framework. We define a bounded-Hamiltonian quantum evolution over a finite-horizon bounded-variation sigma clock with a continuous clock component, flat clock intervals, and a locally finite set of atom times carrying unitary gates. Under these hypotheses the sigma-chronological product exists, is unitary, composes as an evolution family, conserves wave-function norm, is strongly continuous away from atom times, and obeys a sharp atom/gate insertion law. We also prove a fixed-clock perturbation estimate and a bounded isolated-pulse corridor in which shrinking finite-width pulses converge in operator norm to declared atomic gates. The result is deliberately scoped: it does not claim an unbounded Schroedinger-operator theorem, a measurement theorem, an open-system theorem, or a Zeno limit theorem. A finite qubit benchmark with two bounded waits and one atomic gate is included as a reproducibility appendix and verifies unitary defect, trace preservation, Choi positivity, and output-state validity to machine precision

•May 28, 2026•0 citations

Optimal Scaling Quantum Linear-Systems Solver via Discrete Adiabatic Theorem

Pedro C. S. Costa, Dong An, Yuval R. Sanders +3 more

Recently, several approaches to solving linear systems on a quantum computer have been formulated in terms of the quantum adiabatic theorem for a continuously varying Hamiltonian.Such approaches have enabled near-linear scaling in the condition number κ of the linear system, without requiring a complicated variable-time amplitude amplification procedure.However, the most efficient of those procedures is still asymptotically suboptimal by a factor of log(κ).Here, we prove a rigorous form of the adiabatic theorem that bounds the error in terms of the spectral gap for intrinsically discrete-time evolutions.In combination with the qubitized quantum walk, our discrete adiabatic theorem gives a speed-up for all adiabatic algorithms.Here, we use this combination to develop a quantum algorithm for solving linear systems that is asymptotically optimal, in the sense that the complexity is strictly linear in κ, matching a known lower bound on the complexity.Our O[κ log(1/ )] complexity is also optimal in terms of the combined scaling in κ and the precision .Compared to existing suboptimal methods, our algorithm is simpler and easier to implement.Moreover, we determine the constant factors in the algorithm, which would be suitable for determining the complexity in terms of gate counts for specific applications.

arXiv:2111.08152•PRX Quantum•Oct 7, 2022•196 citations

Quantum Adiabatic Theorem under Wiener Noise: Maximal Mean-Square Estimates

A. M. H. H. Caldera, R. P. K. DeSilva, K. K. W. A. S. Kumara +1 more

We derive maximal mean-square adiabatic estimates for finite-dimensional stochastic Schrödinger equations with Hamiltonian-proportional Wiener noise. For deterministic $C^2$ Hamiltonians whose eigenvalues have constant multiplicities and do not cross on $[0,1]$, we construct a unitary stochastic adiabatic intertwiner driven by the same Wiener process as the exact propagator. A commutator argument, Itô calculus, and Doob's maximal inequality yield an explicit bound for the expected supremum of their squared operator-norm difference on a selected initial eigenspace. Under uniform coefficient bounds, the physical noise scaling $α=σT^{-γ}$, where $T$ is the total evolution time and $σ\geq0$ and $γ\geq0$ are fixed, gives maximal mean-square error $O(T^{-2}+σ^4T^{-4γ}+σ^2T^{-(2γ+1)})$. Consequently, adiabatic convergence holds for every $γ>0$ as $T\to\infty$, while $γ\geq1/2$ recovers the deterministic $O(T^{-1})$ bound for the root-mean-square maximal error. For fixed nonzero physical noise amplitude, the estimate leaves convergence unresolved.

arXiv:2611.06029•Nov 4, 2026•0 citations

Large time-step discretization of adiabatic quantum dynamics

Dong Un An, Pedro C. S. Costa, Dominic William Berry

Adiabatic quantum computing is a general framework for preparing eigenstates of Hamiltonians on quantum devices. However, its digital implementation requires an efficient Hamiltonian simulation subroutine, which may introduce extra computational overhead or complicated quantum control logic. In this work, we show that the time-step sizes in time discretization can be much larger than expected, and the overall complexity is greatly reduced. Remarkably, regardless of the general convergence order of the numerical method, we can choose a uniform time-step size independent of tolerated error and evolution time for sufficiently accurate simulation. Furthermore, with the boundary cancellation condition where the continuous diabatic errors are exponentially suppressed, we provide strong evidence for a superpolynomial convergence of first-order Trotter with uniform time-step size. We apply our analysis to the example of adiabatic unstructured search and show several preferable features of the Trotterized adiabatic approach: It can match the Grover lower bound, it does not require knowledge of the number of marked states, and its performance can be asymptotically comparable with that of the quantum approximate optimization algorithm.

arXiv:2509.00171•Physical Review Research•Oct 2, 2026•11 citations

Adiabatic Quantum Computation

Friederike Anna Dziemba

The quantum adiabatic theorem ensures that a slowly changing system, initially prepared in its ground state, will evolve to its final ground state with arbitrary precision. As a first result this thesis extends the original theorem to projection operators keeping the statement valid for Hamiltonians with degenerate ground spaces. Yet the main focus of this work lies in studying the efficiency of quantum circuit simulations by adabatic quantum computation. The standard Hamiltonian construction by Kitaev is based on a path graph reflecting the $L$ computation steps and influencing the scaling of the necessary evolution time by its spectral gap of $\mathcal{O}\left(\frac{1}{L^2}\right)$. Aspiring to an improved running time we generalize Kitaev's Hamiltonian to so-called standard graph Hamiltonians based on graph families with a different spectral gap. In this generalized construction the first two time derivatives of the Hamiltonian and the fraction of initial vertices appear as additional parameters of running time. In a first step the time derivatives can be proven to be constant. Expansion results from spectral graph theory however impose a trade-off between the spectral gap and the fraction of initial vertices as well as the fraction of final vertices which corresponds to the probability for obtaining the correct computational output. Graphs with spectral gap $\mathcal{O}\left(\frac{1}{L^k}\right)$, $k<2$, turn out to contradict very likely, graphs with $k<1$ even for sure at least one of the efficiency criterias for running time, output probability or Hamiltonian implementation. The above results may also be obstacles for a possible quantum PCP-theorem in complexity theory claiming the local Hamiltonian problem with constant gap to be QMA-complete since the very same Kitaev Hamiltonian is constructed in the QMA-hardness proof for the Local Hamiltonian problem.

arXiv:1610.04708•Oct 15, 2016•2 citations

On the Persistence of Product States in Bipartite Quantum Dynamics: An Analytic-Geometric and Diophantine Framework

El Bouazzaoui TAYB

We present a rigorous mathematical analysis of the recurrence of factorized (product) pure states under unitary evolution in a finite-dimensional bipartite quantum system. The central result is an analytic dichotomy: for any initial product state, the set of times at which the state is again factorized is either all of ℝ or a discrete subset. This reduces the problem to the classification of Hamiltonians possessing an eternally factorized product state. We formulate the obstruction through an infinite hierarchy of polynomial jet conditions whose defining ideal stabilises after finitely many steps; thus the exceptional Hamiltonians form a proper lower-dimensional semialgebraic set. The paper does not provide a complete classification of this exceptional set; rather, it proves that it is a finite-level semialgebraic set and develops the algebraic-geometric machinery needed for its future description. Consequently, the set of Hamiltonians with exclusively discrete recurrences is dense and of full Lebesgue measure. Independently, we analyse the gradient flow of the von Neumann entanglement entropy on projective space equipped with the Fubini–Study metric. Using the Kurdyka–Łojasiewicz inequality we prove that every maximal trajectory (defined as a continuous, piecewise-analytic curve satisfying the gradient equation on the analytic stratum) converges to a unique critical point of the entropy; under a natural normal-hyperbolicity assumption (whose verification is left as an open problem) almost every trajectory converges to a point on the Segre variety Σ of product states. We also obtain explicit polynomial bounds on the convergence rate, with exponents determined by the local Łojasiewicz geometry. The logarithmic singularity of the entropy near Σ is shown to preclude exponential convergence entirely. To obtain quantitative recurrence estimates in the unitary setting, we assume the Hamiltonian has a pure point spectrum and reduce the orbit to a linear flow on a torus whose dimension is the rational rank of the energy gaps. Using Dirichlet simultaneous approximation we prove an upper bound on the time to achieve an ϵ-approximate return to the initial ray, with polynomial scaling in 1/ϵ. The bound is universal but not claimed to be optimal. The two-qubit case is treated in full detail: the Segre variety reduces to a quadric hypersurface, the first-order tangency condition becomes a linear equation in the Pauli coefficients, and the moduli space of local unitary equivalence (the Weyl chamber) together with Makhlin invariants drastically simplifies the classification. We provide explicit formulas and a computational roadmap using cylindrical algebraic decomposition. A catalogue of rigorous examples and a systematic classification programme conclude the paper.

•Jun 24, 2026•0 citations
I present a short approach to discretizing continuous unitary evolution. It gives a correspondence in both directions between continuous unitary evolutions and products of unitaries in finite dimensions, and I use it to reduce discrete adiabatic theorems to continuous ones. At fine steps, holding truncated samples of a regulated Hamiltonian on a suitable finite partition gives an approximating product. Conversely, rounding the clock identifies a product of TTT unit-step samples with a continuous evolution, up to two half-step phases. I bound its operator-norm distance from the original evolution by O(1/T)O(1/T)O(1/T) through cancellation within each time step. This assumes bounded first and second derivatives, bounded spectral width, and eigenvalue differences bounded away from nonzero multiples of 2π2π2π, uniformly in TTT. For a unitary walk with these derivative bounds, a fixed common free spectral arc supplies a Hermitian logarithm path satisfying the comparison hypotheses. Continuous simulation guarantees then transfer to the phase-corrected product, and continuous adiabatic bounds to the product itself, with an explicit additive O(1/T)O(1/T)O(1/T) error and each adiabatic theorem's hypotheses retained. For positive definite quantum linear systems of condition number κκκ, this comparison and continuous adiabatic theory give a rescaled qubitized walk with O(κ/δ)O(κ/δ)O(κ/δ) steps for leakage δδδ, matching the scaling previously obtained through a discrete adiabatic theorem. These products need no discrete adiabatic theorem.
The paper asks when sampled products of unitaries can be compared with continuous evolution closely enough to transfer continuous adiabatic bounds. It treats both fine-step discretization and products whose factors represent unit-time steps.
For a regulated, kkk-sparse Hamiltonian on [0,T][0,T][0,T], piecewise-constant entrywise bbb-bit truncation gives operator-norm evolution error at most 2k2−bT\sqrt{2}k2^{-b}T2​k2−bT. Holding truncated midpoint samples between equal-variation checkpoints instead gives error ε\varepsilonε using O(TV/ε)O(TV/\varepsilon)O(TV/ε) factors, where VVV is operator-norm total variation. These estimates use Duhamel’s formula; Davis–Kahan bounds account for replacing endpoint spectral projectors by truncated ones.
The main converse result compares WT=e−iH((T−1)/T)⋯e−iH(0)W_T=e^{-iH((T-1)/T)}\cdots e^{-iH(0)}WT​=e−iH((T−1)/T)⋯e−iH(0) with evolution U(T)U(T)U(T) generated by H(t/T)H(t/T)H(t/T). After endpoint half-step phases, their distance is O((L+L2+M)/T)O((L+L^2+M)/T)O((L+L2+M)/T), with constants depending on spectral width and separation from nonzero 2π2\pi2π resonances; LLL and MMM bound first and second derivatives. A cellwise correction cancels linear drift and nearly cancels between neighboring cells. Continuous adiabatic leakage bounds therefore transfer with additive O(1/T)O(1/T)O(1/T) error. A common spectral-free arc supplies a logarithm path for unitary walks. Applications recover O(κ/δ)O(\kappa/\delta)O(κ/δ) steps or controlled block-encoding queries for positive-definite quantum linear systems, matching previously obtained scaling.
The comparison requires uniform regularity and nonresonance conditions. It does not preserve faster-than-1/T1/T1/T continuous leakage decay. Checkpoint computation, factor implementation, and endpoint state preparation or testing entail costs outside the comparison bounds.
Quantum dynamics is usually written relative to a smooth external time parameter, while actual control schedules often contain waits, pulses, gates, resets, and event-like interventions. This paper develops the first unitary part of a sigma-time quantum dynamics framework. We define a bounded-Hamiltonian quantum evolution over a finite-horizon bounded-variation sigma clock with a continuous clock component, flat clock intervals, and a locally finite set of atom times carrying unitary gates. Under these hypotheses the sigma-chronological product exists, is unitary, composes as an evolution family, conserves wave-function norm, is strongly continuous away from atom times, and obeys a sharp atom/gate insertion law. We also prove a fixed-clock perturbation estimate and a bounded isolated-pulse corridor in which shrinking finite-width pulses converge in operator norm to declared atomic gates. The result is deliberately scoped: it does not claim an unbounded Schroedinger-operator theorem, a measurement theorem, an open-system theorem, or a Zeno limit theorem. A finite qubit benchmark with two bounded waits and one atomic gate is included as a reproducibility appendix and verifies unitary defect, trace preservation, Choi positivity, and output-state validity to machine precision
Recently, several approaches to solving linear systems on a quantum computer have been formulated in terms of the quantum adiabatic theorem for a continuously varying Hamiltonian.Such approaches have enabled near-linear scaling in the condition number κ of the linear system, without requiring a complicated variable-time amplitude amplification procedure.However, the most efficient of those procedures is still asymptotically suboptimal by a factor of log(κ).Here, we prove a rigorous form of the adiabatic theorem that bounds the error in terms of the spectral gap for intrinsically discrete-time evolutions.In combination with the qubitized quantum walk, our discrete adiabatic theorem gives a speed-up for all adiabatic algorithms.Here, we use this combination to develop a quantum algorithm for solving linear systems that is asymptotically optimal, in the sense that the complexity is strictly linear in κ, matching a known lower bound on the complexity.Our O[κ log(1/ )] complexity is also optimal in terms of the combined scaling in κ and the precision .Compared to existing suboptimal methods, our algorithm is simpler and easier to implement.Moreover, we determine the constant factors in the algorithm, which would be suitable for determining the complexity in terms of gate counts for specific applications.
We derive maximal mean-square adiabatic estimates for finite-dimensional stochastic Schrödinger equations with Hamiltonian-proportional Wiener noise. For deterministic C2C^2C2 Hamiltonians whose eigenvalues have constant multiplicities and do not cross on [0,1][0,1][0,1], we construct a unitary stochastic adiabatic intertwiner driven by the same Wiener process as the exact propagator. A commutator argument, Itô calculus, and Doob's maximal inequality yield an explicit bound for the expected supremum of their squared operator-norm difference on a selected initial eigenspace. Under uniform coefficient bounds, the physical noise scaling α=σT−γα=σT^{-γ}α=σT−γ, where TTT is the total evolution time and σ≥0σ\geq0σ≥0 and γ≥0γ\geq0γ≥0 are fixed, gives maximal mean-square error O(T−2+σ4T−4γ+σ2T−(2γ+1))O(T^{-2}+σ^4T^{-4γ}+σ^2T^{-(2γ+1)})O(T−2+σ4T−4γ+σ2T−(2γ+1)). Consequently, adiabatic convergence holds for every γ>0γ>0γ>0 as T→∞T\to\inftyT→∞, while γ≥1/2γ\geq1/2γ≥1/2 recovers the deterministic O(T−1)O(T^{-1})O(T−1) bound for the root-mean-square maximal error. For fixed nonzero physical noise amplitude, the estimate leaves convergence unresolved.
Adiabatic quantum computing is a general framework for preparing eigenstates of Hamiltonians on quantum devices. However, its digital implementation requires an efficient Hamiltonian simulation subroutine, which may introduce extra computational overhead or complicated quantum control logic. In this work, we show that the time-step sizes in time discretization can be much larger than expected, and the overall complexity is greatly reduced. Remarkably, regardless of the general convergence order of the numerical method, we can choose a uniform time-step size independent of tolerated error and evolution time for sufficiently accurate simulation. Furthermore, with the boundary cancellation condition where the continuous diabatic errors are exponentially suppressed, we provide strong evidence for a superpolynomial convergence of first-order Trotter with uniform time-step size. We apply our analysis to the example of adiabatic unstructured search and show several preferable features of the Trotterized adiabatic approach: It can match the Grover lower bound, it does not require knowledge of the number of marked states, and its performance can be asymptotically comparable with that of the quantum approximate optimization algorithm.
The quantum adiabatic theorem ensures that a slowly changing system, initially prepared in its ground state, will evolve to its final ground state with arbitrary precision. As a first result this thesis extends the original theorem to projection operators keeping the statement valid for Hamiltonians with degenerate ground spaces. Yet the main focus of this work lies in studying the efficiency of quantum circuit simulations by adabatic quantum computation. The standard Hamiltonian construction by Kitaev is based on a path graph reflecting the LLL computation steps and influencing the scaling of the necessary evolution time by its spectral gap of O(1L2)\mathcal{O}\left(\frac{1}{L^2}\right)O(L21​). Aspiring to an improved running time we generalize Kitaev's Hamiltonian to so-called standard graph Hamiltonians based on graph families with a different spectral gap. In this generalized construction the first two time derivatives of the Hamiltonian and the fraction of initial vertices appear as additional parameters of running time. In a first step the time derivatives can be proven to be constant. Expansion results from spectral graph theory however impose a trade-off between the spectral gap and the fraction of initial vertices as well as the fraction of final vertices which corresponds to the probability for obtaining the correct computational output. Graphs with spectral gap O(1Lk)\mathcal{O}\left(\frac{1}{L^k}\right)O(Lk1​), k<2k<2k<2, turn out to contradict very likely, graphs with k<1k<1k<1 even for sure at least one of the efficiency criterias for running time, output probability or Hamiltonian implementation. The above results may also be obstacles for a possible quantum PCP-theorem in complexity theory claiming the local Hamiltonian problem with constant gap to be QMA-complete since the very same Kitaev Hamiltonian is constructed in the QMA-hardness proof for the Local Hamiltonian problem.
We present a rigorous mathematical analysis of the recurrence of factorized (product) pure states under unitary evolution in a finite-dimensional bipartite quantum system. The central result is an analytic dichotomy: for any initial product state, the set of times at which the state is again factorized is either all of ℝ or a discrete subset. This reduces the problem to the classification of Hamiltonians possessing an eternally factorized product state. We formulate the obstruction through an infinite hierarchy of polynomial jet conditions whose defining ideal stabilises after finitely many steps; thus the exceptional Hamiltonians form a proper lower-dimensional semialgebraic set. The paper does not provide a complete classification of this exceptional set; rather, it proves that it is a finite-level semialgebraic set and develops the algebraic-geometric machinery needed for its future description. Consequently, the set of Hamiltonians with exclusively discrete recurrences is dense and of full Lebesgue measure. Independently, we analyse the gradient flow of the von Neumann entanglement entropy on projective space equipped with the Fubini–Study metric. Using the Kurdyka–Łojasiewicz inequality we prove that every maximal trajectory (defined as a continuous, piecewise-analytic curve satisfying the gradient equation on the analytic stratum) converges to a unique critical point of the entropy; under a natural normal-hyperbolicity assumption (whose verification is left as an open problem) almost every trajectory converges to a point on the Segre variety Σ of product states. We also obtain explicit polynomial bounds on the convergence rate, with exponents determined by the local Łojasiewicz geometry. The logarithmic singularity of the entropy near Σ is shown to preclude exponential convergence entirely. To obtain quantitative recurrence estimates in the unitary setting, we assume the Hamiltonian has a pure point spectrum and reduce the orbit to a linear flow on a torus whose dimension is the rational rank of the energy gaps. Using Dirichlet simultaneous approximation we prove an upper bound on the time to achieve an ϵ-approximate return to the initial ray, with polynomial scaling in 1/ϵ. The bound is universal but not claimed to be optimal. The two-qubit case is treated in full detail: the Segre variety reduces to a quadric hypersurface, the first-order tangency condition becomes a linear equation in the Pauli coefficients, and the moduli space of local unitary equivalence (the Weyl chamber) together with Makhlin invariants drastically simplifies the classification. We provide explicit formulas and a computational roadmap using cylindrical algebraic decomposition. A catalogue of rigorous examples and a systematic classification programme conclude the paper.