Cyclic Mutually Unbiased Bases and Quantum Public-Key Encryption
Pith reviewed 2026-05-25 02:21 UTC · model grok-4.3
The pith
A recursive construction produces cyclic mutually unbiased bases in Fermat number dimensions and connects them to Wiedemann's conjecture for systems with more than 2048 qubits.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
The author gives a recursive construction for cyclic mutually unbiased bases in Fermat number dimensions, derived from group structures of entanglement, and shows its relation to Wiedemann's conjecture for quantum systems with more than 2048 qubits, while also examining the implications for a quantum public-key encryption scheme.
What carries the argument
The recursive construction using group structures from entanglement configurations in different dimensions.
If this is right
- The construction allows cyclic MUBs to be built for increasingly large Fermat dimensions.
- This supports the existence of such bases in systems with thousands of qubits as per the conjecture.
- The quantum public-key encryption scheme can be implemented using these bases in large dimensions.
- Entanglement structures enable the recursive extension without new constraints.
Where Pith is reading between the lines
- If the construction holds, it could enable scalable quantum cryptography protocols in high dimensions.
- The link to Wiedemann's conjecture might offer a path to prove existence across all such dimensions.
- Similar recursive approaches could apply to other quantum basis constructions.
Load-bearing premise
The group structures for the entanglement allow the recursive construction to extend without contradiction or additional constraints to dimensions beyond current computational reach.
What would settle it
A failure of the recursive step to produce valid mutually unbiased bases in the next Fermat number dimension after a known one, such as beyond dimension 257.
read the original abstract
The thesis is mainly about the construction and implementation of cyclic mutually unbiased bases, dealing with different entanglement structures by discussing the related group structures. A recursive construction for Fermat number dimensions is given and related to Wiedemann's conjecture for systems with more than 2048 qubits. The second part of the thesis analyses a quantum public-key encryption scheme.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript presents constructions of cyclic mutually unbiased bases (MUBs) by examining group structures associated with different entanglement configurations. It supplies a recursive construction that generates such bases for dimensions that are Fermat numbers and connects the construction to Wiedemann’s conjecture for qubit systems exceeding 2048 qubits. A second part analyzes a quantum public-key encryption scheme that employs these bases.
Significance. A verified recursive construction of cyclic MUBs for Fermat-number dimensions would supply an explicit, inductive route to bases in regimes where direct matrix constructions are infeasible, thereby furnishing concrete objects for testing conjectures about the existence of complete sets of MUBs and for cryptographic protocols that rely on them.
major comments (3)
- [recursive construction section] The recursive step (described in the section on the recursive construction for Fermat-number dimensions) asserts that the chosen group actions on the entanglement structures map the cyclic generator and the unbiasedness condition onto the next larger Fermat dimension. No explicit verification—analytic or computational—is supplied that phase or commutation obstructions are absent once the dimension exceeds the range where explicit matrix representations can be checked.
- [discussion of Wiedemann’s conjecture] The link to Wiedemann’s conjecture for n > 2048 is presented as a direct consequence of the recursion, yet the manuscript does not derive or cite a precise statement of the conjecture nor show how the inductive step would falsify or confirm it.
- [quantum public-key encryption analysis] The security analysis of the quantum public-key encryption scheme (second part) relies on the cyclic MUB property; if the recursive construction contains an unverified preservation step, the cryptographic claim inherits the same gap.
minor comments (2)
- Notation for the group actions and the cyclic generators is introduced without a consolidated table or diagram that would allow the reader to track the inductive step across iterations.
- Several references to prior work on MUBs and entanglement are cited only by author name; full bibliographic details should be supplied.
Simulated Author's Rebuttal
We thank the referee for the careful review and constructive feedback on our manuscript concerning recursive constructions of cyclic MUBs for Fermat dimensions and the associated quantum public-key encryption analysis. We address each major comment below.
read point-by-point responses
-
Referee: The recursive step (described in the section on the recursive construction for Fermat-number dimensions) asserts that the chosen group actions on the entanglement structures map the cyclic generator and the unbiasedness condition onto the next larger Fermat dimension. No explicit verification—analytic or computational—is supplied that phase or commutation obstructions are absent once the dimension exceeds the range where explicit matrix representations can be checked.
Authors: The group actions are constructed to preserve cyclicity and unbiasedness via the algebraic structure of Fermat dimensions and the chosen entanglement configurations. We agree that an explicit inductive verification of the absence of phase and commutation obstructions for dimensions beyond direct computation would strengthen the presentation. In the revised manuscript we will add a short analytic argument establishing preservation of these properties under the recursion. revision: yes
-
Referee: The link to Wiedemann’s conjecture for n > 2048 is presented as a direct consequence of the recursion, yet the manuscript does not derive or cite a precise statement of the conjecture nor show how the inductive step would falsify or confirm it.
Authors: We will insert a precise statement of Wiedemann’s conjecture together with the appropriate citation. The revised text will clarify that the recursion supplies an explicit inductive route for Fermat-number dimensions (corresponding to certain qubit counts >2048) but does not itself constitute a proof or disproof of the conjecture; it merely provides concrete objects whose existence would be consistent with the conjecture if the base cases hold. revision: yes
-
Referee: The security analysis of the quantum public-key encryption scheme (second part) relies on the cyclic MUB property; if the recursive construction contains an unverified preservation step, the cryptographic claim inherits the same gap.
Authors: The security reduction is conditional on the cyclic MUBs satisfying the stated algebraic properties. Once the inductive verification requested in the first comment is added, the cryptographic claims will rest on a fully justified construction. We will also make the conditional nature of the security statement more explicit in the revised version. revision: partial
Circularity Check
No circularity: recursive construction presented without self-referential fitting or load-bearing self-citation
full rationale
The provided abstract and context describe a recursive construction for cyclic MUBs in Fermat-number dimensions tied to an external conjecture (Wiedemann), but contain no equations, no fitted parameters renamed as predictions, and no self-citation chains that reduce the central claim to its own inputs. The reader's note explicitly states no derivations are visible, precluding any quoted reduction. The derivation is therefore treated as self-contained against external benchmarks.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.