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.09291

Spectral Core-Tail Architecture for Locally Certified Gibbs-State Preparation

Rui-Hao Li

quant-phSubmitted Sep 8, 2026• Announced Sep 10, 2026• 0 citations
arXivHTMLPDF

Abstract

Preparing a quantum Gibbs state requires reproducing both its thermal distribution and the associated many-body eigenspaces. In this work, we formalize the spectral core-tail architecture (SCTA) as a framework comprising a structured thermal core, a geometrically characterized unitary tail, and an exact residual measuring the remaining core-frame Hamiltonian mismatch. We derive a local Gibbs-state error bound separating core-preparation, tail-implementation, and modeling errors. The modeling contribution is volume uniform when its Kubo-Mori response meets the shell summability condition and the relevant local data remain uniform. We then highlight three anchor Hamiltonian classes which admit exact core-tail constructions with zero residuals. For small deformations of an exact anchor, we employ a Schrieffer-Wolff reduction procedure to construct a corrected core-tail pair that formally removes the deformation order by order. Under uniform locality and solvability assumptions, we show that the first-order reduction yields a residual that remains bounded and is quadratic in the deformation strength. Furthermore, we numerically test the first-order reduction on deformed graph-stabilizer Hamiltonians. The numerical results show approximately quadratic suppression of both the Hamiltonian-level mismatch and the local Gibbs-state error in the perturbative regime. We also find that the constructed correction circuit structure remains useful as a variational ansatz beyond perturbative control, often improving on both the bare and prescribed first-order states.

Comments
23 pages + supplemental material

Related papers

Accelerating quantum Gibbs sampling without quantum walks

Jiaqi Leng, Jiaqing Jiang, Lin Lin

Szegedy's quantum walk quadratically accelerates reversible classical Markov chains, but extending this mechanism to efficiently implementable quantum Gibbs samplers has remained challenging beyond special classes. We present a walk-free quantum algorithm for preparing purified Gibbs states with a quadratic improvement in spectral-gap dependence for a broad class of quantum Gibbs samplers that satisfy exact Kubo-Martin-Schwinger detailed balance. Our main structural result is an explicit factorization of the corresponding parent Hamiltonian into noncommutative first-order operators. This turns purified Gibbs-state preparation into a singular-value filtering problem and enables a quantum singular value transformation algorithm with quadratically improved gap dependence under standard coherent-access and warm-start assumptions. The framework applies to several efficiently implementable Gibbs samplers beyond the Davies setting. Moreover, we construct noncommuting Hamiltonians with efficiently preparable warm starts whose refinement under quantum Gibbs samplers requires exponential time. For these models, our algorithm achieves an end-to-end quantum speedup over the worst-case mixing scale.

quant-pharXiv:2604.22996•Apr 28, 2026•9 citations

From Heat to Homology: Spectral Gap Transfer for Exact Quantum Gibbs Sampling at All Temperatures

Caesnan M. G. Leditto, Kuo-Chin Chen, Min-Hsiu Hsieh

Preparing Gibbs states through dissipative dynamics requires controlling convergence for the chosen Hamiltonian $H$ and coupling operators. However, efficient implementation requires convergence guarantees from the spectral gap of the generator of the dynamics, which remains a crucial challenge. Recent results address the challenge by restricting the dynamics with structural assumptions about the Hamiltonian and its interactions. For the Chen-Kastoryano-Gilyen (CKG) construction and arbitrary finite-dimensional Hamiltonians, we prove an explicit comparison that converts a spectral gap estimate for the infinite-temperature generator into a lower bound on the spectral gap of the CKG quantum Gibbs sampler at every finite positive inverse temperature $β$. It allows a single spectral gap estimate at infinite temperature to certify convergence across Hamiltonians and temperatures. Such an estimate is often known from a classical spectral gap estimate, such as the classical random walk spectral gap. For Hodge Laplacians of simplicial complexes as Hamiltonians, we construct coupling operators whose generator at infinite temperature has the same spectral gap as a classical simplicial down-up walk. A positive spectral gap of the walk and bounded spectral width $W=λ_{\max}(H)-λ_{\min}(H)$ give a generator spectral gap independent of the number of simplices at every fixed temperature. We then establish conditions under which the sampler approximately prepares zero-energy (harmonic) states in polynomial evolution time. This provides a conditional convergence guarantee for the state preparation in the thermal approach to quantum topological data analysis.

