AN INTRODUCTION TO ONE-WAY QUANTUM COMPUTING IN DISTRIBUTED ARCHITECTURES

DOI10.1142/S0219749910006198zbMath1189.81031arXiv0906.2725OpenAlexW3104212492WikidataQ61158742 ScholiaQ61158742MaRDI QIDQ3565446

Earl T. Campbell, Joseph Fitzsimons

Publication date: 3 June 2010

Published in: International Journal of Quantum Information (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0906.2725

zbMATH Keywords

clustergraphquantum computationone-waydistributedmeasurement-based

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Quantum computation (81P68) Research exposition (monographs, survey articles) pertaining to quantum theory (81-02)

Related Items (2)

Qubit mapping of one-way quantum computation patterns onto 2D nearest-neighbor architectures ⋮ Classification of 4-qubit entangled graph states according to bipartite entanglement, multipartite entanglement and non-local properties

Cites Work

• Unnamed Item
• Unnamed Item
• Cluster-state quantum computation
• An efficient algorithm to recognize locally equivalent graphs
• Fault-tolerant quantum computation by anyons
• A fault-tolerant one-way quantum computer
• Percolation, Renormalization, and Quantum Computing with Nondeterministic Gates
• Quantum Information Processing with Delocalized Qubits under Global Control
• Multiparty entanglement in graph states
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• Error Correcting Codes in Quantum Theory
• Quantum noise. A handbook of Markovian and non-Markovian quantum stochastic methods with applications to quantum optics.

This page was built for publication: AN INTRODUCTION TO ONE-WAY QUANTUM COMPUTING IN DISTRIBUTED ARCHITECTURES