Related papers: Entanglement in Interactive Proof Systems with Bin…
Whether the observables of a physical system admit real values is of fundamental importance to a deep understanding of nature. In this work, we report a device-independent experiment to confirm that the joint reality of two observables on a…
We describe two quantum channels that individually cannot send any information, even classical, without some chance of decoding error. But together a single use of each channel can send quantum information perfectly reliably. This proves…
We show that the class QMA does not change even if we restrict Arthur's computing ability to only Clifford gate operations (plus classical XOR gate). The idea is to use the fact that the preparation of certain single-qubit states, so called…
Finding a feasible protocol for probing the quantum nature of gravity has been attracting an increasing amount of attention. In this manuscript, we propose a protocol to enhance the detection of gravitationally induced entanglement by…
Theoretical methods for empirical state determination of entangled two-level systems are analyzed in relation to information theory. We show that hidden variable theories would lead to a Shannon index of correlation between the entangled…
Coherent states with large amplitudes are traditionally thought of as the best quantum mechanical approximation of classical behavior. Here we argue that, far from being classical, coherent state are in fact highly entangled. We demonstrate…
We propose that the entanglement of mixed states is characterised properly in terms of a probability density function $\mathcal{P}_{\rho}(\mathcal{E})$. There is a need for such a measure since the prevalent measures (such as…
We formulate a two-party communication complexity problem and present its quantum solution that exploits the entanglement between two qutrits. We prove that for a broad class of protocols the entangled state can enhance the efficiency of…
The bound entangled state carries noisy entanglement and it is very hard to distill but the usefulness of bound entangled states has been depicted in different applications. This article represents a comparative dynamical study of an open…
In this paper, we study the bipartite entanglement of spin coherent states in the case of pure and mixed states. By a proper choice of the subsystem spins, the entanglement for large class of quantum systems is investigated. We generalize…
Detection of entanglement is an indispensable step to practical quantum computation and communication. Compared with the conventional entanglement witness method based on fidelity, we propose a flexible, machine learning assisted…
The general individual (non-coherent) attack on the ping-pong protocol with completely entangled pairs of three-dimensional quantum systems (qutrits) is analyzed. The expression for amount of the eavesdropper's information as functions from…
Entangled quantum systems can exhibit correlations that cannot be simulated classically. For historical reasons such correlations are called "Bell inequality violations." We give two new two-player games with Bell inequality violations that…
This paper introduces quantum analogues of non-interactive perfect and statistical zero-knowledge proof systems. Similar to the classical cases, it is shown that sharing randomness or entanglement is necessary for non-trivial protocols of…
Copying the quantum states is contradictory to classical information processing since the fundamental difference between classical and quantum information is that while classical information can be copied perfectly, quantum information…
We show a hitherto unexplored consequence of the property of identicity in quantum mechanics. If two identical objects, distinguished by a dynamical variable A, are in certain entangled states of another dynamical variable B, then, for such…
The "Power of One Qubit" refers to a computational model that has access to only one pure bit of quantum information, along with n qubits in the totally mixed state. This model, though not as powerful as a pure-state quantum computer, is…
We show that given an explicit description of a multiplayer game, with a classical verifier and a constant number of players, it is QMA-hard, under randomized reductions, to distinguish between the cases when the players have a strategy…
Suppose Alice and Bob share a maximally entangled state of any finite dimension and each perform two-outcome measurements on the respective part of the state. It is known, due to the recent result of Regev and Toner, that if a classical…
In this paper, we introduce a class of highly entangled real quantum states that cannot be approximated by circuits with $\log$-many non-Clifford gates and prove that Bell sampling enables efficient cross-device verification (or distributed…