Related papers: Gull's theorem revisited

One-way quantum computing achieves the full power of quantum computation by performing single particle measurements on some many-body entangled state, known as the resource state. As single particle measurements are relatively easy to…

We show that any classical two-way communication protocol with shared randomness that can approximately simulate the result of applying an arbitrary measurement (held by one party) to a quantum state of $n$ qubits (held by another), up to…

A proof of Bell's theorem without inequalities and involving only two observers is given by suitably extending a proof of the Bell-Kochen-Specker theorem due to Mermin. This proof is generalized to obtain an inequality-free proof of Bell's…

The superposition principle is fundamental to quantum theory. Yet a recent no-go theorem has proved that quantum theory forbids superposition of unknown quantum states, even with nonzero probability. The implications of this result,…

Bell's theorem is a fundamental theorem in physics concerning the incompatibility between some correlations predicted by quantum theory and a large class of physical theories. In this paper, we introduce the hypothesis of accountability,…

An ambiguity is pointed out in J.S. Bell's argument that the distinction between quantum mechanics and hidden variable theories cannot be found in the behavior of single-particle beams. Within the context of theories for which states are…

For more than 80 years, the counterintuitive predictions of quantum theory have stimulated debate about the nature of reality. In his seminal work, John Bell proved that no theory of nature that obeys locality and realism can reproduce all…

Many physicists limit oneself to an instrumentalist description of quantum phenomena and ignore the problems of foundation and interpretation of quantum mechanics. This instrumentalist approach results to "specialization barbarism" and mass…

We introduce a two-observer all-versus-nothing proof of Bell's theorem which reduces the number of required quantum predictions from 9 [A. Cabello, Phys. Rev. Lett. 87, 010403 (2001); Z.-B. Chen et al., Phys. Rev. Lett. 90, 160408 (2003)]…

The relation between Bell inequalities with two two-outcome measurements per site and distillability is analyzed in systems of an arbitrary number of quantum bits. We observe that the violation of any of these inequalities by a quantum…

Blind quantum computation is a novel secure quantum-computing protocol that enables Alice, who does not have sufficient quantum technology at her disposal, to delegate her quantum computation to Bob, who has a fully fledged quantum…

Self-testing--the attractive possibility to infer the underlying physics of a quantum device in a black-box scenario--has gained increased traction in recent years, with applications to device-independent quantum information processing.…

In the online balanced graph repartitioning problem, one has to maintain a clustering of $n$ nodes into $\ell$ clusters, each having $k = n / \ell$ nodes. During runtime, an online algorithm is given a stream of communication requests…

An open question of fundamental importance in thermodynamics is how to describe the fluctuations of work for quantum coherent processes. In the standard approach, based on a projective energy measurement both at the beginning and at the end…

A recent paper by two of us and co-workers, based on an extended Wigner's friend scenario, demonstrated that certain empirical correlations predicted by quantum theory (QT) violate inequalities derived from a set of metaphysical assumptions…

Efficient teleportation is a crucial step for quantum computation and quantum networking. In the case of qubits, four different entangled Bell states have to be distinguished. We have realized a probabilistic, but in principle…

Information spreads in time. For example, correlations dissipate when the correlated system locally couples to a third party, such as the environment. This simple but important fact forms the known quantum data-processing inequality. Here…

We formally prove the existence of an enduring incongruence pervading a widespread interpretation of the Bell inequality and explain how to rationally avoid it with a natural assumption justified by explicit reference to a mathematical…

The main bottleneck for distributed quantum computing is the rate at which entanglement is produced between quantum processing units (QPUs). In this work, we prove that multiple QPUs connected through slow interconnects can outperform a…

It was believed until recently that the verification of quantum entanglement and quantum steering, between two parties, required trust in at least one of the parties and their devices, in contrast to the verification of Bell…