Related papers: Gull's theorem revisited
A proof of Bell's theorem without inequalities for two maximally entangled particles is proposed using the technique of quantum teleportation. It follows Hardy's arguments for a non-maximally entangled state with the help of two auxiliary…
We propose a set of Bell-type nonlocal games that can be used to prove an unconditional quantum advantage in an objective and hardware-agnostic manner. In these games, the circuit depth needed to prepare a cyclic cluster state and measure a…
The Bell inequalities in three and four correlations are re-derived in general forms showing that three and four data sets, respectively, identically satisfy them regardless of whether they are random, deterministic, measured, predicted, or…
Assumed data streams from a delayed choice gedanken experiment must satisfy a Bell's identity independently of locality assumptions. The violation of Bell's inequality by assumed correlations of identical form among these data streams…
The entangled quantum states play a key role in quantum information. The association of the quantum state vector with each individual physical system in an attributive way is a source of many false paradoxes and inconsistencies. The…
The experimental violation of Bell inequality establishes necessary but not sufficient conditions that any theory must obey. Namely, a theory compatible with the experimental observations can satisfy at most two of the three hypotheses at…
Bell tests---the experimental demonstration of a Bell inequality violation---are central to understanding the foundations of quantum mechanics, underpin quantum technologies, and are a powerful diagnostic tool for technological developments…
The hopes for scalable quantum computing rely on the "threshold theorem": once the error per qubit per gate is below a certain value, the methods of quantum error correction allow indefinitely long quantum computations. The proof is based…
The Church-Turing thesis is one of the pillars of computer science; it postulates that every classical system has equivalent computability power to the so-called Turing machine. While this thesis is crucial for our understanding of…
We prove a new impossibility for quantum information (the no-splitting theorem): an unknown quantum bit (qubit) cannot be split into two complementary qubits. This impossibility, together with the no-cloning theorem, demonstrates that an…
The notorious Wigner's friend thought experiment (and modifications thereof) has in recent years received renewed interest especially due to new arguments that force us to question some of the fundamental assumptions of quantum theory. In…
We improve the test to show the impossibility of a quantum theory based on real numbers by a larger ratio of complex-to-real bound on a Bell-type parameter. In contrast to previous theoretical and experimental proposals the test requires…
We consider a distributed quantum hypothesis testing problem with communication constraints, in which the two hypotheses correspond to two different states of a bipartite quantum system, multiple identical copies of which are shared between…
Bell non-locality is a term that applies to specific modifications and interpretations of quantum mechanics. Yet, Bell's original 1964 theorem is often used to assert that unmodified quantum mechanics itself is non-local and that local…
We will demonstrate in this paper that Bell's theorem (Bell's inequality) does not really conflict with quantum mechanics, the controversy between them originates from the different definitions for the expectation value using the…
A simple minimalist argument is given for why some correlations between quantum systems boggle our classical intuition. The argument relies on two elementary physical assumptions, and recovers the standard experimentally-testable Bell…
The no-go theorem of unconditionally secure quantum bit commitment depends crucially on the assumption that Alice knows in detail all the probability distributions generated by Bob. We show that if a protocol is concealing, then the…
A central challenge in the verification of quantum computers is benchmarking their performance as a whole and demonstrating their computational capabilities. In this work, we find a universal model of quantum computation, Bell sampling,…
Bell's theorem sets a boundary between the classical and quantum realms, by providing a strict proof of the existence of entangled quantum states with no classical counterpart. An experimental violation of Bell's inequality demands…
The one-way quantum computing model introduced by Raussendorf and Briegel [Phys. Rev. Lett. 86 (22), 5188-5191 (2001)] shows that it is possible to quantum compute using only a fixed entangled resource known as a cluster state, and adaptive…