Quantum circuit optimization via local qubit reordering by quantum annealing
Mapping quantum circuits to the nearest-neighbor topology architecture requires additional gates. In this paper, we propose a hybrid approach to optimize quantum circuits for the two-dimensional nearest-neighbor architecture based on graph partitioning and solving SAT problem using quantum annealing...
| Опубликовано в: : | Вестник Томского государственного университета. Управление, вычислительная техника и информатика № 69. С. 103-111 |
|---|---|
| Главный автор: | |
| Формат: | Статья в журнале |
| Язык: | English |
| Предметы: | |
| Online-ссылка: | http://vital.lib.tsu.ru/vital/access/manager/Repository/koha:001150729 Перейти в каталог НБ ТГУ |
| Итог: | Mapping quantum circuits to the nearest-neighbor topology architecture requires additional gates. In this paper, we propose a hybrid approach to optimize quantum circuits for the two-dimensional nearest-neighbor architecture based on graph partitioning and solving SAT problem using quantum annealing. The technique's applicability and solution quality are studied via real experiments. |
|---|---|
| Библиография: | Библиогр.: 20 назв. |
| ISSN: | 1998-8605 |