References
- Ambainis, A., Nayak, A., Ta-Shma, A, Vazirani, U. (2002). Dense quantum coding and quantum finite automata. J. ACM 49(4): 496–511. doi:10.1145/581771.581773
- Ambainis, A., Leung, D., Mancinska, L, Ozols, M. (2008). Quantum Random Access Codes with Shared Randomness. https://arxiv.org/abs/0810.2937.
- Balu, R., Koprowski, P. J., Okoudjou, K. A., Park, J. S, Siopsis, G. (2019). Equiangular quantum key distribution in more than two dimensionsm. J. Phys. A: Math. Theor. 52(7): 75202. arXiv:1810.05161.
- Ballinger, B., Blekherman, G., Cohn, H., Giansiracusa, N., Kelly, E, Achill, S. (2009). Experimental study of energy-minimizing point configurations on spheres. Exp. Math. 18(3), 257–283. https://arxiv.org/abs/math/0611451.
- Benedetto, J, Fickus, M. (2003). Finite normalized frames. Adv. Comput. Math. 18(2/4): 357–385. doi:10.1023/A:1021323312367
- Cohn, H. (2017). A conceptual breakthrough in sphere packing. Notices Amer. Math. Soc. 64(02): 102–115. doi:10.1090/noti1474
- Cohn, H, Kumar, A. (2006). Universally optimal distribution of points on spheres. J. Am. Math. Soc. 20(1): 99–148. doi:10.1090/S0894-0347-06-00546-7
- Cohn, H., Kumar, A, Minton, G. (2016). Optimal simplices and codes in projective spaces. Geom. Topol. 20(3): 1289–1357. doi:10.2140/gt.2016.20.1289
- Fickus, M., Mixon, D. G, Tremain, J. C. (2012). Steiner equiangular tight frames. Linear Algebra Appl. 436(5): 1014–1027. doi:10.1016/j.laa.2011.06.027
- Hayashi, M., Iwama, K., Nishimura, H., Raymond, R, Yamashita, S. (2006). (4,1)-quantum random access coding does not exist. New J. Phys. 8(8): 129–129.
- Okoudjou, K., Chen, X., Goodman, E., Ehler, M, Gonzales, V. (2018). AMS Special Session on Recent Advances in Packing. Columbus, USA.
- Renes, J. M. (2007). Equiangular tight frames from Paley tournaments. Linear Algebra Appl. 426(2–3): 497–501. doi:10.1016/j.laa.2007.05.029
- Strohmer, T, Heath, R. W. (2003). Grassmannian frames with applications to coding and communication. Appl. Comput. Harmon. Anal. 14(3): 257–275. doi:10.1016/S1063-5203(03)00023-X