Fast-forwardable Lindbladians imply quantum phase estimation

• URL: http://arxiv.org/abs/2510.06759v1
• Date: Wed, 08 Oct 2025 08:36:46 GMT
• Title: Fast-forwardable Lindbladians imply quantum phase estimation
• Authors: Zhong-Xia Shang, Naixu Guo, Patrick Rebentrost, Alán Aspuru-Guzik, Tongyang Li, Qi Zhao,
• Abstract summary: We show that certain simple Lindbladian processes can be adapted to perform QPE-type tasks.<n>Unlike QPE, which achieves Heisenberg-limit scaling, these Lindbladian evolutions are restricted to standard quantum limit complexity.<n>This indicates that, different from Hamiltonian dynamics, the natural dissipative evolution speed of such Lindbladians does not saturate the fundamental quantum limit.
• Score: 26.310568727393758
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum phase estimation (QPE) and Lindbladian dynamics are both foundational in quantum information science and central to quantum algorithm design. In this work, we bridge these two concepts: certain simple Lindbladian processes can be adapted to perform QPE-type tasks. However, unlike QPE, which achieves Heisenberg-limit scaling, these Lindbladian evolutions are restricted to standard quantum limit complexity. This indicates that, different from Hamiltonian dynamics, the natural dissipative evolution speed of such Lindbladians does not saturate the fundamental quantum limit, thereby suggesting the potential for quadratic fast-forwarding. We confirm this by presenting a quantum algorithm that simulates these Lindbladians for time $t$ within an error $\varepsilon$ using $\mathcal{O}\left(\sqrt{t\log(\varepsilon^{-1})}\right)$ cost, whose mechanism is fundamentally different from the fast-forwarding examples of Hamiltonian dynamics. As a bonus, this fast-forwarded simulation naturally serves as a new Heisenberg-limit QPE algorithm. Therefore, our work explicitly bridges the standard quantum limit-Heisenberg limit transition to the fast-forwarding of dissipative dynamics. We also adopt our fast-forwarding algorithm for efficient Gibbs state preparation and demonstrate the counter-intuitive implication: the allowance of a quadratically accelerated decoherence effect under arbitrary Pauli noise.

Related papers

• An Analytic Theory of Quantum Imaginary Time Evolution [12.82619168949495]
  Quantum imaginary time evolution (QITE) algorithm is one of the most promising variational quantum algorithms (VQAs)<n>Here, we show that QITE can be interpreted as a form of a general VQA trained with Quantum Natural Gradient Descent (QNGD)<n>We prove that QITE always converges faster than GD-based VQA, though this advantage is suppressed by the exponential growth of Hilbert space dimension.
  arXiv  Detail & Related papers  (2025-10-26T01:43:55Z)
• Average-case quantum complexity from glassiness [45.57609001239456]
  Glassiness -- a phenomenon in physics characterized by a rough free-energy landscape -- implies hardness for stable classical algorithms.<n>We prove that the standard notion of quantum glassiness based on replica symmetry breaking obstructs stable quantum algorithms for Gibbs sampling.
  arXiv  Detail & Related papers  (2025-10-09T17:37:33Z)
• Quantum neural ordinary and partial differential equations [38.77776626953413]
  We present a unified framework that brings the continuous-time formalism of classical neural ODEs/PDEs into quantum machine learning and quantum control.<n>We define QNODEs as the evolution of finite-dimensional quantum systems, and QNPDEs as infinite-dimensional (continuous-variable) counterparts.
  arXiv  Detail & Related papers  (2025-08-24T18:43:44Z)
• Topological control of quantum speed limits [55.2480439325792]
  We show that even if the quantum state is completely dispersionless, QFI in this state remains momentum-resolved.<n>We find bounds on quantum speed limit which scales as $sqrt|C|$ in a (dispersionless) topological phase.
  arXiv  Detail & Related papers  (2025-07-21T18:00:07Z)
• QAMA: Scalable Quantum Annealing Multi-Head Attention Operator for Deep Learning [48.12231190677108]
  Quantum Annealing Multi-Head Attention (QAMA) is proposed, a novel drop-in operator that reformulates attention as an energy-based Hamiltonian optimization problem.<n>In this framework, token interactions are encoded into binary quadratic terms, and quantum annealing is employed to search for low-energy configurations.<n> Empirically, evaluation on both natural language and vision benchmarks shows that, across tasks, accuracy deviates by at most 2.7 points from standard multi-head attention.
  arXiv  Detail & Related papers  (2025-04-15T11:29:09Z)
• Correcting and extending Trotterized quantum many-body dynamics [0.0]
  We develop a hybrid ansatz that combines the strengths of quantum and classical methods.<n>We show how this hybrid ansatz can avoid SWAP gates in the quantum circuit.<n>We also show how it can extend the system size while keeping the number of qubits on the quantum device constant.
  arXiv  Detail & Related papers  (2025-02-19T14:50:12Z)
• Quantum Dissipative Search via Lindbladians [0.0]
  We analyze a purely dissipative quantum random walk on an unstructured classical search space.<n>We show that certain jump operators make the quantum process replicate a classical one, while others yield differences between open quantum (OQRW) and classical random walks.<n>We also clarify a previously observed quadratic speedup, demonstrating that OQRWs are no more efficient than classical search.
  arXiv  Detail & Related papers  (2024-07-16T14:39:18Z)
• Orthogonality catastrophe and quantum speed limit for dynamical quantum phase transition [3.8018284259144344]
  We show that exact zeros of the Loschmidt echo can exist in finite-size systems for specific discrete values. We find the possibility of using the quantum speed limit to detect the critical point of a static quantum phase transition.
  arXiv  Detail & Related papers  (2023-08-09T03:48:06Z)
• Quantum Thermal State Preparation [39.91303506884272]
  We introduce simple continuous-time quantum Gibbs samplers for simulating quantum master equations. We construct the first provably accurate and efficient algorithm for preparing certain purified Gibbs states. Our algorithms' costs have a provable dependence on temperature, accuracy, and the mixing time.
  arXiv  Detail & Related papers  (2023-03-31T17:29:56Z)
• Universality of critical dynamics with finite entanglement [68.8204255655161]
  We study how low-energy dynamics of quantum systems near criticality are modified by finite entanglement. Our result establishes the precise role played by entanglement in time-dependent critical phenomena.
  arXiv  Detail & Related papers  (2023-01-23T19:23:54Z)
• Probing finite-temperature observables in quantum simulators of spin systems with short-time dynamics [62.997667081978825]
  We show how finite-temperature observables can be obtained with an algorithm motivated from the Jarzynski equality. We show that a finite temperature phase transition in the long-range transverse field Ising model can be characterized in trapped ion quantum simulators.
  arXiv  Detail & Related papers  (2022-06-03T18:00:02Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Efficient simulation of sparse Markovian quantum dynamics [13.996412562440891]
  We give the first efficient quantum algorithms for simulating Markovian quantum dynamics generated by Lindbladians that are not necessarily local. First, we show how to simulate Lindbladians that act within small invariant subspaces using a quantum algorithm to implement sparse Stinespring isometries. Second, we develop a method for simulating sparse Lindblad operators by concatenating a sequence of short-time evolutions.
  arXiv  Detail & Related papers  (2016-11-17T02:55:26Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.