Challenges
Datasets
Workspaces
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice
Research Papers

Research Papers

Share and discuss quantum computing research

last post 27d ago by aqora_bot
Aqora Botaqora_bot

1

Posted 11mo ago

Exponential Lindbladian fast forwarding and exponential amplification of certain Gibbs state properties

External link
Zhong-Xia Shang, Dong An, Changpeng Shao (Sep 12 2025).
Abstract: We investigate Lindbladian fast-forwarding and its applications to estimating Gibbs state properties. Fast-forwarding refers to the ability to simulate a system of time ttt using significantly fewer than ttt queries or circuit depth. While various Hamiltonian systems are known to circumvent the no fast-forwarding theorem, analogous results for dissipative dynamics, governed by Lindbladians, remain largely unexplored. We first present a quantum algorithm for simulating purely dissipative Lindbladians with unitary jump operators, achieving additive query complexity O(t+log⁡(ε−1)log⁡log⁡(ε−1)) \mathcal{O}\left(t + \frac{\log(\varepsilon^{-1})}{\log\log(\varepsilon^{-1})}\right)O(t+loglog(ε−1)log(ε−1)​) up to error~ε\varepsilonε, improving previous algorithms. When the jump operators have certain structures (i.e., block-diagonal Paulis), the algorithm can be modified to achieve exponential fast-forwarding, attaining circuit depth O(log⁡(t+log⁡(ε−1)log⁡log⁡(ε−1)))\mathcal{O}\left(\log\left(t + \frac{\log(\varepsilon^{-1})}{\log\log(\varepsilon^{-1})}\right)\right)O(log(t+loglog(ε−1)log(ε−1)​)), while preserving query complexity. Using these fast-forwarding techniques, we develop a quantum algorithm for estimating Gibbs state properties of the form ⟨ψ1∣e−β(H+I)∣ψ2⟩\langle \psi_1 | e^{-\beta(H + I)} | \psi_2 \rangle⟨ψ1​∣e−β(H+I)∣ψ2​⟩, up to additive error ϵ\epsilonϵ, with HHH the Hamiltonian and β\betaβ the inverse temperature. For input states exhibiting certain coherence conditions -- e.g.,~⟨0∣⊗ne−β(H+I)∣+⟩⊗n\langle 0|^{\otimes n} e^{-\beta(H + I)} |+\rangle^{\otimes n}⟨0∣⊗ne−β(H+I)∣+⟩⊗n -- our method achieves exponential improvement in complexity (measured by circuit depth), O(2−n/2ϵ−1log⁡β),\mathcal{O} (2^{-n/2} \epsilon^{-1} \log \beta ),O(2−n/2ϵ−1logβ), compared to the quantum singular value transformation-based approach, with complexity O~(ϵ−1β)\tilde{\mathcal{O}} (\epsilon^{-1} \sqrt{\beta} )O~(ϵ−1β​). For general ∣ψ1⟩| \psi_1 \rangle∣ψ1​⟩ and ∣ψ2⟩| \psi_2 \rangle∣ψ2​⟩, we also show how the level of improvement is changed with the coherence resource in ∣ψ1⟩| \psi_1 \rangle∣ψ1​⟩ and ∣ψ2⟩| \psi_2 \rangle∣ψ2​⟩.
Arxiv: https://arxiv.org/abs/2509.09517

Order by:

Want to join this discussion?

Join our community today and start discussing with our members by participating in exciting events, competitions, and challenges. Sign up now to engage with quantum experts!

LoginSign up