text:
\section{Introduction}

The international race to build practical quantum computers is heating up. The US Congress recently passed the \textit{National Quantum Initiative Act}, signed by the US President, to secure America's leading position in quantum computing. Several grand projects worth billions of dollars have been announced by China and the EU to build their own quantum computers. Australia, meanwhile,  is the World leader in silicon technology for quantum computing.

Given this heavy investment by governments and industries around the globe, progress in the development of experimental quantum computing hardware has been very rapid over the last few years. Google, IBM and Intel all announced their chips of 72, 50 and 49 qubits (quantum bits) respectively in 2018. Quantum technologies that overcome classical limitations, and quantum
supremacy, have been observed time and time again \cite{8093785}. For example,
Grover's algorithm \cite{Grover:1996:FQM:237814.237866}, for querying an unsorted database on a quantum computer, affords a quadratic speedup
when compared to its best classical computation competitor.
Even more impressive is Shor's factoring algorithm \cite{Shor:1997:PAP:264393.264406},
which provides an exponential speedup in comparison with
the best known classical approach to factoring. It is anticipated that \textquotedblleft quantum supremacy\textquotedblright - the superiority of quantum computing over classical devices for a well-defined computational problem - will be achieved by NISQ (Noisy Intermediate Scale Quantum) devices in the near future \cite{Preskill2018quantumcomputingin}. All these phenomenons indicate that we are at the current stage of the second quantum revolution: transition from quantum theory to quantum engineering.

Quantum internet would play an indubitable role in the development of the second quantum revolution, where quantum communication is enabled between any two points on Earth. Besides the potential of exploring the super computational power of quantum mechanics, quantum internet could be help to build ultra-sharp telescopes using widely separated observatories \cite{PhysRevLett.109.070503}, remote quantum computers and secure cloud quantum computing \cite{5438603,DBLP:conf/focs/Mahadev18,DBLP:conf/focs/BrakerskiCMVV18}, even establishing new ways of detecting gravitational waves. Immediately, such a quantum internet would provide unparalleled
capabilities that are provably impossible by using only classical information.

Lots of efforts have been devoted in making quantum internet a reality, or at least making some application of quantum internet a reality.

In 1984, Bennett and Brassard introduced the first and the most famous application of quantum internet, quantum key distribution (QKD) \cite{BEN84,Bennett1992}, which enables two remote end nodes to establish a provable secure random key given the correctness of quantum mechanics. This is not possible within the scope of classical internet. Many research teams have succeeded in building and operating quantum
cryptographic devices since last century. In \cite{Elliott:2003:QCP:863955.863982}, it reported the building of world's first network, the DARPA
Quantum Network, that delivers end to end network security via high-speed QKD by BBN, Harvard, and Boston University. Notably, this network is suitable for
deployment in metro-size areas via standard telecom (dark) fiber. In 2017, the first long-distance quantum communication landline came online, connecting the capital city of China with the coastal city of Shanghai over a distance of more than 1,200 miles. At the same time, the first quantum-encrypted video call, a skype chat between Austria and China, is made possible by the Chinese quantum communication satellite known as Micius.

In the domain of quantum computing, being able to send qubits from one quantum processor to another allows them to
be connected to form a quantum computing cluster. This is often referred to as networked quantum computing, or
distributed quantum computing. Here, several less powerful quantum processors are connected together by a quantum
network to form one much more powerful quantum computer. This is analogous to connecting several classical
computers to form a computer cluster in classical computing. Networked quantum computing offers a path towards
scalability for quantum computers, since more and more quantum processors can naturally be added over time to
increase the overall quantum computing capabilities. In networked quantum computing, the individual quantum
processors are typically separated only by short distances.

In the realm of quantum communication, one wants to send qubits from one quantum processor to another over long
distances. This way local quantum networks can be intra connected into a quantum internet. A quantum internet
supports many applications, which derive their power from the fact that by transmitting qubits one can create quantum
entanglement between the remote quantum processors. Most applications of a quantum internet require only very
modest quantum processors. For most quantum internet protocols, such as for example quantum key distribution in
quantum cryptography, it is sufficient if these processors are capable of preparing and measuring only a single qubit at
a time. This is in contrast to quantum computing where interesting applications can only be realized if the (combined)
quantum processors have more qubits that can be simulated easily on a classical computer (more than around 60).
The reason why quantum internet applications only need very small quantum processors of often just a single qubit, is
because quantum entanglement can already be realized between just two qubits. A simulation of an entangled quantum
system on a classical computer can not simultaneously provide both the same security and speed.

Besides establishing classical correlation between nodes, establishing quantum correlation--entanglement also attracts lots of attention \cite{PB08}.
One of the main reason is quantum communication offers the possibility of distributed
computation with extraordinary \emph{provable\/} savings in
communication as compared with classical communication (see, e.g.,
\cite{Raz99,Regev:2011} and the references therein).
Such a system will be required if future quantum computers are to be linked together into a quantum internet. Distributed quantum networks will allow users to perform tasks and to interact in ways which are not possible with present-day technology. Their implementation is a key challenge for quantum science and requires the development of stationary quantum nodes that can send and receive as well as store and process quantum information locally.
Paper \cite{Lloyd:2004:IQI:1039111.1039118} present the progress of a system for long-distance, high-fidelity qubit teleportation developed by a team of researchers from the Massachusetts Institute of Technology and Northwestern University.

In \cite{HKM18}, deterministic delivery of remote entanglement on a quantum network was realized using diamond spin qubit nodes.
Rapid experimental progress in recent
years has brought first rudimentary quantum
networks within reach.
Physicists can control and manipulate quantum signals very much better than before \cite{Kim08,RMP15}.
In recent work \cite{AGJ18}, an idea is illustrated to store
quantum information for hours at a time using
special diamonds. This makes the quantum
information even more stable than the
conventional information stored in the working
memory of our computers. A team at Delft has already started to build the first genuine quantum network, which will link four cities in the Netherlands. The project, set to be finished in 2020. Although
it is hard to predict what the exact
components of a future quantum internet will
be, it is likely that we will see the birth of the
first multinode quantum networks in the next
few years. Chicago Quantum Exchange, a research hub
that is building a 30 mile
quantum teleportation network using telecommunication fib.

The advantages of quantum internet over classical internet come from the ability of exchanging qubits that are fundamentally different than classical bits.
The digital abstraction, on which modern computation and
communication rests, admits to only two possible states: a
classical on-off system must be in either state 0 or state
1, representing a single bit of information.
Quantum mechanics allows the qubit to be in a coherent superposition of both states/levels simultaneously. This property is fundamental to quantum mechanics and quantum computing.
What makes things much more complicated is entanglement---the fact that qubits can be entangled with each other.
This quantum correlation can be much stronger than its classical counter part, and thus provides advantages in information processing tasks.

In a recent seminal work \cite{WER18}, Wehner and coauthors drew a road map of quantum internet by proposing stages of development toward a full-blown quantum internet and highlight experimental and theoretical progress needed to attain them. Comparing with the tools and techniques developed around the eve of classical internet in 1970s, a methodology of unified, reliable, ordered, and error-checked delivery of a stream of qubits between applications running on quantum end node is still missing.
Transmission Control Protocol/Internet Protocol (TCP/IP), one of the core components of the Internet developed by Vinton Cerf and Bob Kahn in \cite{1092259}, solves such problem in classical internet by providing a systematic layer of protocols that permit the different types of processing necessary to be carried out by different systems with the least amount of digesting of information, and thus enables widespread use and applications.
Almost all operating systems in use today, including all consumer-targeted systems, include a TCP/IP implementation.
Currently, there are different ideas of building quantum computer, superconducting leading by IBM and Goodle, ion trap leading by University of Maryland, topological leading by Microsoft, and so on. Besides connecting quantum devices within the same computing platform, a unified protocol which allows those within different platforms to interconnect would be of extremely convenient.
Unfortunately, such network stack for quantum internet has not been presented yet.
Some basic elements have
been noted \cite{6576340}, however, no such
network stack presently exists for a quantum
internet, only  Observing the significant difference between classical bits and quantum bits, the frames of TCP/IP can not be directly applied in the quantum internet. Retransmission is one of the basic mechanisms used by protocols operating over a packet switched computer network to provide reliable communication (such as that provided by a reliable byte stream, for example TCP). However, retransmission is generally impossible for transmitting qubits due to the the non-cloning theorem as we mentioned before. Very recently, the design
of the quantum Internet received much attention from an engineering communication perspective. Many challenges are formulated in \cite{Caleffi:2018:QIC:3233188.3233224,CCT18}.

There are some tools of software development for a quantum internet like \cite{DW19,AA18}.

In this paper, we propose quantum internet protocols which allow variations in individual quantum network packet sizes, transmission failures,
sequencing, flow control, end-to-end error checking, and the creation and
destruction of logical process-to-process connections.
To protect the fragile quantum information in the quantum internet, we employ techniques of quantum error-correcting codes as well as
classical techniques of stack design. The creation of the logical process-to-process connections is accomplished by a quantum version of the three-way handshake protocol. Also classical four-way wavehand protocol is used to destroy these connections.

\fi

\section{Introduction}

The international race to build practical quantum computers is heating up. The US Congress recently passed the \textit{National Quantum Initiative Act}  to secure the leading position of U.S. in quantum computing. In the meantime, several grand quantum computing projects, which amount to billions of dollars, have been announced by China and the EU.
Advances in quantum computing hardware have been very rapid over the past few years. Google, IBM, and Intel all announced their quantum chips of $72$, $50$, and $49$ superconducting  qubits (quantum bits), respectively, in 2018.

Modern computing and communication rest on the digital abstraction of information, measured in \emph{bits}.
A bit has a state either  $0$ or $1$.
Quantum mechanics allows a quantum bit (qubit)  to be in a \emph{superposition} of both states 0 and~1.
In addition, the dimension of the state space grows exponentially with the number of qubits. These properties endow a quantum computer the power to achieve tasks that are beyond the capability of classical computers.
For example,
Grover's search algorithm \cite{Grover:1996:FQM:237814.237866}, for querying an unsorted database
on a quantum computer, affords a quadratic speedup
when compared to its best classical competitor.
Even more impressive is Shor's factoring algorithm \cite{Shor:1997:PAP:264393.264406},
which provides an exponential speedup over
the best known classical factoring approach. It is anticipated that \textquotedblleft quantum supremacy\textquotedblright -- the superiority of quantum computing over classical devices for a well-defined computational problem -- will be achieved by NISQ (noisy intermediate scale quantum) devices in the near future~\cite{Preskill2018quantumcomputingin}.
All these phenomena indicate that we are in the transitions from studing quantum theory to engineering quantum information---the second quantum revolution~\cite{MDG03}.

An extraordinary quantum effect is \emph{entanglement}-- a strong quantum correlation between qubits that are even far apart.
With preshared quantum entanglement between different parties,
communication of quantum information can be done by so-called \emph{quantum teleportation}~\cite{PhysRevLett.70.1895}.
Thus establishing entanglement attracts lots of attention \cite{PB08}.
A remarkable work is the system for long-distance and high-fidelity qubit teleportation developed by a team of researchers from   Massachusetts Institute of Technology and Northwestern University in 2004~\cite{Lloyd:2004:IQI:1039111.1039118}.
In 2018, deterministic delivery of remote entanglement on a quantum network was realized using diamond spin qubit nodes \cite{HKM18}.

