Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1101.5361 · Physical Review A

Certifying entangled measurements in known Hilbert spaces

Tamás Vértesi, Miguel Navascués

Published Jun 17, 2011• 26 citations
arXivHTMLPDF

Abstract

We study under which conditions it is possible to assert that a joint measurement cannot be simulated by local operations and classical communication. More concretely, we consider a scenario where two parties, Alice and Bob, send each a state selected from a labeled set of unknown states to a third party, Charlie, who in turn interacts with the states in some undisclosed way and then announces an outcome. We show that, under the assumption that Alice and Bob know the dimensionality of their systems, there exist situations where the statistics of the outcomes reveals the nature of Charlie's measurement.

DOI
10.1103/physreva.83.062112

Related papers

Influence-free states on compound quantum systems

Howard Barnum, Christopher A. Fuchs, Joseph M. Renes +1 more

Let Alice and Bob be able to make local quantum measurements and communicate classically. The set of mathematically consistent joint probability assignments (``states'') for such measurements is properly larger than the set of quantum-mechanical mixed states for the Alice-Bob system. It is canonically isomorphic to the set of positive (not necessarily completely positive) linear maps Phi from the bounded linear operators on Alice's space to those on Bob's, for which Tr Phi(I)=1. We review the fact that allowing classical communication is equivalent to enforcing ``no-instantaneous-signalling'' (``no--influence'') in the direction opposite the communication. We establish that in the subclass of ``decomposable'' states, i.e. convex combinations of positive states with "PTP" ones whose partial transpose is positive, the extremal states are just the extremal positive and extremal PTP states. We show that two such states, shared by the same pair of parties, cannot necessarily be combined as independent states (their tensor product) if the full set of quantum operations is allowed locally to each party. We use a framework of ``test spaces'' and states on these, suited for exhibiting the analogies and deviations of empirical probabilistic theories from classical probability theory. This leads to a deeper understanding of analogies between quantum mechanics and Bayesian probability theory. The existence of a ``most Bayesian'' quantum rule for updating states after measurement, and its association with the situation when information on one system is gained by measuring another, is a case of a general proposition holding for test spaces combined subject to the no-signalling requirement.

arXiv:quant-ph/0507108•Bulletin of the American Physical Society•Jul 12, 2005•43 citations

Conditioning two-party quantum teleportation within a three-party quantum channel

Stefano Pirandola, Stefano Mancini, David Vitali

We consider an arbitrary continuous-variable three-party Gaussian quantum state which is used to perform quantum teleportation of a pure Gaussian state between two of the parties (Alice and Bob). In turn, the third party (Charlie) can condition the process by means of local operations and classical communication. We find the best measurement that Charlie can implement on his own mode that preserves the Gaussian character of the three-mode state and optimizes the teleportation fidelity between Alice and Bob.

arXiv:quant-ph/0410213•Physical Review A•Apr 18, 2005•21 citations

Measurement-device-independent quantification of entanglement for given Hilbert space dimension

Koon Tong Goh, Jean-Daniel Bancal, Valerio Scarani

We address the question of how much entanglement can be certified from the observed correlations and the knowledge of the Hilbert space dimension of the measured systems. We focus on the case in which both systems are known to be qubits. For several correlations (though not for all), one can certify the same amount of entanglement as with state tomography, but with fewer assumptions, since nothing is assumed about the measurements. We also present security proofs of quantum key distribution (QKD) without any assumption on the measurements. We discuss how both the amount of entanglement and the security of QKD are affected by the inefficiency of detectors in this scenario.

arXiv:1509.08682•New Journal of Physics•Apr 25, 2016•35 citations

QUANTUM SECURE CONDITIONAL DIRECT COMMUNICATION VIA EPR PAIRS

Ting Gao, Fengli Yan, Zhi‐Xi Wang

