The variational quantum eigensolver (or VQE), first developed by Peruzzo et al.(2014), has
received significant attention from the research community in recent years. It uses the …

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 are promising applications of noisy intermediate-scale
quantum (NISQ) computers. These algorithms consist of a number of separate prepare-and …

Variational quantum eigensolver (VQE) is a promising algorithm for near-term quantum
machines. It can be used to estimate the ground state energy of a molecule by performing …

Variational quantum algorithms dominate gate-based applications of modern quantum
processors. The so-called layerwise trainability conjecture appears in various works …

The relations among a given set of observables on a quantum system are effectively
captured by their so-called joint numerical range, which is the set of tuples of jointly …

We propose a method for classical simulation of finite-dimensional quantum systems, based
on sampling from a quasiprobability distribution, ie, a generalized Wigner function. Our …

Trotter–Suzuki decompositions are frequently used in the quantum simulation of quantum
chemistry. They transform the evolution operator into a form implementable on a quantum …

We show that every quantum computation can be described by a probabilistic update of a
probability distribution on a finite phase space. Negativity in a quasiprobability function is not …

We describe the $\textit {contextual subspace variational quantum eigensolver} $(CS-VQE),
a hybrid quantum-classical algorithm for approximating the ground state energy of a …