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

Lecture notes in computer science

Constructions of Mutually Unbiased Bases

Andreas Klappenecker, Martin Rötteler

Published Jan 1, 2004• 288 citations
Publisher
DOI
10.1007/978-3-540-24633-6_10

Related papers

Constructions of Approximately Mutually Unbiased Bases

Igor E. Shparlinski, Arne Winterhof

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

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

S. Chaturvedi

Pramana•Aug 1, 2002•34 citations

Mutually unbiased bases

TR Thijs Timmerman

Two orthogonal bases A and B of an n-dimensional Hilbert space are called Mutually Unbiased if for ai ∈ A and bj ∈ B holds: |(ai, bj)| = 1 n for each i, j ∈ {1, . . . , n}. A set B of Mutually Unbiased Bases (MUBs) is a set of bases such that each two distinct bases Bi, Bj ∈ B are mutually unbiased. The bounds on the number of MUBs, dependent on the dimension n, will be derived. Also a construction for MUBs in Cp, with p prime, will be showed. Finally, some open problems will be discussed.

•Jan 1, 2009•0 citations

Quantum key distribution for composite dimensional finite systems

Mohamed Ahmed Shalaby, Yasser Kamal

The application of quantum mechanics contributes to the field of cryptography with very important advantage as it offers a mechanism for detecting the eavesdropper. The pioneering work of quantum key distribution uses mutually unbiased bases (MUBs) to prepare and measure qubits (or qudits). Weak mutually unbiased bases (WMUBs) have weaker properties than MUBs properties, however, unlike MUBs, a complete set of WMUBs can be constructed for systems with composite dimensions. In this paper, we study the use of weak mutually unbiased bases (WMUBs) in quantum key distribution for composite dimensional finite systems. We prove that the security analysis of using a complete set of WMUBs to prepare and measure the quantum states in the generalized BB84 protocol, gives better results than using the maximum number of MUBs that can be constructed, when they are analyzed against the intercept and resend attack.

AIP conference proceedings•Jan 1, 2017•1 citation

Mutually Unbiased Bases

M. Kibler

Elsevier eBooks•Jan 1, 2017•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].
Two orthogonal bases A and B of an n-dimensional Hilbert space are called Mutually Unbiased if for ai ∈ A and bj ∈ B holds: |(ai, bj)| = 1 n for each i, j ∈ {1, . . . , n}. A set B of Mutually Unbiased Bases (MUBs) is a set of bases such that each two distinct bases Bi, Bj ∈ B are mutually unbiased. The bounds on the number of MUBs, dependent on the dimension n, will be derived. Also a construction for MUBs in Cp, with p prime, will be showed. Finally, some open problems will be discussed.
The application of quantum mechanics contributes to the field of cryptography with very important advantage as it offers a mechanism for detecting the eavesdropper. The pioneering work of quantum key distribution uses mutually unbiased bases (MUBs) to prepare and measure qubits (or qudits). Weak mutually unbiased bases (WMUBs) have weaker properties than MUBs properties, however, unlike MUBs, a complete set of WMUBs can be constructed for systems with composite dimensions. In this paper, we study the use of weak mutually unbiased bases (WMUBs) in quantum key distribution for composite dimensional finite systems. We prove that the security analysis of using a complete set of WMUBs to prepare and measure the quantum states in the generalized BB84 protocol, gives better results than using the maximum number of MUBs that can be constructed, when they are analyzed against the intercept and resend attack.