Related papers: Simulation of quantum computation with magic state…
We propose a method for classical simulation of finite-dimensional quantum systems, based on sampling from a quasiprobability distribution, i.e., a generalized Wigner function. Our construction applies to all finite dimensions, with the…
We present the generalization of the CNC formalism, based on closed and noncontextual sets of Pauli observables, to the setting of odd-prime-dimensional qudits. By introducing new CNC-type phase space point operators, we construct a…
A central problem in quantum information is to determine the minimal physical resources that are required for quantum computational speedup and, in particular, for fault-tolerant quantum computation. We establish a remarkable connection…
A unification of the set of quasiprobability representations using the mathematical theory of frames was recently developed for quantum systems with finite-dimensional Hilbert spaces, in which it was proven that such representations require…
A recently introduced classical simulation method for universal quantum computation with magic states operates by repeated sampling from probability functions [M. Zurel et al. PRL 260404 (2020)]. This method is closely related to sampling…
Quasiprobability representations, such as the Wigner function, play an important role in various research areas. The inevitable appearance of negativity in such representations is often regarded as a signature of nonclassicality, which has…
Consumption of magic states promotes the stabilizer model of computation to universal quantum computation. Here, we propose three different classical algorithms for simulating such universal quantum circuits, and characterize them by…
This article comprises a review of both the quasi-probability representations of infinite-dimensional quantum theory (including the Wigner function) and the more recently defined quasi-probability representations of finite-dimensional…
Using tomographic-probability representation of spin states, quantum behavior of qudits is examined. For a general j-qudit state we propose an explicit formula of quantumness witnetness whose negative average value is incompatible with…
We investigate the simulation of fermionic systems on a quantum computer. We show in detail how quantum computers avoid the dynamical sign problem present in classical simulations of these systems, therefore reducing a problem believed to…
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…
We describe a scheme of quantum computation with magic states on qubits for which contextuality is a necessary resource possessed by the magic states. More generally, we establish contextuality as a necessary resource for all schemes of…
Magic refers to the degree of "quantumness" in a system that cannot be fully described by stabilizer states and Clifford operations alone. In quantum computing, stabilizer states and Clifford operations can be efficiently simulated on a…
We introduce a general method for the construction of quasiprobability representations for arbitrary notions of quantum coherence. Our technique yields a nonnegative probability distribution for the decomposition of any classical state.…
We show that every quantum computation can be described by Bayesian update of a probability distribution on a finite state space. When applied to the model of quantum computation with magic states, the size of this state space only depends…
We show that quantum circuits where the initial state and all the following quantum operations can be represented by positive Wigner functions can be classically efficiently simulated. This is true both for continuous-variable as well as…
We consider possible non-signaling composites of probabilistic models based on euclidean Jordan algebras. Subject to some reasonable constraints, we show that no such composite exists having the exceptional Jordan algebra as a direct…
It was recently shown that a hidden variable model can be constructed for universal quantum computation with magic states on qubits. Here we show that this result can be extended, and a hidden variable model can be defined for quantum…
The ability to perform classically intractable electronic structure calculations is often cited as one of the principal applications of quantum computing. A great deal of theoretical algorithmic development has been performed in support of…
A web of cohomological facts relates quantum error correction, measurement-based quantum computation, symmetry protected topological order and contextuality. Here we extend this web to quantum computation with magic states. In this…