pith. sign in

arxiv: 0908.3932 · v2 · pith:CMDQ5MS4new · submitted 2009-08-27 · 🪐 quant-ph

Fault Tolerance in Parity-State Linear Optical Quantum Computing

classification 🪐 quant-ph
keywords parity-stateschemecodecomputingconcatenationencodinglinearnoise
0
0 comments X
read the original abstract

We use a combination of analytical and numerical techniques to calculate the noise threshold and resource requirements for a linear optical quantum computing scheme based on parity-state encoding. Parity-state encoding is used at the lowest level of code concatenation in order to efficiently correct errors arising from the inherent nondeterminism of two-qubit linear-optical gates. When combined with teleported error-correction (using either a Steane or Golay code) at higher levels of concatenation, the parity-state scheme is found to achieve a saving of approximately three orders of magnitude in resources when compared to a previous scheme, at a cost of a somewhat reduced noise threshold.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.