Optimal Realizations of Controlled Unitary Gates

Simple item page
dc.creatorSong, Guang
dc.creatorKlappenecker, Andreas
dc.date2002-07-27
dc.date.accessioned2026-07-07T06:04:40Z
dc.date.available2026-07-07T06:04:40Z
dc.descriptionThe controlled-not gate and the single qubit gates are considered elementary gates in quantum computing. It is natural to ask how many such elementary gates are needed to implement more elaborate gates or circuits. Recall that a controlled-U gate can be realized with two controlled-not gates and four single qubit gates. We prove that this implementation is optimal if and only if the matrix U satisfies the conditions tr U != 0, tr UX != 0, and det U != 1. We also derive optimal implementations in the non-generic cases.
dc.description32 figures, 22 pages
dc.identifierhttps://arxiv.org/abs/quant-ph/0207157
dc.identifierhttp://arxiv.org/abs/quant-ph/0207157
dc.identifierJournal of Quantum Information and Computation, 3(2), pages 139-155, 2003
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/90380
dc.subjectQuantum Physics
dc.titleOptimal Realizations of Controlled Unitary Gates
dc.typetext

Files

Collections

arXiv