Symmetric multiparty-controlled teleportation of an arbitrary two-particle entanglement

We present a way for symmetric multiparty-controlled teleportation of an arbitrary two-particle entangled state based on Bell-basis measurements by using two Greenberger-Horne-Zeilinger states, i.e., a sender transmits an arbitrary two-particle entangled state to a distant receiver, an arbitrary one of the $n+1$ agents via the control of the others in a network. It will be shown that the outcomes in the cases that $n$ is odd or it is even are different in principle as the receiver has to perform a controlled-not operation on his particles for reconstructing the original arbitrary entangled state in addition to some local unitary operations in the former. Also we discuss the applications of this controlled teleporation for quantum secret sharing of classical and quantum information. As all the instances can be used to carry useful information, its efficiency for qubits approaches the maximal value.Comment: 9 pages, 3 figures; the revised version published in Physical Review A 72, 022338 (2005). The detail for setting up a GHZ-state quantum channel is adde

Single Qubit Quantum Secret Sharing

We present a simple and practical protocol for the solution of a secure multiparty communication task, the secret sharing, and its experimental realization. In this protocol, a secret message is split among several parties in a way that its reconstruction require the collaboration of the participating parties. In the proposed scheme the parties solve the problem by a sequential communication of a single qubit. Moreover we show that our scheme is equivalent to the use of a multiparty entangled GHZ state but easier to realize and better scalable in practical applications.Comment: 5 pages, 2 figures, submitted December 29, 200

Quantum City: simulation of a practical near-term metropolitan quantum network

We present the architecture and analyze the applications of a metropolitan-scale quantum network that requires only limited hardware resources for end users. Using NetSquid, a quantum network simulation tool based on discrete events, we assess the performance of several quantum network protocols involving two or more users in various configurations in terms of topology, hardware and trust choices. Our analysis takes losses and errors into account and considers realistic parameters corresponding to present or near-term technology. Our results show that practical quantum-enhanced network functionalities are within reach today and can prepare the ground for further applications when more advanced technology becomes available

Recursive quantum repeater networks

Internet-scale quantum repeater networks will be heterogeneous in physical technology, repeater functionality, and management. The classical control necessary to use the network will therefore face similar issues as Internet data transmission. Many scalability and management problems that arose during the development of the Internet might have been solved in a more uniform fashion, improving flexibility and reducing redundant engineering effort. Quantum repeater network development is currently at the stage where we risk similar duplication when separate systems are combined. We propose a unifying framework that can be used with all existing repeater designs. We introduce the notion of a Quantum Recursive Network Architecture, developed from the emerging classical concept of 'recursive networks', extending recursive mechanisms from a focus on data forwarding to a more general distributed computing request framework. Recursion abstracts independent transit networks as single relay nodes, unifies software layering, and virtualizes the addresses of resources to improve information hiding and resource management. Our architecture is useful for building arbitrary distributed states, including fundamental distributed states such as Bell pairs and GHZ, W, and cluster states.Comment: 14 page

Multiparticle entanglement purification for two-colorable graph states

We investigate multiparticle entanglement purification schemes which allow one to purify all two colorable graph states, a class of states which includes e.g. cluster states, GHZ states and codewords of various error correction codes. The schemes include both recurrence protocols and hashing protocols. We analyze these schemes under realistic conditions and observe for a generic error model that the threshold value for imperfect local operations depends on the structure of the corresponding interaction graph, but is otherwise independent of the number of parties. The qualitative behavior can be understood from an analytically solvable model which deals only with a restricted class of errors. We compare direct multiparticle entanglement purification protocols with schemes based on bipartite entanglement purification and show that the direct multiparticle entanglement purification is more efficient and the achievable fidelity of the purified states is larger. We also show that the purification protocol allows one to produce private entanglement, an important aspect when using the produced entangled states for secure applications. Finally we discuss an experimental realization of a multiparty purification protocol in optical lattices which is issued to improve the fidelity of cluster states created in such systems.Comment: 22 pages, 8 figures; replaced with published versio