Applications such as simulating complicated quantum systems or solving large-scale linear
algebra problems are very challenging for classical computers, owing to the extremely high …

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 …

Variational quantum algorithms (VQAs) optimize the parameters θ of a parametrized
quantum circuit V (θ) to minimize a cost function C. While VQAs may enable practical …

Quantum computers can exploit a Hilbert space whose dimension increases exponentially
with the number of qubits. In experiment, quantum supremacy has recently been achieved …

The prospect of achieving quantum advantage with quantum neural networks (QNNs) is
exciting. Understanding how QNN properties (for example, the number of parameters M) …

Previously proposed quantum algorithms for solving linear systems of equations cannot be
implemented in the near term due to the required circuit depth. Here, we propose a hybrid …

Current gate-based quantum computers have the potential to provide a computational
advantage if algorithms use quantum hardware efficiently. To make combinatorial …

Quantum algorithms have been developed for efficiently solving linear algebra tasks.
However, they generally require deep circuits and hence universal fault-tolerant quantum …

Universal quantum computers are potentially an ideal setting for simulating many-body
quantum dynamics that is out of reach for classical digital computers. We use state-of-the-art …

We present Qibo, a new open-source software for fast evaluation of quantum circuits and
adiabatic evolution which takes full advantage of hardware accelerators. The growing …