Efficient Realizations of CNOT gates in IBM's Quantum Computers

dc.contributorUniversidade Estadual Paulista (UNESP)
dc.contributorUniversity of New Brunswick
dc.date.accessioned2022-04-29T08:28:04Z
dc.date.accessioned2022-12-20T02:41:58Z
dc.date.available2022-04-29T08:28:04Z
dc.date.available2022-12-20T02:41:58Z
dc.date.created2022-04-29T08:28:04Z
dc.date.issued2018-07-02
dc.identifierProceedings of the 2018 8th International Symposium on Embedded Computing and System Design, ISED 2018, p. 58-62.
dc.identifierhttp://hdl.handle.net/11449/228683
dc.identifier10.1109/ISED.2018.8704098
dc.identifier2-s2.0-85065963720
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/5408818
dc.description.abstractIBM's quantum computers implement gates from Clifford +T gate library. All single qubit gates are implemented, but only a subset of the possible CNOT are provided. It is well known that the functionally of the missing gates can be achieved by a sequence of gates. The sequence of gates is based on SWAP gates. Up to seven elementary gates are required to implement a SWAP gate. In this paper we show how the same effect can be achieved with fewer gates. To show the potential of the proposed transformations, an example is presented where a reduction of 44% in the gate count and a 26% reduction in the number of levels for IBM's QX5 computer is achieved. An algorithm that is considered state of the art, is used for the comparison.
dc.languageeng
dc.relationProceedings of the 2018 8th International Symposium on Embedded Computing and System Design, ISED 2018
dc.sourceScopus
dc.titleEfficient Realizations of CNOT gates in IBM's Quantum Computers
dc.typeActas de congresos


Este ítem pertenece a la siguiente institución