170 citations · 214 across the 2 of their papers we have counts for
2 papers
quant-ph2014★ 44 cited
Reducing the quantum computing overhead with complex gate distillation
Guillaume Duclos-Cianci, David Poulin
In leading fault-tolerant quantum computing schemes, accurate transformation are obtained by a two-stage process. In a first stage, a discrete, universal set of fault-tolerant oper…
quant-ph2014★ 170 cited
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…