Related papers: Classical simulators of quantum computers and no-g…
We demonstrate that it is possible to simulate Bell violations using probabilistic methods. A quantum state corresponding to optical experiments that violate the Bell inequality is generated, demonstrating that these quantum paradoxes can…
The conflict between classical and quantum physics can be identified through a series of yes-no tests on quantum systems, without it being necessary that these systems be in special quantum states. Kochen-Specker (KS) sets of yes-no tests…
According to a recent no-go theorem (M. Pusey, J. Barrett and T. Rudolph, Nature Physics 8, 475 (2012)), models in which quantum states correspond to probability distributions over the values of some underlying physical variables must have…
The Kochen-Specker theorem states that noncontextual hidden variable models are inconsistent with the quantum predictions for every yes-no question on a qutrit, corresponding to every projector in three dimensions. It has been suggested [D.…
One implication of Bell's theorem is that there cannot in general be hidden variable models for quantum mechanics that both are noncontextual and retain the structure of a classical probability space. Thus, some hidden variable programs aim…
We present a comprehensive study of quantum simulation methods and quantum simulators for classical computers. We first study an exhaustive set of 150+ simulators and quantum libraries. Then, we short-list the simulators that are actively…
In this work we initiate the question of whether quantum devices can provide us with an almost perfect source of classical randomness, and more generally, suffice for classical cryptographic tasks, such as encryption. Indeed, it is well…
The concept of individuality in quantum mechanics shows radical differences from the one used in classical physics. In particular, it is not possible to consider the fundamental particles described by quantum theory as individual…
Fundamental principle of classical physics -- local realism, means that freely chosen observations can be explained by a local (slower than light) real process. It is apparently violated in quantum mechanics as shown by Bell theorem.…
The quantum logic gates used in the design of a quantum computer should be both universal, meaning arbitrary quantum computations can be performed, and fault-tolerant, meaning the gates keep errors from cascading out of control. A number of…
Physics has long lived with a schizophrenia that desires determinism for measured systems while demanding that experimenters decide what to measure on a whim. Intriguingly, such a free will assumption for experimenters has thwarted many…
Simulation of quantum systems that provide intrinsically fault-tolerant quantum computation is shown to preserve fault tolerance. Errors committed in the course of simulation are eliminated by the natural error-correcting features of the…
It has been recently shown by Mayers that no bit commitment scheme is secure if the participants have unlimited computational power and technology. However it was noticed that a secure protocol could be obtained by forcing the cheater to…
Instead of producing quantum languages that are fit for current quantum computers, we build a language from standard classical assembler and augment it with quantum capabilities so that quantum algorithms become a subset of it. This paves…
Meyer recently queried whether non-contextual hidden variable models can, despite the Kochen-Specker theorem, simulate the predictions of quantum mechanics to within any fixed finite experimental precision. Clifton and Kent have presented…
No-go theorems assert that hidden-variable theories, subject to appropriate hypotheses, cannot reproduce the predictions of quantum theory. We examine two species of such theorems, value no-go theorems and expectation no-go theorems. The…
Quantum coherence allows for reduced-memory simulators of classical processes. Using recent results in single-shot quantum thermodynamics, we derive a minimal work cost rate for quantum simulators that is quasistatically attainable in the…
We study classical simulation of quantum computation, taking the Gottesman-Knill theorem as a starting point. We show how each Clifford circuit can be reduced to an equivalent, manifestly simulatable circuit (normal form). This provides a…
A long sequence of tosses of a classical coin produces an apparently random bit string, but classical randomness is an illusion: the algorithmic information content of a classically-generated bit string lies almost entirely in the…
Theoretical physics has faced many challenges since the advent of quantum mechanics. Recently, Frauchiger and Renner have presented a no-go theorem, which makes quantum mechanics more controversial. However, from our perspective, the…