624 citations · 2.1k across the 21 of their papers we have counts for
22 papers
Exhaustive Optimisation of Automorphism Groups for Stabiliser Codes
Aisling Mac Aree, Mark Howard
An important measure of utility for a quantum code is the identification of which logical operations can be implemented fault-tolerantly on its codespace. We introduce a framework…
Quantum Advantage in Information Retrieval
Pierre-Emmanuel Emeriau, Mark Howard, Shane Mansfield
Random access codes have provided many examples of quantum advantage in communication, but concern only one kind of information retrieval task. We introduce a related task - the To…
Lower bounds on the non-Clifford resources for quantum computations
Michael Beverland, Earl Campbell, Mark Howard +1
We establish lower-bounds on the number of resource states, also known as magic states, needed to perform various quantum computing tasks, treating stabilizer operations as free. O…
Simulation of quantum circuits by low-rank stabilizer decompositions
Sergey Bravyi, Dan Browne, Padraic Calpin +3
Recent work has explored using the stabilizer formalism to classically simulate quantum circuits containing a few non-Clifford gates. The computational cost of such methods is dire…
Magic state parity-checker with pre-distilled components
Earl T. Campbell, Mark Howard
Magic states are eigenstates of non-Pauli operators. One way of suppressing errors present in magic states is to perform parity measurements in their non-Pauli eigenbasis and posts…
Application of a resource theory for magic states to fault-tolerant quantum computing
Mark Howard, Earl T. Campbell
Motivated by their necessity for most fault-tolerant quantum computation schemes, we formulate a resource theory for magic states. We first show that robustness of magic is a well-…