581 citations · 1.6k across the 27 of their papers we have counts for
12 papers · 1 filter
A Proof of the Security of Quantum Key Distribution
Eli Biham, Michel Boyer, P. Oscar Boykin +2
We prove the security of theoretical quantum key distribution against the most general attacks which can be performed on the channel, by an eavesdropper who has unlimited computati…
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…
Information vs. Disturbance in Dimension D
P. Oscar Boykin, Vwani P. Roychowdhury
We show that for Eve to get information in one basis about a state, she must cause errors in all bases that are mutually unbiased to that basis. Our result holds in any dimension.…
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…
Information Security and Quantum Mechanics: Security of Quantum Protocols
P. Oscar Boykin
The problem of security of quantum key protocols is examined. In addition to the distribution of classical keys, the problem of encrypting quantum data and the structure of the ope…
Algorithmic Cooling and Scalable NMR Quantum Computers
P. Oscar Boykin, Tal Mor, Vwani Roychowdhury +2
We present here algorithmic cooling (via polarization-heat-bath)- a powerful method for obtaining a large number of highly polarized spins in liquid nuclear-spin systems at finite…
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…
Algorithms on Ensemble Quantum Computers
P. Oscar Boykin, Tal Mor, Vwani Roychowdhury +1
In ensemble (or bulk) quantum computation, measurements of qubits in an individual computer cannot be performed. Instead, only expectation values can be measured. As a result of th…
On Universal and Fault-Tolerant Quantum Computing
P. Oscar Boykin, Tal Mor, Matthew Pulver +2
A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environm…