Bounds in the Projective Unitary Group with Respect to Global Phase Invariant Metric
By: Bhanu Pratap Yadav, Mahdi Bayanifar, Olav Tirkkonen
Potential Business Impact:
Makes quantum computers more reliable and efficient.
We consider a global phase-invariant metric in the projective unitary group PUn, relevant for universal quantum computing. We obtain the volume and measure of small metric ball in PUn and derive the Gilbert-Varshamov and Hamming bounds in PUn. In addition, we provide upper and lower bounds for the kissing radius of the codebooks in PUn as a function of the minimum distance. Using the lower bound of the kissing radius, we find a tight Hamming bound. Also, we establish bounds on the distortion-rate function for quantizing a source uniformly distributed over PUn. As example codebooks in PUn, we consider the projective Pauli and Clifford groups, as well as the projective group of diagonal gates in the Clifford hierarchy, and find their minimum distances. For any code in PUn with given cardinality we provide a lower bound of covering radius. Also, we provide expected value of the covering radius of randomly distributed points on PUn, when cardinality of code is sufficiently large. We discuss codebooks at various stages of the projective Clifford + T and projective Clifford + S constructions in PU2, and obtain their minimum distance, distortion, and covering radius. Finally, we verify the analytical results by simulation.
Similar Papers
Algorithmic Information Bounds for Distances and Orthogonal Projections
Computational Complexity
Makes computer data keep more information.
Stark-Coleman Invariants and Quantum Lower Bounds: An Integrated Framework for Real Quadratic Fields
Number Theory
Classifies number groups, making hard math problems easier.
The covering radius of Butson Hadamard codes for the homogeneous metric
Cryptography and Security
Finds better ways to send secret messages.