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:quant-ph/9908006 · Physical Review A

Quantum-communication protocol employing weak measurements

Alonso Botero, Benni Reznik

Published Mar 31, 2000• 17 citations
arXivHTMLPDF

Abstract

We propose a communication protocol exploiting correlations between two events with a definite time ordering: (a) the outcome of a weak measurement on a spin, and (b) the outcome of a subsequent ordinary measurement on the spin. In our protocol, Alice first generates a ``code'' by performing weak measurements on a sample of N spins. The sample is sent to Bob, who later performs a postselection by measuring the spin along either of two certain directions. The results of the postselection define the ``key,'' which he then broadcasts publicly. Using both her previously generated code and this key, Alice is able to infer the direction chosen by Bob in the postselection. Alternatively, if Alice broadcasts publicly her code, Bob is able to infer from the code and the key the direction chosen by Alice for her weak measurement. Two possible experimental realizations of the protocols are briefly mentioned.

DOI
10.1103/physreva.61.050301

Related papers

Quantum counterfactual communication without a weak trace

David R. M. Arvidsson-Shukur, C. H. W. Barnes

The classical theories of communication rely on the assumption that there has to be a flow of particles from Bob to Alice in order for him to send a message to her. We develop a quantum protocol that allows Alice to perceive Bob's message ``counterfactually''; that is, without Alice receiving any particles that have interacted with Bob. By utilizing a setup built on results from interaction-free measurements, we outline a communication protocol whereby the information travels in the opposite direction of the emitted particles. In comparison to previous attempts on such protocols, this one is such that a weak measurement at the message source would not leave a weak trace that could be detected by Alice's receiver. While some interaction-free schemes require a large number of carefully aligned beam splitters, our protocol is realizable with two or more beam splitters. We demonstrate this protocol by numerically solving the time-dependent Schr\"odinger equation for a Hamiltonian that implements this quantum counterfactual phenomenon.

arXiv:1705.05628•Physical Review A•Dec 5, 2016•30 citations

Weak Values with Remote Postselection and Shared Entanglement

Arun Kumar Pati, Uttam Singh

We propose a new protocol for the weak measurement of any observable with remote pre and postselections. We show that if two parties share a pure entangled state, then by using local operations and classical communication they can preselect and postselect at distant locations leading to the weak value of an observable as a shift in the pointer of the apparatus at one location in the process of the weak measurement. This can be achieved with either sharing of a pure maximally or non-maximally entangled state. We generalize the protocol for realizing the weak value of any observable with remote pre and postselection of mixed states. Finally, we show how the weak value is modified in the remote pre and postselection setting if Alice and Bob share a mixed entangled state.

arXiv:1310.6002•Oct 22, 2013•1 citation

A scheme for quantum communication using EPR pairs and local measurement

Fengli Yan, Ting Gao

We present a scheme for quantum communication, where a set of EPR pairs, initially shared by the sender Alice and the receiver Bob, functions as a quantum channel. After insuring the safety of the quantum channel, Alice applies local measurement on her particles of the EPR pairs and informs Bob the encoding classical information publicly. According to Alice's classical information and his measurement outcomes on the EPR pairs Bob can infer the secret messages directly. In this scheme, to transmit one bit secret message, the sender Alice only needs to send one bit classical information to the receiver Bob. We also show that this scheme is completely secure if perfect quantum channel is used.

arXiv:quant-ph/0501055•Jan 12, 2005•1 citation

Simulating Quantum Correlations with Finite Communication

Oded Regev, Ben Toner

Assume Alice and Bob share some bipartite d-dimensional quantum state. A well-known result in quantum mechanics says that by performing two-outcome measurements, Alice and Bob can produce correlations that cannot be obtained locally, i.e., with shared randomness alone. We show that by using only two bits of communication, Alice and Bob can classically simulate any such correlations. All previous protocols for exact simulation required the communication to grow to infinity with the dimension d. Our protocol and analysis are based on a power series method, resembling Krivine's bound on Grothendieck's constant, and on the computation of volumes of spherical tetrahedra.

arXiv:0708.0827•SIAM Journal on Computing•Dec 4, 2009•53 citations

