Related papers: Communication complexity and the reality of the wa…
We show that quantum-to-classical channels, i.e., quantum measurements, can be asymptotically simulated by an amount of classical communication equal to the quantum mutual information of the measurement, if sufficient shared randomness is…
We give a simple demonstration that the Schr\"odinger equation may be recast as a self-contained second-order Newtonian law for a congruence of spacetime trajectories. This provides a pictorial representation of the quantum state as the…
Realist, no-collapse interpretations of quantum mechanics, such as Everett's, face the probability problem: how to justify the norm-squared (Born) rule from the wavefunction alone. While any basis-independent measure can only be…
We study the fundamental, classical mechanism design problem of single-buyer multi-item Bayesian revenue-maximizing auctions under the lens of communication complexity between the buyer and the seller. Specifically, we ask whether using…
It is the matter of fact that quantum mechanics operates with notions that are not determined in the frame of the mechanics' formalism. Among them we can call the notion of "wave-particle" (that, however, does not appear in both classical…
We consider implementations of a bipartite unitary on many pairs of unknown input states by local operation and classical communication assisted by shared entanglement. We investigate to what extent the entanglement cost and the classical…
Pusey, Barrett and Rudolph (PBR) have recently proven an important new theorem in the foundations of quantum mechanics. Here we propose alternative experimental protocols which lead to the PBR result for a special case and a weaker PBR-like…
We propose a probabilistic two-party communication complexity scenario with a prior nonmaximally entangled state, which results in less communication than that is required with only classical random correlations. A simple all-optical…
According to Relational Quantum Mechanics (RQM) the wave function $\psi$ is considered neither a concrete physical item evolving in spacetime, nor an object representing the absolute state of a certain quantum system. In this interpretative…
The Pusey-Barrett-Rudolph (PBR) theorem deals with the realism of the quantum states. It establishes that every pure quantum state is real, in the context of quantum ontological models. Specifically, by guaranteeing the property of…
In this article we propose an approach that models the truth behavior of cognitive entities (i.e. sets of connected propositions) by taking into account in a very explicit way the possible influence of the cognitive person (the one that…
We study the question of how much classical communication is needed when Alice is given a classical description of a quantum state $|\psi\rangle$ for Bob to recover any expectation value $\langle \psi | M |\psi\rangle$ given an observable…
Quantum communication holds the promise of creating disruptive technologies that will play an essential role in future communication networks. For example, the study of quantum communication complexity has shown that quantum communication…
We show that the so-called quantum probabilistic rule, usually presented in the physical literature as an argument of the essential distinction between the probability relations under quantum and classical measurements, is not, as it is…
We demonstrate how to universally simulate ensemble statistics of projective local measurements on any $n$-qubit state shared among $n$ observers with classical communication and shared randomness. Our technique originates from protocols…
It is first shown that when the Schr\"{o}dinger equation for a wave function is written in the polar form, complete information about the system's {\em quantum-ness} is separated out in a single term $Q$, the so called `quantum potential'.…
We prove new lower bounds for bounded error quantum communication complexity. Our methods are based on the Fourier transform of the considered functions. First we generalize a method for proving classical communication complexity lower…
Niels Bohr proposed that the outcome of the measurement becomes objective and real, and, hence, classical, when its results can be communicated by classical means. In this work we revisit Bohr's postulate using modern tools from the quantum…
By considering quantum computation as a communication process, we relate its efficiency to a communication capacity. This formalism allows us to rederive lower bounds on the complexity of search algorithms. It also enables us to link the…
In this paper we suggest a simple mathematical procedure to derive the classical probability density of quantum systems via Bohr's correspondence principle. Using Fourier expansions for the classical and quantum distributions, we assume…