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

Engineered Dissipation Thermal Quantum Annealing (ED-tQuA): Provable Logarithmic Mixing Time with No Conjectures

Paul J. Werbos

Published Jun 11, 2026• 0 citations
Publisher

Abstract

Previous work on Thermal Quantum Annealing (tQuA) established a natural-bath architecture with strong numerical evidence for favorable scaling, but a fully rigorous proof of logarithmic mixing time remained elusive, with key results labeled as conjectures. This paper resolves that open problem by introducing Engineered Dissipation tQuA (ED-tQuA), a new quantum optimization architecture that replaces the passive thermal bath with programmable, non-local jump operators. We prove three rigorous theorems with complete, self-contained proofs: (1) a logarithmic lower bound on the Liouvillian spectral gap, , establishing a mixing time of ; (2) monotonic energy decrease and guaranteed convergence to the global minimum via dark-state engineering; and (3) robustness of the performance guarantees to bounded control errors. No conjectures are required. The design encompasses a broad family of architectures, including all-to-all, restricted connectivity graphs, and various cooling schedules, all of which inherit the same provable guarantees. This work provides the first complete mathematical foundation for a provably fast, open-system quantum optimizer, directly enabling stronger patent claims and a clear path to near-term hardware demonstration.

DOI
10.5281/zenodo.20653554

Related papers

Analytic Foundations of Thermal Quantum Annealing: Convergence Guarantees and Computational Advantage for Quantum Matrix Methods

Claude, Paul Werbos

Thermal Quantum Annealing (tQuA) is a quantum architecture in which a system coupled non-adiabatically to a thermodynamic reservoir evolves toward the ground state of a target Hamiltonian . This paper provides a rigorous and honest foundation for tQuA and its extension to Quantum Intelligent Matrix Methods (QIMM). We distinguish carefully among Theorems (proved in cited literature), Propositions (proof sketches with explicitly identified gaps), and Conjectures (claims with open steps). This work delivers three principal contributions: Convergence Proof Chain: We present a five-pillar proof chain establishing that tQuA converges to the global minimum from any initial state, without adiabatic scheduling, without eigenstate knowledge, and with a strictly positive escape rate from every local minimum at any . Honest Scaling Benchmarks: We present scaling benchmarks for the Liouvillian spectral gap on gopherhole Hamiltonians, reporting a key finding: fixed-schedule tQuA achieves a perfectly flat gap (, independent of up to ) when the number of local minima is fixed and small, but experiences steep polynomial decay () when grows proportionally to . Adaptive Policy Framework: Third, we outline a rich adaptive annealing policy framework using observed function evaluations and prior probability distributions over problem classes, framing it as a primary research direction for future empirical tuning. The framework applies broadly to nonconvex optimization in artificial intelligence, signal processing, and imaging, with specific application to "seeing the sky" technologies described in the companion paper on intensity-correlation interferometry (Hyland & Werbos 2024).

•May 7, 2026•0 citations

Mechanisms for Quantum Advantage in Global Optimization of Nonconvex Functions

Dylan Herman, Guneykan Ozgul, Anuj Apte +4 more

We present new theoretical mechanisms for quantum speedup in the global optimization of nonconvex functions, expanding the scope of quantum advantage beyond traditional tunneling-based explanations. As our main building-block, we demonstrate a rigorous correspondence between the spectral properties of Schrödinger operators and the mixing times of classical Langevin diffusion. This correspondence motivates a mechanism for separation on functions with unique global minimum: while quantum algorithms operate on the original potential, classical diffusions correspond to a Schrödinger operators with a WKB potential having nearly degenerate global minima. We formalize these ideas by proving that a real-space adiabatic quantum algorithm (RsAA) achieves provably polynomial-time optimization for broad families of nonconvex functions. First, for block-separable functions, we show that RsAA maintains polynomial runtime while known off-the-shelf algorithms require exponential time and structure-aware algorithms exhibit arbitrarily large polynomial runtimes. These results leverage novel non-asymptotic results in semiclassical analysis. Second, we use recent advances in the theory of intrinsic hypercontractivity to demonstrate polynomial runtimes for RsAA on appropriately perturbed strongly convex functions that lack global structure, while off-the-shelf algorithms remain exponentially bottlenecked. In contrast to prior works based on quantum tunneling, these separations do not depend on the geometry of barriers between local minima. Our theoretical claims about classical algorithm runtimes are supported by rigorous analysis and comprehensive numerical benchmarking. These findings establish a rigorous theoretical foundation for quantum advantage in continuous optimization and open new research directions connecting quantum algorithms, stochastic processes, and semiclassical analysis.

arXiv:2510.03385•Oct 3, 2025•8 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

Autonomous Dissipative Quantum Processing: Hardware-intrinsic Stabilization Protocol

QNFO

