51 citations · 134 across the 7 of their papers we have counts for
8 papers · 1 filter
Mutually Unbiased Bases and Orthogonal Decompositions of Lie Algebras
P. Oscar Boykin, Meera Sitharam, Pham Huu Tiep +1
We establish a connection between the problem of constructing maximal collections of mutually unbiased bases (MUBs) and an open problem in the theory of Lie algebras. More precisel…
Real Mutually Unbiased Bases
P. Oscar Boykin, Meera Sitharam, Mohamad Tarifi +1
We tabulate bounds on the optimal number of mutually unbiased bases in R^d. For most dimensions d, it can be shown with relatively simple methods that either there are no real orth…
Threshold Error Penalty for Fault Tolerant Computation with Nearest Neighbour Communication
T. Szkopek, P. O. Boykin, H. Fan +5
The error threshold for fault tolerant quantum computation with concatenated encoding of qubits is penalized by internal communication overhead. Many quantum computation proposals…
A new proof for the existence of mutually unbiased bases
Somshubhro Bandyopadhyay, P. Oscar Boykin, Vwani Roychowdhury +1
We develop a strong connection between maximally commuting bases of orthogonal unitary matrices and mutually unbiased bases. A necessary condition of the existence of mutually unbi…
Optimal Encryption of Quantum Bits
P. Oscar Boykin, Vwani Roychowdhury
We characterize the complete set of protocols that may be used to securely encrypt n quantum bits using secret and random classical bits. In addition to the application of such qua…
A Proof of the Security of Quantum Key Distribution
Eli Biham, Michel Boyer, P. Oscar Boykin +2
We prove the security of quantum key distribution against the most general attacks which can be performed on the channel, by an eavesdropper who has unlimited computation abilities…