Programming a Topological Quantum Computer

Topological quantum computing has recently proven itself to be a powerful computational model when constructing viable architectures for large scale computation. The topological model is constructed from the foundation of a error correction code, required to correct for inevitable hardware faults that will exist for a large scale quantum device. It is also a measurement based model of quantum computation, meaning that the quantum hardware is responsible only for the construction of a large, computationally universal quantum state. This quantum state is then strategically consumed, allowing for the realisation of a fully error corrected quantum algorithm. The number of physical qubits needed by the quantum hardware and the amount of time required to implement an algorithm is dictated by the manner in which this universal quantum state is consumed. In this paper we examine the problem of algorithmic optimisation in the topological lattice and introduce the required elements that will be needed when designing a classical software package to compile and implement a large scale algorithm on a topological quantum computer.

[1]  A. V. Gorshkov,et al.  Scalable architecture for a room temperature solid-state quantum information processor , 2010, Nature Communications.

[2]  A. Kitaev,et al.  Universal quantum computation with ideal Clifford gates and noisy ancillas (14 pages) , 2004, quant-ph/0403025.

[3]  R. V. Meter,et al.  A Layered Architecture for Quantum Computing Using Quantum Dots , 2010 .

[4]  Austin G. Fowler,et al.  Topological cluster state quantum computing , 2008, Quantum Inf. Comput..

[5]  A. Fowler,et al.  A bridge to lower overhead quantum computation , 2012, 1209.0510.

[6]  A. Kitaev Fault tolerant quantum computation by anyons , 1997, quant-ph/9707021.

[7]  W. Munro,et al.  Architectural design for a topological cluster state quantum computer , 2008, 0808.1782.

[8]  J. Preskill,et al.  Topological quantum memory , 2001, quant-ph/0110143.

[9]  W. Munro,et al.  Quantum error correction for beginners , 2009, Reports on progress in physics. Physical Society.

[10]  Michael A. Nielsen,et al.  The Solovay-Kitaev algorithm , 2006, Quantum Inf. Comput..

[11]  Yasunobu Nakamura,et al.  Quantum computers , 2010, Nature.

[12]  D. Deutsch Quantum computational networks , 1989, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[13]  Frederic T. Chong,et al.  A general purpose architectural layout for arbitrary quantum computations , 2005, SPIE Defense + Commercial Sensing.

[14]  D. Deutsch Quantum theory, the Church–Turing principle and the universal quantum computer , 1985, Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences.

[15]  Pedram Khalili Amiri,et al.  Quantum computers , 2003 .

[16]  Peter W. Shor,et al.  Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..

[17]  A. Fowler,et al.  Long-range coupling and scalable architecture for superconducting flux qubits , 2007, cond-mat/0702620.

[18]  Simon J. Devitt,et al.  Synthesis of topological quantum circuits , 2012, 2012 IEEE/ACM International Symposium on Nanoscale Architectures (NANOARCH).

[19]  Robert Raussendorf,et al.  Topological fault-tolerance in cluster state quantum computation , 2007 .

[20]  R. V. Meter,et al.  DISTRIBUTED QUANTUM COMPUTATION ARCHITECTURE USING SEMICONDUCTOR NANOPHOTONICS , 2009, 0906.2686.

[21]  Michael A. Nielsen,et al.  Quantum Computation and Quantum Information Theory , 2000 .