Robust fault tolerance for continuous-variable cluster states with excess antisqueezing

@article{Walshe2019RobustFT,
  title={Robust fault tolerance for continuous-variable cluster states with excess antisqueezing},
  author={Blayney W. Walshe and Lucas J. Mensen and Ben Q. Baragiola and Nicolas C. Menicucci},
  journal={Physical Review A},
  year={2019}
}
The immense scalability of continuous-variable cluster states motivates their study as a platform for quantum computing, with fault tolerance possible given sufficient squeezing and appropriately encoded qubits [Menicucci, PRL 112, 120504 (2014)]. Here, we expand the scope of that result by showing that additional anti-squeezing has no effect on the fault-tolerance threshold, removing the purity requirement for experimental continuous-variable cluster-state quantum computing. We emphasize that… 

Figures from this paper

All-Gaussian Universality and Fault Tolerance with the Gottesman-Kitaev-Preskill Code.
TLDR
It is shown that applying GKP error correction to Gaussian input states, such as vacuum, produces distillable magic states, achieving universality without additional non-Gaussian elements.
High-threshold fault-tolerant quantum computation with the GKP qubit and realistically noisy devices
To implement fault-tolerant quantum computation with continuous variables, continuous variables need to be digitized using an appropriate code such as the Gottesman--Kitaev--Preskill (GKP) qubit. We
Deterministic generation of a two-dimensional cluster state
TLDR
A scalable scheme for the generation of photonic cluster states suitable for universal measurement-based quantum computation is proposed and a demonstrated source of two-dimensional cluster states can be combined with quantum error correction to enable fault-tolerant quantum computation.
Generation of time-domain-multiplexed two-dimensional cluster state
TLDR
Generating a large-scale two-dimensional continuous-variable cluster state that is compatible with Bosonic error-correcting codes that enable fault-tolerant quantum computation and readily scalable and fault tolerant.
Fault-Tolerant Continuous-Variable Measurement-based Quantum Computation Architecture
Mikkel V. Larsen, ∗ Christopher Chamberland, 3 Kyungjoo Noh, 3 Jonas S. Neergaard-Nielsen, and Ulrik L. Andersen † Center for Macroscopic Quantum States (bigQ), Department of Physics, Technical
Cluster States from Gaussian States: Essential Diagnostic Tools for Continuous-Variable One-Way Quantum Computing
TLDR
By a detailed analysis of the structure of Gaussian states, an algorithm is derived that reveals hidden entanglement in an arbitrary Gaussian state and optimizes its use for one-way quantum computing.
Are all Gaussian states also cluster states? Detecting hidden continuous-variable entanglement
TLDR
It is shown here that Gaussian states can present hidden entanglement, which is not captured by the corresponding cluster state graph and therefore invalidates this graph.
Architecture and noise analysis of continuous-variable quantum gates using two-dimensional cluster states
TLDR
A complete measurement-based quantum computing architecture for the implementation of a universal set of gates on the recently generated two-dimensional cluster states is proposed and it is found that, although they all allow for universal computation, the quad-rail lattice cluster state performs better than the other three states which all exhibit similar performance.
Continuous-variable quantum computing in the quantum optical frequency comb
  • O. Pfister
  • Physics
    Journal of Physics B: Atomic, Molecular and Optical Physics
  • 2019
This topical review introduces the theoretical and experimental advances in continuous-variable (CV) --- i.e., qumode-based in lieu of qubit-based --- large-scale, fault-tolerant quantum computing
Continuous-variable gate teleportation and bosonic-code error correction
TLDR
The technique shows how gate teleportation is used to perform error correction on bosonic qubits encoded using the Gottesman-Kitaev-Preskill code, and shows that state injection for both gate teleportation and error correction can be achieved without active squeezing operations.
...
...

References

SHOWING 1-10 OF 47 REFERENCES
Fault-tolerant measurement-based quantum computing with continuous-variable cluster states.
  • N. Menicucci
  • Physics, Computer Science
    Physical review letters
  • 2014
TLDR
By concatenating with one of these codes and using ancilla-based error correction, fault-tolerant measurement-based quantum computation of theoretically indefinite length is possible with finitely squeezed cluster states.
Quantum Computing with Continuous-Variable Clusters
TLDR
It is proved that there are universal states for which the offline squeezing per mode does not increase with the size of the cluster and the existence of universal continuous-variable resource states is found.
High-threshold fault-tolerant quantum computation with analog quantum error correction
TLDR
This work numerically shows that the required squeezing level can be relaxed to less than 10 dB, which is within the reach of the current experimental technology and can considerably alleviate this experimental requirement and take a step closer to the realization of large scale quantum computation.
Universal quantum computation with ideal Clifford gates and noisy ancillas (14 pages)
We consider a model of quantum computation in which the set of elementary operations is limited to Clifford unitaries, the creation of the state |0>, and qubit measurement in the computational basis.
Universal quantum computation with continuous-variable cluster states.
We describe a generalization of the cluster-state model of quantum computation to continuous-variable systems, along with a proposal for an optical implementation using squeezed-light sources, linear
Gain tuning for continuous-variable quantum teleportation of discrete-variable states
We present a general formalism to describe continuous-variable (CV) quantum teleportation of discrete-variable (DV) states with gain tuning, taking into account experimental imperfections. Here the
Analog Quantum Error Correction with Encoding a Qubit into an Oscillator.
TLDR
This approach is the first attempt to draw both digital and analog information to improve quantum error correction performance and achieve the hashing bound for the quantum capacity of the GQC.
Overhead and noise threshold of fault-tolerant quantum error correction
TLDR
Fault-tolerant quantum error correction networks are studied by a combination of numerical and approximate analytical treatments and it is found that concatenated codes based on the Golay code give higher thresholds than thoseBased on the $[[7,1,3]]$ Hamming code under most conditions.
Weaving quantum optical frequency combs into continuous-variable hypercubic cluster states
Cluster states with higher-dimensional lattices that cannot be physically embedded in three-dimensional space have important theoretical interest in quantum computation and quantum simulation of
Encoding a qubit in an oscillator
Quantum error-correcting codes are constructed that embed a finite-dimensional code space in the infinite-dimensional Hilbert space of a system described by continuous quantum variables. These codes
...
...