Current quantum computing architectures face a thermodynamic bottleneck where the energy cost of classical error correction scales superlinearly with system size. Reliance on exogenous classical control imposes a latency and power penalty that renders hybrid paradigms unscalable for exascale applications. An architecture for autonomous dissipative quantum processing is defined to replace active feedback with hardware-intrinsic stability. By encoding logical information into the dark state of a driven-dissipative Liouvillian, error correction functions as a continuous thermodynamic process of entropy export. We explicitly define the implementation of logical Clifford gates via adiabatic code deformation and the physical realization of 4-body stabilizer terms using Fluxonium-based superinductor arrays. Thermal analysis confirms that the heat load ($< 0.5$ W/cm$^2$) remains within the cooling capacity of Stirling engines at 77 K, bounded by the Kapitza resistance of the diamond substrate. This establishes a rigorous pathway to self-contained quantum processors operating at thermodynamic limits.

•Nov 30, 2025•0 citations

Optimal Quantum Algorithm for Gibbs State Preparation

Cambyse Rouzé, Daniel Stilck França, Alvaro Martin Alhambra

It is of great interest to understand the thermalization of open quantum many-body systems, and how quantum computers are able to efficiently simulate that process. A recently introduced dissipative evolution, inspired by existing models of open system thermalization, has been shown to be efficiently implementable on a quantum computer. Here, we prove that, at high enough temperatures, this evolution reaches the Gibbs state in time scaling logarithmically with system size. The result holds for Hamiltonians that satisfy the Lieb-Robinson bound, such as local Hamiltonians on a lattice, and includes long-range systems. To the best of our knowledge, these are the first results rigorously establishing the rapid mixing property of high-temperature quantum Gibbs samplers, which is known to give the fastest possible speed for thermalization in the many-body setting. We then apply our result to the problem of estimating partition functions at high temperature, showing an improved performance over previous classical and quantum algorithms.

arXiv:2411.04885•Physical Review Letters•Jan 14, 2026•94 citations

Towards scalable quantum annealing for pooling and blending problems: A methodological proof-of-concept

Vasileios K. Mappas, Bogdan Dorneanu, Eduardo Nolasco +2 more

Industrial optimization challenges, such as the pooling and blending problem (PBP), require advanced computational methods to address non-convexity and scalability limitations in classical solvers. This work introduces a novel methodological framework for solving PBPs using quantum annealing (QA) that transforms the PBP into quadratic unconstrained binary optimization (QUBO) formulations at two resolution levels, enabling direct deployment on quantum annealers. Key innovations include a discretization technique tailored for PBP’s bilinear constraints and an embedding method optimized for current quantum hardware. Benchmarking against classical solvers focuses on Haverly’s classical three-stream PBP, enabling transparent comparison and development of quantum embedding and solution techniques. The proposed framework offers a scalable template for adapting similar engineering systems to quantum annealing architectures. Addressing genuine industrial-scale instances will require future advances in quantum hardware and embedding algorithms. The results demonstrate that QA exhibits the best performance among the examined alternatives, provide foundational insights towards leveraging QA in Process Systems Engineering.

