Constructions of $\ell$-Adic $t$-Deletion-Correcting Quantum Codes
Ryutaroh Matsumoto, Manabu Hagiwara

TL;DR
This paper introduces two systematic methods for constructing quantum deletion-correcting codes, one for single deletion with asymptotic limitations and another for multiple deletions with better asymptotic properties, including conversion from stabilizer codes.
Contribution
It presents novel constructions for quantum deletion-correcting codes, including a method to convert stabilizer codes and incorporate entanglement assistance.
Findings
First construction corrects one deletion but is asymptotically bad.
Second construction corrects multiple deletions and is asymptotically good.
Conversion of stabilizer codes to deletion-correcting codes is possible.
Abstract
We propose two systematic constructions of deletion-correcting codes for protecting quantum information. The first one works with qudits of any dimension, but only one deletion is corrected and the constructed codes are asymptotically bad. The second one corrects multiple deletions and can construct asymptotically good codes. The second one also allows conversion of stabilizer-based quantum codes to deletion-correcting codes, and entanglement assistance.
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
TopicsQuantum Computing Algorithms and Architecture · Quantum-Dot Cellular Automata · Quantum Information and Cryptography
