The effect of communication costs in solid-state quantum computing architectures

Authors:
Dean Copsey;Mark Oskin;Tzvetan Metodiev;Frederic T. Chong;Isaac Chuang;John Kubiatowicz
Affiliations:
University of California at Davis;University of Washington;University of California at Davis;University of California at Davis;Massachusetts Institute of Technology;University of California, Berkeley
Venue:
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
Year:
2003

Citing 6
Cited 7

A fast quantum mechanical algorithm for database search

STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Fault-tolerant quantum computation with constant error

STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Molecular scale heat engines and scalable quantum computation

STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Quantum computation and quantum information

Quantum computation and quantum information
Building quantum wires: the long and the short of it

Proceedings of the 30th annual international symposium on Computer architecture
Fault-tolerant quantum computation

FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science

After the Transistor, the Qubit?

Computing in Science and Engineering
A Quantum Logic Array Microarchitecture: Scalable Quantum Data Movement and Computation

Proceedings of the 38th annual IEEE/ACM International Symposium on Microarchitecture
Architectural implications of quantum computing technologies

ACM Journal on Emerging Technologies in Computing Systems (JETC)
Distributed Arithmetic on a Quantum Multicomputer

Proceedings of the 33rd annual international symposium on Computer Architecture
Tailoring quantum architectures to implementation style: a quantum computer for mobile and persistent qubits

Proceedings of the 34th annual international symposium on Computer architecture
Arithmetic on a distributed-memory quantum multicomputer

ACM Journal on Emerging Technologies in Computing Systems (JETC)
A Θ( √ n)-depth quantum adder on the 2D NTC quantum computer architecture

ACM Journal on Emerging Technologies in Computing Systems (JETC)

Quantified Score

Hi-index	0.01

Visualization

Abstract

Quantum computation has become an intriguing technology with which to attack difficult problems and to enhance system security. Quantum algorithms, however, have been analyzed under idealized assumptions without important physical constraints in mind. In this paper, we analyze two key constraints: the short spatial distance of quantum interactions and the short temporal life of quantum data.In particular, quantum computations must make use of extremely robust error correction techniques to extend the life of quantum data. We present optimized spatial layouts of quantum error correction circuits for quantum bits embedded in silicon. We analyze the complexity of error correction under the constraint that interaction between these bits is near neighbor and data must be propagated via swap operations from one part of the circuit to another.We discover two interesting results from our quantum layouts. First, the recursive nature of quantum error correction circuits requires a additional communication technique more powerful than near-neighbor swaps -- too much error accumulates if we attempt to swap over long distances. We show that quantum teleportation can be used to implement recursive structures. We also show that the reliability of the quantum swap operation is the limiting factor in solid-state quantum computation.