Finding optimal qubit permutations for IBM's quantum computer architectures

Registro completo de metadados
MetadadosDescriçãoIdioma
Autor(es): dc.contributorUniversidade Estadual Paulista (Unesp)-
Autor(es): dc.contributorUniversity of New Brunswick-
Autor(es): dc.creatorDe Almeida, Alexandre A.A. [UNESP]-
Autor(es): dc.creatorDueck, Gerhard W.-
Autor(es): dc.creatorDa Silva, Alexandre C.R. [UNESP]-
Data de aceite: dc.date.accessioned2022-02-22T00:23:17Z-
Data de disponibilização: dc.date.available2022-02-22T00:23:17Z-
Data de envio: dc.date.issued2020-12-11-
Data de envio: dc.date.issued2020-12-11-
Data de envio: dc.date.issued2019-08-26-
Fonte completa do material: dc.identifierhttp://dx.doi.org/10.1145/3338852.3339829-
Fonte completa do material: dc.identifierhttp://hdl.handle.net/11449/198019-
Fonte: dc.identifier.urihttp://educapes.capes.gov.br/handle/11449/198019-
Descrição: dc.descriptionIBM offers quantum processors for Clifford+T circuits. The only restriction is that not all CNOT gates are implemented and must be substituted with alternate sequences of gates. Each CNOT has its own mapping with a respective cost. However, by permuting the qubits, the number of CNOT that need mappings can be reduced. The problem is to find a good permutation without an exhaustive search. In this paperwe propose a solution for this problem. The permutation problem is formulated as an Integer Linear Programming (ILP) problem. Solving the ILP problem, the lowest cost permutation for the CNOT mappings is guaranteed. To test and validated the proposed formulation, quantum architectures with 5 and 16 qubits were used. The ILP formulation along with mapping techniques found circuits with up to 64% fewer gates than other approaches.-
Descrição: dc.descriptionSchool of Engineering São Paulo State University (Unesp)-
Descrição: dc.descriptionFaculty of Computer Science University of New Brunswick-
Descrição: dc.descriptionSchool of Engineering São Paulo State University (Unesp)-
Idioma: dc.languageen-
Relação: dc.relationProceedings - 32nd Symposium on Integrated Circuits and Systems Design, SBCCI 2019-
???dc.source???: dc.sourceScopus-
Palavras-chave: dc.subjectIBM quantum processors-
Palavras-chave: dc.subjectInteger Linear Programming-
Palavras-chave: dc.subjectQuantum circuit-
Título: dc.titleFinding optimal qubit permutations for IBM's quantum computer architectures-
Aparece nas coleções:Repositório Institucional - Unesp

Não existem arquivos associados a este item.