门型量子计算机优化问题的近似方法

Q1 Mathematics

Chaos, Solitons and Fractals: X Pub Date : 2021-12-01 DOI:10.1016/j.csfx.2021.100066

Laszlo Gyongyosi

{"title":"门型量子计算机优化问题的近似方法","authors":"Laszlo Gyongyosi","doi":"10.1016/j.csfx.2021.100066","DOIUrl":null,"url":null,"abstract":"<div><p>In near-term quantum computers, the computations are realized via unitary operators. The optimization problem fed into the quantum computer sets an objective function that is to be estimated via several measurement rounds. Here, we define a procedure for objective function approximation in gate-model quantum computers. The proposed solution optimizes the process of objective function estimation for optimization problems in gate-model quantum computers and quantum devices.</p></div>","PeriodicalId":37147,"journal":{"name":"Chaos, Solitons and Fractals: X","volume":"7 ","pages":"Article 100066"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2590054421000117/pdfft?md5=1d5706db1e8b7bedb7c130c671cb1a85&pid=1-s2.0-S2590054421000117-main.pdf","citationCount":"1","resultStr":"{\"title\":\"Approximation Method for Optimization Problems in Gate-Model Quantum Computers\",\"authors\":\"Laszlo Gyongyosi\",\"doi\":\"10.1016/j.csfx.2021.100066\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>In near-term quantum computers, the computations are realized via unitary operators. The optimization problem fed into the quantum computer sets an objective function that is to be estimated via several measurement rounds. Here, we define a procedure for objective function approximation in gate-model quantum computers. The proposed solution optimizes the process of objective function estimation for optimization problems in gate-model quantum computers and quantum devices.</p></div>\",\"PeriodicalId\":37147,\"journal\":{\"name\":\"Chaos, Solitons and Fractals: X\",\"volume\":\"7 \",\"pages\":\"Article 100066\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://www.sciencedirect.com/science/article/pii/S2590054421000117/pdfft?md5=1d5706db1e8b7bedb7c130c671cb1a85&pid=1-s2.0-S2590054421000117-main.pdf\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Chaos, Solitons and Fractals: X\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S2590054421000117\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"Mathematics\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Chaos, Solitons and Fractals: X","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2590054421000117","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Mathematics","Score":null,"Total":0}

引用次数: 1

摘要

在近期量子计算机中，计算是通过酉算子实现的。输入量子计算机的优化问题设置了一个目标函数，该目标函数将通过几轮测量来估计。在这里，我们定义了一个门型量子计算机的目标函数逼近过程。该方法优化了门型量子计算机和量子器件优化问题的目标函数估计过程。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Approximation Method for Optimization Problems in Gate-Model Quantum Computers

In near-term quantum computers, the computations are realized via unitary operators. The optimization problem fed into the quantum computer sets an objective function that is to be estimated via several measurement rounds. Here, we define a procedure for objective function approximation in gate-model quantum computers. The proposed solution optimizes the process of objective function estimation for optimization problems in gate-model quantum computers and quantum devices.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Chaos, Solitons and Fractals: X Mathematics-Mathematics (all)

CiteScore

5.00

自引率

0.00%

发文量

审稿时长

20 weeks