Related papers: Using Entanglement in Quantum Multi-Prover Interac…
In this paper we consider quantum interactive proof systems, i.e., interactive proof systems in which the prover and verifier may perform quantum computations and exchange quantum messages. It is proved that every language in PSPACE has a…
We prove a strong limitation on the ability of entangled provers to collude in a multiplayer game. Our main result is the first nontrivial lower bound on the class MIP* of languages having multi-prover interactive proofs with entangled…
A central problem in quantum computational complexity is how to prevent entanglement-assisted cheating in multi-prover interactive proof systems. It is well-known that the standard oracularization technique completely fails in some proof…
For a given pure state of a composite quantum system we analyze the product of its projections onto a set of locally orthogonal separable pure states. We derive a bound for this product analogous to the entropic uncertainty relations. For…
The restrictions that nature places on the distribution of correlations in a multipartite quantum system play fundamental roles in the evolution of such systems, and yield vital insights into the design of protocols for the quantum control…
Quantum entanglement, after playing a significant role in the development of the foundations of quantum mechanics, has been recently rediscovered as a new physical resource with potential commercial applications such as, for example,…
Entanglement is a unique property of quantum systems and an essential resource for many quantum technologies. The ability to transfer or swap entanglement between systems is an important protocol in quantum information science. Entanglement…
Quantum finite automata have been studied intensively since their introduction in late 1990s as a natural model of a quantum computer with finite-dimensional quantum memory space. This paper seeks their direct application to interactive…
A general proof of the security against eavesdropping of a previously introduced protocol for two-party quantum key distribution based on entanglement swapping [Phys. Rev. A {\bf 61}, 052312 (2000)] is provided. In addition, the protocol is…
The security analysis of quantum key distribution is difficult to perform when there is efficiency mismatch between various threshold detectors involved in an experimental setup. Even the verification that the device actually performs in…
We show that quantum entanglement can be used as a substitute for communication when the goal is to compute a function whose input data is distributed among remote parties. Specifically, we show that, for a particular function among three…
The primary goal of entanglement theory is to determine convertibility conditions for two quantum states. Up until now, this has always been done with the use of entanglement monotones. With the exception of the negativity, such quantities…
The entangled quantum states play a key role in quantum information. The association of the quantum state vector with each individual physical system in an attributive way is a source of many false paradoxes and inconsistencies. The…
We derive a general framework that connects every positive map with a corresponding witness for partial separability in multipartite quantum systems. We show that many previous approaches were intimately connected to the witnesses derived…
We study the problem of communication over a compound quantum channel in the presence of entanglement. Classically such channels are modeled as a collection of conditional probability distributions wherein neither the sender nor the…
Entanglement, which is an essential characteristic of quantum mechanics, is the key element in potential practical quantum information and quantum communication systems. However, there are many open and fundamental questions (relating to…
Complementarity, that is the ability of a quantum object to behave either as a particle or as a wave, is one of the most intriguing features of quantum mechanics. An exemplary Gedanken experiment, emphasizing such a measurement-dependent…
Secret sharing of a quantum state, or quantum secret sharing, in which a dealer wants to share certain amount of quantum information with a few players, has wide applications in quantum information. The critical criterion in a threshold…
We consider one-round games between a classical verifier and two provers who share entanglement. We show that when the constraints enforced by the verifier are `unique' constraints (i.e., permutations), the value of the game can be well…
In this paper, a multi-party quantum private comparison (MQPC) scheme is suggested based on entanglement swapping of Bell entangled states within d-level quantum system, which can accomplish the equality comparison of secret binary…