Repeat-until-success cubic phase gate for universal continuous-variable quantum computation
Journal Article
·
· Physical Review A - Atomic, Molecular, and Optical Physics
- Univ. of Toronto, ON (Canada). Dept. of Physics
- Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States). Quantum Information Science Group; Univ. of Tennessee, Knoxville, TN (United States). Dept. of Physics and Astronomy
- Univ. of Tennessee, Knoxville, TN (United States). Dept. of Physics and Astronomy
- QKD Corp., Toronto, ON (Canada)
We report that 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. Ultimately, 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.
- Research Organization:
- Oak Ridge National Laboratory (ORNL), Oak Ridge, TN (United States)
- Sponsoring Organization:
- USDOE
- Grant/Contract Number:
- AC05-00OR22725
- OSTI ID:
- 1185866
- Alternate ID(s):
- OSTI ID: 1179951
- Journal Information:
- Physical Review A - Atomic, Molecular, and Optical Physics, Vol. 91, Issue 3; ISSN 1050-2947
- Publisher:
- American Physical Society (APS)Copyright Statement
- Country of Publication:
- United States
- Language:
- English
Cited by: 49 works
Citation information provided by
Web of Science
Web of Science
Similar Records
Repeat-until-success quantum computing using stationary and flying qubits
Universal Compiling and (No-)Free-Lunch Theorems for Continuous-Variable Quantum Learning
Construction of a universal quantum computer
Journal Article
·
Sun Jan 15 00:00:00 EST 2006
· Physical Review. A
·
OSTI ID:1185866
+2 more
Universal Compiling and (No-)Free-Lunch Theorems for Continuous-Variable Quantum Learning
Journal Article
·
Mon Nov 08 00:00:00 EST 2021
· PRX Quantum
·
OSTI ID:1185866
Construction of a universal quantum computer
Journal Article
·
Fri May 15 00:00:00 EDT 2009
· Physical Review. A
·
OSTI ID:1185866