PBP. Oscar Boykin

P. Oscar Boykin

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


P. Oscar Boykin has a total of 10 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • A Proof of the Security of Quantum Key Distribution

    by Eli Biham, Michel Boyer, P. Oscar Boykin, Tal Mor, Vwani Roychowdhury


  • Open Access

    A Proof of the Security of Quantum Key Distribution

    by Eli Biham, Michel Boyer, P. Oscar Boykin, Tal Mor, Vwani Roychowdhury

    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 computation abilities, and the full power allowed by the rules of classical and quantum physics. A key created that way can then be used to transmit secure messages such that their security is also unaffected in the future.


  • Optimal encryption of quantum bits

    by P. Oscar Boykin, Vwani Roychowdhury

    We show that 2n random classical bits are both necessary and sufficient for encrypting any unknown state of n quantum bits in an informationally secure manner. We also characterize the complete set of optimal protocols in terms of a set of unitary operations that comprise an orthonormal basis in a canonical inner product space. Moreover, a connection is made between quantum encryption and quantum teleportation that allows for a different proof of optimality of teleportation.


  • Open Access

    A new proof for the existence of mutually unbiased bases

    by Somshubhro Bandyopadhyay, P. Oscar Boykin, Vwani Roychowdhury, Farrokh Vatan

    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 unbiased bases for any finite dimension is obtained. Then a constructive proof of the existence of mutually unbiased bases for dimensions which are power of a prime is presented. It is also proved that in any dimension d the number of mutually unbiased bases is at most d+1. An explicit representation of mutually unbiased observables in terms of Pauli matrices are provided for d=2^m.

  • Open Access

    Optimal Encryption of Quantum Bits

    by 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 quantum encryption protocols to quantum data security, our framework allows for generalizations of many classical cryptographic protocols to quantum data. We show that the encrypted state gives no information without the secret classical data, and that 2n random classical bits are the minimum necessary for informationally secure quantum encryption. Moreover, the quantum operations are shown to have a surprising structure in a canonical inner product space. This quantum encryption protocol is a generalization of the classical one time pad concept. A connection is made between quantum encryption and quantum teleportation, and this allows for a new proof of optimality of teleportation.

  • Open Access

    On Universal and Fault-Tolerant Quantum Computing

    by P. Oscar Boykin, Tal Mor, Matthew Pulver, Vwani Roychowdhury, Farrokh Vatan

    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 environment. The new basis consists of two single-qubit gates (Hadamard and ${\sigma_z}^{1/4}$), and one double-qubit gate (Controlled-NOT). Since the set consisting of Controlled-NOT and Hadamard gates is not universal, the new basis achieves universality by including only one additional elementary (in the sense that it does not include angles that are irrational multiples of $\pi$) single-qubit gate, and hence, is potentially the simplest universal basis that one can construct. We also provide an alternative proof of universality for the only other known class of universal and fault-tolerant basis proposed by Shor and by Kitaev.