Programming a Topological Quantum Computer

TL;DR

This paper discusses the development of a classical software framework for optimizing and implementing large-scale algorithms on topological quantum computers, which use error correction and measurement-based computation.

Contribution

It introduces the foundational elements needed to compile and optimize algorithms specifically for topological quantum computing architectures.

Findings

Identifies key components for a topological quantum algorithm compiler.

Highlights the importance of measurement strategies in algorithm execution.

Proposes a framework for algorithmic optimization in topological models.

Abstract

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.