Artificial Intelligence and Quantum Computing for Advanced Wireless Networks. Savo G. Glisic

Скачать книгу

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 16Figure 16.1 Schematic illustration of the adopted quantum network architectu...Figure 16.2 Expected link entanglement rate ξ_{i, j}(T^ch) between adjacent...Figure 16.3 Expected end‐to‐end entanglement rate

between nodes v_i and v_j ...Figure 16.4 Minimum coherence time required for the successful utilization ...Figure 16.5 (a) Butterfly, (b) inverted crown network.Figure 16.6 (a) The G_k network, (b) the grail network.Figure 16.7 Probability distributions of 100‐step discrete quantum walks on ...Figure 16.8 The probability distribution obtained from a computer simulation...Figure 16.9 A graph with various degrees and a labeling of the edges for eac...Figure 16.10 The hypercube in d = 3 dimensions. Vertices correspond to 3‐bit...Figure 16.11 The classical simple random walk on the three‐dimensional hyper...Figure 16.12 The graph G₄. Two binary trees of n = 4 levels are glued togeth...Figure 16.13 The elements of the Hamiltonian of the quantum random walk on GFigure 16.14 Approximation of the finite line by an infinite homogeneous lin...Figure 16.15 A random walk on assignments to the 2‐SAT formula of our exampl...Figure 16.16 The modified graph of Figure 16.12. A big random cycle has been...

      16 Chapter 17Figure 17.1 Quantum internet graph G with deterministically chosen virtual l...Figure 17.2 Quantum internet graph G with deterministically chosen virtual l...Figure 17.3 Comparison of different routing algorithms on deterministic virt...Figure 17.4 Recursively generated physical graph and virtual graph at the 0‐...Figure 17.5 Recursively generated physical graph and virtual graph at the fi...Figure 17.6 Network example with three switches (boxes with multiple vertica...Figure 17.7 A quantum network protocol stack comprising four layers: physica...Figure 17.8 Setting of layers 1 and 2.Figure 17.9 Settings of layers 3 and 4.Figure 17.10 Greenberger–Horne–Zeilinger (GHZ) states are very fragile.Figure 17.11 (a) Static phase, (b) adaptive phase.Figure 17.12 (a) Static phase, (b) adaptive phase.Figure 17.13 The goal of a quantum routing protocol.Figure 17.14 Regions and how they connect.Figure 17.15 The state for connecting nine networks in hierarchical regions ...Figure 17.16 Symmetrizing a network state between regions (shown for a three...Figure 17.17 Example network for illustration of Protocol 2.Figure 17.18 (a) Generating the state |GHZ₄〉, (b) generating the state...

      Guide

      1  Cover Page

      2  Artificial Intelligence and Quantum Computing for Advanced Wireless Networks

      3  Copyright

      4  Preface

      5  Table of Contents

      6  Begin Reading

      7  Index

      8  WILEY END USER LICENSE AGREEMENT

      Pages

      1  iii

      2  iv

      3  xiii

      4  1

      5  3

      6  4

      7  5

      8  6

      9  7

      10  8

      11  9

      12  10

      13  11

      14 12

      15 13

      16 14

      17 15

      18 16

      19  17

      20 18

      21  19

      22  20

      23 21

      24 22

      25  23

      26  24

      27  25

      28  26

      29 27

Скачать книгу