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

Detector-Conditioned Quantum Speed Limits for Trajectory-Independent Bounds on Open-System Dynamics

Roy Surya Sekhar

Published Oct 1, 2026• 0 citations
Publisher

Abstract

Existing quantum speed limits (QSLs) for dissipative dynamics generally require integrating thefull state trajectory, limiting their predictive utility before simulation. We introduce a detector-conditioned framework to overcome this requirement. By projecting the adjoint Lindblad dissipatoronto a target detector Πω and taking its operator norm, we obtain a single static number—thedissipative transition capacity Γω —that provides a trajectory-free upper bound for local fidelitydecay. This construction deliberately sacrifices geometric tightness: for a k-qubit detector in anN -qubit system, it reduces the pre-simulation cost from O(23N ) trajectory integration to O(23k )static extraction, where k ≪ N is the detector size. We prove this quantity is the canonical minimalstate-independent bound arising from trace-class duality, is subadditive under tensor products, obeysextensive many-body scaling (Γ ≤ N γ) for local dissipators, and correctly vanishes for noise channelscommuting with the detector. We validate the local capacity bounds experimentally across 1-to 3-qubit sub-registers executed on the 156-qubit IBM Heron QPU (ibm marrakesh), confirmingbound validity on physical hardware without free parameters. We further demonstrate that Γωprovides a candidate cost function for noise-aware compiler routing, enabling circuit scheduling onheterogeneous hardware without prior classical simulation.

DOI
10.5281/zenodo.23076351

Related papers

Detector-Conditioned Quantum Speed Limits for Open Systems

Roy Surya Sekhar

Existing quantum speed limits (QSLs) for dissipative dynamics generally require integrating the full state trajectory, limiting their predictive utility before simulation. We introduce a detector-conditioned framework to overcome this requirement. By projecting the adjoint Lindblad dissipator onto a target detector $\Pi_\omega$ and taking its operator norm, we obtain a single static number---the \emph{dissipative transition capacity} $\Gamma_\omega$---that caps the fidelity decay rate for any initial state, without requiring prior ODE integration. We demonstrate that within the specified class of trajectory-independent detector-conditioned bounds, $\Gamma_\omega$ provides a natural functional driven by spatial locality, provide algebraic saturation conditions, and delineate regimes where it provides tighter constraints than standard trajectory-dependent trace-norm bounds. An extensive many-body scaling law ($\Gamma \le N\gamma$ for local baths) and subadditivity across orthogonal detectors follow from the triangle inequality, demonstrating an exponential $\mathcal{O}(2^N)$ separation from global geometric trajectory bounds under stated locality assumptions. We provide an operational interpretation in binary state discrimination and quantum error correction, and demonstrate a matrix-free runtime scaling advantage over differential equation integration.

•Jul 27, 2026•0 citations

Simulation of Lindbladian dynamics via adaptive variational quantum trajectory compression

Huan-Yu Liu, Cheng Xue, Yun-Jie Wang +5 more

Quantum simulation of open quantum systems in the noisy intermediate-scale quantum (NISQ) era is hindered by the non-unitary nature of dissipative dynamics and the limited quantum resources available on near-term quantum processors. In this work, we propose a resource-efficient algorithm for simulating Lindbladian dynamics on NISQ devices. For open quantum systems with Pauli dissipations, we first derive a compact and stable mixed-unitary adjoint channel that approximates the target dissipative dynamics and enables ancilla-free implementation through trajectory sampling. To further reduce the circuit depth required for implementing the sampled trajectories, we introduce an adaptive variational quantum trajectory compression framework. In this framework, a depth-adaptive parameterized quantum circuit is trained to approximate repeated Trotterized Hamiltonian simulation operators, which are then used to replace repeated unitary segments appearing in the sampled trajectories. Importantly, the training procedure can also be performed without auxiliary qubits. Numerical simulations of the dissipative quantum $XY$ model demonstrate the accuracy and resource efficiency of the proposed algorithm. Our results provide a practical route toward ancilla-free and depth-reduced simulation of open quantum systems on near-term quantum hardware.

quant-pharXiv:2607.09051•Quantum Science and Technology•Jul 13, 2026•0 citations

