Pith. sign in

REVIEW 1 cited by

A Brief Introduction to Quantum Network Control

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2407.19899 v1 pith:IYZD6KVB submitted 2024-07-29 math.OC quant-ph

classification math.OCquant-ph
keywords quantumnetworkentanglementcontrolareabriefdistributingintroduction
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Quantum networking is an emerging area with the potential to transform information processing and communications. In this paper, we present a brief introduction to quantum network control, an area in quantum networking dedicated to designing algorithms for distributing entanglement (i.e., entangled qubits). We start by explaining what qubits and entanglement are and how they furnish quantum network control operations such as entanglement swapping and teleportation. With those operations, we present a model for distributing entanglement in a multi-hop quantum network to enable applications such as quantum key distribution and distributed quantum computing. We conclude the paper by presenting open research problems in the field, including the characterization of the quantum network capacity region and the design of throughput-optimal policies.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Optimal Scheduling in a Quantum Switch

    quant-ph 2025-01 conditional novelty 7.0 of 10

    A quantum switch's capacity region is characterized for general topologies, and a Markov-decision-process-based policy called ARE is proven asymptotically throughput-optimal.

Pith tools