Related papers: Simple Communication Complexity Separation from Qu…
We show that several classes of mixed quantum states in finite-dimensional Hilbert spaces which can be characterized as being, in some respect, 'most classical' can be described and analyzed in a unified way. Among the states we consider…
We consider a general version of the phenomenon of more nonlocality with less entanglement, within the framework of the unambiguous (i.e., conclusive) quantum state discrimination problem under local quantum operations and classical…
We present a set of inequalities for detecting quantum entanglement of $2\otimes d$ quantum states. For $2\otimes 2$ and $2\otimes 3$ systems, the inequalities give rise to sufficient and necessary separability conditions for both pure and…
The classical communication complexity of testing closeness of discrete distributions has recently been studied by Andoni, Malkin and Nosatzki (ICALP'19). In this problem, two players each receive $t$ samples from one distribution over…
Imagine that Alice and Bob, unable to communicate, are both given a 16-bit string such that the strings are either equal, or they differ in exactly 8 positions. Both parties are then supposed to output a 4-bit string in such a way that…
Bell non-locality is a powerful framework to distinguish classical, quantum and post-quantum resources, which relies on non-communicating players. Under which restriction can we have the same separations, if we allow for communication?…
A central problem in quantum information is determining quantum-classical boundaries. A useful notion of classicality is provided by the quasiprobability formulation of quantum theory. In this framework, a state is called classical if it is…
Quantum communication relies on the existence of high quality quantum channels to exchange information. In practice, however, all communication links are affected by noise from the environment. Here we investigate the ability of quantum…
We consider a quantum and classical version multi-party function computation problem with $n$ players, where players $2, \dots, n$ need to communicate appropriate information to player 1, so that a "generalized" inner product function with…
Communication complexity is an area of classical computer science which studies how much communication is necessary to solve various distributed computational problems. Quantum information processing can be used to reduce the amount of…
Among the surprising features of quantum measurements, the problem of distinguishing and antidistinguishing general quantum measurements is fundamentally appealing. Unlike classical systems, quantum theory offers entangled states and…
We study a new type of separation between quantum and classical communication complexity which is obtained using quantum protocols where all parties are efficient, in the sense that they can be implemented by small quantum circuits with…
Quantum teleportation uses prior shared entanglement and classical communication to send an unknown quantum state from one party to another. Remote state preparation (RSP) is a similar distributed task in which the sender knows the entire…
The discrimination of two nonorthogonal states is a fundamental element for secure and efficient communication. Quantum measurements of nonorthogonal coherent states can enhance information transfer beyond the limits of conventional…
We study the quantum separability problem by using general symmetric informationally complete measurements and present separability criteria for both $d$-dimensional bipartite and multipartite systems. The criterion for bipartite quantum…
We focus on determining the separability of an unknown bipartite quantum state $\rho$ by invoking a sufficiently large subset of all possible entanglement witnesses given the expected value of each element of a set of mutually orthogonal…
A mixed quantum state shared between two parties is said to be distillable if, by means of a protocol involving only local quantum operations and classical communication, the two parties can transform some number of copies of that state…
A bipartite state which is secretly chosen from a finite set of known entangled pure states cannot be immediately useful in standard quantum information processing tasks. To effectively make use of the entanglement contained in this unknown…
We study the problem of testing identity of a collection of unknown quantum states given sample access to this collection, each state appearing with some known probability. We show that for a collection of $d$-dimensional quantum states of…
Motivated by the recent discovery of a quantum Chernoff theorem for asymptotic state discrimination, we investigate the distinguishability of two bipartite mixed states under the constraint of local operations and classical communication…