quant-pharXiv:2610.02859•Oct 5, 2026•0 citations

Double Localization for Quantum Gibbs Sampler Gaps: From an Abstract Framework to Finite-Group Models

Ryu Hayakawa, Angus Southwell, Caesnan M. G. Leditto +2 more

We introduce double localization, a framework for proving spectral gaps of quantum Gibbs samplers through two complementary operations: geometric localization, which selects updates supported in small spatial regions, and interface localization, which focuses on a model-defined subspace of observables while remaining geometrically global. Our abstract gap theorem combines a global bound on this subspace, called the interface, with local quantum gap estimates under quantitative coupling and geometric assembly conditions. The resulting explicit lower bound controls the gap of the full dynamics without requiring the interface to be invariant under the generator. This separation allows global estimates, including classical comparison, to be combined with local control of the remaining quantum directions. We apply the framework to Hamiltonians built from the vertex terms of Kitaev's finite-group quantum double construction, without plaquette terms, on finite simple three-regular graphs of girth at least six. For the specified local Davies dynamics, we prove an unconditional spectral-gap lower bound by a positive constant independent of graph size for every fixed nontrivial finite group and each fixed inverse temperature $β$ with $0\leβJ<\log(5/3)$, where $J>0$ is the coupling strength. For the smallest non-Abelian group $S_3$, double localization yields a positive lower bound uniform in both graph size and the entire interval $0\leβJ\le\log 3$, providing a guarantee that does not follow directly from existing results. This demonstrates how model-specific finite calculations can extend spectral-gap guarantees for the full quantum dynamics.

quant-pharXiv:2609.39802•Oct 1, 2026•1 citation

Convex-Entropy Reservoirs and Conditional Ground-State Preparation: An Operational Separation of Thermodynamic Curvature, Accessible Cooling, and Dynamical Reset, with a Spectral-Obstruction Case Study in the D1-D5 CFT

Noah Embaye Abraha

