Necessary and sufficient condition for constructing a single qudit insertion/deletion code and its decoding algorithm
January 13, 2025 Β· Declared Dead Β· π arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Taro Shibayama
arXiv ID
2501.07027
Category
quant-ph: Quantum Computing
Cross-listed
cs.IT
Citations
0
Venue
arXiv.org
Last Checked
5 months ago
Abstract
This paper shows that Knill-Laflamme condition, known as a necessary and sufficient condition for quantum error-correction, can be applied to quantum errors where the number of particles changes before and after the error. This fact shows that correctabilities of single deletion errors and single insertion errors are equivalent. By applying Knill-Laflamme condition, we generalize the previously known correction conditions for single insertion and deletion errors to necessary and sufficient level. By giving an example that satisfies this condition, we construct a new single qudit insertion/deletion code and explain its decoding algorithm.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
π Similar Papers
In the same crypt β Quantum Computing
R.I.P.
π»
Ghosted
R.I.P.
π»
Ghosted
Quantum machine learning: a classical perspective
R.I.P.
π»
Ghosted
Noise-Adaptive Compiler Mappings for Noisy Intermediate-Scale Quantum Computers
R.I.P.
π»
Ghosted
ProjectQ: An Open Source Software Framework for Quantum Computing
R.I.P.
π»
Ghosted
Quantum Recommendation Systems
R.I.P.
π»
Ghosted
Traffic flow optimization using a quantum annealer
Died the same way β π» Ghosted
R.I.P.
π»
Ghosted
Federated Learning: Strategies for Improving Communication Efficiency
R.I.P.
π»
Ghosted
In-Datacenter Performance Analysis of a Tensor Processing Unit
R.I.P.
π»
Ghosted
Deep Convolutional Neural Networks for Computer-Aided Detection: CNN Architectures, Dataset Characteristics and Transfer Learning
R.I.P.
π»
Ghosted