Related papers: Gull's theorem revisited
Quantum mechanics admits correlations that cannot be explained by local realistic models. Those most studied are the standard local hidden variable models, which satisfy the well-known Bell inequalities. To date, most works have focused on…
We question the commonly accepted statement that random numbers certified by Bell's theorem carry some special sort of randomness, so to say, quantum randomness or intrinsic randomness. We show that such numbers can be easily generated by…
In this paper we identify a hidden premise in Bell's theorem: measurability of the underlying space. But our system (the space of all paths, SP) is not measurable, although it replicates the predictions of standard quantum mechanics. Using…
Since the analysis by John Bell in 1965, the consensus in the literature is that von Neumann's 'no hidden variables' proof fails to exclude any significant class of hidden variables. Bell raised the question whether it could be shown that…
Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks such as parallel computation and circuit optimisation. Crucially, the communication overhead introduced by the allotment process should be…
A Bell test separates quantum mechanics from a classical, local realist theory of physics. However, a Bell test cannot separate quantum physics from all classical theories. Classical devices supplemented with non-signaling correlations,…
Physical constraints and engineering challenges, including wafer dimensions, classical control cabling, and refrigeration volumes, impose significant limitations on the scalability of quantum computing units. As a result, a modular quantum…
The difference between ideal experiments to test Bell's weak nonlocality and the real experiments leads to loopholes. Ideal experiments involve either inequalities (Bell) or equalities (Greenberger, Horne, Zeilinger). Every real experiment…
Identifying stabilizer codes that admit fault-tolerant implementations of the full logical Clifford group would significantly advance fault-tolerant quantum computation. Motivated by this goal, we study several classes of fault-tolerant…
Bell's theorem states that quantum correlation function of two spins can not be represented as an expectation value of two classical random variables. Spin is described in Bell's model by a single scalar random variable. We discuss another…
In this paper we present a new unified theoretical framework that describes the full dynamics of quantum computation. Our formulation allows any questions pertaining to the physical behavior of a quantum computer to be framed, and in…
Specification of the strongest possible Bell inequalities for arbitrarily complicated physical scenarios -- any number of observers choosing between any number of observables with any number of possible outcomes -- is currently an open…
Superior computational power promised by quantum computers utilises the fundamental quantum mechanical principle of entanglement. However, achieving entanglement and verifying that the generated state does not follow the principle of local…
Quantum teleportation provides a `bodiless' way of transmitting the quantum state from one object to another, at a distant location, using a classical communication channel and a previously shared entangled state. In this paper, we present…
Quantum computers, besides offering substantial computational speedups, are also expected to provide the possibility of preserving the privacy of a computation. Here we show the first such experimental demonstration of blind quantum…
Though John Bell had claimed that his spin-1/2 example of a hidden-variable theory(HV) is an \emph{explicit} counterexample to von Neumann's proof of the non-existence of hidden variable theories empirically equivalent to quantum mechanics,…
We define quantum-like probabilistic behaviour as behaviour which is impossible to describe by using the classical probability model. We discuss the conjecture that cognitive behaviour is quantum-like. There is presented the scheme for an…
Monads are commonplace in computer science, and can be composed using Beck's distributive laws. Unfortunately, finding distributive laws can be extremely difficult and error-prone. The literature contains some general principles for…
We present the view of quantum algorithms as a search-theoretic problem. We show that the Fourier transform, used to solve the Abelian hidden subgroup problem, is an example of an efficient elimination observable which eliminates a constant…
It is shown that Bell's counterfactuals admit joint quasiprobability distributions (i.e. joint distributions exist, but may not be non-negative). A necessary and sufficient condition for the existence among them of a true probability…