TL;DR
This paper introduces a scalable lattice renormalization technique for ballistic quantum computation that reduces entanglement errors, enabling fault-tolerant linear-optics quantum computing with probabilistic cluster state generation.
Contribution
It presents a practical classical measurement scheme to purify faulty lattices, achieving fault tolerance in ballistic quantum computation.
Findings
Reduces entanglement error rate to 7% from 25% failure rate
Enables fault-tolerant ballistic quantum computation
Provides a scalable method for lattice renormalization
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 for an input failure rate of . Thus, we can show that it is possible to achieve fault tolerance for ballistic methods.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
