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 = | i > ,| i >(i = 1,2) if and only if | 1 > ,| 2 > ,| 1 > ,| 2 > are linearly independent. We also derive the best transformation efficiencies.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…