Abstract
A recent proposal has shown that it is possible to perform linear-optics quantum computation using a ballistic generation of the lattice. Yet, due to the probabilistic generation of its cluster state, it is not possible to use the fault-tolerant Raussendorf lattice, which requires a lower failure rate during the entanglement-generation process. Previous work in this area showed proof-of-principle linear-optics quantum computation, while this paper presents an approach to it which is more practical, satisfying several key constraints. We develop a classical measurement scheme that purifies a large faulty lattice to a smaller lattice with entanglement faults below threshold. A single application of this method can reduce the entanglement error rate to 7% for an input failure rate of 25%. Thus, we can show that it is possible to achieve fault tolerance for ballistic methods.
Highlights
Several physical platforms are aiming at achieving quantum computing.[1]
While the surface code is suitable for qubit implementations which are relatively easy to control, linear-optics quantum computation[10] is based on a slightly different principle, where photons are entangled in a cluster state which is consumed during the computation
Our procedure is based on ref. 24 which investigated how path-finding procedures can help for quantum computation on a faulty lattice
Summary
Several physical platforms are aiming at achieving quantum computing.[1]. For example, a qubit can be implemented using superconductors,[2] silicon,[3,4] trapped ion systems,[5,6] or using linear optics.[7,8] Major advances in the fidelity of these qubits have made the application of error-correction codes, such as the surface code,[9] feasible. The surface code is of particular interest due to its high threshold[9] and 2D nearest-neighbor layout. While the surface code is suitable for qubit implementations which are relatively easy to control, linear-optics quantum computation[10] is based on a slightly different principle, where photons are entangled in a cluster state which is consumed during the computation. This quantum one-way computer was proposed by Raussendorf et al.[11,12] A high-level implementation for such a quantum computer can be divided into three steps:[13,14]
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
