The realisation of large-scale quantum computing is no longer simply a
hardware question. The rapid development of quantum technology has resulted in
dozens of control and programming problems that should be directed towards the
classical computer science and engineering community. One such problem is known
as Pauli tracking. Methods for implementing quantum algorithms that are
compatible with crucial error correction technology utilise extensive quantum
teleportation protocols. These protocols are intrinsically probabilistic and
result in correction operators that occur as byproducts of teleportation. These
byproduct operators do not need to be corrected in the quantum hardware itself.
Instead, byproduct operators are tracked through the circuit and output results
reinterpreted. This tracking is routinely ignored in quantum information as it
is assumed that tracking algorithms will eventually be developed. In this work
we help fill this gap and present an algorithm for tracking byproduct operators
through a quantum computation. We formulate this work based on quantum gate
sets that are compatible with all major forms of quantum error correction and
demonstrate the completeness of the algorithm.Comment: 5 Pages, 1 figure, Accepted for Design, Automation and Test In Europe
(DATE'2014