Systematically generated two-qubit anyon braids

Caitlin Carnahan, Daniel Zeuch, and N. E. Bonesteel
Phys. Rev. A 93, 052328 – Published 20 May 2016

Abstract

Fibonacci anyons are non-Abelian particles for which braiding is universal for quantum computation. Reichardt has shown how to systematically generate nontrivial braids for three Fibonacci anyons which yield unitary operations with off-diagonal matrix elements that can be made arbitrarily small in a particular natural basis through a simple and efficient iterative procedure. This procedure does not require brute force search, the Solovay-Kitaev method, or any other numerical technique, but the phases of the resulting diagonal matrix elements cannot be directly controlled. We show that despite this lack of control the resulting braids can be used to systematically construct entangling gates for two qubits encoded by Fibonacci anyons.

  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Figure
  • Received 9 November 2015

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

©2016 American Physical Society

Physics Subject Headings (PhySH)

Quantum Information, Science & Technology

Authors & Affiliations

Caitlin Carnahan1, Daniel Zeuch2, and N. E. Bonesteel2

  • 1Department of Computer Science, Florida State University, Tallahassee, Florida 32310, USA
  • 2Department of Physics and NHMFL, Florida State University, Tallahassee, Florida 32310, USA

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 93, Iss. 5 — May 2016

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
×