A universal fault-tolerant quantum computer that can efficiently solve problems such as
integer factorization and unstructured database search requires millions of qubits with low …

Abstract The Quantum Approximate Optimization Algorithm (QAOA) is a highly promising
variational quantum algorithm that aims to solve combinatorial optimization problems that …

The next few years will be exciting as prototype universal quantum processors emerge,
enabling the implementation of a wider variety of algorithms. Of particular interest are …

The Quantum Approximate Optimization Algorithm (QAOA) is a promising approach for
programming a near-term gate-based hybrid quantum computer to find good approximate …

Many quantum algorithms seek to output a specific bitstring solving the problem of interest—
or a few if the solution is degenerate. It is the case for the quantum approximate optimization …

The binary paint shop problem (BPSP) is an APX-hard optimization problem of the
automotive industry. In this work, we show how to use the quantum approximate optimization …

A large ongoing research effort focuses on obtaining a quantum advantage in the solution of
combinatorial optimization problems on near-term quantum devices. A particularly promising …

We propose an implementation of a two-dimensional Z 2 lattice gauge theory model on a
shallow quantum circuit, involving a number of single-and two-qubit gates comparable to …

Quantum computers utilize the fundamentals of quantum mechanics to solve computational
problems more efficiently than traditional computers. Gate-model quantum computers are …

We propose a universal gate set for quantum computing with all-to-all connectivity and
intrinsic robustness to bit-flip errors based on parity encoding. We show that logical …