2019
DOI: 10.1007/s11128-019-2226-5
|View full text |Cite
|
Sign up to set email alerts
|

Entanglement access control for the quantum Internet

Abstract: Quantum entanglement is a crucial element of establishing the entangled network structure of the quantum Internet. Here we define a method to achieve controlled entanglement access in the quantum Internet. The proposed model defines different levels of entanglement accessibility for the users of the quantum network. The path cost is determined by an integrated criterion on the entanglement fidelities between the quantum nodes and the probabilities of entangled connections of an entangled path. We reveal the co… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

1
46
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
8
1

Relationship

3
6

Authors

Journals

citations
Cited by 46 publications
(47 citation statements)
references
References 64 publications
1
46
0
Order By: Relevance
“…Bell measurements are typically used to obtain long-range bipartite entanglement, while multi-qubit measurements can be made in order to generate multipartite entanglement; see, e.g., Refs. [65][66][67][68][69][70][71][72][73][74][75][76].…”
Section: Network Architectures and Entanglement Distribution Protocolsmentioning
confidence: 99%
“…Bell measurements are typically used to obtain long-range bipartite entanglement, while multi-qubit measurements can be made in order to generate multipartite entanglement; see, e.g., Refs. [65][66][67][68][69][70][71][72][73][74][75][76].…”
Section: Network Architectures and Entanglement Distribution Protocolsmentioning
confidence: 99%
“…, ρ g } of demands with both end nodes A ρ∈ ,U k and B ρ∈ ,U k not affected by f as given by (34). The quantity of D P(N ) (ρ i (S i )) (see (33)), which describes the required total entanglement by demand ρ i with connection set S i along entangled connections traversed by respective paths P (N ) in N , is set to the amount of the total entanglement required for ρ i , D (ρ i (S i )) (see (32)). As a final substep, determine the shortest pathṖ i for ρ i by using the temporarily incidence matrixĨ N as characterized in step 1.…”
Section: Stepmentioning
confidence: 99%
“…Step 3. Propagate back R j W R k →B to R i , and update R (0) i W Rj →B (50) via estimation E R i W Rj →B (49) to R i W Rj →B as…”
Section: Routing Space Exploration and Scalable Routingmentioning
confidence: 99%
“…In a quantum Internet scenario [20][21][22][23][24][25][26][27][28][29][30][31][43][44][45][46][47][48][49][50][51][52][53][55][56][57][58][59][60][61][78][79][80] , a primary task is to distribute quantum entanglement 54,81-98 from a source quantum node to a target quantum node through a set of intermediate quantum nodes called quantum repeaters 32,[99][100][101][102][103][104][105][106][107][108][109][110][111][112] . The entanglement distribution is realized in a step-by-step manner by the generation of short-distance entangled connections between quantum nodes.…”
mentioning
confidence: 99%