Approximation Method for Optimization Problems in Gate-Model Quantum Computers

Q1 Mathematics
Laszlo Gyongyosi
{"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}
引用次数: 1

Abstract

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.

门型量子计算机优化问题的近似方法
在近期量子计算机中,计算是通过酉算子实现的。输入量子计算机的优化问题设置了一个目标函数,该目标函数将通过几轮测量来估计。在这里,我们定义了一个门型量子计算机的目标函数逼近过程。该方法优化了门型量子计算机和量子器件优化问题的目标函数估计过程。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Chaos, Solitons and Fractals: X
Chaos, Solitons and Fractals: X Mathematics-Mathematics (all)
CiteScore
5.00
自引率
0.00%
发文量
15
审稿时长
20 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信