Percolation in quantum computation and communication
arXiv:0712.1836
Abstract
This article is a draft of a book chapter of the book entitled "Quantum Percolation and Breakdown", to appear 2008.
Invited book chapter, "Quantum Percolation and Breakdown", Lecture Notes in Physics (Springer, Heidelberg, 2008). Also contains longer version of proof of main statement of quant-ph/0611140
References in corpus (33)
- Quantum Cryptography
- Concentrating Partial Entanglement by Local Operations
- Persistent entanglement in arrays of interacting particles
- Measurement-based quantum computation with cluster states
- Experimental One-Way Quantum Computing
- Multi-party entanglement in graph states
- Fault-tolerant quantum computation with high threshold in two dimensions
- Resource-efficient linear optical quantum computation
- Controlled Collisions for Multiparticle Entanglement of Optically Trapped Atoms
- Probabilistic Quantum Logic Operations Using Polarizing Beam Splitters
- Entanglement of pure states for a single copy
- Quantum error-correcting codes associated with graphs
- Purification via entanglement swapping and conserved entanglement
- Graphical description of the action of local Clifford transformations on graph states
- Maximum efficiency of a linear-optical Bell-state analyzer
- Novel schemes for measurement-based quantum computation
- Entanglement Percolation in Quantum Networks
- Universal resources for measurement-based quantum computation
- Measurement-based quantum computation beyond the one-way model
- Loss tolerance in one-way quantum computation via counterfactual error correction
- On the Number of Incipient Spanning Clusters
- Repeat-Until-Success quantum computing using stationary and flying qubits
- Noise thresholds for optical quantum computers
- Percolation, renormalization, and quantum computing with non-deterministic gates
- Entanglement Distribution in Pure-State Quantum Networks
- On measurement-based quantum computation with the toric code states
- Potential and limits to cluster state quantum computing using probabilistic gates
- Entanglement Swapping Chains for General Pure States
- The Largest Cluster in Subcritical Percolation
- Optimizing linear optics quantum gates
- Upper bounds on success probabilities in linear optics
- Minimal resources for linear optical one-way computing
- Cluster state preparation using gates operating at arbitrary success probabilities
Cited by in corpus (4)
- Enhancing the W State Quantum Network Fusion Process with A Single Fredkin Gate
- Quantum percolation and transition point of a directed discrete-time quantum walk
- Ground states of unfrustrated spin Hamiltonians satisfy an area law
- Directed percolation effects emerging from superadditivity of quantum networks