The intensive pursuit for quantum advantage in terms of computational complexity has
further led to a modernized crucial question of when and how will quantum computers …

It is a useful fact in classical computer science that many search problems are reducible to
decision problems; this has led to decision problems being regarded as the $\textit {de facto} …

Solving optimization problems using variational algorithms stands out as a crucial
application for noisy intermediate-scale devices. Instead of constructing gate-based …

We study a variant of QMA where quantum proofs have no relative phase (ie non-negative
amplitudes, up to a global phase). If only completeness is modified, this class is equal to …

This tutorial introduces quantum computing with a focus on the applicability of formal
methods in this relatively new domain. We describe quantum circuits and convey an …

Variational quantum algorithms (VQAs) are expected to become a practical application of
near-term noisy quantum computers. Although the effect of the noise crucially determines …

Recent work has demonstrated the existence of universal Hamiltonians—simple spin-lattice
models that can simulate any other quantum many-body system to any desired level of …

The Pursuit of Uniqueness: Extending Valiant-Vazirani Theorem to the Probabilistic and
Quantum Settings – Quantum Skip to content Quantum the open journal for quantum science …

The polynomial-time hierarchy (PH) has proven to be a powerful tool for providing
separations in computational complexity theory (modulo standard conjectures such as PH …

Phase diagrams chart material properties with respect to one or more external or internal
parameters such as pressure or magnetisation; as such, they play a fundamental role in …