Efficient Construction of Photonic Quantum Computational Clusters
arXiv:quant-ph/0512110 · doi:10.1103/PhysRevA.73.064303
Abstract
We demonstrate a method of creating photonic two-dimensional cluster states that is considerably more efficient than previously proposed approaches. Our method uses only local unitaries and type-I fusion operations. The increased efficiency of our method compared to previously proposed constructions is obtained by identifying and exploiting local equivalence properties inherent in cluster states.
4 pages, 4 figures
References in corpus (4)
Cited by in corpus (19)
- Photon temporal modes: a complete framework for quantum information science
- Fusing multiple W states simultaneously with a Fredkin gate
- Potential and limits to cluster state quantum computing using probabilistic gates
- Two-dimensional cluster-state preparation with linear ion traps
- Efficient generation of universal two-dimensional cluster states with hybrid systems
- Weak non-linearities and cluster states
- Parameters of Pseudo-Random Quantum Circuits
- One-way quantum computation with four-dimensional photonic qudits
- Minimal resources for linear optical one-way computing
- Cluster state preparation using gates operating at arbitrary success probabilities
- Weaving independently generated photons into an arbitrary graph state
- Entanglement Sudden Death as an Indicator of Fidelity in a Four-Qubit Cluster State
- Graph-theoretical optimization of fusion-based graph state generation
- Linear optical quantum computation with imperfect entangled photon-pair sources and inefficient non-photon-number-resolving detectors
- Layer by layer generation of cluster states
- Efficient graph state generation and artificial error detection
- Fusing Imperfect Photonic Cluster States
- Storing Small Photonic Cluster States in a Dephasing Environment
- Imperfect Construction of Microclusters