• Corpus ID: 235422031

Variational Quantum Eigensolver with Reduced Circuit Complexity

  title={Variational Quantum Eigensolver with Reduced Circuit Complexity},
  author={Yu Zhang and Lukasz Cincio and Christian Francisco Andres Negre and Piotr Czarnik and Patrick J. Coles and Petr M. Anisimov and Susan M. Mniszewski and Sergei Tretiak and Pavel A. Dub},
Yu Zhang, ∗ Lukasz Cincio, Christian F. A. Negre, Piotr Czarnik, Patrick Coles, Petr M. Anisimov, Susan M. Mniszewski, Sergei Tretiak, 4 and Pavel A. Dub Theoretical Division, Los Alamos National Laboratory, Los Alamos, NM, 87545, USA Accelerators and Electrodynamics Group, Los Alamos National Laboratory, Los Alamos, New Mexico 87545, USA Computer, Computational and Statistical Sciences Division, Los Alamos National Laboratory, Los Alamos, New Mexico 87545, USA Center for Integrated… 

Figures and Tables from this paper

A comprehensive study on how to construct local bases in deep variational quantum eigensolver for molecular systems
Luca Erhart, ∗ Kosuke Mitarai, 2, 3, † Wataru Mizukami, 2, 3, ‡ and Keisuke Fujii 2, 4, § Graduate School of Engineering Science, Osaka University, 1-3 Machikaneyama, Toyonaka, Osaka 560-8531, Japan
Accelerating variational quantum algorithms with multiple quantum processors
An efficient distributed optimization scheme, called QUDIO, that can be readily mixed with other advanced VQAs-based techniques to narrow the gap between the state of the art and applications with quantum advantage.
QAOA-in-QAOA: solving large-scale MaxCut problems on small quantum machines
It is proved that the merging process in MaxCut can be further cast into a new MaxCut problem and thus be addressed by QAOAs or other MaxCut solvers, and it is proven that the approximation ratio of QAOA 2 is lower bounded by 1 / 2.
Improving the efficiency of learning-based error mitigation
An error mitigation scheme that builds on Clifford data regression (CDR) is introduced that improves the frugality by carefully choosing the training data and exploiting the symmetries of the problem.


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.
Noise-induced barren plateaus in variational quantum algorithms
This work rigorously proves a serious limitation for noisy VQAs, in that the noise causes the training landscape to have a barren plateau, and proves that the gradient vanishes exponentially in the number of qubits n if the depth of the ansatz grows linearly with n.
Iterative qubit-excitation based variational quantum eigensolver
Molecular simulations with the variational quantum eigensolver (VQE) are a promising application for emerging noisy intermediate-scale quantum computers. Constructing accurate molecular ansatze
Tapering off qubits to simulate fermionic Hamiltonians
It is shown that encodings with a given filling fraction $\nu=N/M$ and a qubit-per-mode ratio $\eta=Q/M<1$ can be constructed from efficiently decodable classical LDPC codes with the relative distance $2\nu$ and the encoding rate $1-\eta$.
VQE method: a short survey and recent developments
Recent developments in the field of designing efficient ansatzes that fall into two categories—chemistry–inspired and hardware–efficient—that produce quantum circuits that are easier to run on modern hardware are presented.
Noisy intermediate-scale quantum (NISQ) algorithms
A thorough summary of NISQ computational paradigms and algorithms, which discusses the key structure of these algorithms, their limitations, and advantages, and a comprehensive overview of various benchmarking and software tools useful for programming and testing NISZ devices.
The power of quantum neural networks
This work is the first to demonstrate that well-designed quantum neural networks offer an advantage over classical neural networks through a higher effective dimension and faster training ability, which is verified on real quantum hardware.
Partitioning Optimization Problems for Hybrid Classical/Quantum Execution TECHNICAL REPORT
We introduce qbsolv , a tool that solves large quadratic unconstrained binary optimization (QUBO) problems by partitioning into subproblems targeted for execution on a D-Wave system. Using a
Quantum measurements and the Abelian Stabilizer Problem
  • A. Kitaev
  • Mathematics
    Electron. Colloquium Comput. Complex.
  • 1996
A polynomial quantum algorithm for the Abelian stabilizer problem which includes both factoring and the discrete logarithm is presented, based on a procedure for measuring an eigenvalue of a unitary operator.
Generalized correlation for biomolecular dynamics
A general statistical mechanics approach to detect and quantify any correlated motion from molecular dynamics simulations and allows for an improved understanding of the conformational dynamics by separating linear and nonlinear contributions of the correlation.