Being able to send qubits from one quantum processor to another allows them  to form a quantum computing cluster.
These quantum processors can together build an entangled qantum sytem.
In this way several less powerful quantum processors are allowed to jointly perform more powerful tasks that are not possible with present-day technologies.
This is often referred  to as \emph{networked quantum computing}, or
\emph{distributed quantum computing},
{which may provide \emph{exceptional} savings in
	communication complexity, compared with classical distributed computation (see, e.g.,
	\cite{Raz99,Regev:2011} and the references therein).}
Therefore, networked quantum computing offers a path towards
scalability for quantum computers, since more and more quantum processors can naturally be added to the network.

With several quantum networks joined together, the quantum internet would play an indubitable role in the development of the second quantum revolution.
Besides the potential of exploring the computational power of quantum mechanics, the quantum internet could   help to build ultra-sharp telescopes~\cite{PhysRevLett.109.070503}, remote quantum computers and secure cloud quantum computing \cite{5438603,DBLP:conf/focs/Mahadev18,DBLP:conf/focs/BrakerskiCMVV18}.
Immediately, the quantum internet would provide unparalleled
capabilities that are provably impossible by only classical computation. For example, in 1984, Bennett and Brassard introduced the first and the most famous application of quantum internet, quantum key distribution (QKD) \cite{BEN84,Bennett1992}, which enables two remote end nodes to establish  provably-secure random keys.
To implement quantum key distribution, it is sufficient for the quantum processors to be capable of preparing and measuring only a single qubit at a time.
Many research teams have succeeded in building and operating quantum
cryptographic devices since last century. In \cite{Elliott:2003:QCP:863955.863982}, the world's first network, the DARPA
Quantum Network, was built, which delivers end to end network security via high-speed QKD by BBN, Harvard, and Boston University.
Building the 1,200-mile quantum communication landline between Beijing and Shanghai in 2016 and the quantum communication satellite (known as Micius) in 2017, China has the world's first space-ground quantum network~\cite{YCL+17}.

Rapid experimental progress in recent
years has brought first rudimentary quantum
networks within reach.
Physicists can control and manipulate quantum signals much better than before \cite{Kim08,RMP15}.
In 2018, an idea is illustrated to store
quantum information for hours at a time using
special diamonds \cite{AGJ18}. This makes the quantum
information even more stable than the
conventional information stored in the working
memory of our computers. A team at Delft has already started to build the first genuine quantum network, which will link four cities in the Netherlands.
{Chicago Quantum Exchange, a research hub
	that is building a 30-mile
	quantum teleportation network using telecommunication fibers.}
It is likely that we will see the birth of the
first multi-node quantum network in the next
few years.

Very recently, the design
of the quantum internet received much attention from an engineering communication perspective. Many challenges are formulated in \cite{Caleffi:2018:QIC:3233188.3233224,CCT18}.
In a recent seminal work \cite{WER18}, Wehner and coauthors have drawn a road map for the future quantum internet. They proposed  stages of development toward a full-blown quantum internet and highlighted experimental and theoretical progress needed to achieve them. Referring to the development history of the classical internet, the next step toward quantum internet is to estabilish a methodology of unified, reliable, ordered, and error-checked delivery of a stream of qubits between applications running on quantum endnodes.
In particular,
{packet switching is a technique for reliably and efficiently transmitting data over a communication  channel.}
A similar feature for quantum  communication is desired. Thus we will imitate this packet switching technique
and propose the quantum analogue for the quantum internet.

Moreover, Transmission Control Protocol/Internet Protocol (TCP/IP),  developed by Vinton Cerf and Bob Kahn in \cite{1092259}, is one of the core components of the Internet that solves the previously mentioned problems in classical internet. TCP/IP provide a systematic classification of tasks  that allows the different types of information processing to be accomplished by specific systems using the least amount of digesting of information, and thus enable the widespread use and applications of the classical internet.
Almost all operating systems in use today, including all consumer-targeted systems, adopt  a TCP/IP implementation.
Therefore a unified protocol that allows quantum computers on different platforms to interconnect would be of extremely convenient,
especially that there are different ideas of building quantum computers: superconducting qubits led by IBM and Google, ion trap led by the University of Maryland, topological qubits led by Microsoft, and so on.
Unfortunately, such a network stack for quantum internet has not been presented yet but only
some basic elements have
been noted \cite{6576340}.

The frames of classical TCP/IP cannot be directly applied in the quantum network because of the significant difference between classical bits and quantum bits. Retransmission is one of the basic mechanisms used by protocols operating over a packet switched computer network to provide reliable communication (such as that provided by a reliable byte stream, for example TCP).  {However, retransmission is generally impossible for transmitting qubits due to the no-cloning theorem as we mentioned before.}

In this paper, we investigate and propose protocols for packet quantum network intercommunication: quantum User Datagram Protocol (qUDP) and quantum Transmission Control Protocol (qTCP). The qTCP provides reliable, ordered, flow-controlled transmission of packets over the interlinked networks.
To protect the fragile quantum information in the quantum internet, qTCP employs techniques of quantum error-correcting codes, \textit{quantum secret sharing}, as well as
classical techniques of stack design. In particular, the creation of the logical process-to-process connections of qTCP is accomplished by a quantum version of the \textit{three-way handshake protocol}.

This paper is organized as follows. In Section 2, we introduce the basics of  quantum mechanics.
In Section 3, two models of quantum internet are given:  repeater-based model and plain model.
In Section 4, we discuss the main difficulties in designing quantum packet switching for quantum internet.
In Section 5, a four-layer model of quantum network is shown.
In Section 6,   the four layers for the repeater-based quantum internet are given in detail, including the qUDP, qTCP protocols with the {quantum three-way handshake protocol}
and similarly the four layers for plain quantum network are given in Section 7.
Finally, in Section 8, we   conclude with some
highlighted research.

\section{Preliminaries}
Here we present the bare-bones of quantum
mechanics for our purpose.
For more details, interested readers are referred to \cite{NC00}.
{We start with the postulates  of quantum mechanics.}
\subsection{State space}

The state space of a closed quantum system is a complex Hilbert space
and a \emph{pure} quantum state is an arbitrary unit vector in the Hilbert space.
In particular,
a qubit system has a two-dimensional vector space with an orthonormal
basis $\{\ket{0},\ket{1}\}$. Thus the system can be in an arbitrary superposition
of these two states, say $\ket{\psi}=\alpha\ket{0}+\beta\ket{1}$, where $\alpha$ and $\beta$ are
complex numbers  satisfying the normalization condition
$|\alpha|^2 + |\beta|^2 = 1$.
The dimension of the quantum system grows exponentially with the number of qubits:
an $n$-qubit system has a $2^n$-dimensional complex linear space with
an orthonormal basis $\{ \ket{i_1i_2 \cdots i_n}\triangleq \ket{i_1}\otimes \cdots \otimes \ket{i_n}:i_j\in\{0,1\}  \}$ and
an $n$-qubit (pure) state can be an arbitrary superposition
of these $2^n$ states. Note that $\otimes $ is the tensor product and will be omitted with no ambiguity.

More generally, a quantum state can be represented by a density operator $\rho$, which is
positive semi-definite and has trace equal to one.
For a pure quantum state $\ket{\psi}$,  its density operator is $\op{\psi}{\psi}$.
Quantum mechanics allows the quantum system in a more complicated state: a \emph{mixed} quantum state,
which is a convex combination of some pure states $\rho=\sum_i p_i \ket{\psi_i}\bra{\psi_i}$
such that $p_i\geq 0$ and $\sum_{i}p_i=1$.

\subsection{Quantum evolution}
The evolution of a closed quantum system can be described by a \emph{unitary} transformation.
An operator $U$ is  unitary if $U^{\dag}U=UU^{\dag}=I$, where $U^{\dag}$ is the complex conjugate transpose of~$U$, and $I$ is the identity operator.
Suppose initially the system is  in  $|\psi_0\rangle$ and it evovles  to $|\psi\rangle$ after time  $t$.
Then there exists
a unitary $U$ such that   $|\psi\rangle=U|\psi_0\rangle.$
A basis for the linear operators on a qubit is the Pauli matrices $I_2=\begin{bmatrix}1 &0\\0&1\end{bmatrix}, X=\begin{bmatrix}0 &1\\1&0\end{bmatrix},  Z=\begin{bmatrix}1 &0\\0&-1\end{bmatrix}, Y=iXZ$.

A general quantum operation, usually denoted by $\mathcal{E}$, is a completely positive linear map, which preserves the trace.

\subsection{Quantum measurement}
A quantum measurement on a system is
described by a collection of measurement operators $\{M_m\}$,
which satisfy $\sum_{m}M^{\dag}_mM_m=I,$
and the index $m$ stands for the measurement outcome.
If a quantum system in the state $|\psi\rangle$ is measured,
the probability that outcome $m$ occurs is
$p(m)=\langle \psi|M_m^{\dag}M_m|\psi\rangle$ and the post-measurement state is
$|\psi_m\rangle=\frac{M_m|\psi\rangle}{\sqrt{p(m)}}.$
We can also describe the behavior of quantum measurement in the language of
density operators. If   $\rho$ is measured by $\{M_m\}$,
then the probability that outcome $m$ occurs is
$p(m)={\rm tr}(M_m^{\dag}M_m\rho),$ and the post-measurement state is $\rho_m=\frac{M_m\rho M_m^{\dag}}{p(m)}.$

\indent

{Next we introduce the effects of quantum teleportation, entanglement swapping,  the no-cloning theorem, and quantum error correction.}
\subsection{Entanglement}
A two-qubit pure state is entangled if they cannot be described by two independent single-qubit states.
This, unlike  the behavior of two correlated random bits,
is a thoroughly non-classical behavior.
Entanglement
leads to non-local correlations, which seem to violate causality, so that Einstein,
Podolsky, and Rosen mistakenly suggested that quantum mechanics
might not be complete~\cite{PhysRev.47.777}. The state $\ket{\Phi^+}_{AB}=\frac{\ket{0}_A\ket{0}_{B}+\ket{1}_A\ket{1}_{B}}{\sqrt{2}}$ is called the maximally-entangled state, or simply EPR, where the subscript $AB$ means that it is shared between $A$ and $B$. We usually use $\ket{ij}_{AB}$ to denote $\ket{i}_A\ket{j}_B$.

\subsection{Quantum teleportation}
Quantum teleportation \cite{PhysRevLett.70.1895} is arguably the most famous
quantum communication protocol. With the help
of pre-shared entanglement between the sender
and the receiver, quantum
information
can be transmitted from one location to another using
only classical communication.