Trajectory-independent speed limits for controlled open quantum systems

James B. Larsen, Tameem Albash, Alicia B. Magann +1 more

Existing quantum speed limits for controlled open quantum systems depend on the specified trajectory. For example, lower bounds on quantum annealing times in the presence of dissipation depend explicitly on the chosen annealing schedule. Recently, schedule-independent speed limits have been derived for annealing in the closed quantum system setting (SciPost Phys. 18, 159 (2025)). In this work, we generalize these results to open quantum systems, deriving schedule-independent lower bounds for quantum annealing times in systems described by a Lindblad master equation. We analyze the interplay between coherent control and dissipation in single- and two-qubit examples, demonstrating that the derived lower bounds capture key scaling behavior with respect to the strength of the dissipator. Finally, we apply the bound to thermal state preparation and show that the bound matches the expected asymptotic behavior for an Ising model in the high temperature limit.

quant-pharXiv:2603.13090•Physical Review A•Mar 16, 2026•0 citations

Dissipation accelerates quantum and classical simulation of open-system dynamics

Armando Angrisani, Ricard Puig, Yanting Teng +1 more

Simulating open quantum systems reveals how environmental coupling shapes relaxation, excitation transport, and the dynamics of quantum correlations. On quantum hardware, dissipative channels add operations and might seem to increase cost. However, we show that a broad class of Pauli noise, including depolarization, can ease quantum and classical simulation by exponentially suppressing high-weight components of Heisenberg-evolved observables. For bounded-degree Lindblad dynamics, this permits system-size-independent Trotter steps when estimating local observables. Combining this compression with Richardson extrapolation, we provide classical and quantum error bounds with respect to the 2-norm of the propagated observable. These give high-probability expectation-value guarantees for random input states or random Hamiltonians acting on a fixed state and control (out-of-time-order) correlators. Concretely, we show that expectation values of local observables at time $t$ can be estimated to accuracy $\varepsilon$ using circuits of maximum depth $O\!\left(\left[1+\left(t/γ\right)^{3/2}\right]\log^2(1/\varepsilon)\right)$, independent of the system size $n$. Classically, we show that sparse Pauli propagation runs in time polynomial in $n$, $t$ and $1/\varepsilon$ for every fixed $γ>0$, with polynomial degree $O(1/γ)$ in the weak dissipation limit. The gap between our quantum and classical upper bounds leaves room for a substantial polynomial quantum advantage as dissipation weakens, an observation further supported by our numerical results.

quant-pharXiv:2609.40174•Oct 1, 2026•2 citations

Quantum-Event Reachability Certificates, dissipative Mixing, and formally verified Coherence Benchmarks

Boris Batenin, Andrei Preece

Can a quantum event be certified without simulating the full quantum state? This study develops rigorous, event-specific probability bounds for constrained, finite-dimensional open quantum systems described by Gorini–Kossakowski–Sudarshan–Lindblad (GKSL) dynamics. For initially unexcited targets, locally bounded Hamiltonian transitions that change at most one target occupation, and dissipation that preserves or lowers these occupations, it proves the sharp joint-excitation envelope pA(t) ≤ ∏j∈A sin²(min{π/2, ∫₀ᵗ uj(s) ds}). Independent resonant drives attain this bound within the stated model class. Complementary rational-polynomial certificates, interaction-dependent estimates, and bounds under pumping, coherent leakage, and guaranteed loss provide checkable alternatives for finite-time and all-time reachability questions. The analysis also examines how much information a particular event actually requires, distinguishing exact observable reductions and scalar trajectories from the exponentially larger ambient state description. Positive-operator barriers and operator-Schmidt-rank constraints clarify the resources and limitations of compact certificates. For independent generalized-amplitude-damping channels, the work establishes an ancilla-stable dissipative mixing bound: ‖⊗ⱼ Φⱼ,ₜ − ⊗ⱼ Rⱼ‖⋄ ≤ min{2, ∑ⱼ(rⱼ + rⱼ²)} ≤ 2N exp(−γ*t), where rⱼ = exp(−λⱼt/2) and γ* = minⱼ(λⱼ/2). The arbitrary-finite-ancilla hybrid inequality and resulting product-channel envelope are supported by kernel-checked Lean theorems; the leading long-time diamond-norm coefficient is established analytically, not formally verified. A separate formal development checks gauge-fixed Fibonacci fusion and braiding coherence identities, including pentagon and hexagon relations, and provides an ideal braid benchmark with conditional bounds for noisy encoded implementations. Taken together, the results offer a framework for auditable quantum-event certificates, model-specific noise benchmarks, and experimentally distinguishable predictions, while keeping their scope explicit: the claims depend on specified dynamics and controls and do not establish a new conservation law, microscopic topological protection, or universal computational advantage. Natural next steps include broader machine-checked dynamical certificates and validated interfaces from experimental models to formal proof objects.