The paper has two components. Parts I–IV develop a conditional operational theory of reservoir-assisted cooling and exact reset at the level of channels; Part V is a self-contained Hamiltonian-level case study of exact reset embeddings in a D1–D5 CFT reservoir. The two notions of “exact reset” are different and are kept distinct throughout. We separate three logically distinct questions in reservoir-assisted cooling: what the reservoir entropy implies thermodynamically, which low-temperature ancillas are accessible, and what extra dynamical resource exact ground-state preparation needs. Convex microcanonical entropy is neither sufficient nor necessary for a microscopic cooling operation; it is a thermodynamic route to an ancilla supply, under a stated local-Gibbsian hypothesis. For a resonant qubit target we prove that every energy-conserving collision with a qubit ancilla acts as p' = p + s(q − p), 0 ≤ s ≤ 1, so cooling to error ε is possible exactly when ancillas with excited population at most ε can be supplied. We then remove the two-level restriction: for an arbitrary energy-incoherent sink, within the stated collision model, the least reachable excited population is a sector-wise majorization (sorting) problem with an explicit closed-form solution. Its consequences are: (a) a cooling criterion: a sink can cool a target of population p if and only if some pair of its levels one target gap apart has population ratio below p/(1−p); (b) a Gibbs sink at any finite temperature leaves the exact floor min{p, (1−p)e^{−β E_sys}} > 0, and this floor is stable under arbitrary sequences of fresh sinks at the same temperature (the sequence extension is proved by a concavity lemma); (c) the floor is a single-temperature statement: a hot and a cold thermal sink used together cool every p ∈ (0,1), and iterating fresh pairs drives p → 0 with no work store, measurement or record, while sequential single-sink collisions already reach n̄_c / (1 + n̄_c + n̄_h); (d) sharpness of the energy support, or one classical record of entropy h_2(p), is what buys exactness in finitely many steps. Exact reset has two independent resource obstructions in the stated model. The optimal residual excitation of any energy-conserving reset is the sink weight on directions that lack spectral room (the room floor), with a criterion for measurement-free exact reset; against limited control, any circuit of m gates with rank(G − I) ≤ ρ leaves the target excited with probability at least the sink-spectrum tail beyond ρm, so, within this gate model, the number of gates needed for exactness is at least the corresponding tail rank divided by ρ, with the operational integer requirement expressed by the ceiling where a finite target error is specified. Within the shell-ancilla model, an explicit dimension requirement dim ≥ 1/ε follows, with the corresponding bound attained by the stated construction. The room floor and the rank–error bound are energy-conserving, sector-wise and gate-rank refinements of the Ticozzi–Viola purification bound, and are presented as such. We also give a conditional zero-designated-work SWAP construction with N = O(log log(1/ε)) collisions for a quadratic-entropy family, a dimension-counting reset criterion with an exact ladder-sink cost–error curve, an error budget for measurement–feedback completion, and a finite birth–death noise model with a positive spectral gap. Black holes, Na⁺_147 nanoclusters, structured-vacuum engines and Casimir experiments are treated as delimited case studies, not demonstrations. The contribution is a conditional operational characterisation with falsifiable requirements; it is not a claim that the third law has been circumvented. Finite instances of the principal formulas were checked by exact arithmetic and numerical sampling (random energy-conserving unitaries against the closed forms, and exact evaluation of tabulated values; Section 27); these checks are consistency tests, not substitutes for the proofs. Part V. The case study proves two conditional obstructions to exact spectral reset embeddings in a D1–D5 CFT reservoir. The first is a sector-specific capacity bound: under explicit component-string, single-strand, graded-orbifold and constant-character hypotheses, the maximal-left-charge Ramond-ground-state sector has dimension 4N, so a larger source cannot embed into it. The second is a finite-dimensional perturbative criterion: for an exactly degenerate source block transported by a regular family, the second-order effective Hamiltonian must act as a scalar on the transported block, equivalently the block must lie in a single second-order eigenspace, which gives an eigenspace-multiplicity bound for a prescribed target sector. At level four, under an explicit Hermiticity and perturbative-matching hypothesis, fifteen long-multiplet primaries with distinct second-order lifts give a fixed-label non-scalar target block. All obstructions are conditional and local, no universal no-go theorem for the full D1–D5 Hilbert space is claimed, and no microscopic reset dynamics are constructed.

•Oct 4, 2026•0 citations

Rigorous error bounds for dissipative thermal state preparation from weak system-bath coupling

Christopher Ong, S. A. Parameswaran, Benedikt Placke +1 more

Thermal state preparation is a central challenge in the simulation of quantum many-body systems. Yet, provably efficient algorithms for this task were only introduced recently [Chen et al. Nature 646, 561 (2025)]. These algorithms are based on dissipative Lindbladian evolution which exactly fixes the thermal state. Controlled and efficient digital simulation of this evolution, although possible in principle, remains out of reach for present-day quantum hardware. Subsequent work has therefore focused on analog approximations of the proposed Lindbladians via `collision models' with relatively modest requirements -- a resettable bath of ancilla qubits whose couplings to the system can be tuned in time-dependent fashion -- while still admitting rigorous fixed-point error bounds. Existing rigorous approaches, however, do not exploit the fact that these constructions generically implement not only the desired Lindblad dynamics, but also an additional unitary evolution generated by the system Hamiltonian which may aid convergence to the thermal state [Lloyd and Abanin arXiv:2506.21318 (2025)]. Here, we show that this unitary contribution does indeed tighten the fixed-point error bound and demonstrate that it is rigorously controlled by the system-bath coupling strength $J$, scaling as $J^2$. This demonstrates that the effect of the spurious `Lamb shift' term generated by the system-bath interaction can be controlled by tuning $J$. We clarify the role, previously observed, of a randomized implementation in suppressing possible resonances of the drive with the many-body spectrum, and bound the additional variance that this randomization imposes on observables. Finally, we numerically study aspects of the protocol which are relevant for its practical realization, such as the mixing time.

