All Abstracts | Poster Abstracts | Talk Abstracts | Tutorial Abstracts

Comparing quantum codes with a Clifford-circuit simulator

Adam Meier, University of Colorado at Boulder

(Session 5 : Friday from 5:00-7:00)

Abstract. The stabilizer formalism used in the proof of the Gottesman-Knill theorem allows classical computers to simulate efficiently a class of quantum circuits known as Clifford circuits. Within this class, the circuits needed to encode and decode additive quantum codes are of particular interest due to the large portion of time most designs for quantum computers spend on encoding and decoding. By modeling these processes on a classical computer under different error models, we can compare different quantum codes in a very practical and pertinent way. We present progress on our design of a fast Clifford-circuit simulator and some results for codes based on Galois fields of prime-power order. This work is in collaboration with K. Costello, B. Eastin, S. Glancy and E. Knill.