000256967 001__ 256967
000256967 005__ 20180919181840.0
000256967 0247_ $$a10.1007/978-3-319-99498-7_12$$2doi
000256967 020__ $$a978-3-319-99498
000256967 037__ $$aCONF
000256967 245__ $$aSAT-based {CNOT, T} Quantum Circuit Synthesis
000256967 260__ $$c2018
000256967 269__ $$a2018
000256967 336__ $$aConference Papers
000256967 520__ $$aThe prospective of practical quantum computers has lead researchers to investigate automatic tools to program them. A quantum program is modeled as a Clifford+T quantum circuit that needs to be optimized in order to comply with quantum technology constraints. Most of the optimization algorithms aim at reducing the number of T gates. Nevertheless, a secondary optimization objective should be to minimize the number of two-qubit operations (the CNOT gates) as they show lower fidelity and higher error rate when compared to single-qubit operations. We have developed an exact SAT-based algorithm for quantum circuit rewriting that aims at reducing CNOT gates without increasing the number of T gates. Our algorithm finds the minimum {CNOT, T} circuit for a given phase polynomial description of a unitary transformation. Experiments confirm a reduction of CNOT in T-optimized quantum circuits. We synthesize quantum circuits for all single-target gates whose control functions are one of the representatives of the 48 spectral equivalence classes of all 5-input Boolean functions. Our experiments show an average CNOT reduction of 26.84%.
000256967 700__ $$0250813$$aMeuli, Giulia
000256967 700__ $$0249604$$aSoeken, Mathias
000256967 700__ $$0240269$$aDe Micheli, Giovanni
000256967 7112_ $$aRC
000256967 8560_ $$fgiulia.meuli@epfl.ch
000256967 909C0 $$xU11140$$pLSI1$$mchristina.govoni@epfl.ch$$mcarole.burget@epfl.ch$$0252283
000256967 909CO $$ooai:infoscience.epfl.ch:256967$$pIC$$pSTI$$pconf
000256967 960__ $$agiulia.meuli@epfl.ch
000256967 961__ $$anoemi.cobolet@epfl.ch
000256967 973__ $$aEPFL$$rREVIEWED
000256967 980__ $$aCONF
000256967 981__ $$aoverwrite