Double-bracket quantum algorithms for diagonalization

Abstract

This work proposes double-bracket iterations as a framework for obtaining diagonalizing quantum circuits. Their implementation on a quantum computer consists of interlacing evolutions generated by the input Hamiltonian with diagonal evolutions which can be chosen variationally. No qubit overheads or controlled-unitary operations are needed but the method is recursive which makes the circuit depth grow exponentially with the number of recursion steps. To make near-term implementations viable, the proposal includes optimization of diagonal evolution generators and of recursion step durations. Indeed, thanks to this numerical examples show that the expressive power of double-bracket iterations suffices to approximate eigenstates of relevant quantum models with few recursion steps. Compared to brute-force optimization of unstructured circuits double-bracket iterations do not suffer from the same trainability limitations. Moreover, with an implementation cost lower than required for quantum phase estimation they are more suitable for near-term quantum computing experiments. More broadly, this work opens a pathway for constructing purposeful quantum algorithms based on so-called double-bracket flows also for tasks different from diagonalization and thus enlarges the quantum computing toolkit geared towards practical physics problems.

arXiv commentManuscript accepted in Quantum. Minor finalization changes

References in corpus (42)

• Noisy intermediate-scale quantum (NISQ) algorithms
• Quantum Coherence as a Resource
• Quantum Amplitude Amplification and Estimation
• Hamiltonian Simulation by Qubitization
• Real-time dynamics of lattice gauge theories with a few-qubit quantum computer
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Hartree-Fock on a superconducting qubit quantum computer
• Area laws in quantum systems: mutual information and correlations
• Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution
• Self-Verifying Variational Quantum Simulation of the Lattice Schwinger Model
• Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics
• A Theory of Trotter Error
• Direct Fidelity Estimation from Few Pauli Measurements
• Training variational quantum algorithms is NP-hard
• Quantum Metropolis Sampling
• Gate count estimates for performing quantum chemistry on small quantum computers
• Variational Fast Forwarding for Quantum Simulation Beyond the Coherence Time
• Sampling from the thermal quantum Gibbs state and evaluating partition functions with a quantum computer
• Optimal Quantum Measurements of Expectation Values of Observables
• Variational Quantum State Diagonalization
• Heisenberg-limited ground state energy estimation for early fault-tolerant quantum computers
• Nearly optimal lattice simulation by product formulas
• Near-optimal ground state preparation
• Dynamical decoupling for superconducting qubits: a performance survey
• Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices
• Geometric Optimization Methods for Adaptive Filtering
• Qibo: a framework for quantum simulation with hardware acceleration
• Fixed points of Wegner-Wilson flows and many-body localization
• Quasi-Locality Bounds for Quantum Lattice Systems. Part I. Lieb-Robinson Bounds, Quasi-Local Maps, and Spectral Flow Automorphisms
• Universal eigenstate entanglement of chaotic local Hamiltonians
• Quantum Error Correcting Codes in Eigenstates of Translation-Invariant Spin Chains
• Time evolution of correlation functions in quantum many-body systems
• Flow Equations and Normal Ordering. A Survey
• Quantum simulation of thermodynamics in an integrated quantum photonic processor
• Optimizing quantum circuits with Riemannian gradient flow
• Eigenstate thermalization from the clustering property of correlation
• Efficient Product Formulas for Commutators and Applications to Quantum Simulation
• Local Integrals of Motion in Quasiperiodic Many-Body Localized Systems
• A variational quantum algorithm for Hamiltonian diagonalization
• The Solovay-Kitaev algorithm
• Limitations on the simulation of non-sparse Hamiltonians
• Theory of polarization-averaged core-level molecular-frame photoelectron angular distributions: III. New formula for p- and s-wave interference analogous to Young's double-slit for core-level photoemission from hetero-diatomic molecules

Cited by in corpus (8)

• Early Fault-Tolerant Quantum Algorithms in Practice: Application to Ground-State Energy Estimation
• Double-bracket quantum algorithms for quantum imaginary-time evolution
• Quantum Dynamic Programming
• Sample-based Hamiltonian and Lindbladian simulation: Non-asymptotic analysis of sample complexity
• Double-bracket algorithm for quantum signal processing without post-selection
• Double-Bracket Master Equations: Phase-Space Representation and Classical Limit
• Role of Riemannian geometry in double-bracket quantum imaginary-time evolution
• Double-bracket quantum algorithms for high-fidelity ground state preparation