Quantum optimization using variational algorithms on near-term quantum devices

Abstract

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 follow a hybrid approach: the aim is to steer a highly entangled state on a quantum system to a target state that minimizes a cost function via variation of some gate parameters. This variational approach can be used both for classical optimization problems as well as for problems in quantum chemistry. The challenge is to converge to the target state given the limited coherence time and connectivity of the qubits. In this context, the quantum volume as a metric to compare the power of near-term quantum devices is discussed.With focus on chemistry applications, a general description of variational algorithms is provided and the mapping from fermions to qubits is explained. Coupledcluster and heuristic trial wave-functions are considered for efficiently finding molecular ground states. Furthermore, simple error-mitigation schemes are introduced that could improve the accuracy of determining ground-state energies. Advancing these techniques may lead to near-term demonstrations of useful quantum computation with systems containing several hundred qubits.PACS numbers: quantum computation, quantum chemistry, quantum algorithms

Quantum Computers as Universal Quantum Simulators: State‐of‐the‐Art and Perspectives

“…Hence, a fair study on the actual performances of a quantum simulator should be done on an architecture including several interacting qubits, in order to assess the effective scalability of the given setup. A useful concept, in this respect, is that of “quantum volume,” recently introduced by IBM researchers with the aim of quantifying with a single paramenter the performance of a quantum computer, based on how efficiently a quantum algorithm can be run . The quantum volume takes into account both width (i.e., the number of qubits used) and depth (i.e., the number of reliable operations performed) of a given quantum circuit.…”

Quantum orbital-optimized unitary coupled cluster methods in the strongly correlated regime: Can quantum algorithms outperform their classical equivalents?

“…Interestingly, the unitary variant of CC (UCC) [21][22][23][24] can naturally be mapped as a quantum circuit for preparing the corresponding wavefunction in a digital quantum computer. [25][26][27][28][29][30] Moreover, variational approaches and in particular the Variational Quantum Eigensolver (VQE) algorithm 25 appear as the most promising way to leverage the exponentially growing Hilbert space of the qubits in near-term quantum hardware. [31][32][33][34][35] Hence, in this work we study the performance of the variational implementation of UCC as a quantum algorithm (q-UCC) 25 in computing the ground state of molecules and lattice models for which the classical CC formulation is known to break.…”

A quantum-classical cloud platform optimized for variational hybrid algorithms

“…Although there is no unanimously supported benchmark for QPU performance within the community (and there may never be), log quantum volume [22,42] ... . .…”