Cluster state generation with ageing qubits
arXiv:1305.7446 · doi:10.1103/PhysRevA.88.012330
Abstract
Cluster states for measurement-based quantum computing can be created with entangling operations of arbitrary low success probability. This will place a lower bound on the minimum lifetime of the qubits used in the implementation. Here, we present a simple scaling argument for the T2 time of the qubits for various cluster state geometries, and we estimate the size of the qubit reservoir that is needed for the creation of mini-clusters.
6 pages, 7 figures
References in corpus (10)
- Fault-tolerant quantum computation with high threshold in two dimensions
- Resource-efficient linear optical quantum computation
- Universal resources for measurement-based quantum computation
- Topological quantum computing with a very noisy network and local error rates approaching one percent
- Brokered Graph State Quantum Computing
- Measurement based entanglement under conditions of extreme photon loss
- Potential and limits to cluster state quantum computing using probabilistic gates
- Fully fault tolerant quantum computation with non-deterministic gates
- Fault-Tolerant Topological One-Way Quantum Computation with Probabilistic Two-Qubit Gates
- Distributed quantum information processing with minimal local resources