Related papers: The vacuum provides quantum advantage to otherwise…
We consider a model of quantum computation using qubits where it is possible to measure whether a given pair are in a singlet (total spin $0$) or triplet (total spin $1$) state. The physical motivation is that we can do these measurements…
Quantum random sampling is the leading proposal for demonstrating a computational advantage of quantum computers over classical computers. Recently, first large-scale implementations of quantum random sampling have arguably surpassed the…
The Gottesman-Knill theorem states that a Clifford circuit acting on stabilizer states can be simulated efficiently on a classical computer. Recently, this result has been generalized to cover inputs that are close to a coherent…
Phase space quasi-probability functions provide powerful representations of quantum states and operators, as well as criteria for assessing quantum computational resources. In discrete, odd-dimensional systems (qudits), protocols involving…
Classical-quantum computational complexity separations are an important motivation for the long-term development of digital quantum computers, but classical-quantum complexity equivalences are just as important in our present era of noisy…
A classical state-preparation device cannot generate states in relative superposition. We introduce classical models in which devices that are individually unable to generate states with relative superposition can be stochastically…
Quantum universality can be achieved using classically controlled stabilizer operations and repeated preparation of certain ancilla states. Which ancilla states suffice for universality? This "magic states distillation" question is closely…
We provide a noisy intermediate-scale quantum framework for simulating the dynamics of open quantum systems, generalized time evolution, non-linear differential equations and Gibbs state preparation. Our algorithm does not require any…
What is the origin of quantum computational advantage? Providing answers to this far-reaching question amounts to identifying the key properties, or quantum resources, that distinguish quantum computers from their classical counterparts,…
Quantum resource theories identify the features of quantum computers that provide their computational advantage over classical systems. We investigate the resources driving the complexity of classical simulation in the standard model of…
According to the quantum adiabatic theorem, we can in principle obtain a true vacuum of a quantum system starting from a trivial vacuum of a simple Hamiltonian. In actual adiabatic digital quantum simulation with finite time length and…
In this work, we study the Wigner phase-space representation of qubit states encoded in continuous variables (CV) by using the Gottesman-Kitaev-Preskill (GKP) mapping. We explore a possible connection between resources for universal quantum…
Classical computers can simulate models of quantum computation with restricted input states. The identification of such states can sharpen the boundary between quantum and classical computations. Previous works describe simulable states of…
In this paper, we extend the standard formalism of quantum mechanics to a quantum theory for a total system including one internal measuring apparatus. The internality of the measuring apparatus implies that different decomposition of a…
Quantum state smoothing is a technique for assigning a valid quantum state to a partially observed dynamical system, using measurement records both prior and posterior to an estimation time. We show that the technique is greatly simplified…
The manifold of pure quantum states is a complex projective space endowed with the unitary-invariant geometry of Fubini and Study. According to the principles of geometric quantum mechanics, the detailed physical characteristics of a given…
While recent advances have established efficient quantum algorithms for preparing Gibbs states of finite-dimensional systems, comparable complexity results for bosonic and other infinite-dimensional models remain unexplored. We introduce…
We consider quantum computational models defined via a Lie-algebraic theory. In these models, specified initial states are acted on by Lie-algebraic quantum gates and the expectation values of Lie algebra elements are measured at the end.…
We investigate for which resource states an efficient classical simulation of measurement based quantum computation is possible. We show that the Schmidt--rank width, a measure recently introduced to assess universality of resource states,…
Randomness is a key feature of quantum physics. Heisenberg's uncertainty principle reveals the existence of an intrinsic noise, usually explored through Gaussian squeezed states. Due to their insufficiency for quantum advantage, the focus…