Quantum complex network

Part of a series on
Network science
Theory
Graph Complex network Contagion Small-world Scale-free Community structure Percolation Evolution Controllability Graph drawing Social capital Link analysis Optimization Reciprocity Closure Homophily Transitivity Preferential attachment Balance theory Network effect Social influence
Network types
Informational (computing) Telecommunication Transport Social Scientific collaboration Biological Artificial neural Interdependent Semantic Spatial Dependency Flow on-Chip
Graphs
Features Clique Component Cut Cycle Data structure Edge Loop Neighborhood Path Vertex Adjacency list / matrix Incidence list / matrix Types Bipartite Complete Directed Hyper Labeled Multi Random Weighted
Metrics Algorithms
Centrality Degree Motif Clustering Degree distribution Assortativity Distance Modularity Efficiency
Models
Topology Random graph Erdős–Rényi Barabási–Albert Bianconi–Barabási Fitness model Watts–Strogatz Exponential random (ERGM) Random geometric (RGG) Hyperbolic (HGN) Hierarchical Stochastic block Blockmodeling Maximum entropy Soft configuration LFR Benchmark Dynamics Boolean network agent based Epidemic/SIR
Lists Categories
Topics Software Network scientists Category:Network theory Category:Graph theory
v t e

Quantum complex networks are complex networks whose nodes are quantum computing devices.^[1][2] Quantum mechanics has been used to create secure quantum communications channels that are protected from hacking.^[3][4] Quantum communications offer the potential for secure enterprise-scale solutions.^[5][2][6]

Motivation[edit]

In theory, it is possible to take advantage of quantum mechanics to create secure communications using features such as quantum key distribution is an application of quantum cryptography that enables secure communications^[3] Quantum teleportation can transfer data at a higher rate than classical channels.^{[4][relevant?]}

History[edit]

Successful quantum teleportation experiments in 1998.^[7] Prototypical quantum communication networks arrived in 2004.^[8] Large scale communication networks tend to have non-trivial topologies and characteristics, such as small world effect, community structure, or scale-free.^[6]

Concepts[edit]

Qubits[edit]

In quantum information theory, qubits are analogous to bits in classical systems. A qubit is a quantum object that, when measured, can be found to be in one of only two states, and that is used to transmit information.^[3] Photon polarization or nuclear spin are examples of binary phenomena that can be used as qubits.^[3]

Entanglement[edit]

Quantum entanglement is a physical phenomenon characterized by correlation between the quantum states of two or more physically separate qubits.^[3] Maximally entangled states are those that maximize the entropy of entanglement.^[9][10] In the context of quantum communication, entangled qubits are used as a quantum channel.^[3]

Bell measurement[edit]

Bell measurement is a kind of joint quantum-mechanical measurement of two qubits such that, after the measurement, the two qubits are maximally entangled.^[3][10]

Entanglement swapping[edit]

Entanglement swapping is a strategy used in the study of quantum networks that allows connections in the network to change.^[1][11] For example, given 4 qubits, A, B, C and D, such that qubits C and D belong to the same station^{[clarification needed]}, while A and C belong to two different stations^{[clarification needed]}, and where qubit A is entangled with qubit C and qubit B is entangled with qubit D. Performing a Bell measurement for qubits A and B, entangles qubits A and B. It is also possible to entangle qubits C and D, despite the fact that these two qubits never interact directly with each other. Following this process, the entanglement between qubits A and C, and qubits B and D are lost. This strategy can be used to define network topology.^[1][11][12]

Network structure[edit]

While models for quantum complex networks are not of identical structure, usually a node represents a set of qubits in the same station (where operations like Bell measurements and entanglement swapping can be applied) and an edge between node ${\displaystyle i}$ and ${\displaystyle j}$ means that a qubit in node ${\displaystyle i}$ is entangled to a qubit in node ${\displaystyle j}$, although those two qubits are in different places and so cannot physically interact.^[1][11] Quantum networks where the links are interaction terms^{[clarification needed]} instead of entanglement are also of interest^[13][which?]

Notation[edit]

Each node in the network contains a set of qubits in different states. To represent the quantum state of these qubits, it is convenient to use Dirac notation and represent the two possible states of each qubit as ${\displaystyle |0\rangle }$ and ${\displaystyle |1\rangle }$.^[1][11] In this notation, two particles are entangled if the joint wave function, ${\displaystyle |\psi _{ij}\rangle }$, cannot be decomposed as^[3][10]

${\displaystyle |\psi _{ij}\rangle =|\phi \rangle _{i}\otimes |\phi \rangle _{j},}$

where ${\displaystyle |\phi \rangle _{i}}$ represents the quantum state of the qubit at node i and ${\displaystyle |\phi \rangle _{j}}$ represents the quantum state of the qubit at node j.

Another important concept is maximally entangled states. The four states (the Bell states) that maximize the entropy of entanglement between two qubits can be written as follows:^[3][10]

${\displaystyle |\Phi _{ij}^{+}\rangle ={\frac {1}{\sqrt {2}}}(|0\rangle _{i}\otimes |0\rangle _{j}+|1\rangle _{i}\otimes |1\rangle _{j}),}$

