Fragmented imaginary-time evolution for early-stage quantum signal processors

Abstract

Simulating quantum imaginary-time evolution (QITE) is a major promise of quantum computation. However, the known algorithms are either probabilistic (repeat until success) with impractically small success probabilities or coherent (quantum amplitude amplification) but with circuit depths and ancillary-qubit numbers unrealistically large in the mid term. Our main contribution is a new generation of deterministic, high-precision QITE algorithms significantly more amenable experimentally. These are based on a surprisingly simple idea: partitioning the evolution into several fragments that are sequentially run probabilistically. This causes a huge reduction in wasted circuit depth every time a run fails. Indeed, the resulting overall runtime is asymptotically better than in coherent approaches and the hardware requirements even milder than in probabilistic ones, remarkably. More technically, we present two QITE-circuit sub-routines with excellent complexity scalings. One of them is optimal in ancillary-qubit overhead (one single ancillary qubit throughout) whereas the other one is optimal in runtime for small inverse temperature or high precision. The latter is shown by noting that the runtime saturates a cooling-speed limit that is the imaginary-time counterpart of the no fast-forwarding theorem of real-time simulations, which we prove. Moreover, we also make two technical contributions to the quantum signal processing formalism for operator-function synthesis (on which our sub-routines are based) that are useful beyond QITE. Our findings are specially relevant for the early fault-tolerance stages of quantum hardware.

Full rigorous proof that fragmented QITE outperforms coherent QITE for general Hamiltonians added

References in corpus (6)

• Simulating Hamiltonian dynamics with a truncated Taylor series
• Efficient step-merged quantum imaginary time evolution algorithm for quantum chemistry
• One qubit as a Universal Approximant
• Preparing thermal states of quantum systems by dimension reduction
• Quantum imaginary time evolution steered by reinforcement learning
• Fragmented imaginary-time evolution for early-stage quantum signal processors

Cited by in corpus (18)

• Fragmented imaginary-time evolution for early-stage quantum signal processors
• Quantum state preparation for multivariate functions
• Double-bracket quantum algorithms for quantum imaginary-time evolution
• Halving the Cost of Quantum Algorithms with Randomization
• First-quantized adiabatic time evolution for the ground state of a many-electron system and the optimal nuclear configuration
• Gate-based quantum simulation of Gaussian bosonic circuits on exponentially many modes
• Randomized semi-quantum matrix processing
• Exact block encoding of imaginary time evolution with universal quantum neural networks
• Quantum simulation of the phase transition of the massive Thirring model
• Double-bracket algorithm for quantum signal processing without post-selection
• Quantum circuits for partial differential equations in Fourier space
• Quantum many-body simulation of finite-temperature systems with sampling a series expansion of a quantum imaginary-time evolution
• Quantum Computing Beyond Ground State Electronic Structure: A Review of Progress Toward Quantum Chemistry Out of the Ground State
• Scalable Quantum Computational Science: A Perspective from Block-Encodings and Polynomial Transformations
• Gibbs state sampling via cluster expansions
• Role of Riemannian geometry in double-bracket quantum imaginary-time evolution
• Beyond asymptotic reasoning: the practicalities of a quantum ground state projector based on the wall-Chebyshev expansion
• Quantum Imaginary-Time Evolution with Polynomial Resources in Evolution Time