A Layered Architecture for Quantum Computing Using Quantum Dots

N. Cody Jones, Rodney Van Meter, Austin G. Fowler, Peter L. McMahon, Jungsang Kim, Thaddeus D. Ladd, Y. Yamamoto

arXiv (Cornell University) · 2010 · 39 citations · 83 references

Full text

Open access

Concepts

TL;DR

The study proposes a modular, layered architecture for a fault‑tolerant quantum computer. The architecture employs optically controlled quantum‑dot electron spins, a topological surface‑code error‑correction scheme with local gates, and semiconductor‑fabrication integration to realize a fault‑tolerant, scalable quantum computer. The design proves flexible, fast, and scalable, enabling a 2048‑bit Shor’s algorithm run in about a week. PACS numbers: 03.67.Pp, 03.67.Lx, 85.35.Be, 73.21.La, 85.40.Hp.

Abstract

We address the challenge of designing a quantum computer architecture with a layered framework that is modular and facilitates faulttolerance. The framework is flexible and could be used for analysis and comparison of differing quantum computer designs. Using this framework, we develop a complete, layered architecture for quantum computing with optically controlled quantum dots, showing how a myriad of technologies must operate synchronously to achieve fault-tolerance. Our design deliberately takes advantage of the large possibilities for integration afforded by semiconductor fabrication. Quantum information is stored in the electron spin states of a charged quantum dot controlled by ultrafast optical pulses. Optical control makes this system very fast, scalable to large problem sizes, and extensible to quantum communication or distributed architectures. The design of this quantum computer centers on error correction in the form of a topological surface code, which requires only local and nearest-neighbor gates. We analyze several important issues of the surface code that are relevant to an architecture, such as resource accounting and the use of Pauli frames. Furthermore, we investigate the performance of this system and find that Shor’s factoring algorithm for a 2048-bit number can be executed in approximately one week. PACS numbers: 03.67.Pp, 03.67.Lx, 85.35.Be, 73.21.La, 85.40.Hp

References

83