Communicating over wireless channels with information-theoretic secrecy

Xiaojun Tang

Wireless systems are susceptible to eavesdropping as an unwelcome result of the broadcast nature of the wireless medium. Fortunately, the wireless medium also provides endowments including the temporal dispersion, the capability of signal superposition and other properties, to facilitate defending against eavesdropping. The focus of the thesis is to provide schemes for utilizing these properties at the physical layer and their performance analysis from an information-theoretic secrecy perspective. The work is based on Wyner's results on the wire-tap channel, in which the transmission between two legitimate users (Alice and Bob) is eavesdropped upon by Eve. The secrecy level is measured by the equivocation rate at Eve. The system performance is measured by the secrecy capacity. This is the maximum rate at which a message can be sent from Alice to Bob, while constraining the equivocation rate at Eve equal to the communication rate, and thus ensuring that Eve cannot deduce any useful information asymptotically. First, the scenario where a secret message needs to be delivered to the intended receiver within a given delay constraint and without the knowledge of the channel state information (CSI) at the transmitter is considered. In particular, hybrid automatic retransmission request (HARQ) protocols are revisited for a block-fading wire-tap channel via a joint consideration of channel coding, secrecy coding, and retransmission protocols. Two secure HARQ protocols: a repetition time diversity (RTD) scheme with maximal-ratio combining, and an incremental redundancy (INR) scheme based on ratecompatible Wyner secrecy codes are analyzed via an outage-based formulation. The throughput of RTD and INR protocols under probabilistic outage requirements is derived. Asymptotic analysis and numerical computations are given to demonstrate both the benefits of HARQ protocols and the tradeoff between reliability and confidentiality in delay-constrained communications. Second, the effects of interference on information-theoretic secret communication is considered. More specifically, the wiretap channel with a helping interferer (WT-HI) is proposed and studied. Here, an interferer, which does not know the confidential message, helps in ensuring the secrecy of the message by sending independent signals. Achievable secrecy rates and upper bounds on the secrecy capacity are given for both discrete memoryless and Gaussian channels. Interference has conventionally been regarded as a harmful phenomenon that leads to decreasing the rate and the reliability performance of wireless systems. In this work, it is shown that interference can be exploited to assist wireless secrecy. Lastly, the problem of secret key generation over fading channels, in which there exists an additional authenticated, public and error-free feedback channel from Bob to Alice, is considered. A key generation scheme consisting of a communication phase and a key-generation phase is presented. The communication phase is based on layered broadcast coding, which adapts the decoded rate at Bob to the actual channel state without requiring CSI available at Alice. The key-generation phase is based on the messages decoded by Bob after the communication phase and the public feedback. The achievable secrecy key rate and the optimal power distribution over coded layers for maximizing the secrecy key rate are characterized. Theoretical and numerical results show that the broadcast approach outperforms the single-level-coding based approach significantly, and hence demonstrate the role of introducing self-interference in facilitating secret-key generation over slowly fading channels when transmit CSI is not available.

•Jan 1, 2010•0 citations

Experimental implementation of time-coding quantum key distribution

William Boucher, Thierry Debuisschert

We have implemented an experimental setup in order to demonstrate the feasibility of time-coding protocols for quantum key distribution. Alice produces coherent 20-ns faint pulses of light at 853 nm. They are sent to Bob with delay 0 ns (encoding bit 0) or 10 ns (encoding bit 1). Bob directs at random the received pulses to two different arms. In the first one, a 300 ps resolution Si photon counter allows Bob to precisely measure the detection times of each photon in order to establish the key. Comparing them with the emission times of the pulses sent by Alice allows one to evaluate the quantum bit error rate (QBER). The minimum obtained QBER is 1.62%. The possible loss of coherence in the setup can be exploited by Eve to eavesdrop the line. Therefore, the second arm of Bob setup is a Mach-Zehnder interferometer with a 10 ns propagation delay between the two paths. Contrast measurement of the output beams allows one to measure the autocorrelation function of the received pulses that characterizes their average coherence. In the case of an ideal setup, the value expected with the pulses sent by Alice is 0.576. The experimental value of the pulses autocorrelation function is found to be 0.541. Knowing the resulting loss of coherence and the measured QBER, one can evaluate the mutual information between Alice and Eve and the mutual information between Alice and Bob, in the case of intercept-resend attacks and in the case of attacks with intrication. With our values, Bob has an advantage on Eve of 0.43 bit per pulse. The maximum possible QBER corresponding to equal informations for Bob and Eve is 5.8%. With the usual attenuation of fibres at 850 nm, it shows that secure key distribution is possible up to a distance of 2.75 km, which is sufficient for local links.

