Variational Quantum Algorithms

@article{Cerezo2021VariationalQA,
  title={Variational Quantum Algorithms},
  author={Mar{\'i}a Cerezo and Andrew Arrasmith and Ryan Babbush and Simon C. Benjamin and Suguru Endo and Keisuke Fujii and Jarrod R. McClean and Kosuke Mitarai and Xiao Yuan and Lukasz Cincio and Patrick J. Coles},
  journal={ArXiv},
  year={2021},
  volume={abs/2012.09265}
}
Applications such as simulating large quantum systems or solving large-scale linear algebra problems are immensely challenging for classical computers due their extremely high computational cost. Quantum computers promise to unlock these applications, although fault-tolerant quantum computers will likely not be available for several years. Currently available quantum devices have serious constraints, including limited qubit numbers and noise processes that limit circuit depth. Variational… Expand

Figures from this paper

Accelerating Variational Quantum Algorithms Using Circuit Concurrency
TLDR
This work shows that circuit-level concurrency provides a means to increase the performance of variational quantum algorithms on noisy quantum computers by mapping multiple instances of the same circuit onto the quantum computer at the same time, which allows multiple samples in a Variational quantum algorithm to be gathered in parallel for each training iteration. Expand
An exponentially more efficient optimization algorithm for noisy quantum computers
Quantum computers are devices which allow the solution of problems unsolvable to their classical counterparts. As an error-corrected quantum computer is still a decade away the quantum computingExpand
Variational Quantum Optimization with Multi-Basis Encodings
Despite extensive research efforts, few quantum algorithms for classical optimization demonstrate realizable quantum advantage. The utility of many quantum algorithms is limited by high requisiteExpand
Accelerating variational quantum algorithms with multiple quantum processors
TLDR
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. Expand
Variational Quantum Simulation of Chemical Dynamics with Quantum Computers
  • Chee-Kong Lee, Chang-Yu Hsieh, Shengyu Zhang, Liang Shi
  • Physics
  • 2021
Classical simulation of real-space quantum dynamics is challenging due to the exponential scaling of computational cost with system dimensions. Quantum computer offers the potential to simulateExpand
Universal quantum algorithmic cooling on a quantum computer
  • Pei Zeng, Jinzhao Sun, Xiao Yuan
  • Physics
  • 2021
Quantum cooling, a deterministic process that drives any state to the lowest eigenstate, has been widely used from studying ground state properties of chemistry and condensed matter quantum physics,Expand
Patterns for Hybrid Quantum Algorithms
TLDR
The best practices for splitting strategies as patterns are described to foster a common understanding of hybrid algorithms, which split the computational tasks between classical and quantum computers circumventing some of these limitations. Expand
Nonlinear Quantum Optimization Algorithms via Efficient Ising Model Encodings
Despite extensive research efforts, few quantum algorithms for classical optimization demonstrate realizable advantage. The utility of many quantum algorithms is limited by high requisite circuitExpand
Avoiding symmetry roadblocks and minimizing the measurement overhead of adaptive variational quantum eigensolvers
Quantum simulation of strongly correlated systems is potentially the most feasible useful application of near-term quantum computers [1]. Minimizing quantum computational resources is crucial toExpand
Variational approaches to constructing the many-body nuclear ground state for quantum computing
We explore the preparation of specific nuclear states on gate-based quantum hardware using variational algorithms. Large scale classical diagonalization of the nuclear shell model have reached sizesExpand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 321 REFERENCES
Quantum optimization using variational algorithms on near-term quantum devices
TLDR
The quantum volume as a metric to compare the power of near-term quantum devices is discussed and simple error-mitigation schemes are introduced that could improve the accuracy of determining ground-state energies. Expand
Limitations of optimization algorithms on noisy quantum devices
TLDR
This work presents a transparent way of comparing classical algorithms to quantum ones running on near-term quantum devices for a large family of problems that include optimization problems and approximations to the ground state energy of Hamiltonians. Expand
Progress towards practical quantum variational algorithms
The preparation of quantum states using short quantum circuits is one of the most promising near-term applications of small quantum computers, especially if the circuit is short enough and theExpand
Hybrid quantum-classical approach to correlated materials
TLDR
This work shows that by using a hybrid quantum-classical algorithm that incorporates the power of a small quantum computer into a framework of classical embedding algorithms, the electronic structure of complex correlated materials can be efficiently tackled using a quantum computer. Expand
The theory of variational hybrid quantum-classical algorithms
TLDR
This work develops a variational adiabatic ansatz and explores unitary coupled cluster where it is shown how 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. Expand
Practical optimization for hybrid quantum-classical algorithms
A novel class of hybrid quantum-classical algorithms based on the variational approach have recently emerged from separate proposals addressing, for example, quantum chemistry and combinatorialExpand
Training Variational Quantum Algorithms Is NP-Hard.
TLDR
This work shows that the training landscape can have many far from optimal persistent local minima, which means gradient and higher order descent algorithms will generally converge to farFrom optimal solutions. Expand
From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
TLDR
The essence of this extension, the quantum alternating operator ansatz, is the consideration of general parameterized families of unitaries rather than only those corresponding to the time evolution under a fixed local Hamiltonian for a time specified by the parameter. Expand
Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets
TLDR
The experimental optimization of Hamiltonian problems with up to six qubits and more than one hundred Pauli terms is demonstrated, determining the ground-state energy for molecules of increasing size, up to BeH2. Expand
Application of Fermionic Marginal Constraints to Hybrid Quantum Algorithms
Many quantum algorithms, including recently proposed hybrid classical/quantum algorithms, make use of restricted tomography of the quantum state that measures the reduced density matrices, orExpand
...
1
2
3
4
5
...