Improved resource-tunable near-term quantum algorithms for transition probabilities, with applications in physics and variational quantum linear algebra

  title={Improved resource-tunable near-term quantum algorithms for transition probabilities, with applications in physics and variational quantum linear algebra},
  author={Nicolas PD Sawaya and Joon Hyuk Huh},
Transition amplitudes and transition probabilities are relevant to many areas of physics simulation, including the calculation of response properties and correlation functions. These quantities are also closely related to solving linear systems of equations in quantum linear algebra. Here we present three related algorithms for calculating transition probabilities with respect to arbitrary operators and states. First, we extend a previously published short-depth algorithm, allowing for the two… 

Figures and Tables from this paper



Resource-efficient digital quantum simulation of d-level systems for photonic, vibrational, and spin-s Hamiltonians

Simulation of quantum systems is expected to be one of the most important applications of quantum computing, with much of the theoretical work so far having focused on fermionic and

Determining eigenstates and thermal states on a quantum computer using quantum imaginary time evolution

The quantum imaginary time evolution and Lanczos algorithms offer a resource-efficient way to compute ground or excited states of target Hamiltonians on quantum computers, and offers promise for quantum simulation on near-term noisy devices.

Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics

A new “Quantum singular value transformation” algorithm is developed that can directly harness the advantages of exponential dimensionality by applying polynomial transformations to the singular values of a block of a unitary operator.

A non-orthogonal variational quantum eigensolver

An extension to the variational quantum eigensolver that approximates the ground state of a system by solving a generalized eigenvalue problem in a subspace spanned by a collection of parametrized quantum states is presented, allowing for the systematic improvement of a logical wavefunction ansatz without a significant increase in circuit complexity.

The theory of variational hybrid quantum-classical algorithms

The concept of quantum variational error suppression that allows some errors to be suppressed naturally in this algorithm on a pre-threshold quantum device is introduced and the use of modern derivative free optimization techniques can offer dramatic computational savings of up to three orders of magnitude over previously used optimization techniques.

Quantum algorithm for nonhomogeneous linear partial differential equations

We describe a quantum algorithm for preparing states that encode solutions of non-homogeneous linear partial differential equations. The algorithm is a continuous-variable version of matrix

Variational Quantum Algorithms

An overview of the field of Variational Quantum Algorithms is presented and strategies to overcome their challenges as well as the exciting prospects for using them as a means to obtain quantum advantage are discussed.

Analog Quantum Simulation of Non-Condon Effects in Molecular Spectroscopy

In this work, we present a linear optical implementation for analog quantum simulation of molecular vibronic spectra, incorporating the non-Condon scattering operation with a quadratically small

Variational quantum algorithms for discovering Hamiltonian spectra

Calculating the energy spectrum of a quantum system is an important task, for example to analyse reaction rates in drug discovery and catalysis. There has been significant progress in developing

Near-term quantum algorithms for linear systems of equations with regression loss functions

This work designs near-term quantum algorithms for linear systems of equations based on the classical combination of variational quantum states (CQS), and exhibits several provable guarantees for these algorithms, supported by the representation of the linear system on a so-called ansatz tree.