Fetching the paper…
Reading the bibliography…
Quantum deletions, which are harder to correct than erasure errors, occur in many realistic settings.
V. I. Levenshtein, “Binary codes capable of correcting deletions, insertions, and reversals,” in Soviet physics doklady
1966
Earlier work this paper cites.
C. H. Bennett, D. P. DiVincenzo, and J. A. Smolin, “Capacities of quantum erasure channels,” Physical Review Letters
1997
Earlier work this paper cites.
M. Grassl, T. Beth, and T. Pellizzari, “Codes for the quantum erasure channel,” Physical Review A
1997
Earlier work this paper cites.
E. Knill and R. Laflamme, “Theory of quantum error-correcting codes,” Phys. Rev. A
1997
Earlier work this paper cites.
D. W. Leung, M. A. Nielsen, I. L. Chuang, and Y. Yamamoto, “Approximate quantum error correction can lead to better codes,” Phys. Rev. A
1997
Earlier work this paper cites.
M. B. Ruskai, “Pauli Exchange Errors in Quantum Computation,” Phys. Rev. Lett
2000
Earlier work this paper cites.
X. Zhou, D. W. Leung, and I. L. Chuang, “Methodology for quantum logic gate construction,” Phys. Rev. A
2000
Earlier work this paper cites.
H. Pollatsek and M. B. Ruskai, “Permutationally invariant codes for quantum error correction,” Linear Algebra and its Applications
2004
Earlier work this paper cites.
New York: Cambridge University Press, 10 anv. ed., 2011
M. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information · 2011
Cited alongside, same era.
Y. Ouyang, “Permutation-invariant quantum codes,” Phys. Rev. A
2014
Cited alongside, same era.
Y. Ouyang and J. Fitzsimons, “Permutation-invariant codes encoding more than one qubit,” Phys. Rev. A
2016
Cited alongside, same era.
Y. Ouyang, “Permutation-invariant qudit codes from polynomials,” Linear Algebra and its Applications
2017
Cited alongside, same era.
A. Wachter-Zeh, “List decoding of insertions and deletions,” IEEE Transactions on Information Theory
2018
Cited alongside, same era.
A. Bärtschi and S. Eidenbenz, “Deterministic preparation of Dicke states,” in International Symposium on Fundamentals of Computation Theory
2019
Later among the works it cites.
C. Wu, Y. Wang, C. Guo, Y. Ouyang, G. Wang, and X.-L. Feng, “Initializing a permutation-invariant quantum error-correction code,” Phys. Rev. A
2019
Later among the works it cites.
J. Sima and J. Bruck, “On optimal k-deletion correcting codes,” IEEE Transactions on Information Theory
2020
Later among the works it cites.
A. Nakayama and M. Hagiwara, “The first quantum error-correcting code for single deletion errors,” IEICE Communications Express
2020
Later among the works it cites.
M. Hagiwara and A. Nakayama, “A four-qubits code that is a quantum deletion error-correcting code with the optimal length,” in IEEE International Symposium on Information Theory, ISIT 2020, Los Angeles, CA, USA, June 21-26, 2020
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2019
Cited alongside, same era.
Y. Ouyang and R. Chao, “Permutation-invariant constant-excitation quantum codes for amplitude damping,” IEEE Transactions on Information Theory
2019
Cited alongside, same era.
2019
Cited alongside, same era.
2020
Later among the works it cites.
A. Nakayama and M. Hagiwara, “Single quantum deletion error-correcting codes,” in 2020 International Symposium on Information Theory and Its Applications (ISITA)
2020
Later among the works it cites.
M. T. Johnsson, N. R. Mukty, D. Burgarth, T. Volz, and G. K. Brennen, “Geometric pathway to scalable quantum sensing,” Physical Review Letters
2020
Later among the works it cites.
Y. Ouyang, “Quantum storage in quantum ferromagnets,” Phys. Rev. B
2021
Closest in time.