China
Africa
Explore chapters and articles related to this topic
Quantum Field Propagation
Published in Indrakshi Dey, Propagation Modeling for Wireless Communications, 2022
As human beings, we generate classical information, and we can only understand information in classical format. To unleash the potentials of a quantum communication system in transferring classical information, we need to encode classical information into a set of quantum states at the input of quantum channel and decode those quantum states back to classical information through measurement at the output of the quantum channel. Photons are natural carriers of information in fiber and free-space optical (FSO) networks. Since photons are a kind of quantum particles and can exhibit the fundamental phenomena of the quantum world, quantum channels can be implemented using optical fiber or FSO channels. Since this book deals with wireless communication networks, we will restrict our discussion to FSO channels and how they can be characterized when quantum particles (photons or bosons) carrying information are sent through them. Before going into detailed characterization, let us acquaint ourselves to some fundamental concepts that we use and reuse throughout this chapter.
Quantum Networks
Published in Jonathan P. Dowling, Schrödinger’s Web, 2020
We have seen why in the discussion above. For a classical network, Alice can always make copies of the data, and so if the transmission line is faulty or has a lot of loss or noise, you can use the redundancy of the copies to overcome those problems. The no-cloning theorem prohibits such an approach in a quantum network. Since you can’t make copies, the analog of the classical solution is to send the quantum states over a quantum communication channel and hope for the best. A quantum communication channel, at the very least, allows you to transmit the quantum superposition state of an H+V polarized photon, and not let that superposition collapse into a classical mixture of either H or V. That is, the quantum channel transmits qubits and the conventional channel only bits. Since we cannot copy the qubits, we have to send them in this superposition of an H+V photon down the quantum channel, from transponder to transponder, until it gets to its final destination. Without the ability to copy it, it can only take one of the ten possible routes shown in Figure 6.12. If there happens to be too much traffic or a break on that route, you lose your state. If the state is carrying part of a computation from one quantum computer to another, the loss means the entire distributed quantum calculation fails, and you have to run the whole thing all over again. Luckily, as all the IARPA teams discovered, pre-shared entanglement, coupled with teleportation, fixes all that.
Lightweight Cryptography for Low Cost RFID: A New Direction in Cryptography
Published in Syed Ahson, Mohammad Ilyas, RFID Handbook, 2017
Damith C. Ranasinghe, Raja Ghosal, Alfio Grasso, Peter H. Cole
In its potential application to RFID, one may note the need for both a quantum transmission channel and a classical channel, and the emergence of only partial keys and then only after classical channel communication between sender and receiver of many quantum channel communications.
Review of Security Methods Based on Classical Cryptography and Quantum Cryptography
Published in Cybernetics and Systems, 2023
Shalini Subramani, Selvi M, Kannan A, Santhosh Kumar Svn
Quantum cryptography uses the smallest quantity of physical property in a system and it allows storing thoughtful information to a key material and that cannot be read by anyone excluding the receiver (Bernstein 2011; Bernstein and Lange 2017). Nowadays, the pasture of quantum technician is magnetizing an additional recognition than ever with significantly upgrade the theories and applications. Further, Shor algorithm (1994) is used to improve their prime factors in quantum algorithm. Grover (1996) laid forward this to establish one more algorithm that increases the speed up for search time within an unsorted database. There are 1024 random bits are used in his algorithm to generate keys independently and also provides a sending procedure by Gracie and Jack. The procedure was recapitulated with next bit, until all 1024 bits were used. The bit values 0 or 1 are generated and send to Jack, up to a long enough sufficient key is constructed to encrypt the message then it has been sent to Jack. Instantly, the classical channel was the traditional Internet Protocol (IP) channel and the key generated in quantum key distribution is extinct by communicating through the quantum channel (Elboukhari, Azizi, and Azizi 2010).
Quantum-computing with AI & blockchain: modelling, fault tolerance and capacity scheduling
Published in Mathematical and Computer Modelling of Dynamical Systems, 2019
The remainder of the paper is organized as follows. In Section 2, we present the quantum system formulation modelled by MIMO channels, fault tolerance by quantum mutual information, quantum storage and particle queueing dynamics. In Section 3, we present the RDRS model and the performance modelling for its internal quantum qubit data flow dynamics of the modelled quantum channel by the RDRS model. Main DCNN and game-competition based scheduling policy together with theoretical modelling results are presented. Numerical simulation examples are also given in this section. In Section 4, we formally prove our main theoretical results. In Section 5, we conclude the paper with remarks.