Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userPractical Realization of the Quantum Cryptography Protocol Exploiting Polarization Encoding in the Qutrits
69
0
0.0
(
0
)
Added by
Gleb A. Maslennikov
Publication date
2003
fields
Physics
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We propose and discuss a specific scheme allowing to realize a Quantum Cryptography qutrit protocol. This protocol exploits the polarization properties of single frequency and single spatial mode biphotons.
rate research
Read More
In counterfactual QKD information is transfered, in a secure way, between Alice and Bob even when no particle carrying the information is in fact transmitted between them. In this letter we fully implement the scheme for counterfactual QKD proposed in [T. Noh, PRL textbf{103}, 230501 (2009)], demonstrating for the first time that information can be transmitted between two parties without the transmission of a carrier.
We propose a probabilistic quantum protocol to realize a nonlinear transformation of qutrit states, which by iterative applications on ensembles can be used to distinguish two types of pure states. The protocol involves single-qutrit and two-qutrit unitary operations as well as post-selection according to the results obtained in intermediate measurements. We utilize the nonlinear transformation in an algorithm to identify a quantum state provided it belongs to an arbitrary known finite set. The algorithm is based on dividing the known set of states into two appropriately designed subsets which can be distinguished by the nonlinear protocol. In most cases this is accompanied by the application of some properly defined physical (unitary) operation on the unknown state. Then, by the application of the nonlinear protocol one can decide which of the two subsets the unknown state belongs to thus reducing the number of possible candidates. By iteratively continuing this procedure until a single possible candidate remains, one can identify the unknown state.
We realize Landau-Streater (LS) and Werner-Holevo (WH) quantum channels for qutrits on the IBM quantum computers. These channels correspond to interaction between the qutrit and its environment that result in the globally unitarily covariant qutrit transformation violating multiplicativity of the maximal $p$-norm. Our realization of LS and WH channels is based on embedding qutrit states into states of two qubits and using single-qubit and two-qubit CNOT gates to implement the specific interaction. We employ the standard quantum gates hence the developed algorithm suits any quantum computer. We run our algorithm on a 5-qubit and a 20-qubit computer as well as on a simulator. We quantify the quality of the implemented channels comparing their action on different input states with theoretical predictions. The overall efficiency is quantified by fidelity between the theoretical and experimental Choi states implemented on the 20-qubit computer.
In this work we review the security vulnerability of Quantum Cryptography with respect to man-in-the-middle attacks and the standard authentication methods applied to counteract these attacks. We further propose a modified authentication algorithm which features higher efficiency with respect to consumption of mutual secret bits.
We present a secure network communication system that operated with decoy-state quantum cryptography in a real-world application scenario. The full key exchange and application protocols were performed in real time among three nodes, in which two adjacent nodes were connected by approximate 20 km of commercial telecom optical fiber. The generated quantum keys were immediately employed and demonstrated for communication applications, including unbreakable real-time voice telephone between any two of the three communication nodes, or a broadcast from one node to the other two nodes by using one-time pad encryption.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
