Corpus ID: 221516284

Variational Hamiltonian Diagonalization for Dynamical Quantum Simulation

  title={Variational Hamiltonian Diagonalization for Dynamical Quantum Simulation},
  author={Benjamin Commeau and M Cerezo and Zoe Holmes and Lukasz Cincio and Patrick J. Coles and Andrew T. Sornborger},
  journal={arXiv: Quantum Physics},
Dynamical quantum simulation may be one of the first applications to see quantum advantage. However, the circuit depth of standard Trotterization methods can rapidly exceed the coherence time of noisy quantum computers. This has led to recent proposals for variational approaches to dynamical simulation. In this work, we aim to make variational dynamical simulation even more practical and near-term. We propose a new algorithm called Variational Hamiltonian Diagonalization (VHD), which… Expand

Figures from this paper

An efficient quantum algorithm for the time evolution of parameterized circuits
A novel hybrid algorithm to simulate the real-time evolution of quantum systems using parameterized quantum circuits realizes an iterative, global projection of the exact time evolution onto the parameterized manifold, equivalent to the McLachlan's variational principle. Expand
Variational Quantum Algorithms for Trace Distance and Fidelity Estimation
This work introduces hybrid quantum-classical algorithms for practical distance measure estimation on near-term quantum devices and shows that local measurement results can extract the desired spectrum information of any Hermitian matrix. Expand
Experimental quantum learning of a spectral decomposition
Currently available quantum hardware allows for small scale implementations of quantum machine learning algorithms. Such experiments aid the search for applications of quantum computers byExpand
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. Expand
General parameter-shift rules for quantum gradients
Variational quantum algorithms are ubiquitous in applications of noisy intermediatescale quantum computers. Due to the structure of conventional parametrized quantum gates, the evaluated functionsExpand
Overlapped grouping measurement: A unified framework for measuring quantum states
Quantum algorithms designed for noisy intermediate-scale quantum devices usually require repeatedly perform a large number of quantum measurements in estimating observable expectation values of aExpand
Absence of Barren Plateaus in Quantum Convolutional Neural Networks
This work rigorously analyze the gradient scaling for the parameters in the QCNN architecture and finds that the variance of the gradient vanishes no faster than polynomially, implying that QCNNs do not exhibit barren plateaus. Expand
Can Error Mitigation Improve Trainability of Noisy Variational Quantum Algorithms?
This work shows that, for a broad class of EM strategies, exponential cost concentration cannot be resolved without committing exponential resources elsewhere, and finds numerical evidence that Clifford Data Regression (CDR) can aid the training process in certain settings where cost concentration is not too severe. Expand
Barren Plateaus Preclude Learning Scramblers.
A no-go theorem for learning an unknown scrambling process with QML is proved, showing that it is highly probable for any variational Ansatz to have a barren plateau landscape, i.e., cost gradients that vanish exponentially in the system size. Expand
Adaptive shot allocation for fast convergence in variational quantum algorithms
This paper presents a probabilistic simulation of the response of the Higgs boson to a proton-proton collision and shows clear patterns in the responses of the immune system to these collisions. Expand


Theory of variational quantum simulation
This work completes the theory of variational quantum simulation of general real and imaginary time evolution and it is applicable to near-term quantum hardware. Expand
Variational quantum state diagonalization
Variational hybrid quantum-classical algorithms are promising candidates for near-term implementation on quantum computers. In these algorithms, a quantum computer evaluates the cost of a gateExpand
Variational Quantum Simulation of General Processes.
The algorithm for generalized time evolution provides a unified framework for variational quantum simulation and shows its application in solving linear systems of equations and matrix-vector multiplications by converting these algebraic problems into generalizedTime evolution. Expand
Subspace Variational Quantum Simulator
Quantum simulation is one of the key applications of quantum computing, which can accelerate research and development in chemistry, material science, etc. Here, we propose an efficient method toExpand
The theory of variational hybrid quantum-classical algorithms
Many quantumalgorithms have daunting resource requirements when compared towhat is available today. To address this discrepancy, a quantum-classical hybrid optimization scheme known as ‘theExpand
Variational consistent histories as a hybrid algorithm for quantum foundations
A variational hybrid quantum-classical algorithm for finding consistent histories, which should revitalize interest in this formalism by allowing classically impossible calculations to be performed. Expand
Hardware-efficient fermionic simulation with a cavity–QED system
This work shows how one can use a cavity–QED system to perform digital quantum simulation of fermionic models with qubits, and shows that highly nonlocal Jordan–Wigner or Bravyi–Kitaev transformations can be efficiently implemented through a hardware approach. Expand
Quantum-assisted quantum compiling
This work proposes a variational hybrid quantum-classical algorithm called quantum-assisted quantum compiling (QAQC), and presents both gradient-free and gradient-based approaches to minimizing the cost of this algorithm's cost. Expand
Efficient quantum circuits for diagonal unitaries without ancillas
The accurate evaluation of diagonal unitary operators is often the most resource-intensive element of quantum algorithms such as real-space quantum simulation and Grover search. Efficient circuitsExpand
Barren plateaus in quantum neural network training landscapes
It is shown that for a wide class of reasonable parameterized quantum circuits, the probability that the gradient along any reasonable direction is non-zero to some fixed precision is exponentially small as a function of the number of qubits. Expand