Growth of graph states in quantum networks
arXiv:1208.0710 · doi:10.1103/PhysRevA.86.042304
Abstract
We propose a scheme to distribute graph states over quantum networks in the presence of noise in the channels and in the operations. The protocol can be implemented efficiently for large graph sates of arbitrary (complex) topology. We benchmark our scheme with two protocols where each connected component is prepared in a node belonging to the component and subsequently distributed via quantum repeaters to the remaining connected nodes. We show that the fidelity of the generated graphs can be written as the partition function of a classical Ising-type Hamiltonian. We give exact expressions of the fidelity of the linear cluster and results for its decay rate in random graphs with arbitrary (uncorrelated) degree distributions.
16 pages, 7 figures
References in corpus (19)
- The Quantum Internet
- Critical phenomena in complex networks
- 14-qubit entanglement: creation and coherence
- Multi-party entanglement in graph states
- An Elementary Quantum Network of Single Atoms in Optical Cavities
- Experimental entanglement of six photons in graph states
- Taming multiparticle entanglement
- Entanglement purification and quantum error correction
- Universal resources for measurement-based quantum computation
- Bell Inequalities for Graph States
- Entanglement purification protocols for all graph states
- Distributed quantum information processing with minimal local resources
- Purification of large bicolorable graph states
- Limited path entanglement percolation in quantum complex networks
- Adaptive strategies for graph state growth in the presence of monitored errors
- Cluster state preparation using gates operating at arbitrary success probabilities
- Strategies for the preparation of large cluster states using non-deterministic gates
- Multipartite purification protocols: upper and optimal bounds
- Efficient growth of complex graph states via imperfect path erasure