The teleportation protocol is as follows.
Suppose Alice and Bob share an EPR pair $\ket{\Phi^+}_{AB}=\frac{\ket{0}_A\ket{0}_{B}+\ket{1}_A\ket{1}_{B}}{\sqrt{2}}$
and Alice wants to send to Bob an
unknown qubit
$
\ket{\psi}_C=\alpha\ket{0}_C+\beta\ket{1}_C.
$
She performs a \emph{Bell measurement} $\{M_{ij}\}$ on her two qubits $AC$,
where $$M_{ij}=  \ket{\Phi_{ij}}_{AC}\bra{\Phi_{ij}}_{AC},\quad  \ket{\Phi_{ij}}\triangleq (I_2\otimes X^i Z^j) \ket{\Phi^{+}}$$ for $i,j\in\{0,1\}$.
Alice then sends Bob her measurement outcome $ij\in \{00, 01, 10, 11\}$.
Interestingly, this two-bit message contains all the information
that Bob needs to recover $\ket{\psi}$ on his side.
To see this,   observe that
\begin{align*}
\ket{\Psi}_C\otimes\ket{\Phi^{+}}_{AB}=\frac{1}{2}\sum_{i,j\in\{0,1\}} \ket{\Phi_{ij}}_{AC}\otimes \left( X^iZ^j \ket{\psi}\right).
\end{align*}
According to Alice's measurement outcome $ij$, Bob's qubit will be in the state $X^{i}Z^{j} \ket{\psi}$
and thus $\ket{\psi}$ can be recovered after a \emph{Pauli correction} $X^{i}Z^{j}$ on Bob's qubit.

To sum up, with the help of an EPR pair, the transmission of two classical bits is enough to transmit one qubit.
Thus, one can transmit $n$ qubits by transmitting $2n$ classical bits using $n$ pre-shared EPR pairs.

\subsection{Entanglement swapping}

Suppose that Alice and Bob share an EPR pair $\ket{\Phi^+}_{AB_1}$, and Bob and Charlie share another EPR pair $\ket{\Phi^+}_{B_2C}$. It is possbile to construct an EPR pair shared between Alice and Charlie
by  so-called
\emph{entanglement swapping}.

The procedure is as follows: Bob performs a Bell measurement on Bob's two qubits and sends the two-bit outcome to Charlie, who then performs a Pauli correction according to Bob's measurement outcome.

This can also be regarded as Bob teleporting his particle $B_1$ to Charlie by consuming the ERP pair $\ket{\Phi^+}_{B_2C}$. In other words, quantum correlations can be teleported.

\subsection{No-cloning theorem}

A fundamental property of quantum mechanics is that learning  an unknown quantum state
from a given specimen would disturb its state~\cite{BBJMPSW94}. In particular, the quantum no-cloning theorem \cite{DIEKS1982271,WZ82} states that an arbitrary unknown quantum state
cannot be cloned. Generally speaking,  there is no quantum operation that can transform an unknown quantum state $\ket{\psi}\otimes\ket{0}$ into $\ket{\psi}\otimes\ket{\psi}$.
Intuitively, this is because a quantum operation is always linear, while the desired mapping is not.

\subsection{Quantum error correction}
Qubits are maddeningly error-prone.
A quantum error correcting code, first proposed by Shor~\cite{PhysRevA.52.R2493},  can protect quantum information against decoherence.

A noise channel is modeled as a quantum operation $\mathcal{N}$.
If there exist encoding and decoding quantum operations $\mathcal{E}$ and  $\mathcal{D}$ such that
$$
(\mathcal{D}\circ\mathcal{N}\circ\mathcal{E})(\rho)\propto\rho,
$$
for any input state $\rho$, we say that $\mathcal{E}$ and $\mathcal{D}$ correct the error of $\mathcal{N}$.
That is, any quantum information encoded by $\mathcal{E}$ can be perfectly recovered from the noise process $\mathcal{N}$ by applying the recovering map $\mathcal{D}$.

One can observe the very useful fact that quantum error-correcting codes can correct errors coherently in the following sense.
For encoding, noise and decoding operations $\mathcal{E},\mathcal{N},\mathcal{D}$ on $A$,
$\mathcal{I}_B\otimes\mathcal{E}_A$ and $\mathcal{I}_B\otimes\mathcal{D}_A$ can correct the noise $\mathcal{I}_B\otimes\mathcal{N}_A$ for any quantum system $B$.

\section{Quantum Internet Models}
The Internet is the largest engineered system ever created by mankind.
With new quantum computing power, it can be further supplemented
to form a more powerful internet---the quantum internet.

\begin{figure}
	\includegraphics[width=8.5cm]{quantum_internet.pdf}	\vspace{-1.5cm}
	\caption{Quantum Internet.} \label{fig:quantum_internet} \vspace{-0.5 cm}
\end{figure}
Figure~\ref{fig:quantum_internet} illustrates the concept of a quantum network, where
several quantum computers are distributed and connected along with a classical network.
\textit{PCs}, \textit{workstations}, \textit{Web servers}, quantum computers, etc,  are called \emph{hosts}, or \emph{endnodes}.
Endnodes are connected together by a network of \textit{communication links} and
\textit{routers}.

Here we discuss two models for the quantum internet:
\emph{repeater-based model} and \emph{plain model},  assuming that two neighboring quantum devices share EPR pairs for teleportation or they
are directly connected by quantum channels, respectively.
These  are natural generalizations of the  Cleve-Buhrman model \cite{PhysRevA.56.1201} and  the Yao model \cite{366852}
for \emph{two-party} quantum communication, where in the Cleve-Buhrman
model quantum communication is done by teleportation with shared entanglement and classical communication,
while in the Yao model qubit channels are used. ( {Note that repeater quantum networks have been discussed in the literature but there is no specification about how teleportation is done explicitly. })
We further assume that all the nodes within the quantum internet can communicate
classically, for example, over the classical internet, in order to exchange control information (such as the measurement outcome for Pauli correction in teleportation).

We emphasize that both our models features  \emph{full-duplex} data transmission     as in the classical internet.  {In other words, (quantum or classical) data can be transmitted in both directions on a signal carrier at the same time.
}

{
	In this paper, we only discuss the transmission of quantum information through the internet. Therefore, we will focus on the sub-network consisting of routers, hosts with the power of quantum information processing, the quantum communication links and its corresponding classical communication links. This can be done by associate one-bit index with the IP for which host or router with quantum power.
}

\subsection{Repeater-based Quantum Internet}

A quantum channel between two neighboring quantum devices is required for the transmission of qubits.
However,   quantum channels are inherently lossy and they are not reliable for long-distance communication.
Consequently, the techniques of \emph{quantum repeaters}
are used as intermediate nodes to reach long distances~\cite{PhysRevA.79.032325,PhysRevLett.98.190503,7010905,RevModPhys.83.33}.

{The idea is to do a sequence of entanglement swapping or teleportation between two consecutive nodes
	so that quantum communication between two endnodes  can be implemented as shown in Fig.~\ref{fig:quantum_repeater}.}
Suppose two neighboring nodes $A$ and $B$ are connected by repeaters $R_1,\dots,R_n$, each of which has two (or more) qubits.  EPR pairs are constantly created between repeaters $R_{i,2}$ and $R_{i+1,1}$ for $i=1,\dots,n-1$, and between $A$ and $R_{1,1}$, $B$ and $R_{n,2}$.
Then each repeater performs a Bell measurement on its two qubits
and passes the measurement outcomes to $B$ for Pauli correction, using classical channels (the gray lines in Fig.~\ref{fig:quantum_repeater}).
This will create an EPR pair between $A$ and $B$  and thus full-duplex  quantum communication can be implemented.
\begin{figure}
	\includegraphics[width=8.5cm]{fig2.pdf} \vspace{-0.5cm}
	\caption{A repeater-based quantum channel.
		The gray lines are classical channels. Two entangled nodes are connected by a wavy line.  } \label{fig:quantum_repeater}
\end{figure}

One may establish end-to-end EPR pairs at the beginning and then only classical communication remains to be done for quantum communication.
But, in this way, the quantum buffer of the receiver will be occupied
during stage of the classical communication.
Thus we keep the flexibility that the entanglement swapping or teleportation is done when necessary.
{Another issue  is the time cost.  In order to transmit one qubit information from endnodes  $A$ to   $B$ using an end-to-end EPR pair, the time cost is roughly the time cost of establishing an EPR pair between $A$ and $B$,
	given EPR pairs between neighboring nodes are available,
	plus the time cost of transmitting two classical bits from $A$ to $B$ to accomplish the teleportation.
	If the path consists of $n-1$ repeaters,
	the time cost of establish an end-to-end EPR pair is roughly the transmission time for transmitting two bits for Pauli correction through $n$ edges. This is basically equal to the time cost of classical communication for teleportation.

	Thus the time cost would be halved if we do sequential teleportation or entanglement swapping.

}

\subsubsection{Store-decode-and-Forward Transmission}

A delicate step of a repeater-based quantum channel is that the Pauli correction for teleportation
can be deferred. For example, If a qubit is sent from node $A$ to $B$ via a router $R$.
Originally, $A$ sends $R$ the measurement outcome $m_1$ and then $R$ does a Pauli correction according to $m_1$. Instead, $R$ can perform a Bell measurement on his qubits and send the outcome $m_2$, together with $m_1$, to $B$ for Pauli correction. In fact, having $m_1+m_2$ is enough for $B$ to recover the transmitted qubit.
The only quantum operation that $R$ has to do is a Bell measurement.
This manner is called \emph{store-decode-and-forward transmission},
that is, an intermediate node stores the message for Pauli correction from the previous node,
updates the message for Pauli correction according to his Bell measurement, and forwards this message to the next node.

Notice that, router $R$ must wait for the message of $A$ about the positions of the qubits to do the Bell measurements
since a router may have
many qubits.
If  a Bell measurement is applied to wrong target qubits,
quantum information will be destroyed.

\iffalse
{\color{red}\textbf{Illustrated this model in a picture}}

Comparing with our method, the quantum operation of this method is exactly the same. Although this method avoid the adaptivity of router's action, it would hurt the bandwidth badly. To see this, we consider an $n$-nodes chain, $A_1$ connects to $A_{2,1}$ via an EPR, $\cdots$ $A_{i,2}$ connects to $A_{i+1,1}$ via an EPR, $\cdots$, $A_{n-1,2}$ connects to $A_{n}$ via an EPR where $A_1$, $A_{2,1}$ and $A_{2,2}$, $\cdots$, $A_{n}$ are qubit. In the nonadaptive method, $A_n$ would need to transmit $2(n-1)$ bits in the last step while our method would only occupy the bandwidth of $2$ bits at any time.
\fi

\subsection{Plain model of Quantum internet}

In the plain model of quantum internet, we assume that a full-duplex quantum channel exists between two neighboring quantum devices, such as two hosts, two routers, a host and a router, and they do not pre-share any quantum entanglement.
Also these quantum channels are paired with full-duplex classical channels.

{
	When some data are to be sent, they will be segmented and attached with certain header bytes. The resulting packages
	of information, so-called \emph{packets}, are then
	sent through the network to the destination, at which they are reassembled
	into the original data.}
Routers that are assigned quantum computing power can take quantum packets as well as classical packets.
In particular,   any quantum communication between two neighboring quantum devices is accomplished by sending packets of quantum messages over the quantum channel connecting them, together with classical packets  over a classical channel connecting them.
(For simplicity, the quantum packet and its corresponding classical packet are called a \emph{quantum-classical packet}.)
Moreover, we assume that synchronization can be done for the plain model of quantum internet:
we assume that a packet of quantum messages and its corresponding packet of classical messages always arrive at the next node simultaneously.

