Repeat-until-success cubic phase gate for universal continuous-variable quantum computation

Kevin Marshall, Raphael Pooser, George Siopsis, and Christian Weedbrook
Phys. Rev. A 91, 032321 – Published 24 March 2015

Abstract

To achieve universal quantum computation using continuous variables, one needs to jump out of the set of Gaussian operations and have a non-Gaussian element, such as the cubic phase gate. However, such a gate is currently very difficult to implement in practice. Here we introduce an experimentally viable “repeat-until-success” approach to generating the cubic phase gate, which is achieved using sequential photon subtractions and Gaussian operations. We find that our scheme offers benefits in terms of the expected time until success, as well as the fact that we do not require any complex off-line resource state, although we require a primitive quantum memory.

  • Figure
  • Figure
  • Figure
  • Figure
  • Received 3 December 2014

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

©2015 American Physical Society

Authors & Affiliations

Kevin Marshall1, Raphael Pooser2,3, George Siopsis3, and Christian Weedbrook4

  • 1Department of Physics, University of Toronto, Toronto, M5S 1A7, Canada
  • 2Quantum Information Science Group, Oak Ridge National Laboratory, Oak Ridge, Tennessee 37831, USA
  • 3Department of Physics and Astronomy, University of Tennessee, Knoxville, Tennessee 37996-1200, USA
  • 4QKD Corp., 60 St. George St., Toronto, M5S 1A7, Canada

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 91, Iss. 3 — March 2015

Reuse & Permissions
Access Options
CHORUS

Article Available via CHORUS

Download Accepted Manuscript
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
×