quant-pharXiv:2605.03011•Physical Review A•May 6, 2026•4 citations

Getting error-resilient qubits to work

Zsolt Szabó

This thesis develops structure-preserving methods to control and compile quantum evolutions with provable guarantees. In quantum dynamics, a fundamental resource is coherence maintained within a designated subspace; leakage – population transfer out of that subspace – is a major source of error that demands robust methods for its suppression and control. For example, maintaining the evolution within the computational (logical) subspace in quantum computing is essential for practical quantum information processing. On the dynamics side, we study adiabatic evolution under weak perturbations through effective-Hamiltonian frames. Using Bloch wave operators and Schrieffer-Wolff constructions, we obtain block-diagonal generators and prove that their evolutions remain uniformly close to the true dynamics. Moreover, we establish time-independent (“eternal”) bounds on spectral leakage that scale as 𝑂(𝛾−1) in the weak-coupling regime, where 𝛾 is the dimensionless ratio between the strength of the strong system Hamiltonian and the weak drive. The analysis covers both finite-dimensional, time-dependent settings and a novel coarse-grained framework that accommodates continuous spectra and even unbounded Hamiltonians, enabling applications to banded tight-binding models and superconducting-qubit architectures. Optimising quantum algorithms for reduced depth or fewer non-error-corrected physical gates is also key to mitigating leakage. We therefore formulate quantum compiling as exact or approximate unitary synthesis up to a physically irrelevant global phase and solve it via mixed-integer linear programming (MILP). The formulation supports multiple objectives (depth, two-qubit gate count, non-Clifford cost) and provides theoretical guarantees of optimality. To the best of our knowledge, this is the first MILP formulation that targets circuit depth directly, rather than minimising gate counts and inferring depth retroactively. The model explores the algebraic structure of the problem in order to accelerate the solver through symmetry breaking, redundancy elimination, and other mathematically sound constraints. To scale beyond exact global optimisation, we introduce a rolling-horizon strategy that compiles circuits in overlapping windows. An open-source implementation, written in the Julia language and released as QuantumCircuitOpt.jl, provides these capabilities to facilitate further research. In both cases, similarity transformations and algebraic identities reduce complexity while focusing attention on the spectral/target content, and both yield quantitative guarantees. Collectively, these contributions confront leakage, the key threat to coherent, in-subspace computation, with the ultimate aim of getting error-resilient qubits to work.