•Nov 9, 2026•0 citations

Shallow Quantum Circuits for Geometrically Local Lindblad Dynamics

Zheyu Shen, Yusen Wu, Xiao Yuan +1 more

Open-system dynamics govern decoherence, transport, and engineered dissipation in quantum many-body systems. We propose a quantum algorithm for simulating time-independent, finite-range Lindblad dynamics with bounded local strength on a constant-dimensional lattice of $n$ sites, allowing noncommuting jump operators. For time $T\ge1$ and diamond-norm error at most $ε$, it has depth $O(T\operatorname{polylog}(nT/ε))$ and gate count $O(nT\operatorname{polylog}(nT/ε))$. These results extend the HHKL spatial decomposition to open systems. The main obstacle is that the reversible overlap corrections used for unitary dynamics have no direct analogue for dissipative channels. We overcome this by retaining the environment in a shared unitary dilation, keeping information lost from the system coherently available and making the spatial corrections reversible. We prove exponential occupation bounds for the environmental states generated by the decomposition, allowing compact representation and coherent simulation of local factors on the inputs that arise. The construction reduces each short-time evolution to a constant number of parallel layers on regions of logarithmic diameter, using nearest-neighbour gates and polylogarithmic auxiliary density. We also prove unconditional worst-case lower bounds using time-independent, purely dissipative processes that transport quantum information. For circuits with local quantum and classical communication, the lower bounds are $Ω(nT)$ for the expected gate count and $Ω(T)$ for depth on time scales up to the lattice diameter. They match the upper bounds' leading time and volume dependence up to polylogarithmic factors. At fixed time and sufficiently small fixed error, we further prove a depth lower bound of $Ω(\log n/\log\log n)$, showing that global accuracy can require increasing depth as the lattice grows.