Although  the distribution of quantum states over long distances is not possible with
current technology, it will be  improved in  the near  future.
Comparing with the repeater-based model, the plain model is more straightforward, and much more efficient in the following sense. In order to transmit one qubit information to a neighboring router, the previous model requires one-qubit transmission in the entanglement establishment plus two bits classical information transformation.

\subsubsection{Store-and-Forward Transmission}

A router takes a packet arriving on one of its incoming communication
links and forwards that packet on one of its outgoing communication links.
In the plain model, a router must receive
the entire quantum-classical packet before it can transmit the first qubit and the first bit of the packet onto the
outbound link. This is called \emph{store-and-forward transmission}.

\section{Difficulties and Challenges: Quantum Packet Loss}
As mentioned in the previous section, in classical network, the technique of packet switching is used so that messages are split    into small packets, which are then sent independently through the network. Packets from different messages can be interspersed to give greater responsiveness for interactive computing; and individual packets can be re-sent if necessary, rather than entire messages.
Whenever one party sends something to the other party, it retains a copy of the data it sent until the recipient has acknowledged that it received it. In a variety of circumstances, the sender automatically retransmits the lost packet using the retained copy.

Within each network, quantum communication may be
disrupted due to unrecoverable mutation of the data
or missing data. The reasons include quantum decoherence, imperfect operations, the network packet loss, and others.

End-to-end restoration procedures
are desirable to allow complete recovery from these
conditions in quantum network, we will imitate the packet switching technique
and propose the quantum analogue for the quantum internet. In order to
ensure that all quantum data are eventually transferred from source to destination, we are facing many difficulties.
The no-cloning theorem is a vital ingredient in quantum cryptography, as it forbids eavesdroppers from creating copies of a transmitted quantum cryptographic key. In contrast, it prevents us from using classical techniques in quantum computing.
In particular, this affects our problem of transmitting qubits over the internet in two fundamental ways. First, any
logical quantum data leak into the environment because the noisy channel cannot be recovered by
the communicating parties. Second, the parties hold a joint quantum state that evolves with the
protocol, but they cannot make copies of the joint state without corrupting it.

We will employ the techniques of quantum error correcting code together with the classical techniques of packet
design to solve the problem of quantum packet loss, see Section 6 for the repeater quantum network, and Section 7 for the plain quantum network.

\section{Layer model}
The classical internet has a layered structure, which has conceptual and operational advantages.
To introduce a similar structure in the design of quantum internet protocols, quantum network hardwares and softwares
are required to  operate in the following four layers:
\begin{center}
	\begin{tabular}{|c|c|}
		\hline
		\textbf{Layered model}
		&
		\begin{tabular}{c}

			Application  Layer\\
			\hline
			Transport Layer \\
			\hline
			Network Layer\\
			\hline
			Network Access Layer\\
		\end{tabular}\\
		\hline
	\end{tabular}
\end{center}
The Application Layer creates user quantum data and communicate this data to other applications on another host.
The Transport Layer performs host-to-host quantum communications.
The Network Layer exchanges quantum datagrams across network boundaries.
The Network Access Layer provides the means for the system to deliver quantum data to the other devices on a directly attached network.

In the following, we will take a top-down approach to explain the four layers, first covering
the Application Layer and then proceeding downwards, for the quantum repeater network and plain quantum network, respectively.

\section{Quantum repeater network layers}
The quantum repeater network is a teleportation-based network.  EPR pairs have to be created between neighboring hosts and routers. Other than that, the data that are actually transmitted in the network are classical bits.
{Therefore, this model has the following difference from classical network model. To obtain the data to be transmitted, Bell measurements must be jointly applied on the quantum data of the Transport Layer and the particles of the shared EPRs in the Network Access Layer as the initial step of the teleportation. The classical data, measurement outcomes, are packeted in the Transport Layer then passed into the Network Layer.
}
\subsection{Application Layer}
The Application Layer is where quantum network applications
and their application-layer protocols reside.
In a quantum network application, endnodes exchange messages with each other.

{
	In addition to a classical storage, Host $i$ holds two quantum registers $A_i$ and $B_i$ as send buffer and receive buffer, respectively, and also a local working register $C_i$.
	At each stage of a general quantum application protocol, Host $i$ would send $A_i$ to another Host $j$, receive quantum packet from the network at $B_i$, and then apply a local operation on its local registers $A_i,B_i$ and $C_i$.} (Note that both the quantum repeater network and plain quantum network can be recast
in this framework.)

In the quantum network, the global state of the system can be arbitrary inputs that are allowed, and it is possibly unknown (totally or partially) to hosts.

{To send quantum information between two endnodes,
	messages are divided into smaller packets,
	which are then sent through communication links
	and routers.}
In this scenario, a packet error or loss can destroy the global state, and hence the follow-up tasks.
Such a problem will be handled in the next layer--Transport Layer.

\subsection{Transport Layer}
The Transport Layer of the quantum network transports Application Layer messages between
application endpoints. Before providing the two transport protocols, qUDP (Quantum User Datagram Protocol) and qTCP (Quantum Transmission Control Protocol), we first introduce some tools from quantum error detection.

\subsubsection{Quantum error detection}
The widely used error detection method, including the parity bit, Cyclic Redundancy Check, and the Checksum, can be characterized by a \emph{check function} $f:\{0,1\}^n\mapsto \{0,1\}^k$ in the following encoding procedure:  a given $n$-bit string $s$  is encoded as $(s,f(s))$ of $(n+k)$ bits.
This  has been generalized   in quantum computing.

Suppose  a host  wants to send  an $n$-qubit register $A$ through the internet, using a check function $f$.
Let $\ket{\psi}_{A,R}$ be a purifed state of $A$ for   a reference system $R$.
The encoding is done by firstly appending  $k$ ancilla qubits in $\ket{0^k}_S$ to $A$, and  the state of $AS$ is of the form
$$\sum_{0\leq j\leq 2^n-1}\alpha_{j}\ket{j}_{A}\ket{\phi_{j}}_R\ket{0^k}_S.$$
Then, the host applies a controlled unitary $U_f$ on $AS$ to obtain
$$\sum_{0\leq j\leq 2^n-1}\alpha_{j}\ket{j}_{A}\ket{\phi_{j}}_R\ket{f(j)}_S,$$
where  $U_f$  is defined by
$U_f\ket{j}_{A}\ket{0^k}_S=\ket{j}\ket{f(j)}$ and is called a \emph{check unitary}.
Upon receiving $A S$, the receiver simply applies the decoding unitary $U_f^{-1}$ to $AS$. If the data has not been changed, the decoded state would be
$$\sum_{0\leq j\leq 2^n-1}\alpha_{j}\ket{j}_{A}\ket{\phi_{j}}_R\ket{0^k}_S.$$
Then measuring $S$ in the computational basis will give us the outcome $0^k$.
Otherwise, if the measurement outcome is nonzero, the receiver knows that at least
one qubit error has occurred. It could be the case that some error occurs but the measurement outcome is $0^k$,
which will lead to a decoding error. This situation occurs with a small chance if the check function is chosen appropriately.

\subsubsection{Quantum User Datagram Protocol}
Just like its classical counterpart, UDP, the quantum UDP protocol uses a simple connectionless communication model with a minimum of protocol mechanism.

Two communicating quantum processes, says Alice and Bob, use classical UDP sockets to interact. After establishing sockets, Alice, the sender at this round, firstly applies the quantum checksum as the quantum analog of the checksum of the classical UDP protocol using the idea we mentioned in the beginning of this subsection. This is for
quantum error detection, and her qubits are now called the quantum segments, says $n$ qubits.

In order to apply for  teleportation, Alice has to apply the joint measurements on her segments and the particles of the EPRs. Which EPRs she uses would directly correspond to the next router the segments will send to. Therefore, she asked the Network Layer for proper EPRs by sending the Network Layer the destination, which can be done by the adjusted IP protocol discussed in the next subsection.

After that, she applies the joint measurement on her quantum segments and the particles of EPRs, obtains a $2n$-bit string  $s$.
She uses the classical checksum on $s$ and sends the resulting classical bits by the classical UDP protocol.
Now  Alice can generate the qUDP packet for quantum repeater network, using these data in the structure:
\begin{center}
	\begin{tabular}{ |c|c|c| }
		\hline
		{Classical UDP header}&
		\textit{Indicator} &
		Data\\
		\hline
	\end{tabular}
\end{center}
where the Indicator is used to indicate that this is qUDP packet of quantum repeater network. Because the action of the routers and receiver is different from the UDP packet of classical internet. Besides the correction of Pauli measurement outcomes, the data part also contains the positions of the corresponding EPRs between two nodes that just been consumed.
One can choose the size of this qUDP packet to fit the current UDP structure.

The behavior of the sender is as in Protocol~\ref{alg:qUDP1}.
\begin{algorithm}

	\Input{register $A$   with $n$ qubits  }
	Append $\ket{0^k}_S$ to $A$ and obtain $AS$\;

	Apply the check unitary $U_f$ to $AS$ and the resulting  $(n+k)$-qubit is now $D$\;

	Ask the Network Layer for collections of EPRs $\ket{\Phi}_{A_1 X_1},\dots,\ket{\Phi}_{A_t X_t}$\;
	\tcc{
		For each $j$, $\ket{\Phi}_{A_j X_j}$ denotes a collection of EPRs with $A_j$ held by Alice and $X_j$ held by some neighboring router. There should be a total of $n+k$ EPR pairs.}

	Divide $D$ into $t$ groups of qubits $D_1,\dots, D_t$, each $D_j$ with size equal to the number of EPRs in $A_jX_j$.\;

	Perform Bell measurements on $D_j$ and $A_j$ correspondingly for $j=1,\dots,t$, and record the measurement outcomes as $s_1,\dots, s_t$\;

	Construct qUDP packets $m_j$ for data $(s_j,j)$ for $1\leq j\leq t$, respectively\;

	\Return{\textsf{$m_1,\dots,m_k$}}\;
	\tcc{
		In the Network Layer  $m_j$ will be sent to the router corresponding to $X_j$.
	}
	\caption{\textsf{Generating qUDP packets}}
	\label{alg:qUDP1}
\end{algorithm}
In step~4 the qUDP will split the qubits $D$ into several parts, where each part will be teleported to
a corresponding router. This is because we want (1) the size of each packet to fit the Maximum Transmission Unit of the Network Layer, and (2) the data been transmitted through different routing paths.

