arXiv subjects

Vwani Roychowdhury

Publications and source records attributed to Vwani Roychowdhury.

62 records · Page 4Linked to original sources

arXiv2001

A new proof for the existence of mutually unbiased bases

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.

quant-ph↗

arXiv2001

Supercatalysis

We show that entanglement-assisted transformations of bipartite entangled states can be more efficient than catalysis [D. Jonathan and M. B. Plenio, Phys. Rev. Lett. 83, 3566 (1999)}, i.e., given two incomparable bipartite states not only can the transformation be enabled by performing collective operations with an auxiliary entangled state, but the entanglement of the auxiliary state itself can be enhanced. We refer to this phenomenon as supercatalysis. We provide results on the properties of supercatalysis and its relationship with catalysis. In particular, we obtain a useful necessary and sufficient condition for catalysis, provide several sufficient conditions for supercatalysis and study the extent to which entanglement of the auxiliary state can be enhanced via supercatalysis.

quant-ph↗

arXiv2001

Algorithmic Cooling and Scalable NMR Quantum Computers

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 temperature. Given that spin-half states represent (quantum) bits, algorithmic cooling cleans dirty bits beyond the Shannon's bound on data compression, by employing a set of rapidly thermal-relaxing bits. Such auxiliary bits could be implemented using spins that rapidly get into thermal equilibrium with the environment, e.g., electron spins. Cooling spins to a very low temperature without cooling the environment could lead to a breakthrough in nuclear magnetic resonance experiments, and our ``spin-refrigerating'' method suggests that this is possible. The scaling of NMR ensemble computers is probably the main obstacle to building useful quantum computing devices, and our spin-refrigerating method suggests that this problem can be resolved.

quant-ph↗

arXiv2000

Optimal Encryption of Quantum Bits

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.

quant-ph↗

arXiv1999

A Proof of the Security of Quantum Key Distribution

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, 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 in a way that their security is also unaffected in the future.

quant-ph↗

arXiv1999

Algorithms on Ensemble Quantum Computers

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 this limitation on the model of computation, various important algorithms cannot be processed directly on such computers, and must be modified. We provide modifications of various existing protocols, including algorithms for universal fault--tolerant computation, Shor's factorization algorithm (which can be extended to any algorithm computing an NP function), and some search algorithms to enable processing them on ensemble quantum computers.

quant-ph↗

arXiv1999

On Universal and Fault-Tolerant Quantum Computing

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 ${σ_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 $π$) 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.

quant-ph↗

arXiv1999

Electron Spin Resonance Transistors for Quantum Computing in Silicon-Germanium Heterostructures

We apply the full power of modern electronic band structure engineering and epitaxial heterostructures to design a transistor that can sense and control a single donor electron spin. Spin resonance transistors may form the technological basis for quantum information processing. One and two qubit operations are performed by applying a gate bias. The bias electric field pulls the electron wave function away from the dopant ion into layers of different alloy composition. Owing to the variation of the g-factor (Si:g=1.995, Ge:g=1.563), this displacement changes the spin Zeeman energy, allowing single-qubit operations. By displacing the electron even further, the overlap with neighboring qubits is affected, which allows two-qubit operations. Certain Silicon-Germanium alloys allow a qubit spacing as large as 200 nm, which is well within the capabilities of current lithographic techniques. We discuss manufacturing limitations and issues regarding scaling up to a large size computer.

quant-ph↗