Two schemes for quantum secure conditional direct communication are proposed, where a set of EPR pairs of maximally entangled particles in Bell states, initially made by the supervisor Charlie, but shared by the sender Alice and the receiver Bob, functions as quantum information channels for faithful transmission. After insuring the security of the quantum channel and obtaining the permission of Charlie (i.e., Charlie is trustworthy and cooperative, which means the "conditional" in the two schemes), Alice and Bob begin their private communication under the control of Charlie. In the first scheme, Alice transmits secret message to Bob in a deterministic manner with the help of Charlie by means of Alice's local unitary transformations, both Alice and Bob's local measurements, and both of Alice and Charlie's public classical communication. In the second scheme, the secure communication between Alice and Bob can be achieved via public classical communication of Charlie and Alice, and the local measurements of both Alice and Bob. The common feature of these protocols is that the communications between two communication parties Alice and Bob depend on the agreement of the third side Charlie. Moreover, transmitting one bit secret message, the sender Alice only needs to apply a local operation on her one qubit and send one bit classical information. We also show that the two schemes are completely secure if quantum channels are perfect.

arXiv:quant-ph/0501130•International Journal of Modern Physics C•Aug 1, 2005•40 citations

How Much Measurement Independence Is Needed to Demonstrate Nonlocality?

Jonathan Barrett, Nicolas Gisin

If nonlocality is to be inferred from a violation of Bell's inequality, an important assumption is that the measurement settings are freely chosen by the observers, or alternatively, that they are random and uncorrelated with the hypothetical local variables. We demonstrate a connection between models that weaken this assumption, allowing partial correlation, and (i) models that allow classical communication between the distant parties, (ii) models that exploit the detection loophole. Even if Bob's choices are completely independent, all correlations from projective measurements on a singlet can be reproduced, with mutual information between Alice's choice and local variables less than or equal to one bit.

arXiv:1008.3612•Physical Review Letters•Mar 10, 2011•180 citations

TRADE-OFFS IN DISTINGUISHING TWO-QUBIT STATE PREPARATIONS USING ONE-WAY LOCC

Alvin Gonzales

Quantum state discrimination is a fundamental problem in quantum information science. We investigate the optimal distinguishability of orthogonal two-qubit (bipartite) quantum states. The scenario consists of three parties: Alice, Bob, and Charlie. Charlie prepares one of two orthogonal states and sends one qubit to Alice and the other to Bob. Their goal is to correctly identify which state Charlie sent. In most state discrimination scenarios, it is assumed that Alice and Bob can freely communicate with one another so as to collectively agree on the best guess. In this research, we consider a more restricted setting where only one-way classical communication is possible from Alice to Bob. Under this setting, we study two figures of merit (i) Alice's optimal probability, $P$, of identifying the state , and (ii) Alice's optimal probability, $P^\perp$, of identifying the state along with helping Bob identify the state perfectly. We show that in general $P\neq P^\perp$ and we prove a theorem for when $P=P^\perp$. We also found that the maximum of $P-P^\perp$ can arbitrarily approach $1/2$.

