Details
| Original language | English |
|---|---|
| Pages (from-to) | 443-486 |
| Number of pages | 44 |
| Journal | Quantum Information and Computation |
| Volume | 2 |
| Issue number | 6 |
| Publication status | Published - 2002 |
| Externally published | Yes |
Abstract
In this paper we present the computational model underlying the one-way quantum computer which we introduced recently [Phys. Rev. Lett. 86, 5188 (2001)]. The one-way quantum computer has the property that any quantum logic network can be simulated on it. Conversely, not all ways of quantum information processing that are possible with the one-way quantum computer can be understood properly in network model terms. We show that the logical depth is, for certain algorithms, lower than has so far been known for networks. For example, every quantum circuit in the Clifford group can be performed on the one-way quantum computer in a single step.
Keywords
- Models for quantum computation, Temporal complexity
ASJC Scopus subject areas
- Mathematics(all)
- Theoretical Computer Science
- Physics and Astronomy(all)
- Statistical and Nonlinear Physics
- Physics and Astronomy(all)
- Nuclear and High Energy Physics
- Mathematics(all)
- Mathematical Physics
- Physics and Astronomy(all)
- Computer Science(all)
- Computational Theory and Mathematics
Cite this
- Standard
- Harvard
- Apa
- Vancouver
- BibTeX
- RIS
In: Quantum Information and Computation, Vol. 2, No. 6, 2002, p. 443-486.
Research output: Contribution to journal › Article › Research › peer review
}
TY - JOUR
T1 - Computational model underlying the one-way quantum computer
AU - Raußendorf, Robert
AU - Briegel, Hans J.
PY - 2002
Y1 - 2002
N2 - In this paper we present the computational model underlying the one-way quantum computer which we introduced recently [Phys. Rev. Lett. 86, 5188 (2001)]. The one-way quantum computer has the property that any quantum logic network can be simulated on it. Conversely, not all ways of quantum information processing that are possible with the one-way quantum computer can be understood properly in network model terms. We show that the logical depth is, for certain algorithms, lower than has so far been known for networks. For example, every quantum circuit in the Clifford group can be performed on the one-way quantum computer in a single step.
AB - In this paper we present the computational model underlying the one-way quantum computer which we introduced recently [Phys. Rev. Lett. 86, 5188 (2001)]. The one-way quantum computer has the property that any quantum logic network can be simulated on it. Conversely, not all ways of quantum information processing that are possible with the one-way quantum computer can be understood properly in network model terms. We show that the logical depth is, for certain algorithms, lower than has so far been known for networks. For example, every quantum circuit in the Clifford group can be performed on the one-way quantum computer in a single step.
KW - Models for quantum computation
KW - Temporal complexity
UR - http://www.scopus.com/inward/record.url?scp=4043141630&partnerID=8YFLogxK
U2 - 10.26421/qic2.6-3
DO - 10.26421/qic2.6-3
M3 - Article
AN - SCOPUS:4043141630
VL - 2
SP - 443
EP - 486
JO - Quantum Information and Computation
JF - Quantum Information and Computation
SN - 1533-7146
IS - 6
ER -