Ground state preparation and energy estimation on early fault-tolerant quantum computers via quantum eigenvalue transformation of unitary matrices

by   Yulong Dong, et al.

Under suitable assumptions, the algorithms in [Lin, Tong, Quantum 2020] can estimate the ground state energy and prepare the ground state of a quantum Hamiltonian with near-optimal query complexities. However, this is based on a block encoding input model of the Hamiltonian, whose implementation is known to require a large resource overhead. We develop a tool called quantum eigenvalue transformation of unitary matrices with real polynomials (QET-U), which uses a controlled Hamiltonian evolution as the input model, a single ancilla qubit and no multi-qubit control operations, and is thus suitable for early fault-tolerant quantum devices. This leads to a simple quantum algorithm that outperforms all previous algorithms with a comparable circuit structure for estimating the ground state energy. For a class of quantum spin Hamiltonians, we propose a new method that exploits certain anti-commutation relations and further removes the need of implementing the controlled Hamiltonian evolution. Coupled with Trotter based approximation of the Hamiltonian evolution, the resulting algorithm can be very suitable for early fault-tolerant quantum devices. We demonstrate the performance of the algorithm using IBM Qiskit for the transverse field Ising model. If we are further allowed to use multi-qubit Toffoli gates, we can then implement amplitude amplification and a new binary amplitude estimation algorithm, which increases the circuit depth but decreases the total query complexity. The resulting algorithm saturates the near-optimal complexity for ground state preparation and energy estimating using a constant number of ancilla qubits (no more than 3).


page 1

page 2

page 3

page 4


Algebraic Compression of Quantum Circuits for Hamiltonian Evolution

Unitary evolution under a time dependent Hamiltonian is a key component ...

Implementing Linear Combination of Unitaries on Intermediate-term Quantum Computers

Over the years, the framework of Linear combination of unitaries (LCU) h...

Dense outputs from quantum simulations

The quantum dense output problem is the process of evaluating time-accum...

Direct Application of the Phase Estimation Algorithm to Find the Eigenvalues of the Hamiltonians

The eigenvalue of a Hamiltonian, H, can be estimated through the phase e...

A Generalized Circuit for the Hamiltonian Dynamics Through the Truncated Series

In this paper, we present a fixed-quantum circuit design for the simulat...

Near-optimal ground state preparation

Preparing the ground state of a given Hamiltonian and estimating its gro...

On the complexity of implementing Trotter steps

Quantum dynamics can be simulated on a quantum computer by exponentiatin...

Please sign up or login with your details

Forgot password? Click here to reset