Process Safety and Environmental Protection•Aug 24, 2025•2 citations
Previous work on Thermal Quantum Annealing (tQuA) established a natural-bath architecture with strong numerical evidence for favorable scaling, but a fully rigorous proof of logarithmic mixing time remained elusive, with key results labeled as conjectures. This paper resolves that open problem by introducing Engineered Dissipation tQuA (ED-tQuA), a new quantum optimization architecture that replaces the passive thermal bath with programmable, non-local jump operators. We prove three rigorous theorems with complete, self-contained proofs: (1) a logarithmic lower bound on the Liouvillian spectral gap, , establishing a mixing time of ; (2) monotonic energy decrease and guaranteed convergence to the global minimum via dark-state engineering; and (3) robustness of the performance guarantees to bounded control errors. No conjectures are required. The design encompasses a broad family of architectures, including all-to-all, restricted connectivity graphs, and various cooling schedules, all of which inherit the same provable guarantees. This work provides the first complete mathematical foundation for a provably fast, open-system quantum optimizer, directly enabling stronger patent claims and a clear path to near-term hardware demonstration.
Thermal Quantum Annealing (tQuA) is a quantum architecture in which a system coupled non-adiabatically to a thermodynamic reservoir evolves toward the ground state of a target Hamiltonian . This paper provides a rigorous and honest foundation for tQuA and its extension to Quantum Intelligent Matrix Methods (QIMM). We distinguish carefully among Theorems (proved in cited literature), Propositions (proof sketches with explicitly identified gaps), and Conjectures (claims with open steps). This work delivers three principal contributions: Convergence Proof Chain: We present a five-pillar proof chain establishing that tQuA converges to the global minimum from any initial state, without adiabatic scheduling, without eigenstate knowledge, and with a strictly positive escape rate from every local minimum at any . Honest Scaling Benchmarks: We present scaling benchmarks for the Liouvillian spectral gap on gopherhole Hamiltonians, reporting a key finding: fixed-schedule tQuA achieves a perfectly flat gap (, independent of up to ) when the number of local minima is fixed and small, but experiences steep polynomial decay () when grows proportionally to . Adaptive Policy Framework: Third, we outline a rich adaptive annealing policy framework using observed function evaluations and prior probability distributions over problem classes, framing it as a primary research direction for future empirical tuning. The framework applies broadly to nonconvex optimization in artificial intelligence, signal processing, and imaging, with specific application to "seeing the sky" technologies described in the companion paper on intensity-correlation interferometry (Hyland & Werbos 2024).
We present new theoretical mechanisms for quantum speedup in the global optimization of nonconvex functions, expanding the scope of quantum advantage beyond traditional tunneling-based explanations. As our main building-block, we demonstrate a rigorous correspondence between the spectral properties of Schrödinger operators and the mixing times of classical Langevin diffusion. This correspondence motivates a mechanism for separation on functions with unique global minimum: while quantum algorithms operate on the original potential, classical diffusions correspond to a Schrödinger operators with a WKB potential having nearly degenerate global minima. We formalize these ideas by proving that a real-space adiabatic quantum algorithm (RsAA) achieves provably polynomial-time optimization for broad families of nonconvex functions. First, for block-separable functions, we show that RsAA maintains polynomial runtime while known off-the-shelf algorithms require exponential time and structure-aware algorithms exhibit arbitrarily large polynomial runtimes. These results leverage novel non-asymptotic results in semiclassical analysis. Second, we use recent advances in the theory of intrinsic hypercontractivity to demonstrate polynomial runtimes for RsAA on appropriately perturbed strongly convex functions that lack global structure, while off-the-shelf algorithms remain exponentially bottlenecked. In contrast to prior works based on quantum tunneling, these separations do not depend on the geometry of barriers between local minima. Our theoretical claims about classical algorithm runtimes are supported by rigorous analysis and comprehensive numerical benchmarking. These findings establish a rigorous theoretical foundation for quantum advantage in continuous optimization and open new research directions connecting quantum algorithms, stochastic processes, and semiclassical analysis.
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.
Current quantum computing architectures face a thermodynamic bottleneck where the energy cost of classical error correction scales superlinearly with system size. Reliance on exogenous classical control imposes a latency and power penalty that renders hybrid paradigms unscalable for exascale applications. An architecture for autonomous dissipative quantum processing is defined to replace active feedback with hardware-intrinsic stability. By encoding logical information into the dark state of a driven-dissipative Liouvillian, error correction functions as a continuous thermodynamic process of entropy export. We explicitly define the implementation of logical Clifford gates via adiabatic code deformation and the physical realization of 4-body stabilizer terms using Fluxonium-based superinductor arrays. Thermal analysis confirms that the heat load (<0.5< 0.5<0.5 W/cm2^22) remains within the cooling capacity of Stirling engines at 77 K, bounded by the Kapitza resistance of the diamond substrate. This establishes a rigorous pathway to self-contained quantum processors operating at thermodynamic limits.
It is of great interest to understand the thermalization of open quantum many-body systems, and how quantum computers are able to efficiently simulate that process. A recently introduced dissipative evolution, inspired by existing models of open system thermalization, has been shown to be efficiently implementable on a quantum computer. Here, we prove that, at high enough temperatures, this evolution reaches the Gibbs state in time scaling logarithmically with system size. The result holds for Hamiltonians that satisfy the Lieb-Robinson bound, such as local Hamiltonians on a lattice, and includes long-range systems. To the best of our knowledge, these are the first results rigorously establishing the rapid mixing property of high-temperature quantum Gibbs samplers, which is known to give the fastest possible speed for thermalization in the many-body setting. We then apply our result to the problem of estimating partition functions at high temperature, showing an improved performance over previous classical and quantum algorithms.
Industrial optimization challenges, such as the pooling and blending problem (PBP), require advanced computational methods to address non-convexity and scalability limitations in classical solvers. This work introduces a novel methodological framework for solving PBPs using quantum annealing (QA) that transforms the PBP into quadratic unconstrained binary optimization (QUBO) formulations at two resolution levels, enabling direct deployment on quantum annealers. Key innovations include a discretization technique tailored for PBP’s bilinear constraints and an embedding method optimized for current quantum hardware. Benchmarking against classical solvers focuses on Haverly’s classical three-stream PBP, enabling transparent comparison and development of quantum embedding and solution techniques. The proposed framework offers a scalable template for adapting similar engineering systems to quantum annealing architectures. Addressing genuine industrial-scale instances will require future advances in quantum hardware and embedding algorithms. The results demonstrate that QA exhibits the best performance among the examined alternatives, provide foundational insights towards leveraging QA in Process Systems Engineering.