quant-pharXiv:2610.05362•Oct 6, 2026•1 citation
Existing quantum speed limits (QSLs) for dissipative dynamics generally require integrating thefull state trajectory, limiting their predictive utility before simulation. We introduce a detector-conditioned framework to overcome this requirement. By projecting the adjoint Lindblad dissipatoronto a target detector Πω and taking its operator norm, we obtain a single static number—thedissipative transition capacity Γω —that provides a trajectory-free upper bound for local fidelitydecay. This construction deliberately sacrifices geometric tightness: for a k-qubit detector in anN -qubit system, it reduces the pre-simulation cost from O(23N ) trajectory integration to O(23k )static extraction, where k ≪ N is the detector size. We prove this quantity is the canonical minimalstate-independent bound arising from trace-class duality, is subadditive under tensor products, obeysextensive many-body scaling (Γ ≤ N γ) for local dissipators, and correctly vanishes for noise channelscommuting with the detector. We validate the local capacity bounds experimentally across 1-to 3-qubit sub-registers executed on the 156-qubit IBM Heron QPU (ibm marrakesh), confirmingbound validity on physical hardware without free parameters. We further demonstrate that Γωprovides a candidate cost function for noise-aware compiler routing, enabling circuit scheduling onheterogeneous hardware without prior classical simulation.
Existing quantum speed limits (QSLs) for dissipative dynamics generally require integrating the full state trajectory, limiting their predictive utility before simulation. We introduce a detector-conditioned framework to overcome this requirement. By projecting the adjoint Lindblad dissipator onto a target detector Πω\Pi_\omegaΠω​ and taking its operator norm, we obtain a single static number---the \emph{dissipative transition capacity} Γω\Gamma_\omegaΓω​---that caps the fidelity decay rate for any initial state, without requiring prior ODE integration. We demonstrate that within the specified class of trajectory-independent detector-conditioned bounds, Γω\Gamma_\omegaΓω​ provides a natural functional driven by spatial locality, provide algebraic saturation conditions, and delineate regimes where it provides tighter constraints than standard trajectory-dependent trace-norm bounds. An extensive many-body scaling law (Γ≤Nγ\Gamma \le N\gammaΓ≤Nγ for local baths) and subadditivity across orthogonal detectors follow from the triangle inequality, demonstrating an exponential O(2N)\mathcal{O}(2^N)O(2N) separation from global geometric trajectory bounds under stated locality assumptions. We provide an operational interpretation in binary state discrimination and quantum error correction, and demonstrate a matrix-free runtime scaling advantage over differential equation integration.
Quantum simulation of open quantum systems in the noisy intermediate-scale quantum (NISQ) era is hindered by the non-unitary nature of dissipative dynamics and the limited quantum resources available on near-term quantum processors. In this work, we propose a resource-efficient algorithm for simulating Lindbladian dynamics on NISQ devices. For open quantum systems with Pauli dissipations, we first derive a compact and stable mixed-unitary adjoint channel that approximates the target dissipative dynamics and enables ancilla-free implementation through trajectory sampling. To further reduce the circuit depth required for implementing the sampled trajectories, we introduce an adaptive variational quantum trajectory compression framework. In this framework, a depth-adaptive parameterized quantum circuit is trained to approximate repeated Trotterized Hamiltonian simulation operators, which are then used to replace repeated unitary segments appearing in the sampled trajectories. Importantly, the training procedure can also be performed without auxiliary qubits. Numerical simulations of the dissipative quantum XYXYXY model demonstrate the accuracy and resource efficiency of the proposed algorithm. Our results provide a practical route toward ancilla-free and depth-reduced simulation of open quantum systems on near-term quantum hardware.
Existing quantum speed limits for controlled open quantum systems depend on the specified trajectory. For example, lower bounds on quantum annealing times in the presence of dissipation depend explicitly on the chosen annealing schedule. Recently, schedule-independent speed limits have been derived for annealing in the closed quantum system setting (SciPost Phys. 18, 159 (2025)). In this work, we generalize these results to open quantum systems, deriving schedule-independent lower bounds for quantum annealing times in systems described by a Lindblad master equation. We analyze the interplay between coherent control and dissipation in single- and two-qubit examples, demonstrating that the derived lower bounds capture key scaling behavior with respect to the strength of the dissipator. Finally, we apply the bound to thermal state preparation and show that the bound matches the expected asymptotic behavior for an Ising model in the high temperature limit.
Simulating open quantum systems reveals how environmental coupling shapes relaxation, excitation transport, and the dynamics of quantum correlations. On quantum hardware, dissipative channels add operations and might seem to increase cost. However, we show that a broad class of Pauli noise, including depolarization, can ease quantum and classical simulation by exponentially suppressing high-weight components of Heisenberg-evolved observables. For bounded-degree Lindblad dynamics, this permits system-size-independent Trotter steps when estimating local observables. Combining this compression with Richardson extrapolation, we provide classical and quantum error bounds with respect to the 2-norm of the propagated observable. These give high-probability expectation-value guarantees for random input states or random Hamiltonians acting on a fixed state and control (out-of-time-order) correlators. Concretely, we show that expectation values of local observables at time ttt can be estimated to accuracy ε\varepsilonε using circuits of maximum depth O ⁣([1+(t/γ)3/2]log⁡2(1/ε))O\!\left(\left[1+\left(t/γ\right)^{3/2}\right]\log^2(1/\varepsilon)\right)O([1+(t/γ)3/2]log2(1/ε)), independent of the system size nnn. Classically, we show that sparse Pauli propagation runs in time polynomial in nnn, ttt and 1/ε1/\varepsilon1/ε for every fixed γ>0γ>0γ>0, with polynomial degree O(1/γ)O(1/γ)O(1/γ) in the weak dissipation limit. The gap between our quantum and classical upper bounds leaves room for a substantial polynomial quantum advantage as dissipation weakens, an observation further supported by our numerical results.
Can a quantum event be certified without simulating the full quantum state? This study develops rigorous, event-specific probability bounds for constrained, finite-dimensional open quantum systems described by Gorini–Kossakowski–Sudarshan–Lindblad (GKSL) dynamics. For initially unexcited targets, locally bounded Hamiltonian transitions that change at most one target occupation, and dissipation that preserves or lowers these occupations, it proves the sharp joint-excitation envelope pA(t) ≤ ∏j∈A sin²(min{π/2, ∫₀ᵗ uj(s) ds}). Independent resonant drives attain this bound within the stated model class. Complementary rational-polynomial certificates, interaction-dependent estimates, and bounds under pumping, coherent leakage, and guaranteed loss provide checkable alternatives for finite-time and all-time reachability questions. The analysis also examines how much information a particular event actually requires, distinguishing exact observable reductions and scalar trajectories from the exponentially larger ambient state description. Positive-operator barriers and operator-Schmidt-rank constraints clarify the resources and limitations of compact certificates. For independent generalized-amplitude-damping channels, the work establishes an ancilla-stable dissipative mixing bound: ‖⊗ⱼ Φⱼ,ₜ − ⊗ⱼ Rⱼ‖⋄ ≤ min{2, ∑ⱼ(rⱼ + rⱼ²)} ≤ 2N exp(−γ*t), where rⱼ = exp(−λⱼt/2) and γ* = minⱼ(λⱼ/2). The arbitrary-finite-ancilla hybrid inequality and resulting product-channel envelope are supported by kernel-checked Lean theorems; the leading long-time diamond-norm coefficient is established analytically, not formally verified. A separate formal development checks gauge-fixed Fibonacci fusion and braiding coherence identities, including pentagon and hexagon relations, and provides an ideal braid benchmark with conditional bounds for noisy encoded implementations. Taken together, the results offer a framework for auditable quantum-event certificates, model-specific noise benchmarks, and experimentally distinguishable predictions, while keeping their scope explicit: the claims depend on specified dynamics and controls and do not establish a new conservation law, microscopic topological protection, or universal computational advantage. Natural next steps include broader machine-checked dynamical certificates and validated interfaces from experimental models to formal proof objects.
Open-system dynamics govern decoherence, transport, and engineered dissipation in quantum many-body systems. We propose a quantum algorithm for simulating time-independent, finite-range Lindblad dynamics with bounded local strength on a constant-dimensional lattice of nnn sites, allowing noncommuting jump operators. For time T≥1T\ge1T≥1 and diamond-norm error at most εεε, it has depth O(Tpolylog⁡(nT/ε))O(T\operatorname{polylog}(nT/ε))O(Tpolylog(nT/ε)) and gate count O(nTpolylog⁡(nT/ε))O(nT\operatorname{polylog}(nT/ε))O(nTpolylog(nT/ε)). These results extend the HHKL spatial decomposition to open systems. The main obstacle is that the reversible overlap corrections used for unitary dynamics have no direct analogue for dissipative channels. We overcome this by retaining the environment in a shared unitary dilation, keeping information lost from the system coherently available and making the spatial corrections reversible. We prove exponential occupation bounds for the environmental states generated by the decomposition, allowing compact representation and coherent simulation of local factors on the inputs that arise. The construction reduces each short-time evolution to a constant number of parallel layers on regions of logarithmic diameter, using nearest-neighbour gates and polylogarithmic auxiliary density. We also prove unconditional worst-case lower bounds using time-independent, purely dissipative processes that transport quantum information. For circuits with local quantum and classical communication, the lower bounds are Ω(nT)Ω(nT)Ω(nT) for the expected gate count and Ω(T)Ω(T)Ω(T) for depth on time scales up to the lattice diameter. They match the upper bounds' leading time and volume dependence up to polylogarithmic factors. At fixed time and sufficiently small fixed error, we further prove a depth lower bound of Ω(log⁡n/log⁡log⁡n)Ω(\log n/\log\log n)Ω(logn/loglogn), showing that global accuracy can require increasing depth as the lattice grows.