51 citations · 122 across the 10 of their papers we have counts for
10 papers · 1 filter
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…
Algorithmic Cooling of Spins: A Practicable Method for Increasing Polarization
Jose M. Fernandez, Seth Lloyd, Tal Mor +1
An efficient technique to generate ensembles of spins that are highly polarized by external magnetic fields is the Holy Grail in Nuclear Magnetic Resonance (NMR) spectroscopy. Sinc…
Quantum Formulas: a Lower Bound and Simulation
Vwani P. Roychowdhury, Farrokh Vatan
We show that Nechiporuk's method for proving lower bounds for Boolean formulas can be extended to the quantum case. This leads to an lower bound for quantum for…
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…