The coming Quantum Internet will bring us new capabilities: advanced
cryptographic functions, high-precision sensor networks for uses such
as high-resolution astronomy, and secure distributed quantum
computing. Experimental progress on the components for quantum
repeaters is moving at a dizzying rate, and theorists have proposed
various approaches to managing errors to create high-fidelity quantum
entanglement. Building quantum networks presents different challenges
from building quantum links. I will give an overview of these issues,
then discuss the even more daunting challenge of creating a network of
networks -- an internetwork -- and show how our simulations are
guiding the design of a true quantum Internet.
These challenges include routing (path selection), resource management
such as multiplexing techniques, and security considerations within
individual networks. Recently, we have discovered that it is possible
for a single hijacked quantum repeater to frame other repeaters as
malicious, substantially disrupting network operations. All of these
issues are magnified when discussing autonomous networks that exchange
information, known as an internetwork. In internetworking, not only
is the scale of the problem daunting, but heterogeneous technologies
will be deployed and demand interoperability at the logical level as
well as the physical. Network operators also prefer to maintain
the privacy of their own network operations, requiring mechanisms
including connection establishment to operate with minimal sharing of
information across network boundaries.
When built, quantum repeaters will allow the distribution of entangled quantum states across large distances,
playing a vital part in many proposed quantum technologies. Enabling multiple users to connect through the
same network will be key to their real-world deployment. Previous work on repeater technologies has focussed
only on simple entanglment production, without considering the issues of resource scarcity and competition
that necessarily arise in a network setting. In this paper we simulated a thirteen-node network with up to five
flows sharing different parts of the network, measuring the total throughput and fairness for each case. Our
results suggest that the Internet-like approach of statistical multiplexing use of a congested link gives the highest
aggregate throughput. Time division multiplexing and buffer space multiplexing were slightly less effective, but
all three schemes allow the sum of multiple flows to substantially exceed that of any one flow, improving over
circuit switching by taking advantage of resources that are forced to remain idle in circuit switching. All three
schemes proved to have excellent fairness. The high performance, fairness and simplicity of implementation
support a recommendation of statistical multiplexing for shared quantum repeater networks.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.