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

Bulletin of the American Physical Society

Approaching the Heisenberg Limit with a time-reversal Hamiltonian

Edwin Pedrozo-Peñafiel, Simone Colombo, Albert F. Adiyatullin, Chi Shu, Zeyang Li, Enrique Mendez, Vladan Vuletić

Published Jun 1, 2021• 0 citations
OpenAlex

Related papers

Approaching the Heisenberg Limit Without Single-Particle Detection

Gregory S. Bentsen, Emily J. Davis, Monika Schleier-Smith

Bulletin of the American Physical Society•May 25, 2016•0 citations

The power of time reversal in Hamiltonian property testing

Richard R. Allen, Matthias C. Caro, Yanlin Chen +2 more

Quantum algorithms enable Heisenberg-limited scaling across many tasks in sensing and learning, achieving precision $\varepsilon$ using $O(1/\varepsilon)$ total evolution time. However, in Hamiltonian property testing, the best known algorithms have $O(1/\varepsilon^2)$ total evolution time, unless it is possible to $\textit{reverse}$ the flow of time under the Hamiltonian. In this work, we prove that time reversal is necessary to close this gap. We establish evolution time lower bounds for Hamiltonian certification and locality testing, for a continuous family of error metrics ranging from average- to worst-case. We also prove matching upper bounds for Hamiltonian certification in all cases, both with and without time reversal, showing that the advantage from time reversal persists. Our results follow from a new Fourier-analytic approach to quantum lower bounds in continuous time, which is sensitive to time reversal and applicable beyond Hamiltonian property testing. This gives an alternative proof that inverses are required for amplitude amplification and estimation, improving the lower bounds of Tang and Wright and extending to fractional queries. We also show that, for unstructured search, uncertainty in the phase of the oracle destroys the quantum speedup without inverse queries, even when the oracle is fixed and coherent. Our work rigorously establishes time reversal as a resource governing both the precision of quantum measurement and the robustness of quantum algorithms.

quant-pharXiv:2610.04996•Oct 6, 2026•0 citations

On the spectrum of the Heisenberg Hamiltonian

Claudio Albanese

Journal of Statistical Physics•Apr 1, 1989•18 citations

Phase amplification via synthetic two-axis-twisting echo from interaction-fixed one-axis twisting

Jihao Ma, Jungeng Zhou, Jiahao Huang +1 more

One-axis twisting (OAT) and two-axis twisting (TAT) are well-known methods for achieving entanglement-enhanced quantum metrology, and their time-reversal echo offers a potent tool for approaching the Heisenberg limit even with detection noise. However, flipping the sign of interaction to implement the time-reversal echo is generally challenging. Here, we propose an echo protocol based on synthetic TAT from interaction-fixed OAT in a pseudospin-1/2 ensemble to achieve time-reversal quantum metrology. By applying modulation pulses around two different orthogonal directions, the effective TAT and its echo can be realized without changing the interaction. We demonstrate that this protocol not only outperforms the OAT echo scheme in both metrological gain and evolution time but is also robust against detection noise. Our protocol presents a TAT echo scheme that effectively avoids flipping the sign of interaction, providing a viable method for improving precision and robustness of quantum metrology.

Physical Review A•Aug 5, 2024•5 citations

Heisenberg Hamiltonian

Marek S. Wartak, Ching-Yao Fong

SPIE eBooks•Jan 4, 2019•1 citation

Near-Heisenberg-limit Quantum Computing

Frank Z. Wang

Quantum computing is fundamentally limited by the Planck constant ( \(h = 6.63\ \times {{10}^{ - 34}}\ J \cdot s\) ) through the Heisenberg Limit. The energy consumption over a given time, or the speed of processing information with a specific energy budget, is a core research focus in quantum computing. To date, the smallest action (the energy-time cost) achieved is approximately \({{10}^{ - 29}}J \cdot s\) , using a giant spin qubit composed of 20 spins. In our study, we achieved an action of \(1.66\ \times {{10}^{ - 34}}\ J \cdot s\) to reversibly manipulate a single spin qubit through a spin-spin magnetic interaction experiment. By adhering to the principle of least action, our theoretical and experimental results establish the minimal action required. Our findings highlight the potential of spin-qubit quantum computers as accelerators for computation-intensive applications, such as AI and Post-Quantum Cryptography, since they exhibit several unique advantages: 1. High energy efficiency (by approaching the Heisenberg limit as well as the Landauer bound); 2. High-density integration (with just an atom/ion per qubit); 3. Long coherence times (tens of seconds); 4. High-fidelity (98%); and 5. Fault tolerance (through decoherence-free subspaces).

