2012/12/21 by Justin B. Spring, Benjamin J. Metcalf, Peter C. Humphreys +12 · 37 citations
Computer Science · Physics and Astronomy · #Neural Networks and Reservoir Computing #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #physics.optics #quant-ph
paper · pdf · doi:10.1126/science.1231692
published as Science 339 798-801 (2013) · Main text: 5 pages, 4 figures. Supp Info: 6 pages
openalex publication_date 2012/12/21 · arxiv created 2013/05/27 · arxiv updated 2013/05/28 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
Computing Power of Quantum Mechanics There is much interest in developing quantum computers in order to perform certain tasks much faster than, or that are intractable for, a classical computer. A general quantum computer, however, requires the fabrication and operation a number of quantum logic devices (see the Perspective by Franson ). Broome et al. (p. 794 , published online 20 December) and Spring et al. (p. 798 , published online 20 December) describe experiments in which single photons and quantum interference were used to perform a calculation (the permanent of a matrix) that is very difficult on a classical computer. Similar to random walks, quantum walks on a graph describe the movement of a walker on a set of predetermined paths; instead of flipping a coin to decide which way to go at each point, a quantum walker can take several paths at once. Childs et al. (p. 791 ) propose an architecture for a quantum computer, based on quantum walks of multiple interacting walkers. The system is capable of performing any quantum operation using a subset of its nodes, with the size of the subset scaling favorably with the complexity of the operation.