170 citations · 264 across the 7 of their papers we have counts for
8 papers
Affine Equivalence in the Clifford Hierarchy
Jonas T. Anderson, Andrew Connelly
In this paper we prove a collection of results on the structure of permutations in the Clifford Hierarchy. First, we leverage results from the cryptography literature on affine equ…
Controlled Gates in the Clifford Hierarchy
Jonas T. Anderson, Matthew Weippert
In this note we prove a necessary set of conditions which must be satisfied by any controlled gate in the qubit Clifford Hierarchy. These conditions are straightforward to derive y…
On Groups in the Qubit Clifford Hierarchy
Jonas T. Anderson
Here we study the unitary groups that can be constructed using elements from the qubit Clifford Hierarchy. We first provide a necessary and sufficient canonical form that semi-Clif…
Classification of transversal gates in qubit stabilizer codes
Jonas T. Anderson, Tomas Jochym-O'Connor
This work classifies the set of diagonal gates that can implement a single or two-qubit transversal logical gate for qubit stabilizer codes. We show that individual physical gates…
Fault-tolerant conversion between the Steane and Reed-Muller quantum codes
Jonas T. Anderson, Guillaume Duclos-Cianci, David Poulin
Steane's 7-qubit quantum error-correcting code admits a set of fault-tolerant gates that generate the Clifford group, which in itself is not universal for quantum computation. The…
On the Power of Reusable Magic States
Jonas T. Anderson
In this paper we study reusable magic states. These states are a special subset of the standard magic states. Once distilled, reusable magic states can be used, repeatedly, to appl…