ACM Transactions on Quantum Computing•Sep 30, 2025•0 citations
Quantum algorithms enable Heisenberg-limited scaling across many tasks in sensing and learning, achieving precision ε\varepsilonε using O(1/ε)O(1/\varepsilon)O(1/ε) total evolution time. However, in Hamiltonian property testing, the best known algorithms have O(1/ε2)O(1/\varepsilon^2)O(1/ε2) total evolution time, unless it is possible to reverse\textit{reverse}reverse the flow of time under the Hamiltonian. In this work, we prove that time reversal is necessary to close this gap. We establish evolution time lower bounds for Hamiltonian certification and locality testing, for a continuous family of error metrics ranging from average- to worst-case. We also prove matching upper bounds for Hamiltonian certification in all cases, both with and without time reversal, showing that the advantage from time reversal persists. Our results follow from a new Fourier-analytic approach to quantum lower bounds in continuous time, which is sensitive to time reversal and applicable beyond Hamiltonian property testing. This gives an alternative proof that inverses are required for amplitude amplification and estimation, improving the lower bounds of Tang and Wright and extending to fractional queries. We also show that, for unstructured search, uncertainty in the phase of the oracle destroys the quantum speedup without inverse queries, even when the oracle is fixed and coherent. Our work rigorously establishes time reversal as a resource governing both the precision of quantum measurement and the robustness of quantum algorithms.
One-axis twisting (OAT) and two-axis twisting (TAT) are well-known methods for achieving entanglement-enhanced quantum metrology, and their time-reversal echo offers a potent tool for approaching the Heisenberg limit even with detection noise. However, flipping the sign of interaction to implement the time-reversal echo is generally challenging. Here, we propose an echo protocol based on synthetic TAT from interaction-fixed OAT in a pseudospin-1/2 ensemble to achieve time-reversal quantum metrology. By applying modulation pulses around two different orthogonal directions, the effective TAT and its echo can be realized without changing the interaction. We demonstrate that this protocol not only outperforms the OAT echo scheme in both metrological gain and evolution time but is also robust against detection noise. Our protocol presents a TAT echo scheme that effectively avoids flipping the sign of interaction, providing a viable method for improving precision and robustness of quantum metrology.
Quantum computing is fundamentally limited by the Planck constant ( h=6.63 ×10−34 J⋅sh = 6.63\ \times {{10}^{ - 34}}\ J \cdot sh=6.63 ×10−34 J⋅s ) through the Heisenberg Limit. The energy consumption over a given time, or the speed of processing information with a specific energy budget, is a core research focus in quantum computing. To date, the smallest action (the energy-time cost) achieved is approximately 10−29J⋅s{{10}^{ - 29}}J \cdot s10−29J⋅s , using a giant spin qubit composed of 20 spins. In our study, we achieved an action of 1.66 ×10−34 J⋅s1.66\ \times {{10}^{ - 34}}\ J \cdot s1.66 ×10−34 J⋅s to reversibly manipulate a single spin qubit through a spin-spin magnetic interaction experiment. By adhering to the principle of least action, our theoretical and experimental results establish the minimal action required. Our findings highlight the potential of spin-qubit quantum computers as accelerators for computation-intensive applications, such as AI and Post-Quantum Cryptography, since they exhibit several unique advantages: 1. High energy efficiency (by approaching the Heisenberg limit as well as the Landauer bound); 2. High-density integration (with just an atom/ion per qubit); 3. Long coherence times (tens of seconds); 4. High-fidelity (98%); and 5. Fault tolerance (through decoherence-free subspaces).