Adaptive Integer Linear Programming Model for Optimal Qubit Permutation

Nenhuma Miniatura disponível

Data

2021-01-01

Autores

Orientador

Coorientador

Pós-graduação

Curso de graduação

Título da Revista

ISSN da Revista

Título de Volume

Editor

Tipo

Artigo

Direito de acesso

Resumo

The architecture of most current quantum computers limits the pairs of qubits that can interact. That is, not all possible CNOT gates are directly available and their implementation requires additional gates. Hence the permutation of qubits will have an effect on the circuit complexity. We formulate the permutation problem as an Integer Linear Programming (ILP) problem. The solution of the ILP guarantees the lowest cost permutation for the problem. The results are compared to the previously best-known algorithm showing an improvement of up to 57% in the number of gates.

Descrição

Palavras-chave

Computer architecture, IBM quantum processors, Integer Linear Programming, Integrated circuit modeling, Logic gates, Manganese, Mathematical model, Quantum circuit, quantum circuits, Qubit, reversible circuits

Idioma

Inglês

Como citar

IEEE Design and Test.

URI

http://hdl.handle.net/11449/206109

Itens relacionados

Financiadores

Coleções

Artigos