Quantum Compiling with Approximation of Multiplexors

Simple item page
dc.creatorTucci, Robert R.
dc.date2004-12-09
dc.date2005-02-09
dc.date.accessioned2026-07-07T06:11:44Z
dc.date.available2026-07-07T06:11:44Z
dc.descriptionA quantum compiling algorithm is an algorithm for decomposing ("compiling") an arbitrary unitary matrix into a sequence of elementary operations (SEO). Suppose $U_{in}$ is an $\nb$-bit unstructured unitary matrix (a unitary matrix with no special symmetries) that we wish to compile. For $\nb>10$, expressing $U_{in}$ as a SEO requires more than a million CNOTs. This calls for a method for finding a unitary matrix that: (1)approximates $U_{in}$ well, and (2) is expressible with fewer CNOTs than $U_{in}$. The purpose of this paper is to propose one such approximation method. Various quantum compiling algorithms have been proposed in the literature that decompose an arbitrary unitary matrix into a sequence of U(2)-multiplexors, each of which is then decomposed into a SEO. Our strategy for approximating $U_{in}$ is to approximate these intermediate U(2)-multiplexors. In this paper, we will show how one can approximate a U(2)-multiplexor by another U(2)-multiplexor that is expressible with fewer CNOTs.
dc.descriptionVer1:18 pages (files: 1 .tex, 1 .sty, 7 .eps); Ver2:26 pages (files: 1 .tex, 1 .sty, 7 .eps, 7 .m) Ver2 = Ver1 + new material, including 7 Octave/Matlab m-files
dc.identifierhttps://arxiv.org/abs/quant-ph/0412072
dc.identifierhttp://arxiv.org/abs/quant-ph/0412072
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/92574
dc.subjectQuantum Physics
dc.titleQuantum Compiling with Approximation of Multiplexors
dc.typetext

Files

Collections

arXiv