Compiling Quantum Circuits using the Palindrome Transform

Simple item page
dc.creatorAho, Alfred V.
dc.creatorSvore, Krysta M.
dc.date2003-11-03
dc.date.accessioned2026-07-07T06:08:14Z
dc.date.available2026-07-07T06:08:14Z
dc.descriptionThe design and optimization of quantum circuits is central to quantum computation. This paper presents new algorithms for compiling arbitrary 2^n x 2^n unitary matrices into efficient circuits of (n-1)-controlled single-qubit and (n-1)-controlled-NOT gates. We first present a general algebraic optimization technique, which we call the Palindrome Transform, that can be used to minimize the number of self-inverting gates in quantum circuits consisting of concatenations of palindromic subcircuits. For a fixed column ordering of two-level decomposition, we then give an numerative algorithm for minimal (n-1)-controlled-NOT circuit construction, which we call the Palindromic Optimization Algorithm. Our work dramatically reduces the number of gates generated by the conventional two-level decomposition method for constructing quantum circuits of (n-1)-controlled single-qubit and (n-1)-controlled-NOT gates.
dc.description17 pages, LaTex
dc.identifierhttps://arxiv.org/abs/quant-ph/0311008
dc.identifierhttp://arxiv.org/abs/quant-ph/0311008
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/91556
dc.subjectQuantum Physics
dc.titleCompiling Quantum Circuits using the Palindrome Transform
dc.typetext

Files

Collections

arXiv