Quantum optimization using variational algorithms on near-term quantum devices

@article{Moll2017QuantumOU,
  title={Quantum optimization using variational algorithms on near-term quantum devices},
  author={Nikolaj Moll and Panagiotis Kl. Barkoutsos and Lev Bishop and Jerry M. Chow and Andrew W. Cross and Daniel J. Egger and Stefan Filipp and Andreas Fuhrer and Jay M. Gambetta and Marc Ganzhorn and Abhinav Kandala and Antonio Mezzacapo and Peter Muller and Walter Riess and G. Salis and John A. Smolin and Ivano Tavernelli and Kristan Temme},
  journal={arXiv: Quantum Physics},
  year={2017}
}
Universal fault-tolerant quantum computers will require error-free execution of long sequences of quantum gate operations, which is expected to involve millions of physical qubits. Before the full power of such machines will be available, near-term quantum devices will provide several hundred qubits and limited error correction. Still, there is a realistic prospect to run useful algorithms within the limited circuit depth of such devices. Particularly promising are optimization algorithms that… Expand
View PDF on arXiv
238 Citations
Highly Influential Citations
6
Background Citations
59
Methods Citations
33

238 Citations

Citation Type

Citation Type

Error mitigation for variational quantum algorithms through mid-circuit measurements
Noisy Intermediate-Scale Quantum (NISQ) algorithms require novel paradigms of error mitigation. To obtain noise-robust quantum computers, each logical qubit is equipped with hundreds or thousands of… Expand
Variational Quantum Algorithms
TLDR
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
Gate-Efficient Simulation of Molecular Eigenstates on a Quantum Computer
A key requirement to perform simulations of large quantum systems on near-term quantum hardware is the design of quantum algorithms with short circuit depth that finish within the available coherence… Expand
QVECTOR: an algorithm for device-tailored quantum error correction
Current approaches to fault-tolerant quantum computation will not enable useful quantum computation on near-term devices of 50 to 100 qubits. Leading proposals, such as the color code and surface… Expand
Numerical hardware-efficient variational quantum simulation of a soliton solution
Implementing variational quantum algorithms with noisy intermediate-scale quantum machines of up to a hundred of qubits is nowadays considered as one of the most promising routes towards achieving a… Expand
Variational Quantum Information Processing
TLDR
This dissertation presents the application of the variational quantum computing approach to problems in quantum simulation, quantum state preparation, quantum error-correction, and generative modeling, and establishes practical guidelines to implement these methods on near-term quantum computers. Expand
Quantum simulation and computing with Rydberg-interacting qubits
Arrays of optically trapped atoms excited to Rydberg states have recently emerged as a competitive physical platform for quantum simulation and computing, where high-fidelity state preparation and… Expand
Quantum communication protocols as a benchmark for programmable quantum computers
TLDR
This work performs proof-of-principle implementations of superdense coding and quantum key distribution BB84 using 5- and 16-qubit superconducting quantum processors of IBM Quantum Experience and examines the ability of quantum devices to serve as quantum memory and to store entangled states used in quantum communication. Expand
Quantum simulation and computing with Rydberg qubits
TLDR
An overview of the Rydberg quantum toolbox is given, emphasizing the high degree of flexibility for encoding qubits, performing quantum operations and engineering quantum many-body Hamiltonians. Expand
Barren plateaus in quantum neural network training landscapes
TLDR
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
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 126 REFERENCES
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 the… Expand
Quantum Algorithms for Fixed Qubit Architectures
Gate model quantum computers with too many qubits to be simulated by available classical computers are about to arrive. We present a strategy for programming these devices without error correction or… Expand
Gate count estimates for performing quantum chemistry on small quantum computers
As quantum computing technology improves and quantum computers with a small but non-trivial number of N > 100 qubits appear feasible in the near future the question of possible applications of small… Expand
Faster Quantum Chemistry Simulation on Fault-Tolerant Quantum Computers
Quantum computers can in principle simulate quantum physics exponentially faster than their classical counterparts, but some technical hurdles remain. We propose methods which substantially improve… Expand
Characterizing quantum supremacy in near-term devices
A critical question for quantum computing in the near future is whether quantum devices without error correction can perform a well-defined computational task beyond the capabilities of… 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
Optimizing qubit resources for quantum chemistry simulations in second quantization on a quantum computer
Quantum chemistry simulations on a quantum computer suffer from the overhead needed for encoding the fermionic problem in a bosonic system of qubits. By exploiting the block diagonality of a… Expand
Superconducting quantum circuits at the surface code threshold for fault tolerance
TLDR
The results demonstrate that Josephson quantum computing is a high-fidelity technology, with a clear path to scaling up to large-scale, fault-tolerant quantum circuits. Expand
Logic gates at the surface code threshold: Superconducting qubits poised for fault-tolerant quantum computing
TLDR
The results demonstrate that Josephson quantum computing is a high-fidelity technology, with a clear path to scaling up to large-scale, fault-tolerant quantum circuits. 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
...
1
2
3
4
5
...