A quantum double-bracket algorithm for imaginary-time evolution with exponentially shorter depth

arXiv:2609.37095 · quant-ph · Submitted 2026-09-29 · Read on arXiv

quant-ph

Submitted: 2026-09-29

Updated: 2026-09-29

Terminology

• Accuracy — 17× in this paper · explained in 1 episode
• Fidelity — 6× in this paper · explained in 2 episodes
• Benchmark — 5× in this paper · explained in 2 episodes
• Quantum Circuits — 4× in this paper · explained in 2 episodes
• Fisher Information — 3× in this paper · explained in 3 episodes
• Maximum Independent Set — 3× in this paper
• Post-Selection — 3× in this paper · explained in 2 episodes
• Ancilla Qubits — 2× in this paper · explained in 1 episode
• Block Encoding — 2× in this paper · explained in 4 episodes
• Combinatorial Optimization — 2× in this paper · explained in 2 episodes
• Adam — 1× in this paper · explained in 2 episodes
• Ancillary Qubits — 1× in this paper · explained in 1 episode
• Gradient Flow — 1× in this paper · explained in 2 episodes
• Graph Neural Network (GNN) — 1× in this paper · explained in 3 episodes
• Hybrid Approach — 1× in this paper · explained in 4 episodes
• Quantization — 1× in this paper · explained in 12 episodes
• Robustness — 1× in this paper · explained in 5 episodes
• Spectral Gap — 1× in this paper · explained in 5 episodes
• Unitary Dynamics — 1× in this paper · explained in 2 episodes

Sources

• Quantum-Enhanced Optimization by Warm Starts
• Quantum speedups in solving near-symmetric optimization problems by low-depth QAOA
• Regularized Warm-Started Quantum Approximate Optimization and Conditions for Surpassing Classical Solvers on the Max-Cut Problem
• Securing Elliptic Curve Cryptocurrencies against Quantum Vulnerabilities: Resource Estimates and Mitigations
• Programmable digital quantum simulation of 2D Fermi-Hubbard dynamics using 72 superconducting qubits
• Fermionic dynamics on a trapped-ion quantum computer beyond exact classical simulation
• Quantum Imaginary-Time Evolution with Polynomial Resources in Evolution Time
• Hamiltonian Simulation Using Linear Combinations of Unitary Operations
• Simulating non-unitary dynamics using quantum signal processing with unitary block encoding
• A probabilistic imaginary-time evolution quantum algorithm for advection-diffusion equation: Explicit gate-level implementation and comparisons to quantum linear system algorithms
• Grover's algorithm is an approximation of imaginary-time evolution
• Equating quantum imaginary time evolution, Riemannian gradient flows, and stochastic implementations
• Observation of Improved Accuracy over Classical Sparse Ground-State Solvers using a Quantum Computer
• Symmetry-based perturbation theory for electronic structure calculations
• A Quantum Approximate Optimization Algorithm
• Deterministic Ground State Preparation via Power-Cosine Filtering of Time Evolution Operators
• Multiple-time Quantum Imaginary Time Evolution
• Operator-Projected Variational Quantum Imaginary Time Evolution
• Role of Riemannian geometry in double-bracket quantum imaginary-time evolution
• Double-bracket quantum algorithms for high-fidelity ground state preparation

Related papers

• Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Polynomial-time classical and quantum simulation of quantum impurity models
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
• Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity