Abstract
Mutually Unbiased Bases (MUBs) have varied applications in quantum information. However, obtaining the optimal number of MUBs is a challenging problem for different dimensions. The problem has received serious attention for several decades and still number of questions are unsolved in this domain. As optimal number of MUBs may not always be available for different composite dimensions, Approximate MUBs (AMUBs) received serious attention in recent time. In this paper, we present a heuristic to obtain AMUBs with significantly good parameters. Given a non-prime dimension d, we note the closest prime \(d' > d\) and form \(d'+1\) MUBs through the existing methods. Then our proposed idea is (i) to apply basis reduction techniques (that are well studied in Machine Learning literature) in obtaining the initial solutions, and finally (ii) to exploit the steepest ascent kind of search to achieve further improved results. The efficacy of our technique is shown through construction of AMUBs in dimensions \(d = 6, 10, 46\) from \(d' = 7, 11\) and 47 respectively. Our technique provides a novel framework in construction of AMUBs that can be refined in a case-specific manner. From a more generic view, this approach considers approximately solving a challenging (where efficient deterministic algorithms are not known) mathematical problem in discrete domain through state-of-the-art heuristic ideas.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aguilar, E.A., Borkala, J.J., Mironowicz, P., Pawlowski, M.: Connections between mutually unbiased bases and quantum random access codes. Phys. Rev. Lett. 121, 050501 (2018)
Bengtsson, I., Bruzda, W., Ericsson, A., Larsson, J., Tadej, W., Źyczkowski, K.: Mutually unbiased bases and Hadamard matrices of order six. J. Math. Phys. 48, 052106 (2007). https://arxiv.org/abs/quant-ph/0610161
Bennett, C.H., Brassard, G.: Quantum cryptography: public key distribution and coin tossing. In: Proceedings of IEEE International Conference on Computers, Systems and Signal Processing, Bangalore, pp. 175–179 (1984)
Colomer, M.P., Mortimer, L., Frérot, I., Farkas, M., Acín, A.: Three numerical approaches to find mutually unbiased bases using bell inequalities. arXiv preprint arXiv:2203.09429 (2022)
Dubner, H.: Large Sophie Germain primes. Math Comput. 65(213), 393–397. https://doi.org/10.1090/S0025-5718-96-00670-9
Durt, T., Englert, B., Bengtsson, I., Źyczkowski, K.: On mutually unbiased bases. Int. J. Quantum Inform. 8, 535–640 (2010). https://doi.org/10.1142/S0219749910006502
Eckart, C., Young, G.: A principal axis transformation for non-Hermitian matrices. Bull. Amer. Math. Soc. 45(2), 118–121 (1939)
Fodor, I.K.: A survey of dimension reduction techniques. Technical report, Lawrence Livermore National Lab., CA, USA (2002)
Gibbons, K.S., Hoffman, M.J., Wootters, W.K.: Discrete phase space based on finite fields. Phys. Rev. A 70, 1–23 (2004). https://link.aps.org/doi/10.1103/PhysRevA.70.062101
Kalman, D.: A singularly valuable decomposition: the SVD of a matrix. Coll. Math. J. 27(1), 2–23 (1996)
Kumar, A., Maitra, S., Mukherjee, C.S.: On approximate real mutually unbiased bases in square dimension. Cryptogr. Commun. 13(2), 321–329 (2021). https://doi.org/10.1007/s12095-020-00468-6
Kumar, A., Maitra, S.: Resolvable block designs in construction of approximate real MUBs that are sparse. Cryptogr. Commun. (2021). https://doi.org/10.1007/s12095-021-00537-4
Kumar A., Maitra, S., Roy, S.: Almost perfect real MUBs that are sparse, November 2021. Preprint
Raynal, P., Lu, X., Englert, B.: Mutually unbiased bases in six dimensions: the four most distant bases. Phys. Rev. 83, 062303 (2011). https://link.aps.org/doi/10.1103/PhysRevA.83.062303
Sadek, R.A.: SVD based image processing applications: state of the art, contributions and research challenges. IJACSA - Int. J. Adv. Comput. Sci. Appl. (2012). https://arxiv.org/ftp/arxiv/papers/1211/1211.7102.pdf
Shparlinski, I.E., Winterhof, A.: Constructions of approximately mutually unbiased bases. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol. 3887, pp. 793–799. Springer, Heidelberg (2006). https://doi.org/10.1007/11682462_72
Stewart, G.W.: On the early history of the singular value decomposition. SIAM Rev. 35, 551–566 (1993). https://www.jstor.org/stable/2132388
Wootters, W.K., Fields, B.D.: Optimal state-determination by mutually unbiased measurements. Ann. Phys. 191(2), 363–381 (1989). https://doi.org/10.1016/0003-4916(89)90322-9
GitHub Repository for Codes - https://bit.ly/3KPS9jk
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 Springer Nature Switzerland AG
About this paper
Cite this paper
Chaudhury, S., Kumar, A., Maitra, S., Roy, S., Sen Gupta, S. (2022). A Heuristic Framework to Search for Approximate Mutually Unbiased Bases. In: Dolev, S., Katz, J., Meisels, A. (eds) Cyber Security, Cryptology, and Machine Learning. CSCML 2022. Lecture Notes in Computer Science, vol 13301. Springer, Cham. https://doi.org/10.1007/978-3-031-07689-3_16
Download citation
DOI: https://doi.org/10.1007/978-3-031-07689-3_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-07688-6
Online ISBN: 978-3-031-07689-3
eBook Packages: Computer ScienceComputer Science (R0)