Probabilistic implementation of universal Hadamard and Unitary gates

Abstract

We show that the Hadamard and Unitary gates could be implemented by a unitary evolution together with a measurement for any unknown state chosen from a set $A=|{\Psi }_i>,|{\bar{\Psi }}_i>(i=1,2)$ if and only if $|{\Psi }_1>,|{\Psi }_2>,|{\bar{\Psi }}_1>,|{\bar{\Psi }}_2>$ are linearly independent. We also derive the best transformation efficiencies.

9 pages, no figures

References in corpus (11)

• Optimal cloning of coherent states with a linear amplifier and beam splitters
• Quantum cloning machines for equatorial qubits
• Storing quantum dynamics in quantum states: stochastic programmable gate for U(1) operations
• Quantum multimeters: A programmable state discriminator
• Probabilistic implementation of universal quantum processors
• General impossible operations in quantum information
• Implementation of quantum maps by programmable quantum processors
• Quantum cloning of orthogonal qubits
• Improving performance of probabilistic programmable quantum processors
• Bounds for state-dependent quantum cloning
• Scheme for the implementation of optimal cloning of two pairs of orthogonal states

Cited by in corpus (2)

• Photon exchange and correlations transfer in atom-atom entanglement dynamics
• Some Possibility and Impossibility Results related to Discrete Fourier type transforms in Quantum Information