•Jan 1, 2017•0 citations
We study under which conditions it is possible to assert that a joint measurement cannot be simulated by local operations and classical communication. More concretely, we consider a scenario where two parties, Alice and Bob, send each a state selected from a labeled set of unknown states to a third party, Charlie, who in turn interacts with the states in some undisclosed way and then announces an outcome. We show that, under the assumption that Alice and Bob know the dimensionality of their systems, there exist situations where the statistics of the outcomes reveals the nature of Charlie's measurement.
Let Alice and Bob be able to make local quantum measurements and communicate classically. The set of mathematically consistent joint probability assignments (``states'') for such measurements is properly larger than the set of quantum-mechanical mixed states for the Alice-Bob system. It is canonically isomorphic to the set of positive (not necessarily completely positive) linear maps Phi from the bounded linear operators on Alice's space to those on Bob's, for which Tr Phi(I)=1. We review the fact that allowing classical communication is equivalent to enforcing ``no-instantaneous-signalling'' (``no--influence'') in the direction opposite the communication. We establish that in the subclass of ``decomposable'' states, i.e. convex combinations of positive states with "PTP" ones whose partial transpose is positive, the extremal states are just the extremal positive and extremal PTP states. We show that two such states, shared by the same pair of parties, cannot necessarily be combined as independent states (their tensor product) if the full set of quantum operations is allowed locally to each party. We use a framework of ``test spaces'' and states on these, suited for exhibiting the analogies and deviations of empirical probabilistic theories from classical probability theory. This leads to a deeper understanding of analogies between quantum mechanics and Bayesian probability theory. The existence of a ``most Bayesian'' quantum rule for updating states after measurement, and its association with the situation when information on one system is gained by measuring another, is a case of a general proposition holding for test spaces combined subject to the no-signalling requirement.
We consider an arbitrary continuous-variable three-party Gaussian quantum state which is used to perform quantum teleportation of a pure Gaussian state between two of the parties (Alice and Bob). In turn, the third party (Charlie) can condition the process by means of local operations and classical communication. We find the best measurement that Charlie can implement on his own mode that preserves the Gaussian character of the three-mode state and optimizes the teleportation fidelity between Alice and Bob.
We address the question of how much entanglement can be certified from the observed correlations and the knowledge of the Hilbert space dimension of the measured systems. We focus on the case in which both systems are known to be qubits. For several correlations (though not for all), one can certify the same amount of entanglement as with state tomography, but with fewer assumptions, since nothing is assumed about the measurements. We also present security proofs of quantum key distribution (QKD) without any assumption on the measurements. We discuss how both the amount of entanglement and the security of QKD are affected by the inefficiency of detectors in this scenario.
Two schemes for quantum secure conditional direct communication are proposed, where a set of EPR pairs of maximally entangled particles in Bell states, initially made by the supervisor Charlie, but shared by the sender Alice and the receiver Bob, functions as quantum information channels for faithful transmission. After insuring the security of the quantum channel and obtaining the permission of Charlie (i.e., Charlie is trustworthy and cooperative, which means the "conditional" in the two schemes), Alice and Bob begin their private communication under the control of Charlie. In the first scheme, Alice transmits secret message to Bob in a deterministic manner with the help of Charlie by means of Alice's local unitary transformations, both Alice and Bob's local measurements, and both of Alice and Charlie's public classical communication. In the second scheme, the secure communication between Alice and Bob can be achieved via public classical communication of Charlie and Alice, and the local measurements of both Alice and Bob. The common feature of these protocols is that the communications between two communication parties Alice and Bob depend on the agreement of the third side Charlie. Moreover, transmitting one bit secret message, the sender Alice only needs to apply a local operation on her one qubit and send one bit classical information. We also show that the two schemes are completely secure if quantum channels are perfect.
If nonlocality is to be inferred from a violation of Bell's inequality, an important assumption is that the measurement settings are freely chosen by the observers, or alternatively, that they are random and uncorrelated with the hypothetical local variables. We demonstrate a connection between models that weaken this assumption, allowing partial correlation, and (i) models that allow classical communication between the distant parties, (ii) models that exploit the detection loophole. Even if Bob's choices are completely independent, all correlations from projective measurements on a singlet can be reproduced, with mutual information between Alice's choice and local variables less than or equal to one bit.
Quantum state discrimination is a fundamental problem in quantum information science. We investigate the optimal distinguishability of orthogonal two-qubit (bipartite) quantum states. The scenario consists of three parties: Alice, Bob, and Charlie. Charlie prepares one of two orthogonal states and sends one qubit to Alice and the other to Bob. Their goal is to correctly identify which state Charlie sent. In most state discrimination scenarios, it is assumed that Alice and Bob can freely communicate with one another so as to collectively agree on the best guess. In this research, we consider a more restricted setting where only one-way classical communication is possible from Alice to Bob. Under this setting, we study two figures of merit (i) Alice's optimal probability, PPP, of identifying the state , and (ii) Alice's optimal probability, P⊥P^\perpP⊥, of identifying the state along with helping Bob identify the state perfectly. We show that in general P≠P⊥P\neq P^\perpP=P⊥ and we prove a theorem for when P=P⊥P=P^\perpP=P⊥. We also found that the maximum of P−P⊥P-P^\perpP−P⊥ can arbitrarily approach 1/21/21/2.