Growth of graph states in quantum networks
- 3 October 2012
- journal article
- research article
- Published by American Physical Society (APS) in Physical Review A
- Vol. 86 (4)
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.Keywords
All Related Versions
This publication has 55 references indexed in Scilit:
- Google in a Quantum NetworkScientific Reports, 2012
- An elementary quantum network of single atoms in optical cavitiesNature, 2012
- Random Quantum NetworksScience, 2010
- Distributed quantum-information processing with minimal local resourcesPhysical Review A, 2007
- Efficient growth of complex graph states via imperfect path erasureNew Journal of Physics, 2007
- Adaptive strategies for graph-state growth in the presence of monitored errorsPhysical Review A, 2007
- Experimental entanglement of six photons in graph statesNature Physics, 2007
- Graphical description of the action of local Clifford transformations on graph statesPhysical Review A, 2004
- Statistical mechanics of complex networksReviews of Modern Physics, 2002
- Quantum error-correcting codes associated with graphsPhysical Review A, 2001