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/0101066 · Journal of Physics A Mathematical and General

Secure communication with single-photon two-qubit states

Almut Beige, Berthold‐Georg Englert, Christian Kurtsiefer, Harald Weinfurter

Published Jul 5, 2002• 127 citations
arXivHTMLPDF

Abstract

We propose a cryptographic scheme that is deterministic: Alice sends single photons to Bob, and each and every photon detected supplies one key bit—no photon is wasted. This is in marked contrast to other schemes in which a random process decides whether the next photon sent will contribute to the key or not. The determinism is achieved by preparing the photons in two-qubit states, rather than the one-qubit states used in conventional schemes. In particular, we consider the realistic situation in which one qubit is the photon polarization and the other a spatial alternative. Further, we show how one can exploit the deterministic nature for direct secure communication, that is without the need for establishing a shared key first.

DOI
10.1088/0305-4470/35/28/103

Related papers

Secure communication with a publicly known key

Almut Beige, Berthold‐Georg Englert, Christian Kurtsiefer +1 more

We present a scheme for direct and confidential communication between Alice and Bob, where there is no need for establishing a shared secret key first, and where the key used by Alice even will become known publicly. The communication is based on the exchange of single photons and each and every photon transmits one bit of Alice's message without revealing any information to a potential eavesdropper.

arXiv:quant-ph/0111106•Nov 20, 2001•2 citations

Secure Communication with a Publicly Known Key

Almut Beige, Berthold‐Georg Englert, Christian Kurtsiefer +1 more

We present a scheme for direct and confidential communication between Alice and Bob, where there is no need for establishing a shared secret key first, and where the key used by Alice even will become known publicly. The communication is based on the exchange of single photons and each and every photon transmits one bit of Alice's message without revealing any information to a potential eavesdropper.

Acta Physica Polonica A•Mar 1, 2002•416 citations

Deterministic and Highly Efficient Quantum Cryptography with Entangled Photon Pairs

Zhao, Zhi, Yang, Tao, Z B Chen +2 more

We present a protocol for deterministic and highly efficient quantum cryptography with entangled photon pairs in a 4x4-dimentional Hilbert space. Two communicating parties, Alice and Bob first share a both polarization- and path-entangled photon pair, and then each performs a complete Bell-state measurement on their own photon in one of two complementary Bell-state bases. It is demonstrated that each measurement in which both Alice and Bob register a photon can build certain perfect correlation and generate 1.5 key bits on average. The security of our protocol is guaranteed by the non-cloning theorem.

arXiv:quant-ph/0211098•Nov 18, 2002•4 citations

Efficient Three-Party Quantum Secret Sharing with Single Photons

Ping Zhou, Xihan Li, Deng Fu-Guo +1 more

A scheme for three-party quantum secret sharing of a private key is presented with single photons. The agent Bob first prepares a sequence of single photons with two biased bases and then sends them to the boss Alice who checks the security of the transmission with measurements and produces some decoy photons by rearranging the orders of some sample photons. Alice encodes her bits with two unitary operations on the photons and then sends them to the other agent. The security of this scheme is equivalent to that in the modified Bennett–Brassard 1984 quantum key distribution protocol. Moreover, each photon can carry one bit of the private key and the intrinsic efficiency for qubits and the total efficiency both approach the maximal value 100% when the number of the bits in the key is very large.

Chinese Physics Letters•Jul 26, 2007•26 citations

Unconditional security proof of a deterministic quantum key distribution with a two-way quantum channel

Hua Lu, Chi‐Hang Fred Fung, Xiongfeng Ma +1 more

In a deterministic quantum key distribution (DQKD) protocol with a two-way quantum channel, Bob sends a qubit to Alice who then encodes a key bit onto the qubit and sends it back to Bob. After measuring the returned qubit, Bob can obtain Alice's key bit immediately, without basis reconciliation. Since an eavesdropper may attack the qubits traveling on either the Bob-Alice channel or the Alice-Bob channel, the security analysis of DQKD protocol with a two-way quantum channel is complicated and its unconditional security has been controversial. This paper presents a security proof of a single-photon four-state DQKD protocol against general attacks.

