Related papers: Classical simulators of quantum computers and no-g…
In the area of the foundations of quantum mechanics a true industry appears to have developed in the last decades, with the aim of proving as many results as possible concerning what there cannot be in the quantum realm. In principle, the…
The Kochen-Specker theorem has been discussed intensely ever since its original proof in 1967. It is one of the central no-go theorems of quantum theory, showing the non-existence of a certain kind of hidden states models. In this paper, we…
Conway and Kochen's Free Will Theory is examined as an important foundational element in a new area of activity in computer science - developing protocols for quantum computing
Recent experiments have shown that certain fluid-mechanical systems, namely oil droplets bouncing on oil films, can mimic a wide range of quantum phenomena, including double-slit interference, quantization of angular momentum and Zeeman…
We present a no-go theorem for the distinguishability between quantum random numbers (i.e., random numbers generated quantum mechanically) and pseudo-random numbers (i.e., random numbers generated algorithmically). The theorem states that…
Conway and Kochen have presented a "free will theorem" (Notices of the AMS 56, pgs. 226-232 (2009)) which they claim shows that "if indeed we humans have free will, then [so do] elementary particles." In a more precise fashion, they claim…
Understanding the boundary between classical simulatability and the power of quantum computation is a fascinating topic. Direct simulation of noisy quantum computation requires solving an open quantum many-body system, which is very costly.…
Quantum computing improves substantially on known classical algorithms for various important problems, but the nature of the relationship between quantum and classical computing is not yet fully understood. This relationship can be…
For a two-particle two-state system, sets of compatible propositions exist for which quantum mechanics and noncontextual hidden-variable theories make conflicting predictions for every individual system whatever its quantum state. This…
Unconditionally secure bit commitment is forbidden by quantum mechanics. We extend this no-go theorem to continuous-variable protocols where both players are restricted to use Gaussian states and operations, which is a reasonable assumption…
(Abridged.) Quantum computers promise to solve some problems exponentially faster than traditional computers, but we still do not fully understand why this is the case. While the most studied model of quantum computation uses qubits, which…
This article focuses on the connection between the possibility of quantum computers, the predictability of complex quantum systems in nature, and the issue of free will.
In classical computation, a "write-only memory" (WOM) is little more than an oxymoron, and the addition of WOM to a (deterministic or probabilistic) classical computer brings no advantage. We prove that quantum computers that are augmented…
Von Neumann's statistical theory of quantum measurement interprets the instantaneous quantum state and derives instantaneous classical variables. In realty, quantum states and classical variables coexist and can influence each other in a…
Several arguments demonstrate the incompatibility between Quantum Mechanics and classical Physics. Bell's inequalities and Greenberger-Horne-Zeilinger (GHZ) arguments apply to specific non-classical states. The Kochen-Specker (KS) one,…
In a recent paper, Conway and Kochen proposed what is now known as the "Free Will theorem" which, among other things, should prove the impossibility of combining GRW models with special relativity, i.e., of formulating relativistically…
In this perspective article, we revisit and critically evaluate prevailing viewpoints on the capabilities and limitations of near-term quantum computing and its potential transition toward fully fault-tolerant quantum computing. We examine…
It is shown that the restrictions of what can be inferred from classically-recorded observational outcomes that are imposed by the no-cloning theorem, the Kochen-Specker theorem and Bell's theorem also follow from restrictions on inferences…
Efficiently simulating quantum circuits on classical computers is a fundamental challenge in quantum computing. This paper presents a novel theoretical approach that achieves substantial speedups over existing simulators for a wide class of…
Digital quantum computers promise exponential speedups in performing quantum time-evolution, providing an opportunity to simulate quantum dynamics of complex systems in physics and chemistry. However, the task of extracting desired quantum…