Cyclic Mutually Unbiased Bases and Quantum Public-Key Encryption
Ulrich Seyfarth
TL;DR
This paper explores the construction of cyclic mutually unbiased bases with various entanglement structures, provides a recursive method for Fermat number dimensions, and analyzes a quantum public-key encryption scheme.
Contribution
It introduces a recursive construction for cyclic mutually unbiased bases in Fermat number dimensions and examines their group structures and entanglement properties.
Findings
Recursive construction for Fermat number dimensions
Relation to Wiedemann's conjecture for large systems
Analysis of a quantum public-key encryption scheme
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Computability, Logic, AI Algorithms