arXiv:1111.0109•Physical Review A•Oct 31, 2011•70 citations

Quantum Secret Sharing Protocol between Multiparty and Multiparty with Single Photons and Unitary Transformations

Yan Feng-Li, Gao Ting, You‐Cheng Li

We propose a scheme of quantum secret sharing between Alice's group and Bob's group with single photons and unitary transformations. In the protocol, one member in Alice's group prepares a sequence of single photons in one of four different states, while other members directly encode their information on the sequence of single photons via unitary operations; after that, the last member sends the sequence of single photons to Bob's group. Then Bob's, except for the last one, do work similarly. Finally the last member in Bob's group measures the qubits. If the security of the quantum channel is guaranteed by some tests, then the qubit states sent by the last member of Alice's group can be used as key bits for secret sharing. It is shown that this scheme is safe.

arXiv:0801.4052•Chinese Physics Letters•Apr 1, 2008•49 citations
We propose a cryptographic scheme that is deterministic: Alice sends single photons to Bob, and each and every photon detected supplies one key bit—no photon is wasted. This is in marked contrast to other schemes in which a random process decides whether the next photon sent will contribute to the key or not. The determinism is achieved by preparing the photons in two-qubit states, rather than the one-qubit states used in conventional schemes. In particular, we consider the realistic situation in which one qubit is the photon polarization and the other a spatial alternative. Further, we show how one can exploit the deterministic nature for direct secure communication, that is without the need for establishing a shared key first.
We present a protocol for deterministic and highly efficient quantum cryptography with entangled photon pairs in a 4x4-dimentional Hilbert space. Two communicating parties, Alice and Bob first share a both polarization- and path-entangled photon pair, and then each performs a complete Bell-state measurement on their own photon in one of two complementary Bell-state bases. It is demonstrated that each measurement in which both Alice and Bob register a photon can build certain perfect correlation and generate 1.5 key bits on average. The security of our protocol is guaranteed by the non-cloning theorem.
A scheme for three-party quantum secret sharing of a private key is presented with single photons. The agent Bob first prepares a sequence of single photons with two biased bases and then sends them to the boss Alice who checks the security of the transmission with measurements and produces some decoy photons by rearranging the orders of some sample photons. Alice encodes her bits with two unitary operations on the photons and then sends them to the other agent. The security of this scheme is equivalent to that in the modified Bennett–Brassard 1984 quantum key distribution protocol. Moreover, each photon can carry one bit of the private key and the intrinsic efficiency for qubits and the total efficiency both approach the maximal value 100% when the number of the bits in the key is very large.
In a deterministic quantum key distribution (DQKD) protocol with a two-way quantum channel, Bob sends a qubit to Alice who then encodes a key bit onto the qubit and sends it back to Bob. After measuring the returned qubit, Bob can obtain Alice's key bit immediately, without basis reconciliation. Since an eavesdropper may attack the qubits traveling on either the Bob-Alice channel or the Alice-Bob channel, the security analysis of DQKD protocol with a two-way quantum channel is complicated and its unconditional security has been controversial. This paper presents a security proof of a single-photon four-state DQKD protocol against general attacks.
We propose a scheme of quantum secret sharing between Alice's group and Bob's group with single photons and unitary transformations. In the protocol, one member in Alice's group prepares a sequence of single photons in one of four different states, while other members directly encode their information on the sequence of single photons via unitary operations; after that, the last member sends the sequence of single photons to Bob's group. Then Bob's, except for the last one, do work similarly. Finally the last member in Bob's group measures the qubits. If the security of the quantum channel is guaranteed by some tests, then the qubit states sent by the last member of Alice's group can be used as key bits for secret sharing. It is shown that this scheme is safe.