arXiv subjects

A. J. F. Hayes

Publications and source records attributed to A. J. F. Hayes.

6 recordsLinked to original sources

arXiv2009

Fault Tolerance in Parity-State Linear Optical Quantum Computing

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.

quant-ph↗

arXiv2007

Proposal for optical parity state re-encoder

We propose a re-encoder to generate a refreshed parity encoded state from an existing parity encoded state. This is the simplest case of the scheme by Gilchrist et al. (Phys. Rev. A 75, 052328). We show that it is possible to demonstrate with existing technology parity encoded quantum gates and teleportation.

quant-ph↗

arXiv2007

Loss-tolerant operations in parity-code linear optics quantum computing

A heavy focus for optical quantum computing is the introduction of error-correction, and the minimisation of resource requirements. We detail a complete encoding and manipulation scheme designed for linear optics quantum computing, incorporating scalable operations and loss-tolerant architecture.

quant-ph↗

arXiv2005

Efficient Parity Encoded Optical Quantum Computing

We present a linear optics quantum computation scheme with a greatly reduced cost in resources compared to KLM. The scheme makes use of elements from cluster state computation and achieves comparable resource usage to those schemes while retaining the circuit based approach of KLM.

quant-ph↗

arXiv2005

Loss Tolerant Optical Qubits

We present a linear optics quantum computation scheme that employs a new encoding approach that incrementally adds qubits and is tolerant to photon loss errors. The scheme employs a circuit model but uses techniques from cluster state computation and achieves comparable resource usage. To illustrate our techniques we describe a quantum memory which is fault tolerant to photon loss.

quant-ph↗

arXiv2004

Utilizing Encoding in Scalable Linear Optics Quantum Computing

We present a scheme which offers a significant reduction in the resources required to implement linear optics quantum computing. The scheme is a variation of the proposal of Knill, Laflamme, and Milburn, and makes use of an incremental approach to the error encoding to boost probability of success.

quant-ph↗