• Editors' Suggestion

Reducing the quantum-computing overhead with complex gate distillation

Guillaume Duclos-Cianci and David Poulin
Phys. Rev. A 91, 042315 – Published 13 April 2015

Abstract

In leading fault-tolerant quantum-computing schemes, accurate transformations are obtained by a two-stage process. In a first stage, a discrete universal set of fault-tolerant operations is obtained by error-correcting noisy transformations and distilling resource states. In a second stage, arbitrary transformations are synthesized to desired accuracy by combining elements of this set into a circuit. Here we present a scheme that merges these two stages into a single one, directly distilling complex transformations. We find that our scheme can reduce the total overhead to realize certain gates by up to a few orders of magnitude. In contrast to other schemes, this efficient gate synthesis does not require computationally intensive compilation algorithms and a straightforward generalization of our scheme circumvents compilation and synthesis altogether.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Received 1 April 2014
  • Revised 10 December 2014

DOI:https://doi.org/10.1103/PhysRevA.91.042315

©2015 American Physical Society

Authors & Affiliations

Guillaume Duclos-Cianci and David Poulin

  • Département de Physique, Université de Sherbrooke, Québec, Canada J1K 2R1

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 91, Iss. 4 — April 2015

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×