${\displaystyle |\Phi _{ij}^{-}\rangle ={\frac {1}{\sqrt {2}}}(|0\rangle _{i}\otimes |0\rangle _{j}-|1\rangle _{i}\otimes |1\rangle _{j}),}$

${\displaystyle |\Psi _{ij}^{+}\rangle ={\frac {1}{\sqrt {2}}}(|0\rangle _{i}\otimes |1\rangle _{j}+|1\rangle _{i}\otimes |0\rangle _{j}),}$

${\displaystyle |\Psi _{ij}^{-}\rangle ={\frac {1}{\sqrt {2}}}(|0\rangle _{i}\otimes |1\rangle _{j}-|1\rangle _{i}\otimes |0\rangle _{j}).}$

Models[edit]

Quantum random networks[edit]

The quantum random network model proposed by Perseguers et al. (2009)^[1] can be thought of as a quantum version of the Erdős–Rényi model. In this model, each node contains ${\displaystyle N-1}$ qubits, one for each other node. The degree of entanglement between a pair of nodes, represented by ${\displaystyle p}$, plays a similar role to the parameter ${\displaystyle p}$ in the Erdős–Rényi model in which two nodes form a connection with probability ${\displaystyle p}$, whereas in the context of quantum random networks, ${\displaystyle p}$ refers to the probability of converting an entangled pair of qubits to a maximally entangled state using only local operations and classical communication.^[14]

Using Dirac notation, a pair of entangled qubits connecting the nodes ${\displaystyle i}$ and ${\displaystyle j}$ is represented as

${\displaystyle |\psi _{ij}\rangle ={\sqrt {1-p/2}}|0\rangle _{i}\otimes |0\rangle _{j}+{\sqrt {p/2}}|1\rangle _{i}\otimes |1\rangle _{j},}$

For ${\displaystyle p=0}$, the two qubits are not entangled:

${\displaystyle |\psi _{ij}\rangle =|0\rangle _{i}\otimes |0\rangle _{j},}$

and for ${\displaystyle p=1}$, we obtain the maximally entangled state:

${\displaystyle |\psi _{ij}\rangle ={\sqrt {1/2}}(|0\rangle _{i}\otimes |0\rangle _{j}+|1\rangle _{i}\otimes |1\rangle _{j})}$.

For intermediate values of ${\displaystyle p}$, ${\displaystyle 0<p<1}$, any entangled state is, with probability ${\displaystyle p}$, successfully converted to the maximally entangled state using LOCC operations.^[14]

One feature that distinguishes this model from its classical analogue is the fact that, in quantum random networks, links are only truly established after they are measured, and it is possible to exploit this fact to shape the final state of the network.^[relevant?] For an initial quantum complex network with an infinite number of nodes, Perseguers et al.^[1] showed that, the right measurements and entanglement swapping, make it possible^[how?] to collapse the initial network to a network containing any finite subgraph, provided that ${\displaystyle p}$ scales with ${\displaystyle N}$ as ${\textstyle p\sim N^{Z}}$, where ${\displaystyle Z\geq -2}$. This result is contrary to classical graph theory, where the type of subgraphs contained in a network is bounded by the value of ${\displaystyle z}$.^[15][why?]

Entanglement percolation[edit]

Entanglement percolation models attempt to determine whether a quantum network is capable of establishing a connection between two arbitrary nodes through entanglement, and to find the best strategies to create such connections.^[11][16]

Cirac et al. (2007)^[16] applied a model to complex networks by Cuquet et al. (2009),^[11] in which nodes are distributed in a lattice^[16] or in a complex network,^[11] and each pair of neighbors share two pairs of entangled qubits that can be converted to a maximally entangled qubit pair with probability ${\displaystyle p}$. We can think of maximally entangled qubits as the true links between nodes. In classical percolation theory, with a probability ${\displaystyle p}$ that two nodes are connected, ${\displaystyle p}$ has a critical value (denoted by ${\displaystyle p_{c}}$), so that if ${\displaystyle p>p_{c}}$ a path between two randomly selected nodes exists with a finite probability, and for ${\displaystyle p<p_{c}}$ the probability of such a path existing is asymptotically zero.^[17] ${\displaystyle p_{c}}$ depends only on the network topology.^[17]

A similar phenomenon was found in the model proposed by Cirac et al. (2007),^[16] where the probability of forming a maximally entangled state between two randomly selected nodes is zero if ${\displaystyle p<p_{c}}$ and finite if ${\displaystyle p>p_{c}}$. The main difference between classical and entangled percolation is that, in quantum networks, it is possible to change the links in the network, in a way changing the effective topology of the network. As a result, ${\displaystyle p_{c}}$ depends on the strategy used to convert partially entangled qubits to maximally connected^{[clarification needed]} qubits.^[11][16] With a naïve approach, ${\displaystyle p_{c}}$ for a quantum network is equal to ${\displaystyle p_{c}}$ for a classic network with the same topology.^[16] Nevertheless, it was shown that is possible to take advantage of quantum swapping to lower ${\displaystyle p_{c}}$ both in regular lattices^[16] and complex networks.^[11]

See also[edit]

• Erdős–Rényi model
• Gradient network
• Network dynamics
• Network topology
• Quantum key distribution
• Quantum teleportation

References[edit]

External links[edit]

• LOCC operations