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.

Manuscript accepted in Quantum. Minor finalization changes

References in corpus (9)

• Simulating Hamiltonian dynamics with a truncated Taylor series
• Area laws in quantum systems: mutual information and correlations
• Direct Fidelity Estimation from Few Pauli Measurements
• Optimal Quantum Measurements of Expectation Values of Observables
• 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
• Quantum simulation of thermodynamics in an integrated quantum photonic processor
• Optimizing quantum circuits with Riemannian gradient flow
• The Solovay-Kitaev algorithm

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