arXiv:quant-ph/0601068•Physical Review A•Dec 19, 2005•23 citations
We propose a communication protocol exploiting correlations between two events with a definite time ordering: (a) the outcome of a weak measurement on a spin, and (b) the outcome of a subsequent ordinary measurement on the spin. In our protocol, Alice first generates a code'' by performing weak measurements on a sample of N spins. The sample is sent to Bob, who later performs a postselection by measuring the spin along either of two certain directions. The results of the postselection define the key,'' which he then broadcasts publicly. Using both her previously generated code and this key, Alice is able to infer the direction chosen by Bob in the postselection. Alternatively, if Alice broadcasts publicly her code, Bob is able to infer from the code and the key the direction chosen by Alice for her weak measurement. Two possible experimental realizations of the protocols are briefly mentioned.
The classical theories of communication rely on the assumption that there has to be a flow of particles from Bob to Alice in order for him to send a message to her. We develop a quantum protocol that allows Alice to perceive Bob's message ``counterfactually''; that is, without Alice receiving any particles that have interacted with Bob. By utilizing a setup built on results from interaction-free measurements, we outline a communication protocol whereby the information travels in the opposite direction of the emitted particles. In comparison to previous attempts on such protocols, this one is such that a weak measurement at the message source would not leave a weak trace that could be detected by Alice's receiver. While some interaction-free schemes require a large number of carefully aligned beam splitters, our protocol is realizable with two or more beam splitters. We demonstrate this protocol by numerically solving the time-dependent Schr\"odinger equation for a Hamiltonian that implements this quantum counterfactual phenomenon.
We propose a new protocol for the weak measurement of any observable with remote pre and postselections. We show that if two parties share a pure entangled state, then by using local operations and classical communication they can preselect and postselect at distant locations leading to the weak value of an observable as a shift in the pointer of the apparatus at one location in the process of the weak measurement. This can be achieved with either sharing of a pure maximally or non-maximally entangled state. We generalize the protocol for realizing the weak value of any observable with remote pre and postselection of mixed states. Finally, we show how the weak value is modified in the remote pre and postselection setting if Alice and Bob share a mixed entangled state.
We present a scheme for quantum communication, where a set of EPR pairs, initially shared by the sender Alice and the receiver Bob, functions as a quantum channel. After insuring the safety of the quantum channel, Alice applies local measurement on her particles of the EPR pairs and informs Bob the encoding classical information publicly. According to Alice's classical information and his measurement outcomes on the EPR pairs Bob can infer the secret messages directly. In this scheme, to transmit one bit secret message, the sender Alice only needs to send one bit classical information to the receiver Bob. We also show that this scheme is completely secure if perfect quantum channel is used.
Assume Alice and Bob share some bipartite d-dimensional quantum state. A well-known result in quantum mechanics says that by performing two-outcome measurements, Alice and Bob can produce correlations that cannot be obtained locally, i.e., with shared randomness alone. We show that by using only two bits of communication, Alice and Bob can classically simulate any such correlations. All previous protocols for exact simulation required the communication to grow to infinity with the dimension d. Our protocol and analysis are based on a power series method, resembling Krivine's bound on Grothendieck's constant, and on the computation of volumes of spherical tetrahedra.
Wireless systems are susceptible to eavesdropping as an unwelcome result of the broadcast nature of the wireless medium. Fortunately, the wireless medium also provides endowments including the temporal dispersion, the capability of signal superposition and other properties, to facilitate defending against eavesdropping. The focus of the thesis is to provide schemes for utilizing these properties at the physical layer and their performance analysis from an information-theoretic secrecy perspective. The work is based on Wyner's results on the wire-tap channel, in which the transmission between two legitimate users (Alice and Bob) is eavesdropped upon by Eve. The secrecy level is measured by the equivocation rate at Eve. The system performance is measured by the secrecy capacity. This is the maximum rate at which a message can be sent from Alice to Bob, while constraining the equivocation rate at Eve equal to the communication rate, and thus ensuring that Eve cannot deduce any useful information asymptotically. First, the scenario where a secret message needs to be delivered to the intended receiver within a given delay constraint and without the knowledge of the channel state information (CSI) at the transmitter is considered. In particular, hybrid automatic retransmission request (HARQ) protocols are revisited for a block-fading wire-tap channel via a joint consideration of channel coding, secrecy coding, and retransmission protocols. Two secure HARQ protocols: a repetition time diversity (RTD) scheme with maximal-ratio combining, and an incremental redundancy (INR) scheme based on ratecompatible Wyner secrecy codes are analyzed via an outage-based formulation. The throughput of RTD and INR protocols under probabilistic outage requirements is derived. Asymptotic analysis and numerical computations are given to demonstrate both the benefits of HARQ protocols and the tradeoff between reliability and confidentiality in delay-constrained communications. Second, the effects of interference on information-theoretic secret communication is considered. More specifically, the wiretap channel with a helping interferer (WT-HI) is proposed and studied. Here, an interferer, which does not know the confidential message, helps in ensuring the secrecy of the message by sending independent signals. Achievable secrecy rates and upper bounds on the secrecy capacity are given for both discrete memoryless and Gaussian channels. Interference has conventionally been regarded as a harmful phenomenon that leads to decreasing the rate and the reliability performance of wireless systems. In this work, it is shown that interference can be exploited to assist wireless secrecy. Lastly, the problem of secret key generation over fading channels, in which there exists an additional authenticated, public and error-free feedback channel from Bob to Alice, is considered. A key generation scheme consisting of a communication phase and a key-generation phase is presented. The communication phase is based on layered broadcast coding, which adapts the decoded rate at Bob to the actual channel state without requiring CSI available at Alice. The key-generation phase is based on the messages decoded by Bob after the communication phase and the public feedback. The achievable secrecy key rate and the optimal power distribution over coded layers for maximizing the secrecy key rate are characterized. Theoretical and numerical results show that the broadcast approach outperforms the single-level-coding based approach significantly, and hence demonstrate the role of introducing self-interference in facilitating secret-key generation over slowly fading channels when transmit CSI is not available.
We have implemented an experimental setup in order to demonstrate the feasibility of time-coding protocols for quantum key distribution. Alice produces coherent 20-ns faint pulses of light at 853 nm. They are sent to Bob with delay 0 ns (encoding bit 0) or 10 ns (encoding bit 1). Bob directs at random the received pulses to two different arms. In the first one, a 300 ps resolution Si photon counter allows Bob to precisely measure the detection times of each photon in order to establish the key. Comparing them with the emission times of the pulses sent by Alice allows one to evaluate the quantum bit error rate (QBER). The minimum obtained QBER is 1.62%. The possible loss of coherence in the setup can be exploited by Eve to eavesdrop the line. Therefore, the second arm of Bob setup is a Mach-Zehnder interferometer with a 10 ns propagation delay between the two paths. Contrast measurement of the output beams allows one to measure the autocorrelation function of the received pulses that characterizes their average coherence. In the case of an ideal setup, the value expected with the pulses sent by Alice is 0.576. The experimental value of the pulses autocorrelation function is found to be 0.541. Knowing the resulting loss of coherence and the measured QBER, one can evaluate the mutual information between Alice and Eve and the mutual information between Alice and Bob, in the case of intercept-resend attacks and in the case of attacks with intrication. With our values, Bob has an advantage on Eve of 0.43 bit per pulse. The maximum possible QBER corresponding to equal informations for Bob and Eve is 5.8%. With the usual attenuation of fibres at 850 nm, it shows that secure key distribution is possible up to a distance of 2.75 km, which is sufficient for local links.