Artificial Intelligence and Quantum Computing for Advanced Wireless Networks. Savo G. Glisic. Читать онлайн. Newlib. NEWLIB.NET

Автор: Savo G. Glisic
Издательство: John Wiley & Sons Limited
Серия:
Жанр произведения: Программы
Год издания: 0
isbn: 9781119790310
Скачать книгу
Homer CPU utilization, (b) Homestead processing delay (t‐tes...Figure 7.19 (a) Percentage error on delay prediction, (b) percentage CPU for...Figure 7.20 (a) Effect on processing latency, (b) effect on calls dropped (t...Figure 7.21 Cumulative call drops (t‐test number).Figure 7.22 Results of change point detection for a nonstationary traffic se...Figure 7.23 Learned traffic parameters and predicted resource demands for da...Figure 7.24 Distribution of VNF packet processing delay for both the synthes...Figure 7.25 QoS performance comparison between resource demand prediction sc...Figure 7.26 Episodic average reward versus the episode number for the three ...Figure 7.27 (a) System model, (b) local control loop used to stabilize the u...Figure 7.28 Numerical experiments with different M under N = 100.Figure 7.29 Illustrative example of structural role proximity.Figure 7.30 Conceptual view of network representation learning (NRL).Figure 7.31 Taxonomy to summarize network representation learning (NRL) tech...Figure 7.32 Categorization of network structure.

      7 Chapter 8Figure 8.1 The 2D representation of a qubit, when the amplitudes of its quan...Figure 8.2 The generic 3D representation of a qubit using a Bloch sphere, wh...Figure 8.3 Qubit represented by two electronic levels in an atom.Figure 8.4 Beam splitting of light.Figure 8.5 Wave and particle nature of light. (for more details see the colo...Figure 8.6 (a) Einstein–Podolsky–Rosen (EPR) paradox description using He at...Figure 8.7 Circuit representation of the Hadamard gate H, of the three Pauli...Figure 8.8 Quantum teleportation using entanglement.Figure 8.9 The five complex fifth roots of 1.Figure 8.10 QFTM/2 and a Hadamard gate correspond to FFTM/2 on the odd and e...Figure 8.11 QFTM is reduced to QFTM/2 and M additional gates.Figure 8.12 Quantum Fourier transform (QFT) iterations.Figure 8.13 General block diagram of QFT processor.

      8 Chapter 9Figure 9.1 Geometrical picture of a noisy qubit quantum channel on the Bloch...Figure 9.2 The channel evolution phase.Figure 9.3 The general model of transmission of information over a noisy

c...Figure 9.4 Communication over a noisy
channel.Figure 9.5 Detailed model of
channel: P purification state, X transmitter ...Figure 9.6 The formal model of a noisy quantum communication channel. The ou...Figure 9.7 Effects of the environment on the transmittable information and o...Figure 9.8 Transmission of classical information over quantum channel with p...Figure 9.9 Transmission of classical information over quantum channel with p...Figure 9.10 Transmission of classical information over quantum channel with ...Figure 9.11 Transmission of classical information over quantum channel with ...Figure 9.12 Model of private classical communication of a
channel.Figure 9.13 Entanglement‐assisted capacity of a
channel.Figure 9.14 Quantum zero‐error communication system.Figure 9.15 Comparison of single (a) and joint (b) measurement settings. The...Figure 9.16 Confusability graph of a zero‐error code for one channel use. Th...Figure 9.17 Graph of a zero‐error code for two channel uses of a quantum cha...Figure 9.18 Hypergraph and the confusability graph of a given input system w...Figure 9.19 Steps of the entanglement‐assisted zero‐error quantum communicat...Figure 9.20 Hypergraph of an entanglement‐assisted zero‐error quantum code. ...Figure 9.21 Transmission of quantum information through the quantum channel....Figure 9.22 (a) Initially, the quantum system and the reference system are i...Figure 9.23 The conceptual meaning of quantum coherent information. The unit...Figure 9.24 Expression of quantum coherent information. The source entropy o...Figure 9.25 Polarization optics of the QKD transmitter and receiver.

      9 Chapter 10Figure 10.1 Circuit diagram for the two‐qubit code.Figure 10.2 The circuit diagram of the three‐qubit code.Figure 10.3 Circuit illustrating the structure of an [[n, k, d]] stabilizer ...Figure 10.4 Circuit diagram for the four‐qubit code.Figure 10.5 The general procedure for active recovery in a quantum error cor...Figure 10.6 The surface code four cycle. (a) Graphical representation. (b) A...Figure 10.7 [50] (a) The [[5, 1, 2]] surface code formed by putting together...Figure 10.8 [50] A distance‐three surface code with parameters [13, 1, 3].Figure 10.9 (a),(b),(c) Rotating a distance 5 lattice to produce another dis...Figure 10.10 Notation for fault‐tolerant circuits.Figure 10.11 Simple example illustrating the principles of quantum error cor...Figure 10.12 Syndrome extraction operation for [[7, 1, 3]] CSS code.

      10 Chapter 11Figure 11.1 The quantum circuit employed in Shor’s algorithm for finding the...Figure 11.2 The quantum circuit of the quantum phase estimation algorithm, w...Figure 11.3 Grover operator’s quantum circuit including an oracle, two n‐qub...Figure 11.4 Example of Grover’s QSA, OO‐Oracle Operator, and DO‐Diffusion Op...Figure 11.5 Flowchart of the Boyer–Brassard–Høyer–Tapp (BBHT) quantum search...Figure 11.6 Flowchart of the Dürr–Høyer (DH) quantum search algorithm (QSA)....Figure 11.7 Quantum circuit of the quantum counting algorithm (QCA).Figure 11.8 Quantum circuit of the quantum mean algorithm (QMA).Figure 11.9 Quantum circuit of the quantum weighted sum algorithm (QWSA)....Figure 11.10 Interferometer with two phase shifters.Figure 11.11 Network representation for the phase shift transformation of Eq...Figure 11.12 Network representation of Deutsch’s algorithm.Figure 11.13 Network representation of Deutsch–Jozsa and Bernstein–Vazirani ...Figure 11.14 Network for

shown acting on the basis state ∣a1a2⋯am〉...Figure 11.15 Network illustrating estimation of phase φ with j‐bit precision...Figure 11.16 Network representation of Grover’s algorithms. By repeating the...

      11 Chapter 12Figure 12.1 Circuit‐centric quantum classifier.Figure 12.2 The circuit‐centric quantum classifier representation.Figure 12.3 Generic model circuit architecture for eight qubits.Figure 12.4 Graphical representation of quantum gates.Figure 12.5 (a) Parameter t1 and its derivative.Figure 12.5b Parameter t7 and its derivative.Figure 12.6 Schematic of the quantum neural network (QNN) on a quantum proce...

      12 Chapter 13Figure 13.1 Illustration of the three common steps of hybrid quantum‐classic...Figure 13.2 Quantum circuit to evaluate the n‐th component of the grad...Figure 13.3 Fraction of satisfied clauses R7(γ, β) for circuits o...Figure 13.4 Processing steps of HHL algorithm.Figure 13.5 Quantum circuit for solving a 4 × 4 system of linear equation Ax...

      13 Chapter 14Figure 14.1 Braess’s paradox.Figure 14.2 Simulation results.Figure 14.3 Simulation results.Figure 14.4 Cognitive network architecture.Figure 14.5 Circuit that generates the initial entangled state ∣ψ e 〉....Figure 14.6 CtrlF1 gate circuit, where

. Looking fro...Figure 14.7 Empirical probability p(L1) (choice frequency of the risky prosp...Figure 14.8 Empirical probability p(L1) (choice frequency of the risky prosp...

      14 Chapter 15Figure 15.1 Integration of satellite and ground communication networks.Figure 15.2 Principle of trusted‐repeater‐based satellite QKD.Figure 15.3 Basic structure of QKP‐enabled satellite QKD system.Figure 15.4 Architecture of double‐layer quantum satellite networks (QSNs)....Figure 15.5 Route selection for key‐relay services in two scenarios over the...Figure 15.6 Contact and resource graph of quantum satellite network (QSN)....Figure 15.7 Success probability (SP) and SP‐a versus traffic load under diff...Figure 15.8 (a) Success probability (SP) versus traffic load with different ...Figure 15.9 (a) Success probability (SP) versus traffic load with different ...Figure 15.10 Social overlay network.Figure 15.11 Social relationship graph form.Figure 15.12 Adaptive QoS‐QKD network model.Figure 15.13 Simple topology showing the calculation of the threshold

.Figure 15.14 Network parameters.Figure 15.15 An example of greedy forwarding.Figure 15.16 The number and average sizes of routing packets.Figure 15.17 Packet delivery ratio (PDR).

      15 Chapter