•Jul 8, 2026•0 citations
Preparing a quantum Gibbs state requires reproducing both its thermal distribution and the associated many-body eigenspaces. In this work, we formalize the spectral core-tail architecture (SCTA) as a framework comprising a structured thermal core, a geometrically characterized unitary tail, and an exact residual measuring the remaining core-frame Hamiltonian mismatch. We derive a local Gibbs-state error bound separating core-preparation, tail-implementation, and modeling errors. The modeling contribution is volume uniform when its Kubo-Mori response meets the shell summability condition and the relevant local data remain uniform. We then highlight three anchor Hamiltonian classes which admit exact core-tail constructions with zero residuals. For small deformations of an exact anchor, we employ a Schrieffer-Wolff reduction procedure to construct a corrected core-tail pair that formally removes the deformation order by order. Under uniform locality and solvability assumptions, we show that the first-order reduction yields a residual that remains bounded and is quadratic in the deformation strength. Furthermore, we numerically test the first-order reduction on deformed graph-stabilizer Hamiltonians. The numerical results show approximately quadratic suppression of both the Hamiltonian-level mismatch and the local Gibbs-state error in the perturbative regime. We also find that the constructed correction circuit structure remains useful as a variational ansatz beyond perturbative control, often improving on both the bare and prescribed first-order states.
Szegedy's quantum walk quadratically accelerates reversible classical Markov chains, but extending this mechanism to efficiently implementable quantum Gibbs samplers has remained challenging beyond special classes. We present a walk-free quantum algorithm for preparing purified Gibbs states with a quadratic improvement in spectral-gap dependence for a broad class of quantum Gibbs samplers that satisfy exact Kubo-Martin-Schwinger detailed balance. Our main structural result is an explicit factorization of the corresponding parent Hamiltonian into noncommutative first-order operators. This turns purified Gibbs-state preparation into a singular-value filtering problem and enables a quantum singular value transformation algorithm with quadratically improved gap dependence under standard coherent-access and warm-start assumptions. The framework applies to several efficiently implementable Gibbs samplers beyond the Davies setting. Moreover, we construct noncommuting Hamiltonians with efficiently preparable warm starts whose refinement under quantum Gibbs samplers requires exponential time. For these models, our algorithm achieves an end-to-end quantum speedup over the worst-case mixing scale.
Preparing Gibbs states through dissipative dynamics requires controlling convergence for the chosen Hamiltonian HHH and coupling operators. However, efficient implementation requires convergence guarantees from the spectral gap of the generator of the dynamics, which remains a crucial challenge. Recent results address the challenge by restricting the dynamics with structural assumptions about the Hamiltonian and its interactions. For the Chen-Kastoryano-Gilyen (CKG) construction and arbitrary finite-dimensional Hamiltonians, we prove an explicit comparison that converts a spectral gap estimate for the infinite-temperature generator into a lower bound on the spectral gap of the CKG quantum Gibbs sampler at every finite positive inverse temperature βββ. It allows a single spectral gap estimate at infinite temperature to certify convergence across Hamiltonians and temperatures. Such an estimate is often known from a classical spectral gap estimate, such as the classical random walk spectral gap. For Hodge Laplacians of simplicial complexes as Hamiltonians, we construct coupling operators whose generator at infinite temperature has the same spectral gap as a classical simplicial down-up walk. A positive spectral gap of the walk and bounded spectral width W=λmax⁡(H)−λmin⁡(H)W=λ_{\max}(H)-λ_{\min}(H)W=λmax​(H)−λmin​(H) give a generator spectral gap independent of the number of simplices at every fixed temperature. We then establish conditions under which the sampler approximately prepares zero-energy (harmonic) states in polynomial evolution time. This provides a conditional convergence guarantee for the state preparation in the thermal approach to quantum topological data analysis.
We introduce double localization, a framework for proving spectral gaps of quantum Gibbs samplers through two complementary operations: geometric localization, which selects updates supported in small spatial regions, and interface localization, which focuses on a model-defined subspace of observables while remaining geometrically global. Our abstract gap theorem combines a global bound on this subspace, called the interface, with local quantum gap estimates under quantitative coupling and geometric assembly conditions. The resulting explicit lower bound controls the gap of the full dynamics without requiring the interface to be invariant under the generator. This separation allows global estimates, including classical comparison, to be combined with local control of the remaining quantum directions. We apply the framework to Hamiltonians built from the vertex terms of Kitaev's finite-group quantum double construction, without plaquette terms, on finite simple three-regular graphs of girth at least six. For the specified local Davies dynamics, we prove an unconditional spectral-gap lower bound by a positive constant independent of graph size for every fixed nontrivial finite group and each fixed inverse temperature βββ with 0≤βJ<log⁡(5/3)0\leβJ<\log(5/3)0≤βJ<log(5/3), where J>0J>0J>0 is the coupling strength. For the smallest non-Abelian group S3S_3S3​, double localization yields a positive lower bound uniform in both graph size and the entire interval 0≤βJ≤log⁡30\leβJ\le\log 30≤βJ≤log3, providing a guarantee that does not follow directly from existing results. This demonstrates how model-specific finite calculations can extend spectral-gap guarantees for the full quantum dynamics.
The paper has two components. Parts I–IV develop a conditional operational theory of reservoir-assisted cooling and exact reset at the level of channels; Part V is a self-contained Hamiltonian-level case study of exact reset embeddings in a D1–D5 CFT reservoir. The two notions of “exact reset” are different and are kept distinct throughout. We separate three logically distinct questions in reservoir-assisted cooling: what the reservoir entropy implies thermodynamically, which low-temperature ancillas are accessible, and what extra dynamical resource exact ground-state preparation needs. Convex microcanonical entropy is neither sufficient nor necessary for a microscopic cooling operation; it is a thermodynamic route to an ancilla supply, under a stated local-Gibbsian hypothesis. For a resonant qubit target we prove that every energy-conserving collision with a qubit ancilla acts as p' = p + s(q − p), 0 ≤ s ≤ 1, so cooling to error ε is possible exactly when ancillas with excited population at most ε can be supplied. We then remove the two-level restriction: for an arbitrary energy-incoherent sink, within the stated collision model, the least reachable excited population is a sector-wise majorization (sorting) problem with an explicit closed-form solution. Its consequences are: (a) a cooling criterion: a sink can cool a target of population p if and only if some pair of its levels one target gap apart has population ratio below p/(1−p); (b) a Gibbs sink at any finite temperature leaves the exact floor min{p, (1−p)e^{−β E_sys}} > 0, and this floor is stable under arbitrary sequences of fresh sinks at the same temperature (the sequence extension is proved by a concavity lemma); (c) the floor is a single-temperature statement: a hot and a cold thermal sink used together cool every p ∈ (0,1), and iterating fresh pairs drives p → 0 with no work store, measurement or record, while sequential single-sink collisions already reach n̄_c / (1 + n̄_c + n̄_h); (d) sharpness of the energy support, or one classical record of entropy h_2(p), is what buys exactness in finitely many steps. Exact reset has two independent resource obstructions in the stated model. The optimal residual excitation of any energy-conserving reset is the sink weight on directions that lack spectral room (the room floor), with a criterion for measurement-free exact reset; against limited control, any circuit of m gates with rank(G − I) ≤ ρ leaves the target excited with probability at least the sink-spectrum tail beyond ρm, so, within this gate model, the number of gates needed for exactness is at least the corresponding tail rank divided by ρ, with the operational integer requirement expressed by the ceiling where a finite target error is specified. Within the shell-ancilla model, an explicit dimension requirement dim ≥ 1/ε follows, with the corresponding bound attained by the stated construction. The room floor and the rank–error bound are energy-conserving, sector-wise and gate-rank refinements of the Ticozzi–Viola purification bound, and are presented as such. We also give a conditional zero-designated-work SWAP construction with N = O(log log(1/ε)) collisions for a quadratic-entropy family, a dimension-counting reset criterion with an exact ladder-sink cost–error curve, an error budget for measurement–feedback completion, and a finite birth–death noise model with a positive spectral gap. Black holes, Na⁺_147 nanoclusters, structured-vacuum engines and Casimir experiments are treated as delimited case studies, not demonstrations. The contribution is a conditional operational characterisation with falsifiable requirements; it is not a claim that the third law has been circumvented. Finite instances of the principal formulas were checked by exact arithmetic and numerical sampling (random energy-conserving unitaries against the closed forms, and exact evaluation of tabulated values; Section 27); these checks are consistency tests, not substitutes for the proofs. Part V. The case study proves two conditional obstructions to exact spectral reset embeddings in a D1–D5 CFT reservoir. The first is a sector-specific capacity bound: under explicit component-string, single-strand, graded-orbifold and constant-character hypotheses, the maximal-left-charge Ramond-ground-state sector has dimension 4N, so a larger source cannot embed into it. The second is a finite-dimensional perturbative criterion: for an exactly degenerate source block transported by a regular family, the second-order effective Hamiltonian must act as a scalar on the transported block, equivalently the block must lie in a single second-order eigenspace, which gives an eigenspace-multiplicity bound for a prescribed target sector. At level four, under an explicit Hermiticity and perturbative-matching hypothesis, fifteen long-multiplet primaries with distinct second-order lifts give a fixed-label non-scalar target block. All obstructions are conditional and local, no universal no-go theorem for the full D1–D5 Hilbert space is claimed, and no microscopic reset dynamics are constructed.
Thermal state preparation is a central challenge in the simulation of quantum many-body systems. Yet, provably efficient algorithms for this task were only introduced recently [Chen et al. Nature 646, 561 (2025)]. These algorithms are based on dissipative Lindbladian evolution which exactly fixes the thermal state. Controlled and efficient digital simulation of this evolution, although possible in principle, remains out of reach for present-day quantum hardware. Subsequent work has therefore focused on analog approximations of the proposed Lindbladians via `collision models' with relatively modest requirements -- a resettable bath of ancilla qubits whose couplings to the system can be tuned in time-dependent fashion -- while still admitting rigorous fixed-point error bounds. Existing rigorous approaches, however, do not exploit the fact that these constructions generically implement not only the desired Lindblad dynamics, but also an additional unitary evolution generated by the system Hamiltonian which may aid convergence to the thermal state [Lloyd and Abanin arXiv:2506.21318 (2025)]. Here, we show that this unitary contribution does indeed tighten the fixed-point error bound and demonstrate that it is rigorously controlled by the system-bath coupling strength JJJ, scaling as J2J^2J2. This demonstrates that the effect of the spurious `Lamb shift' term generated by the system-bath interaction can be controlled by tuning JJJ. We clarify the role, previously observed, of a randomized implementation in suppressing possible resonances of the drive with the many-body spectrum, and bound the additional variance that this randomization imposes on observables. Finally, we numerically study aspects of the protocol which are relevant for its practical realization, such as the mixing time.
This thesis develops structure-preserving methods to control and compile quantum evolutions with provable guarantees. In quantum dynamics, a fundamental resource is coherence maintained within a designated subspace; leakage – population transfer out of that subspace – is a major source of error that demands robust methods for its suppression and control. For example, maintaining the evolution within the computational (logical) subspace in quantum computing is essential for practical quantum information processing. On the dynamics side, we study adiabatic evolution under weak perturbations through effective-Hamiltonian frames. Using Bloch wave operators and Schrieffer-Wolff constructions, we obtain block-diagonal generators and prove that their evolutions remain uniformly close to the true dynamics. Moreover, we establish time-independent (“eternal”) bounds on spectral leakage that scale as 𝑂(𝛾−1) in the weak-coupling regime, where 𝛾 is the dimensionless ratio between the strength of the strong system Hamiltonian and the weak drive. The analysis covers both finite-dimensional, time-dependent settings and a novel coarse-grained framework that accommodates continuous spectra and even unbounded Hamiltonians, enabling applications to banded tight-binding models and superconducting-qubit architectures. Optimising quantum algorithms for reduced depth or fewer non-error-corrected physical gates is also key to mitigating leakage. We therefore formulate quantum compiling as exact or approximate unitary synthesis up to a physically irrelevant global phase and solve it via mixed-integer linear programming (MILP). The formulation supports multiple objectives (depth, two-qubit gate count, non-Clifford cost) and provides theoretical guarantees of optimality. To the best of our knowledge, this is the first MILP formulation that targets circuit depth directly, rather than minimising gate counts and inferring depth retroactively. The model explores the algebraic structure of the problem in order to accelerate the solver through symmetry breaking, redundancy elimination, and other mathematically sound constraints. To scale beyond exact global optimisation, we introduce a rolling-horizon strategy that compiles circuits in overlapping windows. An open-source implementation, written in the Julia language and released as QuantumCircuitOpt.jl, provides these capabilities to facilitate further research. In both cases, similarity transformations and algebraic identities reduce complexity while focusing attention on the spectral/target content, and both yield quantitative guarantees. Collectively, these contributions confront leakage, the key threat to coherent, in-subspace computation, with the ultimate aim of getting error-resilient qubits to work.