Related papers: Simple Communication Complexity Separation from Qu…
We present a general technique for hiding a classical bit in multipartite quantum states. The hidden bit, encoded in the choice of one of two possible density operators, cannot be recovered by local operations and classical communication…
This work addresses two problems in the context of two-party communication complexity of functions. First, it concludes the line of research, which can be viewed as demonstrating qualitative advantage of quantum communication in the three…
We propose a probabilistic quantum protocol to realize a nonlinear transformation of qutrit states, which by iterative applications on ensembles can be used to distinguish two types of pure states. The protocol involves single-qutrit and…
One advantage of quantum algorithms over classical computation is the possibility to spread out, process, analyse and extract information in multipartite configurations in coherent superpositions of classical states. This will be discussed…
Quantum entanglement is a key enabling ingredient in diverse applications. However, the presence of unwanted adversarial entanglement also poses challenges in many applications. In this paper, we explore methods to "break" quantum…
The creation complexity of a quantum state is the minimum number of elementary gates required to create it from a basic initial state. The creation complexity of quantum states is closely related to the complexity of quantum circuits, which…
I consider the problem of deterministically distinguishing the state of a multipartite system, from a set of $N\ge d+1$ orthogonal states, where $d$ is the dimension of each party's subsystem. It is shown that if the set of orthogonal…
The problem of quantum state classification asks how accurately one can identify an unknown quantum state that is promised to be drawn from a known set of pure states. In this work, we introduce the notion of $k$-learnability, which…
We investigate the quantum advantage that can arise in typical two-party communication scenarios, where the sender and the receiver are allowed to share prior correlations. Focusing on communication tasks constrained by the…
In this paper, we study the separability of quantum states in bosonic system. Our main tool here is the "separability witnesses", and a connection between "separability witnesses" and a new kind of positivity of matrices--- "Power Positive…
In this paper, we consider the problem of unambiguous discrimination between a set of mixed quantum states. We first divide the density matrix of each mixed state into two parts by the fact that it comes from ensemble of pure quantum…
Quantum state discrimination is one of the most fundamental problems studied in quantum information theory. Applications range from channel coding to metrology and cryptography. In this work, we introduce a new variant of this task: Local…
In STOC 1999, Raz presented a (partial) function for which there is a quantum protocol communicating only $O(\log n)$ qubits, but for which any classical (randomized, bounded-error) protocol requires $\poly(n)$ bits of communication. That…
Quantum key distribution (QKD) allows two users to exchange a provably secure key for cryptographic applications. In prepare-and-measure QKD protocols, the states must be indistinguishable to prevent information leakage to an eavesdropper…
If a pure state of a qubit pair is developed over the four basis states, it is known that an equality between the four coefficients of that development exists if and only if that state is unentangled. This paper considers an arbitrary pure…
A fundamental limitation of quantum communication is that a single qubit can carry at most 1 bit of classical information. For an important class of quantum communication channels, known as entanglement-breaking, this limitation holds even…
We give an exponential separation between one-way quantum and classical communication complexity for a Boolean function. Earlier such a separation was known only for a relation. A very similar result was obtained earlier but independently…
Realizing robust quantum information transfer between long-lived qubit registers is a key challenge for quantum information science and technology. Here we demonstrate unconditional teleportation of arbitrary quantum states between diamond…
Like entanglement, quantum discord quantifies the quantum correlations. Unlike entanglement, whose detection is extremely difficult, the quantum discord of an arbitrary bipartite state allows itself to be detected perfectly by a single…
We define "coherent communication" in terms of a simple primitive, show it is equivalent to the ability to send a classical message with a unitary or isometric operation, and use it to relate other resources in quantum information theory.…