Monte Carlo graph search for quantum circuit optimization

Research output: Contribution to journalArticleResearchpeer review

View graph of relations

Details

Original languageEnglish
Article number062615
Number of pages10
JournalPhysical Review A
Volume108
Issue number6
Publication statusPublished - 19 Dec 2023

Abstract

The building blocks of quantum algorithms and software are quantum gates, with the appropriate combination of quantum gates leading to a desired quantum circuit. Deep expert knowledge is necessary to discover effective combinations of quantum gates to achieve a desired quantum algorithm for solving a specific task. This is especially challenging for quantum machine learning and signal processing. For example, it is not trivial to design a quantum Fourier transform from scratch. This work proposes a quantum architecture search algorithm which is based on a Monte Carlo graph search and measures of importance sampling. It is applicable to the optimization of gate order for both discrete gates and gates containing continuous variables. Several numerical experiments demonstrate the applicability of the proposed method for the automatic discovery of quantum circuits.

ASJC Scopus subject areas

Cite this

Monte Carlo graph search for quantum circuit optimization. / Rosenhahn, Bodo; Osborne, Tobias J.
In: Physical Review A, Vol. 108, No. 6, 062615, 19.12.2023.

Research output: Contribution to journalArticleResearchpeer review

Rosenhahn B, Osborne TJ. Monte Carlo graph search for quantum circuit optimization. Physical Review A. 2023 Dec 19;108(6):062615. doi: 10.48550/arXiv.2307.07353, 10.1103/PhysRevA.108.062615
Download
@article{4f7a65055d6b4d178aca43833cc25bf3,
title = "Monte Carlo graph search for quantum circuit optimization",
abstract = "The building blocks of quantum algorithms and software are quantum gates, with the appropriate combination of quantum gates leading to a desired quantum circuit. Deep expert knowledge is necessary to discover effective combinations of quantum gates to achieve a desired quantum algorithm for solving a specific task. This is especially challenging for quantum machine learning and signal processing. For example, it is not trivial to design a quantum Fourier transform from scratch. This work proposes a quantum architecture search algorithm which is based on a Monte Carlo graph search and measures of importance sampling. It is applicable to the optimization of gate order for both discrete gates and gates containing continuous variables. Several numerical experiments demonstrate the applicability of the proposed method for the automatic discovery of quantum circuits.",
author = "Bodo Rosenhahn and Osborne, {Tobias J.}",
note = "Funding Information: This work was supported, in part, by Quantum Valley Lower Saxony and the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation), Project No. 274200144, SFB1227, under Germany's Excellence Strategies EXC-2123 QuantumFrontiers and EXC-2122 PhoenixD. ",
year = "2023",
month = dec,
day = "19",
doi = "10.48550/arXiv.2307.07353",
language = "English",
volume = "108",
journal = "Physical Review A",
issn = "2469-9926",
publisher = "American Physical Society",
number = "6",

}

Download

TY - JOUR

T1 - Monte Carlo graph search for quantum circuit optimization

AU - Rosenhahn, Bodo

AU - Osborne, Tobias J.

N1 - Funding Information: This work was supported, in part, by Quantum Valley Lower Saxony and the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation), Project No. 274200144, SFB1227, under Germany's Excellence Strategies EXC-2123 QuantumFrontiers and EXC-2122 PhoenixD.

PY - 2023/12/19

Y1 - 2023/12/19

N2 - The building blocks of quantum algorithms and software are quantum gates, with the appropriate combination of quantum gates leading to a desired quantum circuit. Deep expert knowledge is necessary to discover effective combinations of quantum gates to achieve a desired quantum algorithm for solving a specific task. This is especially challenging for quantum machine learning and signal processing. For example, it is not trivial to design a quantum Fourier transform from scratch. This work proposes a quantum architecture search algorithm which is based on a Monte Carlo graph search and measures of importance sampling. It is applicable to the optimization of gate order for both discrete gates and gates containing continuous variables. Several numerical experiments demonstrate the applicability of the proposed method for the automatic discovery of quantum circuits.

AB - The building blocks of quantum algorithms and software are quantum gates, with the appropriate combination of quantum gates leading to a desired quantum circuit. Deep expert knowledge is necessary to discover effective combinations of quantum gates to achieve a desired quantum algorithm for solving a specific task. This is especially challenging for quantum machine learning and signal processing. For example, it is not trivial to design a quantum Fourier transform from scratch. This work proposes a quantum architecture search algorithm which is based on a Monte Carlo graph search and measures of importance sampling. It is applicable to the optimization of gate order for both discrete gates and gates containing continuous variables. Several numerical experiments demonstrate the applicability of the proposed method for the automatic discovery of quantum circuits.

UR - http://www.scopus.com/inward/record.url?scp=85181084902&partnerID=8YFLogxK

U2 - 10.48550/arXiv.2307.07353

DO - 10.48550/arXiv.2307.07353

M3 - Article

AN - SCOPUS:85181084902

VL - 108

JO - Physical Review A

JF - Physical Review A

SN - 2469-9926

IS - 6

M1 - 062615

ER -

By the same author(s)