Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Journal of Systems Science and Complexity

Approximately Mutually Unbiased Bases by Frobenius Rings

Naparat Sripaisan, Yotsanan Meemark

Published Aug 1, 2020• 2 citations
Publisher
DOI
10.1007/s11424-020-8251-8

Related papers

Constructions on Approximately Mutually Unbiased Bases by Galois Rings

Li, Jin, Feng +1 more

系统科学与复杂性:英文版•Jan 1, 2015•1 citation

Constructions on approximately mutually unbiased bases by Galois rings

Jin Li, Keqin Feng

Journal of Systems Science and Complexity•Jun 1, 2015•7 citations

Constructions of Approximately Mutually Unbiased Bases

Igor E. Shparlinski, Arne Winterhof

Lecture notes in computer science•Jan 1, 2006•25 citations

On approximate real mutually unbiased bases in square dimension

Ajeet Kumar, Subhamoy Maitra, Chandra Sekhar Mukherjee

Cryptography and Communications•Jan 11, 2021•4 citations

A Heuristic Framework to Search for Approximate Mutually Unbiased Bases

Sreejit Chaudhury, Ajeet Kumar, Subhamoy Maitra +2 more

Lecture notes in computer science•Jan 1, 2022•1 citation

New Constructions of Approximately Mutually Unbiased Bases by Character Sums over Galois Rings

You Gao, Ming-Yue XIE, Gang Wang +1 more

Mutually unbiased bases (MUBs) are widely used in quantum information processing and play an important role in quantum cryptography, quantum state tomography and communications. It's difficult to construct MUBs and remains unknown whether complete MUBs exist for any non prime power. Therefore, researchers have proposed the solution to construct approximately mutually unbiased bases (AMUBs) by weakening the inner product conditions. This paper constructs q AMUBs of ℂq, (q+1) AMUBs of ℂq-1 and q AMUBs of ℂq-1 by using character sums over Galois rings and finite fields, where q is a power of a prime. The first construction of q AMUBs of ℂq is new which illustrates K AMUBs of ℂK can be achieved. The second and third constructions in this paper include the partial results about AMUBs constructed by W. Wang et al. in [9].

IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences•Feb 6, 2024•0 citations
Mutually unbiased bases (MUBs) are widely used in quantum information processing and play an important role in quantum cryptography, quantum state tomography and communications. It's difficult to construct MUBs and remains unknown whether complete MUBs exist for any non prime power. Therefore, researchers have proposed the solution to construct approximately mutually unbiased bases (AMUBs) by weakening the inner product conditions. This paper constructs q AMUBs of ℂq, (q+1) AMUBs of ℂq-1 and q AMUBs of ℂq-1 by using character sums over Galois rings and finite fields, where q is a power of a prime. The first construction of q AMUBs of ℂq is new which illustrates K AMUBs of ℂK can be achieved. The second and third constructions in this paper include the partial results about AMUBs constructed by W. Wang et al. in [9].