2005/05/10 by Arpita Maitra, Preeti Parashar, Maitra, Arpita +1 · 2 citations
Computer Science · Engineering · Physics and Astronomy · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #graph theory and CDMA systems #quant-ph
paper · pdf · doi:10.48550/arxiv.quant-ph/0505068
arxiv created 2005/05/10 · arxiv updated 2009/12/01
We obtain the most general ensemble of qubits, for which it is possible to design a universal Hadamard gate. These states when geometrically represented on the Bloch sphere, give a new trajectory. We further consider some Hadamard `type' of operations and find ensembles of states for which such transformations hold. Unequal superposition of a qubit and its orthogonal complement is also investigated.