Fetching the paper…
Reading the bibliography…
Highly entangled multipartite states such as k-uniform (k-UNI) and absolutely maximally entangled (AME) states serve as critical resources in quantum networking and other quantum information applications.
1910
Earlier work this paper cites.
F. J. MacWilliams, N. J. A. Sloane, ”The Theory of Error Correcting Codes”, North-Holland, Amesterdam (1977)
1977
Earlier work this paper cites.
R. M Roth, and G. Seroussi, ”On Generator Matrices of MDS Codes”, IEEE Trans. Inf. Theor. 31, 6 (1985)
1985
Earlier work this paper cites.
J. W. P. Hirschfeld, ”The main conjecture for MDS codes”, Springer Berlin Heidelberg, book title ”Cryptography and Coding”, 44-52 (1995)
1995
Earlier work this paper cites.
W. Dür, G. Vidal, and J. I. Cirac, ”Three qubits can be entangled in two inequivalent ways”, Phys. Rev. A 62
2000
Earlier work this paper cites.
R. Raussendorf and H. J. Briegel, ”A One-Way Quantum Computer”, Phys. Rev. Lett. 86
2001
Earlier work this paper cites.
D. Schlingemann, and R. F. Werner, ”Quantum error-correcting codes associated with graphs”, Phys. Rev. A 65
2001
Earlier work this paper cites.
J. Eisert and H. J. Briegel, “The Schmidt Measure as a Tool for Quantifying Multi-Particle Entanglement”, Phys. Rev. A 64
2001
Earlier work this paper cites.
F. Verstraete, J. Dehaene, B. De Moor, and H. Verschelde, ”Four qubits can be entangled in nine different ways” Phys. Rev. A 65
2002
Earlier work this paper cites.
M. Grassl, A. Klappenecker, and M. Rotteler, ”Graphs, quadratic forms, and quantum codes”, Proceedings IEEE International Symposium on Information Theory, pp. 45 (2002)
2002
Cited alongside, same era.
E. Briand, J. G. Luque, J. Y. Thibon, and F. Verstraete, ”The moduli space of three qutrit states”, J. Math. Phys. 45
2004
Cited alongside, same era.
A. J. Scott, ”Multipartite entanglement, quantum-error-correcting codes, and entangling power of quantum evolutions”, Phys. Rev. A, 69
2004
Cited alongside, same era.
M. Hein, J. Eisert, H. J. Briegel, ”Multi-party entanglement in graph states”, Phys. Rev. A 69
2004
Cited alongside, same era.
M. Van den Nest, J. Dehaene, B. De Moor, ”Graphical description of the action of local Clifford transformations on graph states”, Phys. Rev. A 69
2004
Cited alongside, same era.
D. Goyeneche, K. Życzkowski, ”Genuinely multipartite entangled states and orthogonal arrays” Phys. Rev. A 90
2014
Later among the works it cites.
V. Gheorghiu, ”Standard form of qudit stabilizer groups”, Phys. Lett. A, 378
2014
Later among the works it cites.
K. Azuma, K. Tamaki, and H. K. Lo, ”All-photonic quantum repeaters”, Nature Communications 6
2015
Later among the works it cites.
F. Pastawski, B. Yoshida, D. Harlow, J. Preskill, ”Holographic quantum error-correcting codes: Toy models for the bulk/boundary correspondence” JHEP, 06
2015
Later among the works it cites.
2017
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2005
Cited alongside, same era.
R. Singleton, ”Maximum distance q-nary codes”, IEEE Trans. Inf. Theor., 10
2006
Cited alongside, same era.
M. Zwerger, W. Dür, and H. J. Briegel, ”Measurement-based quantum repeaters”, Phys. Rev. A 85
2012
Cited alongside, same era.
Cited in the paper.
M. Hein, W. Dür, J. Eisert, R. Raussendorf, M. Van den Nest, H. J. Briegel, ”Entanglement in Graph States and its Applications”, arXiv:quant-ph/0602096
Cited in the paper.
W. Helwig, ”Absolutely Maximally Entangled Qudit Graph States”, arXiv:1306.2879 [quant-ph]
Cited in the paper.
Cited in the paper.
D. Goyeneche, Z. Raissi, S. Di Martino, K. Życzkowski, ”Entanglement and quantum combinatorial designs”, Phys. Rev. A 97
2018
Later among the works it cites.
A. Burchardt, and Z. Raissi, ”Stochastic local operations with classical communication of absolutely maximally entangled states” Phys. Rev. A 102
2020
Later among the works it cites.
Z. Raissi, ”Modifying method of constructing quantum codes from highly entangled states”, IEEE Access, 8
2020
Later among the works it cites.