STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
Journal of the ACM (JACM)
Pauli Measurements are Universal
Electronic Notes in Theoretical Computer Science (ENTCS)
The Role of Classical Computation in Measurement-Based Quantum Computation
CiE '08 Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms
Quadratic Form Expansions for Unitaries
Theory of Quantum Computation, Communication, and Cryptography
Parallelizing quantum circuits
Theoretical Computer Science
Twisted Graph States for Ancilla-driven Universal Quantum Computation
Electronic Notes in Theoretical Computer Science (ENTCS)
Programmable Hamiltonian for One-way Patterns
Electronic Notes in Theoretical Computer Science (ENTCS)
An extremal result for geometries in the one-way measurement model
Quantum Information & Computation
Cluster states, algorithms and graphs
Quantum Information & Computation
Ancilla-driven quantum computation with twisted graph states
Theoretical Computer Science
| Hi-index | 0.00 |
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.