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 (48)
- Statistical mechanics of complex networks
- Quantum Cryptography
- The Quantum Internet
- Lethality and centrality in protein networks
- Random graphs with arbitrary degree distributions and their applications
- Classes of behavior of small-world networks
- Purification of Noisy Entanglement and Faithful Teleportation via Noisy Channels
- Critical phenomena in complex networks
- Quantum state transfer and entanglement distribution among distant nodes in a quantum network
- Dynamical and correlation properties of the Internet
- Quantum privacy amplification and the security of quantum cryptography over noisy channels
- 14-qubit entanglement: creation and coherence
- Measurement-based quantum computation
- Multi-party entanglement in graph states
- An Elementary Quantum Network of Single Atoms in Optical Cavities
- Experimental entanglement of six photons in graph states
- Modeling the Internet's Large-Scale Topology
- Quantum error-correcting codes associated with graphs
- Taming multiparticle entanglement
- Graphical description of the action of local Clifford transformations on graph states
- Entanglement purification and quantum error correction
- Continuous-Time Quantum Walks: Models for Coherent Transport on Complex Networks
- Entanglement Percolation in Quantum Networks
- Universal resources for measurement-based quantum computation
- Bell Inequalities for Graph States
- Multiparticle entanglement purification for graph states
- Quantum complex networks
- Multiparticle entanglement purification for two-colorable graph states
- Google in a Quantum Network
- Measurement-based quantum repeaters
- Small-world networks and the conformation space of a lattice polymer chain
- Entanglement percolation in quantum complex networks
- Entanglement purification protocols for all graph states
- Entanglement Purification of Any Stabilizer State
- Multipartite secure state distribution
- Distributed quantum information processing with minimal local resources
- Purification of large bicolorable graph states
- Limited path entanglement percolation in quantum complex networks
- Fidelity threshold for long-range entanglement in quantum networks
- Entanglement Percolation with Bipartite Mixed States
- Probabilistic growth of large entangled states with low error accumulation
- Adaptive strategies for graph state growth in the presence of monitored errors
- Cluster state preparation using gates operating at arbitrary success probabilities
- Singlet Generation in Mixed State Quantum Networks
- 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
- Edge local complementation for logical cluster states
Cited by in corpus (20)
- Control Principles of Complex Networks
- A quantum network stack and protocols for reliable entanglement-based networks
- Modular architectures for quantum networks
- Quantum Google in a Complex Network
- Distributing Graph States Over Arbitrary Quantum Networks
- Analysis of Multipartite Entanglement Distribution using a Central Quantum-Network Node
- Multipartite state generation in quantum networks with optimal scaling
- Delocalized information in quantum networks
- Optimized Quantum Networks
- Distributing Graph States Across Quantum Networks
- Influence of noise in entanglement-based quantum networks
- Unitary Entanglement Construction in Hierarchical Networks
- High fidelity GHZ generation within nearby nodes
- Flexible quantum data bus for quantum networks
- Controlled remote implementation of operations via graph states
- Many-body quantum resources of graph states
- Space-time Peer-to-Peer Distribution of Multi-party Entanglement for Any Quantum Network
- A resource- and computationally-efficient protocol for multipartite entanglement distribution in Bell-pair networks
- Multipartite Entanglement Distribution in Quantum Networks using Subgraph Complementations
- Distillation of multipartite entangled states for arbitrary subsets of parties in noisy quantum networks of increasing size