Generalised All-Optical Cat Correction
Ari John Boon, Olivier Landon-Cardinal, Nicol\'as Quesada

TL;DR
This paper extends all-optical telecorrection protocols for higher-order cat codes, reducing iteration counts and enabling new transformations, with trade-offs in photon-number and complexity.
Contribution
It generalizes the telecorrection protocol to higher-order cat codes and introduces a probabilistic scheme for state deformation correction.
Findings
Higher-order cat codes achieve target fidelity with fewer iterations.
A third-order cat code reduces iterations by 70 times compared to first-order.
The scheme allows encoding new transformations and changing the code basis.
Abstract
We have generalised an all-optical telecorrection protocol for the higher orders of the cat code, and show that with these higher orders we can achieve target performance at substantially reduced iteration counts at the cost of a higher mean photon-number. We also introduce a probabilistic scheme for correcting deformation of the state, which highlights two interesting abilities of telecorrection: to encode new sets of transformations, and to change the basis of the code. We find that for a target channel fidelity of over a channel with of loss, a third-order cat code requires times fewer telecorrection iterations than a first-order one, at a cost of a -fold increase in mean photon-number.
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsOptical Network Technologies · Quantum Information and Cryptography · graph theory and CDMA systems