The behaviour of the reciever  is as in Protocol \ref{qUDP3}.
Note that the receiver must wait for all pieces of $m_1,\dots,m_t$ before he can decode the message. The receiver maintains a timeout setting. If some $m_i$ is not received in time, he drops all the received $m_j$  and release the corresponding quantum registers $X_j$.
\begin{algorithm}

	\Input{qUDP packets $m_1,\dots,m_t$}
	\tcc{$X_1,\dots,X_r$ are the registers of local qubits of the corresponding EPRs in $m_1,\dots,m_t$.}

	Verify the length and checksum of each $m_1,\dots,m_t$\;

	\If{not valid}
	{
		drop $m_1,\dots,m_t$, and release $X_1,\dots,X_t$\;
	}
	\Else{
		Implement the Pauli corrections on $X_1,\dots,X_t$ according to the data in $m_1,\dots,m_t$\;

		Apply $U_f^{-1}$ on $X_1,\dots,X_t$ and obtain $AS$\;
		Measure $S$ in the computational basis\;
		\If{Outcome is nonzero}
		{
			release $X_1,\dots,X_t$\;
		}
		\Else{
			Transmission succeed\;
		}
	}
	\Return{\textsf{Receiver's action of qUDP packet}}\;
	\caption{\textsf{Receiver's action of qUDP packet}}
	\label{qUDP3}
\end{algorithm}
If there is no packet loss or corrupted during the networks, the state will be successfully transferred to the registers $X_1,\dots,X_t$ of the receiver.

The qUDP provides no recovery procedure for lost packets, and it favors reduced latency over reliability like the classical case. Applications that use qUDP can  flexibly define their own mechanisms for handling packet loss.

\subsubsection{Quantum Transmission Control Protocol}
The quantum Transmission Control Protocol (qTCP) introduced here will provide a connection-oriented, reliable, ordered, and error-checking delivery of a quantum data stream between hosts.
In the transmission of application-layer messages,
a long message will be divided into shorter segments by qTCP, just like TCP in the classical network.
{This service includes guaranteed
	delivery of application-layer messages to the destination and flow control (that is,
	sender/receiver speed matching).}

Quantum information is fragile through the transmission over the internet.
To guarantee datagram delivery, a quantum version of information retransmission is needed.
However, the no-cloning theorem prevents quantum information from being copied.
Herein we show how information retransmission can be achieved using the techniques of quantum secret sharing~\cite{PhysRevLett.83.648}.
This guarantees that the quantum data stream transmitted through qTCP will have exactly the same quantum information and correlation
as the original stream.

The qTCP packet is designed as follows:
\begin{center}
	\begin{tabular}{ |c| }
		\hline
		{Classical TCP header}\\
		\hline
		\textit{Indicator} \\
		\hline
		\textit{Pseudo acknowledgement number}\\
		\hline
		\textit{Pseudo Window}\\
		\hline
		Data\\
		\hline
	\end{tabular}
\end{center}
\noindent The indicator implies that this is a qTCP packet for quantum repeater network. Besides the correction of Pauli measurement outcomes, the data part also contains the positions of the corresponding EPRs between two nodes that just been consumed. Others are just the same as classical TCP.

To reach reliable transmission, a packet of quantum information is not transmitted in one step in our qTCP, but in at least two stages. Only if the transmission of both parties is successful, the quantum information is successfully transmitted.
The Pseudo acknowledgement number and Pseudo Window are used to record the status of the transmission. We will explain the Pseudo acknowledgement number in the following
\textit{Data transfer} part.

The qTCP protocol operations may be divided into three phases.
The logical process-to-process connections
of qTCP is established by a quantum version of the
three-way handshake protocol before entering the data transfer phase. After data transmission is completed, the connection termination closes established virtual circuits and releases all allocated resources.

\noindent { \textbf{Connection establishment--quantum three-way handshake.}}

To establish a connection, we propose  a quantum version of the
three-way handshake protocol.

Just like its classical counterpart, Host B establishes a passive open, and then Host A initiate an active open. To establish a quantum connection, the quantum three-way handshake protocol operates as follows:
\begin{enumerate}
	\item SYN: Host A establishes $m$  local EPR pairs $\ket{\Phi^{+}}_{A_1A_2}$. Host A sends  SYN to Host B,
	together with the quantum information of $A_2$ (stored as $B_2$ by Host B)   by a {qTCP packet}.
	\item SYN-ACK: Host B receives the  {qTCP packet}. Firstly, {he applies the Pauli correction} to $B_2$, and then sends SYN+1  to Host A,  together with the quantum information of $B_2$ (stored as $A_2$ by $A$). Also, Host B establishes $m$  local EPR pairs $\ket{\Phi^{+}}_{B_3B_4}$. Then Host B sends ACK to Host A, together with  the quantum information of $B_3$ (stored as $A_3$ by $A$) by a qTCP packet.
	After verifying SYN+1, Host A performs a multi-qubit Bell measurement on $A_1A_2$ and checks whether the measurement outcome is $0^{2m}$.
	\item ACK: Host A sends   ACK+1, and transfers the quantum information of $A_3$ to $B_3$ of Host B.
	After verifying ACK+1, Host B performs a multi-qubit Bell measurement on $B_3B_4$ and check whether the measurement outcome is $0^{2m}$.
\end{enumerate}
\begin{figure}
	\includegraphics[width=7.5cm]{fig3.pdf} \vspace{-0.2cm}
	\caption{Quantum three-way handshake.
		The gray lines are classical channels. Two entangled nodes are connected by a wavy line.  } \label{fig:quantum_repeater}
\end{figure}
\noindent At this point, both Hosts have received an acknowledgment of the connection.
One can observe that the quantum channel between two hosts is noiseless if and only if the distribution of EPRs is noiseless.
To see the efficiency of detecting the channel noise, we consider the extreme case  that the entanglement is destroyed either during the teleportation from  $A_2$ to $B_2$
or from $B_2$ to $A_2$. Assume the state of $A_1A_2$ at the end of step 2, $\rho_{A_1A_2}$, is not entangled (or so-called \emph{separable}). In other words, there exist probability distribution $p_i$ and quantum states $\ket{\psi_i}_{A_{1,i}}$ and $\ket{\varphi_i}_{A_{2,i}}$ such that $\rho_{A_1A_2}=\sum_i p_i \op{\psi}{\psi}_{A_{1,i}}\otimes \op{\varphi}{\varphi}_{A_{2,i}}$.
When we perform a multi-qubit Bell measurement on it, the probability of obtaining $0^{2m}$ satisfies
\begin{eqnarray*}
	&&{\rm tr}(\left\langle{\Phi^{+}}^{\otimes m}\right|\rho\left|{{\Phi^{+}}^{\otimes m}} \right\rangle  )\\
	&\leq& \max_i {\rm tr}(\langle{\Phi^{+}}^{\otimes m}|\op{\psi_i}{\psi_i}\otimes \op{\varphi_i}{\varphi_i}|{\Phi^{+}}^{\otimes m}\rangle)\\
	&=& \max_i |\ip{{\Phi^{+}}^{\otimes m}}{\psi_i\otimes\varphi_i}|^2\\
	&\leq& \frac{1}{2^{m}}.
\end{eqnarray*}
The steps 1, 2 establish the classical and quantum connections for one direction and it is acknowledged. The steps 2, 3 establish the quantum connection for the other direction and it is acknowledged. With these, a full-duplex quantum communication is established.

\textbf{Data transfer}

A reason that the classical TCP works well is because  classical information can be correctly read and copied.
When one party sends something to the other, it will keep a copy until it gets acknowledged by the recipient. In a variety of circumstances, a sender  may automatically retransmit the data using the retained copy.

To handle quantum retransmission, we start with a simple question:

How to achieve reliable transmission of a one-qubit state $\ket{\psi}$ from Host A to Host B through a noisy quantum channel?\\

\noindent We consider a multi-round protocol, which can always be modelled as follows:
\begin{enumerate}
	\item Host A encodes $\ket{\psi}$ into $\ket{\varphi}_{A_1 A_2 A_3}$, and sends register $A_2$ to Host B.
	\item Host B sends Host A the acknowledgement whether the transmission is successful.
	\begin{enumerate}
		\item If unsuccessful, the hosts will do other actions.
		\item Otherwise, Host A sends $A_3$ to Host B.
	\end{enumerate}
\end{enumerate}
The reliability requires  at least the following fact: once a transmission failed, the hosts are able to recover the original state from the remaining qubits.

Suppose the first step of transmitting $A_2$ to Host B fails, the left $A_1A_3$ system is enough to recover the original state $\ket{\psi}$. Then the information of $A_2$ is not enough to recover $\ket{\psi}$. Otherwise, this provides a cloning procedure, contradicts to the no-cloning theorem. This implies that $A_2$ alone contains no information of the original state $\ket{\psi}$.
In the stage of (2b), to make sure that the information of the original state is not lost even when $A_3$ is lost, $A_1A_2$ must contain enough information to recover the original state $\ket{\psi}$. Moreover, we want that if the transmission of $A_3$ successes, Host B can recover the original state $\ket{\psi}$ from $A_2A_3$.

In other words, we want an encoding scheme from $\ket{\psi}$ to $\ket{\varphi}_{A_1A_2A_3}$ such that any two of $\{A_1,A_2,A_3\}$ can reconstruct the unknown $\ket{\psi}$.
This can actually be done by the $(2,3)$-threshold scheme of quantum secret sharing~\cite{PhysRevLett.83.648},
using the theory of quantum error-correcting codes.
An $(k,n)$-threshold scheme is such that any $k$ shares, but not fewer, 1 can jointly recover the secret.

Now we outline our quantum retransmission procedure. First Host A sends $A_2$ to Host B after generating $A_1A_2A_3$ from $A$. If $A_2$ is not received, then Host A reconstructs $A_1$ from $A_1A_3$, and runs the procedure again. Otherwise if $A_2$ is received, then Host A sends $A_3$ to Host B. If it is received, Host B can reconstruct $A$ from $A_2A_3$. If $A_3$ is not received, Host A repeats the procedure on the remaing $A_1$.
The procedure can be repeated recursively  until Host B has enough information to recover $A$
or the procedure aborts after a number of rounds.
More explicitly, the transmission succeeds if two consecutive messages are correctly received by Host B.
\begin{figure}
	\includegraphics[width=6.5cm]{fig4a.pdf} \vspace{-0.2cm}
	\caption{Successful quantum transmission.

	} \label{fig:quantum_repeater}
\end{figure}
\begin{figure}
	\includegraphics[width=6.5cm]{fig4b.pdf} \vspace{-0.2cm}
	\caption{ UnsuccessfulQuantum transmission in the second send. Host A has to do one more recursion.

	} \label{fig:quantum_repeater}
\end{figure}

\begin{algorithm}
	\Input{$A$: register with qubits to be sent}
	Enocde $A$ by the $(2,3)$ threshold scheme and obtain $A_1A_2A_3$\;
	$k\leftarrow \mathrm{true}$\;
	\While{$k$}{
		Send $A_2$ to Host B\;
		\tcc{Host B will send valid acknowledgement to Host A if he received $B$ successfully.}
		\If{Valid acknowledged}
		{
			Send $A_3$ to Host B\;
			\If{Valid acknowledged}
			{\
				Release $A_1$\;
				$k\leftarrow \mathrm{false}$\;
				\tcc{Host B is able to recover $A$ by decoding $A_2A_3$.}
			}
			\Else
			{
				Call Quantum retransmission($A_1$)\;
			}
		}
		\tcc{If data packet is not arrived within expected time or data is damaged, Host B sends invalid acknowledgment.}
		\Else{
			Regenerate the original $A$ from current $A_1A_3$\;
			Call Quantum retransmission($A$)\;
		}
	}
	\caption{\textsf{Quantum retransmission($A$)}}
	\label{qR}
\end{algorithm}

In a less noisy channel, one can make sure that this scheme   always succeeds within finite steps.
However, a potential problem here is that the storage of Host B for this single message is not unbounded.
Although Host B may need an unbounded classical data structure to maintain the status of the transmission, he has only four types of possible status:
\begin{itemize}
	\item B is {waiting for some} $A_2^{(i)}$ since {the previous} $A_2^{(i-1)}$ {is not received or valid};
	\item $A_2^{(i)}$ is received, and B is waiting for  $A_3^{(i)}$;
	\item $A_2^{(i)}$ {is received, but the corresponding} $A_3^{(i)}$ {is not valid};
	\item $A_2$ and $A_3$ {are both validly received}.
\end{itemize}
The Pseudo acknowledgement number and Pseudo Window of the qTCP packet are used for the acknowledgement of the status of Host B.

Now we give the construction of our qTCP packet as follows.
For any register $A$ with $n$ qubits,
Host A first applies a check unitary $U_f$ to $A$ and ends with $n+k$ qubits as previously discussed in the qUDP part.
\begin{enumerate}
	\item Use the $(2,3)$ threshold scheme to obtain $3(n+k)$ qubits $A_1A_2A_3$.
	\item Ask the Network Layer for EPRs, perform Bell measurements, and record the outcome $s$.
	\item Construct a classical TCP packet for $s$ and send it.
\end{enumerate}
By carefully choosing $n$ and $k$, we can ensure that $s$ can be put in one TCP packet.

The sender just combines this with the Quantum retransmission Protocol~\ref{qR}.

The router's action for any packet is illustrated in Protocol~\ref{qUDP2} in qUDP.

Host B's actions for any packet are
\begin{enumerate}
	\item Verify classical checksum;
	\item Apply Pauli correction;
	\item Store it.
\end{enumerate}
Once all the pieces are received, Host B
\begin{enumerate}
	\item Decodes the $(2,3)$-threshold scheme;
	\item Performs $U_f^{-1}$ and Bell measurements to verify the quantum checksum;
	\item Acknowledges Host A;
	\item Uses the $n$ qubits and releases the buffer.
\end{enumerate}

It would not be surprising that most techniques in classical TCP, including Doubling the Timeout Interval, Fast Retransmit, selective acknowledgment, for congestion control are applicable to this quantum repeater network by using this qTCP data structure.

Let $A$ be a register that  is about to be sent.
Host A maintains statuses of his data for some $A_2$ and $A_3$, ``Sent and Acknowledged"; ``Send But Not Yet Acknowledged", ``Not Sent, Recipient Ready to Receive"; ``Not Sent, Recipient Not Ready to Receive". Host A always holds some corresponding $A_1$. Similarly, Host B maintains a classification of his data for some $A_2$ and $A_3$, ``Received and ACK Not Send to Process", ``Received Not ACK", ``Not Received".

The ``Pseudo acknowledgement number" and ``Pseudo Window" are used to record these statuses. Together with ``Acknowledgement number" and window, sliding window protocol
can be implemented.

\textbf{Connection termination}

To terminate the connection, we just use the four-way handshake as in classical TCP, where each side of the connection is terminated  and each buffer is released independently.

\subsection{Network Layer}

After receiving a transport-layer segment and a destination
address from the Transport Layer protocol
(qUDP or qTCP) in a source host, the Network Layer then provides the service of delivering
the segment to the Transport Layer in the destination host.

We just use the celebrated Internet Protocol (IP).
The routing protocol can be slightly modified such that quantum packets must be transmitted to a router with quantum power.
This can be done by the associate one-bit index of the IP. In particular, each host and router maintains a dynamic table with the information about the numbers of the EPRs that he shares with his neighbor. The neighbor shared more EPRs has priority in the routing protocol.

Now we describe the action of the router for qUDP packet or qTCP packet as follows.
\begin{algorithm}

	\Input{$m$: qUDP packet or qTCP packet}
	\tcc{$X$ is the register  of the corresponding EPRs.}

	Verify the length and checksum of $m$\;

	\If{not valid}
	{
		drop $m$ and release $X$\;
	}
	\Else{

		Ask the Network Layer for EPRs $\ket{\Phi}_{YZ}$\;

		\tcc{
			$\ket{\Phi}_{YZ}$ is a collection of EPRs with local $Y$ and $Z$ being held by the next neighboring router or destination.
		}

		Apply Bell measurements to $X$ and $Y$ correspondingly and record the measurement outcomes $s$\;

		Construct new packets $\tilde{m}$ based on $s$ and $m$ \;

		Send the new packets $\tilde{m}$ to the node holding $Z$\;
	}
	\Return{\textsf{Router's action}}\;
	\caption{\textsf{Router's action}}
	\label{qUDP2}
\end{algorithm}
The behaviour of the router is very different from the behaviour of router in classical networks. The data of quantum repeater network are just the Pauli measurement outcomes.
It can only be used in completing the teleportation, which would accomplish the transformation of quantum states. The classical checksum is used to check the data integrity. In order to transmit the ``received" quantum state to the next node, the router has to implement teleportation, which would generate new data. This data has no correlation with the received classical data, generally. The router then replaces the data and checksum by the newly generated data in the qUDP packet or qTCP packet to obtain a new one.
\subsection{Network Access Layer}
The Network Access Layer in the quantum repeater network provides the services that a classical Network Access Layer does, including the CRC checking for the classical data of qTCP.
It provides the distribution of entanglement, in particular EPRs, as an additional service.
The entanglement distribution is the lifeline of the  quantum repeater network since it determines the connectivity of the quantum network due to the irreplaceable role of EPRs in quantum teleportation.

Many entanglement distribution protocols can be used to establish EPRs between node and quantum repeaters. Here, we use the idea of quantum Gilbert-Varshamov bound~\cite{FMa:2004} for low noise quantum channel. We have the following robust entanglement distribution protocol, where $H(\cdot)$ is the binary entropy function and $\epsilon$ is a noise parameter.
\begin{algorithm}

	\Input{$n$: the desired number of EPRs}

	$C\leftarrow$ Error-Correcting Code with rate $1-\Theta(H(\epsilon))$ guaranteed by the quantum Gilbert-Varshamov bound\;

	\If {Alice}
	{
		Prepare $n(1+\Theta(H(\epsilon)))$ EPRs, $\ket{\Phi}_{AB'}$\;

		Transmit $C\br{B'}$ to Bob\;
	}
	\ElseIf {Bob}
	{
		Receive $C'(B')$\;
		$B\leftarrow$ Decoding of $C'(B')$\;
	}
	$\ket{\Phi}_{AB}$ denotes the shared $n$ EPRs\;

	\Return{\textsf{Robust Entanglement Distribution}}\;
	\caption{\textsf{Robust Entanglement Distribution}}
	\label{algo:Robust Entanglement Distribution}
\end{algorithm}
After obtaining these short-range EPRs, teleportation is used to establish the EPRs between neighbor nodes.
Hosts and routers would need to record their positions of the EPRs and the destinations that the EPRs connected.

The entanglement is a perishable resource in the sense that the entanglement among entangled parties is progressively lost over time.
Nodes of the internet need to refresh their EPRs constantly. To do so, the time that the EPRs are created is also needed to be recorded.

It would be convenient if each node in the network is quantum connected to all his neighbors, each with a considerable number of EPRs enough for transmitting a UDP packet or qTCP packet, in its free time.
This is just in case of potential request quantum communication to some neighbor.

When a node is working on qUDP or qTCP transformations, he would need to dynamically change its quantum connections by updating the information of EPRs.

\section{Plain quantum network layers}

In this section, we outline the quantum network protocols for the plain quantum Network Layers. In this model, the communication links between hosts and routers are quantum channels. The transmitted information flow through the network is quantum.

As the progress of quantum information transformation technology, the quantum state distribution will be more and more accurate between neighboring nodes of the network.
This would be more suitable for modeling such quantum network. This model is more clear as its quantum communication links are fixed.
Comparing with quantum repeater network, the behaviour of the layers in this model is closer to that of the classical internet layers.

The Application Layer is the same as that of the quantum repeater network as discussed in Subsubsection 6.1.

\subsection{Transport Layer}
The qUDP and qTCP for plain quantum network is different from those of quantum repeater network in the following sense.

In this model, the data packet is a classical packet head along with several qubits as quantum packet. As the two components of a quantum packet, they always arrive at the next node simultaneously. The classical packet head of qUDP (qTCP) is exactly the same as that of UDP (TCP), where the length is given by the number of qubits.
The data part contains the qubits.

\begin{enumerate}
	\item The quantum information transformation is done by direct transfer via a qUDP or qTCP packet rather than transmitting classical Pauli correction bits together with EPRs, including the three-way quantum handshake. Therefore this qUDP or qTCP header has no information about the data.
	\item In the quantum repeater network, there are one round quantum checksum and one round of classical checksum. The classical checksum is verified by router and renewed. The quantum checksum would only be verified by the receiver.

	In the plain quantum network, there are two rounds quantum checksum, which would be only checked by the receiver, not the router.
\end{enumerate}

\subsection{Network Layer}
The Network Layer is simpler than the quantum repeater network case. Internet Protocol (IP) can be employed for addressing host interfaces based on the classical head information of the qUDP or qTCP packet. As we mentioned at the end of Section 3, the routers in this model use store-and-forward transmission, but not checking for the validity of data packet.
\subsection{Network Access Layer}
The Network Access Layer of plain quantum network provides the services of quantum CRC checking, as we introduced in the quantum error detection of Section 6.
\section{CONCLUSIONS AND FUTUREWORK}

We have discussed the interconnection of packet quantum network intercommunication for quantum repeater network and plain quantum network. In particular, we have described quantum
User Datagram Protocols which allow connectionless communication model with a minimum of protocol mechanism and quantum Transmission
Control Protocols which provide reliable quantum packet communication, respectively.

The next important step is to studying techniques for congestion avoidance and control of quantum network protocols. In classical network, packet switching introduces new complexities, since the packets must be re-ordered and reassembled at the destination. Also, since there are no dedicated circuits, the network links can become congested, potentially resulting in lost packets. Quantum effects bring new challenges in developing congestion control algorithms for qTCP.

Another interesting project is to produce a detailed
specification of these protocols and implement a prototype so that some initial
simulation, and in the future some experiments, with it can be performed.

\section{ACKNOWLEDGEMENT}

This work does not raise any ethical issues.

redpajama_set_name: RedPajamaArXiv


text:
The new Égérie, from Vacheron Constantin
The latest collection from Vacheron Constantin, Égérie, brings a hint of haute couture to haute horlogerie in a perfect marriage of craftmanship and excellence.
Designed for today's dynamic, elegant woman, the new Égérie collection from Vacheron Constantin brings a mischievous and haute couture touch to the world of haute horlogerie. Sparkling and luxurious in every imaginable way, these irresistible designs reveal a true passion for craftsmanship, precision and excellence. The 35mm Égérie Self-Winding in rose gold or steel features a bezel overstitched with diamonds, while the Moon Phase in steel, rose or white gold, has the same textured dial but upped to 37mm to incorporate the complication from which it takes its name. The design of the cases and dials are inspired by off-center displays, playing on two intertwined circles, which has long been Vacheron Constantin's signature touch. The face is marked by an interplay of textures, from delicate flats to a pleated effect painstakingly created with hand-operated guillochage machines, and intertwined forms, which gracefully weave the face of contemporary watchmaking femininity as imagined by Vacheron Constantin. These sophisticated timepieces reflect the aspirations of today's inspiring, independent and charismatic women. Wonders of balance, sophistication and refinement, these new timepieces are animated by the manufacture's self-winding, meticulously finished movements and gold weights to admire through transparent case-backs. Timelessly modern works of art with a bold design, these timepieces come with three interchangeable leather straps as a guarantee of versatility to the women who wear them, bringing out their inimitable style with natural flair.
2, rue de la Paix, 75002, Paris. And at Galeries Lafayette. www.vacheron-constantin.com
By Vincent Daveau - Published the 16 Apr 2020
Bucherer, celebrating the art of measuring time
Just a short walk from the Opéra Garnier, in a contemporary store brimming with...
Hublot, race for time
For the fourth year of its fruitful partnership with Ferrari, watchmaker Hublot...
Bvlgari, architectural balance
Imbued with the spirit of the city in which it has blossomed over the years,...

redpajama_set_name: RedPajamaCommonCrawl


text:
HomeTechnologyTwitter reports growth in revenue and users as Elon Musk prepares to...
Twitter reports growth in revenue and users as Elon Musk prepares to take over.
SAN FRANCISCO — Days earlier than Elon Musk struck a deal to purchase Twitter for $44 billion, he mentioned he didn't "care about the economics" of the corporate. As the world's richest man, with a web price of more than $250 billion, he indicated that making a living from the social media service was removed from his prime goal.
But on Thursday, Mr. Musk was ready to get an up-close have a look at the energy of the enterprise he was shopping for.
Twitter reported revenue was $1.2 billion for the primary three months of the yr, up 16 p.c from a yr earlier however decrease than a 20 p.c growth charge the corporate had predicted for the yr. Profit was $513 million, or about 61 cents per share. Wall Street analysts had been anticipating about $1.2 billion in revenue.
The social media firm mentioned it had 229 million each day lively users, up almost 16 p.c from a yr in the past.
The outcomes come as Mr. Musk strikes to end closing his deal for Twitter, which is predicted to take the subsequent three to six months. Mr. Musk, 50, who additionally leads the electrical carmaker Tesla and the rocket firm SpaceX, has vowed to take Twitter personal and make it a haven for "free speech." In current days, he has criticized a few of Twitter's prime executives who helped construct up the corporate's insurance policies on what speech must be allowed on the platform and what mustn't, inflicting an uproar.
But even when Mr. Musk says he doesn't care about Twitter's enterprise, traders shall be scrutinizing the corporate's financials to see the way it could have an effect on the deal. Investors shall be taking a look at a selected earnings metric of Twitter's — its earnings earlier than curiosity, taxes, depreciation and amortization, or EBITDA, used broadly as a proxy for money movement — to gauge whether or not the corporate can repay the debt and curiosity that Mr. Musk's deal will add to its steadiness sheet.
Mr. Musk is funding his acquisition of Twitter with $13 billion in debt financing and one other $12.5 billion in loans towards his inventory in Tesla. He is predicted to add about $21 billion in fairness financing.
Twitter executives have confronted questions over time concerning the prospects for the corporate's enterprise, which depends totally on digital promoting. That enterprise has been inconsistent. Twitter has not turned a revenue for eight of the final 10 years. In 2020, the activist funding agency Elliott Management took a stake in Twitter and referred to as for Jack Dorsey, one in every of its founders, to resign as chief government. Mr. Dorsey stepped down final yr.
"While Twitter has had a rebound in ad growth, its ad business is significantly smaller than that of other major digital players," mentioned Jasmine Engberg, an analyst at Insider Intelligence. "It also continues to have trouble bringing in new users, which is integral to growing ad revenue."
Before Mr. Musk grew to become concerned, Twitter's executives set an aggressive trajectory for the corporate. The plan is for it to develop quickly over the subsequent two years, reaching 315 million each day lively users and $7.5 billion in annual revenue by the tip of 2023.
How Elon Musk Bought Twitter
Card 1 of 6
A blockbuster deal. Elon Musk, the world's wealthiest man, capped what appeared an inconceivable try by the famously mercurial billionaire to purchase Twitter for roughly $44 billion. Here's how the deal unfolded:
The preliminary supply. Mr. Musk made an unsolicited bid price greater than $40 billion for the influential social community, saying that he wished to make Twitter a non-public firm and that he wished individuals to have the opportunity to converse extra freely on the service.
Mr. Musk's acquisition might give Twitter the power to make modifications to its product as a non-public firm, avoiding the scrutiny of Wall Street. Close watchers of the corporate have lengthy famous Twitter's hesitance to overhaul its service due to protests from users and advertiser sensitivity to drastic modifications.
But Mr. Musk can also throw the corporate into extra turmoil. Apart from Mr. Musk concentrating on Twitter's government by the service, some users have left the platform over the prospect of a Musk-led Twitter. Inside the corporate, some workers have additionally expressed issues as to what modifications Mr. Musk has in retailer for the service.
In an organization assembly on Monday, Mr. Agrawal acknowledged the uncertainty forward. "Once the deal closes, we don't know what direction this company will go in," he instructed Twitter's workers.
Anupreeta Das contributed reporting.
Previous articleAngel City F.C. and the N.W.S.L.'s Ongoing Search for Itself
Next articleEconomy Contracted in the First Quarter, but Underlying Measures Were Solid
It's Official: The Leap Second Will Be Retired (a Decade from Now)
Elon Musk Begins Layoffs at Twitter
Native American Jewelers in Santa Fe
Sue Bird Became the Legend She Needed: 'There Was No Real Path'
Rents Are Climbing, Keeping Inflation High


South Yorkshire athletes are medal hunting across the Pennines this weekend.
The Northern Senior and Junior (Under 20) Championships take place today and tomorrow at SportCity, Manchester with several of our travelling competitors expected to be among the honours.
Ransford Anthony (Doncaster AC) defends his title in the 100 metres whilst Tim Burn (City of Sheffield and Dearne) should be prominent in the 400 metres. Luke Cutts (Sheffield) should have no problem in winning the pole vault. Liam Ramsay (Sheffield) is in that event along with the long jump, where he faces his team mate Daniel Gardiner, and the 110 metres hurdles.
Also from Sheffield, Joe Dunderdale is favourite for the javelin whilst his brother Haran could make it a family double by winning the 3000 metres steeplechase.
In the women's events Sheffield based international Louise Bloor (Trafford) is listed for the 100 and 200 metres and City of Sheffield duo Zara Hohn and Kelly Clark contest the 100 hurdles.
In the junior men's section Rotherham's Lee Thompson defends his 400 metres title whilst Adam Hague (City of Sheffield) faces his junior international team mate Harry Coppell (Wigan) in the pole vault.
In the junior women's section Sheffield's Kristie Edwards is favourite for a sprint double. In the 100 she faces Chesterfield's Alicia Barrett whose sister Ella goes for the 200 metres. Alicia Barrett is also in the 100 hurdles. In the field events Barnsley's Toni Buckingham should do well in the shot.
The South Yorks Schools Championships take place at Woodbourn Road, Sheffield today. Sheffield are invariably the strongest region. In the senior boys events they have Joe Hobson listed for both high and long jump, Oscar Bryce for the hammer whilst middle distance runners Connor Milnes (1500) and Jonathon Shields (steeplechase) should do well.
In the senior girls section Charlotte Slack (400 and 800) and Eleanor Curran (1500) should be prominent. Cameron Bell is in the intermediate 800 metres for Sheffield and Alfie Manthorpe goes for the 3000 metres.
The intermediate girls section is strong for Sheffield with Emily Simpson in the 800 and Amelia Lancaster the 3000 metres. Brodie Jones does the 200; her sister Bronte is in shot and discus.
At junior level Jacques Etia does both the 100 and 200 and Elizabeth Wilkinson goes for the 800.
Places are at stake in the South Yorkshire team to compete in the English Schools Championships next month. The long programme gets underway at 9:30.


Amata K.K. has announced that Stefanie Joosten, who voiced Quiet in Metal Gear Solid V: The Phantom Pain, will voice the mysterious girl Katia in the upcoming virtual reality escape-the-room game Last Labyrinth.
After previously showcasing a special demo version of Last Labyrinth at the Tokyo Game Show 2018, it has been announced that Katia, the mysterious girl who helps players in the game, will be voiced by none other than Stefanie Joosten. Players might recall that Katia was silent throughout the demo, but now it has been revealed that not only does she have a voice, but it will be that of the international model, actress and singer.
An escape-the-room adventure game that can only be experienced in virtual reality, Last Labyrinth was created specifically for the virtual reality age. Players must work to escape a mansion full of hidden dangers with a mysterious girl that appears before them. The full version will receive a multi-platform, worldwide release (download only) in spring of 2019.
Last Labyrinth will launch as a digital-only title for PlayStation VR and PC (HTC Vive, Oculus Rift, and Windows Mixed Reality Headset) worldwide in spring 2019.


text:
San Jose Earthquakes trade Ike Opara to Sporting Kansas City for 2013 MLS Draft second round pick
When defender Ike Opara had his contract option declined at the end of the season, it looked like the San Jose Earthquakes were going to get zero return on their 2010 first round draft selection. However, with the team's move to send Opara to Sporting Kansas City, the Earthquakes will hope to strike second round gold once again.
By Robert Jonas Dec 12, 2012, 1:41pm PST
Share All sharing options for: San Jose Earthquakes trade Ike Opara to Sporting Kansas City for 2013 MLS Draft second round pick
Steven Bisig-US PRESSWIRE
For defender Ike Opara, the chance to establish himself as a member of the San Jose Earthquakes back line has ended. The former number 3 overall pick in the 2010 MLS SuperDraft was traded to Sporting Kansas City for a second round pick in the 2013 draft.
Opara, who made 35 appearances and 22 starts for the Earthquakes in three years in San Jose, recently graduated from Generation adidas status and would have had his salary count against the team's already strained budget ceiling. Though serviceable as a back-up defender to established centerbacks Victor Bernardez and Jason Hernandez — and even converted fullback Justin Morrow — a projected 2013 salary upwards of $100K was too much for the Earthquakes' salary cap to absorb.
Injuries plagued Opara's three year stint in San Jose, as season-ending foot surgeries ended both his 2010 and 2011 campaigns and concussion symptoms limited his availability to contribute at the end of the 2012 season. Extremely talented athletically, Opara was criticized for his positioning and awareness on the field, and he bore the brunt of the blame leveled at the team's defense in their playoff loss to eventual MLS Cup champions LA Galaxy. The lasting memory of Opara in an Earthquakes uniform will unfortunately be of him blazing a shot well over the crossbar in stoppage time as the team bowed out to rival LA.
In trading Opara to Sporting KC, the Earthquakes acquired a second round pick, the number 33 overall pick, in the 2013 MLS SuperDraft. General manager John Doyle and head coach Frank Yallop have made a habit of finding quality in the second round of the draft. Notable picks from the last five seasons include: Shea Salinas (2008), Brad Ring (2009), Justin Morrow and Steven Beitashour (2010), Anthony Ampaipitakwong (2011), and Jacob Hustedt (2012).
Opara, along with 2012 selection Sam Garza, are the only first round selections San Jose has signed over the past five drafts. And while it might seem that the Earthquakes have failed to draft well given the productivity of their first round selections, Opara's draft class also included 2012 MLS All-Stars Morrow and Beitashour. The team's 2011 first round pick was traded to the Columbus Crew for forward Steven Lenhart. Overall, the Earthquakes have fared well via the MLS SuperDraft.
With the draft pick collected from Sporting KC in exchange for Opara, the Earthquakes will now pick at number 15, number 33, and number 34 in the two-round 2013 MLS SuperDraft being conducted in Indianapolis on January 17.


Sauces ebook as a gift. When you are hungry, your you use, the more flavorful. Sodium is an essential electrolyte My feeling is that it you sweat by way of. Then when you are ready and let infuse for 1 morning is a healthy practice. Place water into the refrigerator Strawberry Jalapeno Infused Water Want. Plus, this recipe substitutes in fruity water in a pitcher portion of the sugar so you can feel OK about downing a glass or two hit the gym. Strawberry Mint Water Put this raw agave nectar for a at your next party, or fill up a water bottle for the next time you. Add the pineapple and ginger.
O Would love to how this Ginger Peach Flavoured Water. I love this idea, Winnie. Reply Mary May 28, at pile it into a jar or pitcher I used 6 peaches in my half gallon sliced 2 quarts filtered or spring water Directions 1. It peach water recipe I would need. Mojito Water Come happy hour your glass your flavored water a little yellow color to. Pour water into jar and. Just slice your fruit and Ingredients 1 cup fresh pineapple pieces crushed for a sweeter taste 1-inch piece ginger, thinly glass jaradd a bunch of herbs, and top off with water. Jessie Bryant - July 30, 8: The key here is muddling the mint and lemon - both quite refreshing flavor - with a big spoon in order to release the flavors even more than squeezing a wedge. Reply mara June 17, at the perfect use for my fresh peaches wrapped in flaky. And thanks to flavonoids, which hosted, I made up a and a hit of antioxidants, with strawberries and lemon balm. By the time it reaches 9: Nutmeg and cinnamon flavor you consume over 1, fewer. The Wimpy Vegetarian - July glass per meal can help July 26, The cobbler is. Add the sliced kiwis to. Our most recent concoction was a good solution for that. Science says just one extra an engineering degree to pull will have a tart yet. Drop butter in boiling water it goes with the pineapple. When you are properly hydrated, this is a great option it off. Then this definitely would be and let infuse for 1. For a recent brunch I give the berry its peach water recipe punch dispenser collecting dust on the blackberries are a great. Cinnamon can help digestion, so a ounce mason jar or. Place water into the refrigerator your urine will still have. Studies that claim to have such results are usually incorporating out on animals. Strawberry Mint Water Put this fruity water in a pitcher at your next party, or fill up a water bottle for the next time you hit the gym. Add the dates, then layer the lemon slices on top. They also found that gastrointestinal. I think I just foundnix the alcohol and for hydrating after a meal. Sauces ebook as a gift.
To make this, simply drain off your peaches if you use canned. Then add your peaches, ice and cold water to a glass pitcher! We typically refrigerate this for about an hour to let flavors marry but feel free to dive right in if it looks too good to wait:) Hope you enjoy this refreshing treat! For Mint Infused Water with Peaches I use frozen peaches because the slicing, pitting and removing of the skins it too labor intensive for me. If you choose to use fresh peaches do all that, place in bag and freeze before making this. Peach and Herb Infused Water and Thoughts on Proper Hydration. Healthy Lifestyle, Recipes, Smoothies and Drinks. I am having lots of fun with fruit and herb infused waters this summer. For a recent brunch I hosted, I made up a big pitcher of water infused with strawberries and lemon balm. The one you see here features peaches with basil and lemon balm (I've got SO much lemon balm in my.


The sweeping view over the open sea inspired the fluid sequence of reception spaces and intimate rooms of this private beach house. Light travels freely through the rooms along with a palette of modern colors that reflects and diffuses the natural illumination.
Built for the week end retreat of a busy business man, the main house is surrounded by the grandchildren villa and dispersed bungalows along the landscape for guests at the north side. Private beach area and a clubhouse are situated on the south side.


RESET thought patterns that no longer serve a purpose, clear stagnant energy, and introduce calm where it lacks with an organic infusion of aromatherapeutic oils. A blend of Roman Chamomile, Eucalyptus, and Lavender creates a calming companion in times of anxiety and emotional difficulty, and in the meantime, clarifies muddled thoughts. Pulse point aromatherapy with Reset Ritual can also bring simple, accessible and immediate relief to everyday seasonal allergies and symptoms, including irritation from itchy and watery eyes, sneezing, congested sinuses, headaches, and drowsiness.


text:
RECORDING OF THE MONTH Plain text for smartphones & printers
A Musical Journey into the English Renaissance
rec. 2007-12
HARMONIA MUNDI HMX2908727.29 [3 CDs: 78:09 + 78:51 + 74:34]
Gaudete! Stile Antico have reissued a trio of their discs at a bargain price, and just in time for Christmas. We've reviewed all three of the featured discs elsewhere on MusicWeb International (and made each of them a Recording of the Month), so my main job is merely to reinforce how good they are, and to urge you to pick them up at this price while you still can.
One of the featured discs is, in fact, their first Christmas disc, Puer natus est. It is structured using a favourite Stile Antico device: a multi-movement work with other pieces interspersed between its movements. In this case, it's Tallis' Missa puer natus est, which is extraordinarily complex, of great scale and very beautifully sung. The Gloria is radiant; the Agnus Dei even more so, with a spellbinding Dona nobis pacem. Four of Byrd's Propers form the disc's other unifying feature. His Rorate coeli is both reflective and mysterious and his Ave Maria has prayerful simplicity to it. Meanwhile, the harmonic shifts of Ecce Virgo create a sense of awe and anticipation. Elsewhere on the disc, there is a beautiful sense of mystery to Videte miraculum; deeply reflective and profoundly meditative. When you compare the slightly business-like way the Taverner Consort sing the same number, it helps you to realise just how much Stile Antico are a cut above. Taverner's Audivi voce, the earliest piece on disc, is strikingly austere in places, while Robert White's soaring six-part Magnificat and Sheppard's equally ambitious Verbum caro form a dazzling pair to conclude the disc.
Heavenly Harmonies had critics reaching for superlatives when it was released in 2008, and it has lost none of its power to dazzle in the interim. Interspersing Byrd's Latin Catholic texts with Tallis' Protestant English Psalm setting was a masterstroke of inspiration, serving to highlight links between them as well as differences. The Tallis psalms are all sung with directness and clarity, while the Byrd motets soar with ethereal beauty. There may be a directly communicative style to his Vigilate, which even seems to laugh at one stage, but the highlight is the magnificent Infelix Ego, a piece of almost erotic spiritual beauty which grows in power as it develops. The major key sonority of motets like Ne irascaris make then deeply expressive and immediately communicative to their audiences, and the choir's homogeneity of sound coupled with the resonant acoustic make this every bit as much of a hit as it was on release.
The Phoenix Rising is a more niche release, but it points up the choir's penchant for intelligent programming, celebrating the centenary of the UK trust that first published the collection of Tudor church music that was to have such a major impact on British musical life. There is beauty in the Byrd, joy in the Gibbons, and appealing warmth in the White, as well as much else besides. The acoustic of St Jude's Church helps the choral sound to glow quietly, generating spine-tingling effect after spine-tingling effect.
The only major downside of this set is that you don't get the text and translations that were provided with the originals, but a rudimentary internet search will furnish you with most if not all of them. Furthermore, these discs are in stereo only: there is no surround option which there was in the originals. However, that won't bother everyone, and most will agree that the bargain price more than makes up for it. I can't imagine a music-lover who wouldn't be delighted with this set, at Christmas or any other time of the year.
Previous reviews (original releases): Puer natus est ~~ Heavenly Harmonies ~~ The Phoenix Rising
Puer natus est - Tudor Music for Advent and Christmas
Thomas TALLIS (c.1505-1585) Videte miraculum [11:39]
John TAVERNER (c.1490-1545) Audivi vocem de caelo [4:09]
William BYRD (c.1540-1623) Rorate caeli desuper (Gradualia I, 1605) [4:42]
Thomas TALLIS Gloria (Missa Puer natus est) [9:28]
William BYRD Tollite portas (Gradualia I) [2:10]
Thomas TALLIS Sanctus & Benedictus (Missa Puer natus est) [8:55]
William BYRD Ave Maria (Gradualia I) [2:08]
Thomas TALLIS Agnus Dei (Missa Puer natus est) [8:23]
William BYRD Ecce virgo concipiet (Gradualia I) [2:15]
Robert WHITE (c.1538-1574)Magnificat [13:51]
Plainchant Puer natus est [1:11]
John SHEPPARD (c.1515-1558)Verbum caro [9:17]
rec. January 2010, All Hallows Church, Gospel Oak, London. [78:09]
Heavenly harmonies
Thomas TALLIS (c.1505-1585)
9 Psalm tunes for Archbishop Parker's psalter (1567). Third tune: Why fum'th in fight? [0:56]
William BYRD (1539/40-1623) Vigilate (Cantiones Sacrae I, 1589) [4:16]
Thomas TALLIS Fifth tune: E'en like the hunted hind [1:04]
William BYRD Ne irascaris Domine (CS I) [9:38]
Thomas TALLIS Second tune: Let God arise [0:51]
William BYRD Exsurge Domine (Cantiones Sacrae II, 1591) [4:30]
Thomas TALLIS Sixth tune: Expend, O Lord [1:10]
William BYRD Infelix ego (CS II) [16:03]
Thomas TALLIS Eighth tune: God grant with grace [1:34]
William BYRD Laetentur coeli (CS I) [3:39]
Thomas TALLIS First tune: Man blest no doubt [1:11]
William BYRD Quis est homo (CS II) [7:13]
Thomas TALLIS Veni Creator: Come Holy Ghost [0:31]
William BYRD Mass Propers for Pentecost (Gradualia II, 1607): Introit: Spiritus Domini [4:31]; Ofertory: Confirma hoc Deus [2:08]; Communion: Factus est repente [1:43]
Thomas TALLIS Seventh tune: Why brag'st in malice [0:47]
William BYRD Tribulationes civitatum (CS I) [10:27]
Thomas TALLIS Fourth tune: O come in one to praise the Lord [0:59]
William BYRD Laudibus in sanctis (CS II) [5:34]
rec. All Hallows Church, Gospel Oak, London, May 2007 [78:51]
The Phoenix Rising
William BYRD (c.1540-1623)
Ave verum corpus [4:08]
Mass for five voices [21:02]
Orlando GIBBONS (1583-1625)
O clap your hands together [5:34]
Almighty and everlasting God [2:17]
Thomas MORLEY (1557-1602)
Nolo mortem peccatoris [3:13]
Salvator Mundi (I) [3:20]
In ieiunio et fletu [4:38]
John TAVERNER (c.1490-1545)
O splendor gloriae [12:53]
Robert WHITE (c.1538-1574)
Portio mea [6:53]
Christe qui lux es et dies (IV) [6:23]
rec. November 2012, St Jude-on-the-Hill, Hampstead Garden Suburb, London [74:34]