Adaptive Integer Linear Programming Model for Optimal Qubit Permutation

dc.contributorUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2021-06-25T10:26:43Z
dc.date.accessioned2022-12-19T22:13:04Z
dc.date.available2021-06-25T10:26:43Z
dc.date.available2022-12-19T22:13:04Z
dc.date.created2021-06-25T10:26:43Z
dc.date.issued2021-01-01
dc.identifierIEEE Design and Test.
dc.identifier2168-2364
dc.identifier2168-2356
dc.identifierhttp://hdl.handle.net/11449/206109
dc.identifier10.1109/MDAT.2021.3069138
dc.identifier2-s2.0-85103245217
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/5386706
dc.description.abstractThe 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.
dc.languageeng
dc.relationIEEE Design and Test
dc.sourceScopus
dc.subjectComputer architecture
dc.subjectIBM quantum processors
dc.subjectInteger Linear Programming
dc.subjectIntegrated circuit modeling
dc.subjectLogic gates
dc.subjectManganese
dc.subjectMathematical model
dc.subjectQuantum circuit
dc.subjectquantum circuits
dc.subjectQubit
dc.subjectreversible circuits
dc.titleAdaptive Integer Linear Programming Model for Optimal Qubit Permutation
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución