Details
| Originalsprache | Englisch |
|---|---|
| Aufsatznummer | 022304 |
| Fachzeitschrift | Physical Review A - Atomic, Molecular, and Optical Physics |
| Jahrgang | 76 |
| Ausgabenummer | 2 |
| Publikationsstatus | Veröffentlicht - 6 Aug. 2007 |
| Extern publiziert | Ja |
Abstract
We study measurement-based quantum computation (MQC) using as a quantum resource the planar code state on a two-dimensional square lattice (planar analog of the toric code). It is shown that MQC with the planar code state can be efficiently simulated on a classical computer if at each step of MQC the sets of measured and unmeasured qubits correspond to connected subsets of the lattice. The simulation scheme is built upon Barahona's algorithm for computing the partition function of the Ising model on a planar graph. Our results provide a simulation method for MQC centered around planarity of graphs.
ASJC Scopus Sachgebiete
- Physik und Astronomie (insg.)
- Atom- und Molekularphysik sowie Optik
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
in: Physical Review A - Atomic, Molecular, and Optical Physics, Jahrgang 76, Nr. 2, 022304, 06.08.2007.
Publikation: Beitrag in Fachzeitschrift › Artikel › Forschung › Peer-Review
}
TY - JOUR
T1 - Measurement-based quantum computation with the toric code states
AU - Bravyi, Sergey
AU - Raussendorf, Robert
PY - 2007/8/6
Y1 - 2007/8/6
N2 - We study measurement-based quantum computation (MQC) using as a quantum resource the planar code state on a two-dimensional square lattice (planar analog of the toric code). It is shown that MQC with the planar code state can be efficiently simulated on a classical computer if at each step of MQC the sets of measured and unmeasured qubits correspond to connected subsets of the lattice. The simulation scheme is built upon Barahona's algorithm for computing the partition function of the Ising model on a planar graph. Our results provide a simulation method for MQC centered around planarity of graphs.
AB - We study measurement-based quantum computation (MQC) using as a quantum resource the planar code state on a two-dimensional square lattice (planar analog of the toric code). It is shown that MQC with the planar code state can be efficiently simulated on a classical computer if at each step of MQC the sets of measured and unmeasured qubits correspond to connected subsets of the lattice. The simulation scheme is built upon Barahona's algorithm for computing the partition function of the Ising model on a planar graph. Our results provide a simulation method for MQC centered around planarity of graphs.
UR - http://www.scopus.com/inward/record.url?scp=34547665551&partnerID=8YFLogxK
U2 - 10.48550/arXiv.quant-ph/0610162
DO - 10.48550/arXiv.quant-ph/0610162
M3 - Article
AN - SCOPUS:34547665551
VL - 76
JO - Physical Review A - Atomic, Molecular, and Optical Physics
JF - Physical Review A - Atomic, Molecular, and Optical Physics
SN - 1094-1622
IS - 2
M1 - 022304
ER -