Inductive Construction of Variational Quantum Circuit for Constrained Combinatorial Optimization

In this study, we propose a new method for constrained combinatorial optimization using variational quantum circuits. Quantum computers are considered to have the potential to solve large combinatorial optimization problems faster than classical computers. Variational quantum algorithms, such as Var...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE access Ročník 13; s. 73096 - 73108
Hlavní autori: Nakada, Hyakka, Tanahashi, Kotaro, Tanaka, Shu
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: Piscataway IEEE 2025
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Predmet:
Algorithms
Circuits
Combinatorial analysis
Computers
Constrained combinatorial optimization problem
Constraints
Costs
facility location problem
Linear programming
Logic gates
Optimization
Quantum circuit
Quantum computers
quantum gate
Qubit
Technological innovation
Traveling salesman problems
Urban areas
variational quantum circuit
variational quantum eigensolver
ISSN:2169-3536, 2169-3536
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract In this study, we propose a new method for constrained combinatorial optimization using variational quantum circuits. Quantum computers are considered to have the potential to solve large combinatorial optimization problems faster than classical computers. Variational quantum algorithms, such as Variational Quantum Eigensolver (VQE), have been studied extensively because they are expected to work on noisy intermediate scale devices. Unfortunately, many optimization problems have constraints, which induces infeasible solutions during VQE process. Recently, several methods for efficiently solving constrained combinatorial optimization problems have been proposed by designing a quantum circuit so as to output only the states that satisfy the constraints. However, the types of available constraints are still limited. Therefore, we have started to develop variational quantum circuits that can handle a wider range of constraints. The proposed method utilizes a forwarding operation that maps from feasible states for subproblems to those for larger subproblems. As long as appropriate forwarding operations can be defined, iteration of this process can inductively construct variational circuits outputting feasible states even in the case of multiple and complex constraints. In this paper, the proposed method was applied to facility location problem. As a result, feasible solutions were obtained with 100%, and the probability of obtaining optimal solutions was over 22 times higher than that of conventional VQEs. Nevertheless, the cost of the obtained circuit was comparable to that of conventional circuits.
AbstractList In this study, we propose a new method for constrained combinatorial optimization using variational quantum circuits. Quantum computers are considered to have the potential to solve large combinatorial optimization problems faster than classical computers. Variational quantum algorithms, such as Variational Quantum Eigensolver (VQE), have been studied extensively because they are expected to work on noisy intermediate scale devices. Unfortunately, many optimization problems have constraints, which induces infeasible solutions during VQE process. Recently, several methods for efficiently solving constrained combinatorial optimization problems have been proposed by designing a quantum circuit so as to output only the states that satisfy the constraints. However, the types of available constraints are still limited. Therefore, we have started to develop variational quantum circuits that can handle a wider range of constraints. The proposed method utilizes a forwarding operation that maps from feasible states for subproblems to those for larger subproblems. As long as appropriate forwarding operations can be defined, iteration of this process can inductively construct variational circuits outputting feasible states even in the case of multiple and complex constraints. In this paper, the proposed method was applied to facility location problem. As a result, feasible solutions were obtained with 100%, and the probability of obtaining optimal solutions was over 22 times higher than that of conventional VQEs. Nevertheless, the cost of the obtained circuit was comparable to that of conventional circuits.
Author Tanaka, Shu
Nakada, Hyakka
Tanahashi, Kotaro
Author_xml – sequence: 1
  givenname: Hyakka
  orcidid: 0009-0003-8451-047X
  surname: Nakada
  fullname: Nakada, Hyakka
  email: hyakka_nakada@r.recruit.co.jp
  organization: Recruit Company Ltd., Tokyo, Japan
– sequence: 2
  givenname: Kotaro
  orcidid: 0000-0001-8334-7285
  surname: Tanahashi
  fullname: Tanahashi, Kotaro
  organization: Recruit Company Ltd., Tokyo, Japan
– sequence: 3
  givenname: Shu
  orcidid: 0000-0002-0871-3836
  surname: Tanaka
  fullname: Tanaka, Shu
  organization: Graduate School of Science and Technology, Keio University, Yokohama, Kanagawa, Japan
BookMark eNqFUcFq3DAUFCWFpmm-oD0Yet6tnyXZ1jGYtF0IhJK2V_VZ0itavNZWlgvt11deLyH0El007zEzD2Zes4sxjI6xt1BuAUr14abrbh8etlVZyS2XNVd1-YJdVlCrDZe8vniCX7HradqX-bV5JZtL9mM32tkk_9sVXRinFJchjEWg4jtGj8uAQ_FlxjHNh6Lz0cw-FRTimY9-dDbjQ-9HTCFLhuL-mPzB_z2J37CXhMPkrs__Ffv28fZr93lzd_9p193cbYwASJtGUVU2PdXGWqOoQQu2B8nBihqVqfoSWym5FVBRQxKh6ZEQFbdETgjiV2y3-tqAe32M_oDxjw7o9WkR4k-NMXkzOC1E77BWLdWuEsihlYKQiDubYWUhe71fvY4x_JrdlPQ-zDHnMGkOSkkQrVCZxVeWiWGaoqPHq1DqpRm9NqOXZvS5maxS_6mMT6ekliyHZ7TvVq13zj25phrZtMD_AcVToL0
CODEN IAECCG
CitedBy_id crossref_primary_10_20935_AcadQuant7900
crossref_primary_10_22331_q_2025_07_21_1799
Cites_doi 10.1007/BF01857727
10.1021/acs.jctc.3c01325
10.7566/jpsj.88.061010
10.22331/q-2023-09-26-1121
10.1088/2058-9565/ac3e54
10.1080/00107514.2018.1450720
10.1063/5.0187026
10.1007/978-94-015-8330-5_4
10.1103/PhysRevResearch.3.033002
10.1587/transinf.2023EDP7071
10.1088/1367-2630/18/2/023023
10.1002/qute.202400201
10.1103/PhysRevA.101.012320
10.1103/PhysRevLett.122.140504
10.1007/978-3-030-85450-8
10.1088/2058-9565/ace474
10.3390/a12020034
10.1103/PhysRevE.58.5355
10.1038/ncomms5213
10.1103/PhysRevLett.122.230401
10.3389/fphy.2014.00005
10.1038/s41592-019-0686-2
10.22331/q-2021-04-08-428
10.1109/TC.2021.3063618
10.1038/s41467-023-37587-6
10.1109/ACCESS.2021.3081685
10.1109/QCE52317.2021.00035
10.1140/epjqt/s40507-022-00123-4
10.22331/q-2018-08-06-79
10.1109/ICTC46691.2019.8939749
10.1109/QCE49297.2020.00020
10.1007/s11128-022-03766-5
10.34133/icomputing.0037
10.1088/2058-9565/aab822
10.22331/q-2021-06-17-479
10.1103/PhysRevA.110.022430
10.1109/ICCE-Berlin47944.2019.8966167
10.1038/nature23879
ContentType Journal Article
Copyright Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2025
Copyright_xml – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2025
DBID 97E
ESBDL
RIA
RIE
AAYXX
CITATION
7SC
7SP
7SR
8BQ
8FD
JG9
JQ2
L7M
L~C
L~D
DOA
DOI 10.1109/ACCESS.2025.3563960
DatabaseName IEEE Xplore (IEEE)
Open Access资源_IEL Journals
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Engineered Materials Abstracts
METADEX
Technology Research Database
Materials Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
Materials Research Database
Engineered Materials Abstracts
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
METADEX
Computer and Information Systems Abstracts Professional
DatabaseTitleList Materials Research Database
Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: RIE
  name: IEEE Xplore
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 2169-3536
EndPage 73108
ExternalDocumentID oai_doaj_org_article_44bea698f6e24a31854faff3ed1852d1
10_1109_ACCESS_2025_3563960
10975781
Genre orig-research
GrantInformation_xml – fundername: Council for Science, Technology, and Innovation (CSTI) through the Cross-Ministerial Strategic Innovation Promotion Program (SIP)
– fundername: Promoting the Application of Advanced Quantum Technology Platforms to Social Issues [Funding Agency: National Institutes for Quantum Science and Technology (QST)], Japan Science and Technology Agency (JST)
  grantid: JPMJPF2221
– fundername: World Premier International Research Center Initiative (WPI), Ministry of Education, Culture, Sports, Science and Technology (MEXT), Japan, through the Human Biology-Microbiome-Quantum Research Center (Bio2Q)
– fundername: Japan Society for the Promotion of Science (JSPS) KAKENHI
  grantid: JP23H05447
  funderid: 10.13039/501100000646
GroupedDBID 0R~
4.4
5VS
6IK
97E
AAJGR
ABAZT
ABVLG
ACGFS
ADBBV
AGSQL
ALMA_UNASSIGNED_HOLDINGS
BCNDV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
EBS
EJD
ESBDL
GROUPED_DOAJ
IPLJI
JAVBF
KQ8
M43
M~E
O9-
OCL
OK1
RIA
RIE
RNS
AAYXX
CITATION
7SC
7SP
7SR
8BQ
8FD
JG9
JQ2
L7M
L~C
L~D
ID FETCH-LOGICAL-c411t-79f207bf6cddc9f7ad1db1531d46a9c2b0a8553d412f7f5a17bafaa93dffe44f3
IEDL.DBID RIE
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001481864700030&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2169-3536
IngestDate Fri Oct 03 12:43:03 EDT 2025
Mon Jun 30 11:09:46 EDT 2025
Tue Nov 18 22:35:00 EST 2025
Sat Nov 29 08:01:00 EST 2025
Wed Aug 27 01:53:39 EDT 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Language English
License https://creativecommons.org/licenses/by/4.0/legalcode
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c411t-79f207bf6cddc9f7ad1db1531d46a9c2b0a8553d412f7f5a17bafaa93dffe44f3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0001-8334-7285
0009-0003-8451-047X
0000-0002-0871-3836
OpenAccessLink https://ieeexplore.ieee.org/document/10975781
PQID 3199514849
PQPubID 4845423
PageCount 13
ParticipantIDs crossref_primary_10_1109_ACCESS_2025_3563960
crossref_citationtrail_10_1109_ACCESS_2025_3563960
ieee_primary_10975781
doaj_primary_oai_doaj_org_article_44bea698f6e24a31854faff3ed1852d1
proquest_journals_3199514849
PublicationCentury 2000
PublicationDate 20250000
2025-00-00
20250101
2025-01-01
PublicationDateYYYYMMDD 2025-01-01
PublicationDate_xml – year: 2025
  text: 20250000
PublicationDecade 2020
PublicationPlace Piscataway
PublicationPlace_xml – name: Piscataway
PublicationTitle IEEE access
PublicationTitleAbbrev Access
PublicationYear 2025
Publisher IEEE
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref35
ref15
ref37
ref36
ref31
ref11
Farhi (ref12) 2014
ref33
ref10
ref32
ref1
ref17
ref39
ref16
ref19
Quinones (ref34) 2020
Nakada (ref38) 2024
ref24
Christiansen (ref30) 2024
Diker (ref47) 2016
ref23
ref45
ref26
ref48
ref25
ref20
ref42
ref41
Marin-Sanchez (ref46) 2024
ref22
ref44
ref21
ref43
Bertsekas (ref14) 1982
ref28
ref27
ref29
Aleksandrowicz (ref40) 2019
ref8
ref7
ref9
ref4
ref3
ref6
ref5
Tanaka (ref18) 2017
Farhi (ref2) 2000
References_xml – ident: ref48
  doi: 10.1007/BF01857727
– ident: ref32
  doi: 10.1021/acs.jctc.3c01325
– ident: ref21
  doi: 10.7566/jpsj.88.061010
– ident: ref44
  doi: 10.22331/q-2023-09-26-1121
– ident: ref45
  doi: 10.1088/2058-9565/ac3e54
– ident: ref36
  doi: 10.1080/00107514.2018.1450720
– ident: ref37
  doi: 10.1063/5.0187026
– ident: ref41
  doi: 10.1007/978-94-015-8330-5_4
– year: 2000
  ident: ref2
  article-title: Quantum computation by adiabatic evolution
  publication-title: arXiv:quant-ph/0001106
– year: 2019
  ident: ref40
  article-title: Qiskit: An open-source framework for quantum computing
– ident: ref35
  doi: 10.1103/PhysRevResearch.3.033002
– year: 2024
  ident: ref38
  article-title: Quick design of feasible tensor networks for constrained combinatorial optimization
  publication-title: arXiv:2409.01699
– ident: ref33
  doi: 10.1587/transinf.2023EDP7071
– year: 2014
  ident: ref12
  article-title: A quantum approximate optimization algorithm
  publication-title: arXiv:1411.4028
– ident: ref8
  doi: 10.1088/1367-2630/18/2/023023
– ident: ref39
  doi: 10.1002/qute.202400201
– ident: ref28
  doi: 10.1103/PhysRevA.101.012320
– ident: ref9
  doi: 10.1103/PhysRevLett.122.140504
– ident: ref15
  doi: 10.1007/978-3-030-85450-8
– volume-title: Quantum Spin Glasses, Annealing and Computation
  year: 2017
  ident: ref18
– ident: ref26
  doi: 10.1088/2058-9565/ace474
– ident: ref27
  doi: 10.3390/a12020034
– ident: ref1
  doi: 10.1103/PhysRevE.58.5355
– ident: ref7
  doi: 10.1038/ncomms5213
– ident: ref10
  doi: 10.1103/PhysRevLett.122.230401
– ident: ref16
  doi: 10.3389/fphy.2014.00005
– ident: ref42
  doi: 10.1038/s41592-019-0686-2
– ident: ref3
  doi: 10.22331/q-2021-04-08-428
– ident: ref22
  doi: 10.1109/TC.2021.3063618
– ident: ref4
  doi: 10.1038/s41467-023-37587-6
– ident: ref20
  doi: 10.1109/ACCESS.2021.3081685
– ident: ref23
  doi: 10.1109/QCE52317.2021.00035
– ident: ref31
  doi: 10.1140/epjqt/s40507-022-00123-4
– ident: ref6
  doi: 10.22331/q-2018-08-06-79
– ident: ref13
  doi: 10.1109/ICTC46691.2019.8939749
– year: 2016
  ident: ref47
  article-title: Deterministic construction of arbitrary W states with quadratically increasing number of two-qubit gates
  publication-title: arXiv:1606.09290
– ident: ref29
  doi: 10.1109/QCE49297.2020.00020
– ident: ref24
  doi: 10.1007/s11128-022-03766-5
– ident: ref25
  doi: 10.34133/icomputing.0037
– ident: ref5
  doi: 10.1088/2058-9565/aab822
– ident: ref43
  doi: 10.22331/q-2021-06-17-479
– year: 2024
  ident: ref46
  article-title: Performance analysis of a filtering variational quantum algorithm
  publication-title: arXiv:2404.08933
– ident: ref17
  doi: 10.1103/PhysRevA.110.022430
– volume-title: Constrained Optimization and Lagrange Multiplier Methods
  year: 1982
  ident: ref14
– ident: ref19
  doi: 10.1109/ICCE-Berlin47944.2019.8966167
– ident: ref11
  doi: 10.1038/nature23879
– year: 2024
  ident: ref30
  article-title: Quantum tree generator improves QAOA state-of-the-art for the knapsack problem
  publication-title: arXiv:2411.00518
– year: 2020
  ident: ref34
  article-title: Modeling linear inequality constraints in quadratic binary optimization for variational quantum eigensolver
  publication-title: arXiv:2007.13245
SSID ssj0000816957
Score 2.347689
Snippet In this study, we propose a new method for constrained combinatorial optimization using variational quantum circuits. Quantum computers are considered to have...
SourceID doaj
proquest
crossref
ieee
SourceType Open Website
Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 73096
SubjectTerms Algorithms
Circuits
Combinatorial analysis
Computers
Constrained combinatorial optimization problem
Constraints
Costs
facility location problem
Linear programming
Logic gates
Optimization
Quantum circuit
Quantum computers
quantum gate
Qubit
Technological innovation
Traveling salesman problems
Urban areas
variational quantum circuit
variational quantum eigensolver
SummonAdditionalLinks – databaseName: DOAJ Directory of Open Access Journals
  dbid: DOA
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LS8QwEA4iHvQgPnF9kYNHq0mTtM1RF8WD-AAVbzHpJLDgrqK7_n4naVYXBL14K2HaNF-mk3yh8w0hB85y5lwDBe5GFBIU4IUD6QoBAAqdpmIuibhe1ldXzeOjvpkp9RX_CevkgTvgjqV03la6CZUvpY25vjLYEISHmPYLifiwWs-QqRSDG15pVWeZIc708Um_jyNCQliqI6FwXU6ilN9LUVLszyVWfsTltNicr5DlvEukJ93brZI5P1ojSzPagevkKRbdSMGKxqKbUxlY-hLoA_LffMZHbycI3WRI-4O3djIYU9yjZnuLzwK8HiI3jswbHZFeYwAZ5szMDXJ_fnbXvyhyuYSilZyPi1oHRMKFqgVodagtcHAY0DjIyuq2dMw2SgmQvAx1UJbXzgZrtYAQvJRBbJL50cvIbxEKpQWG9s4xIa2HxovSaeFd3UhhmeqRcoqcabOWeHzvZ5M4BdOmg9tEuE2Gu0cOv2567aQ0fjc_jVPyZRp1sFMDeofJ3mH-8o4e2YgTOtOfjgL-2L47nWGTP9p3I2K6OtJDqbf_o-8dshjH053X7JJ5dAS_Rxbaj_Hg_W0_-esnBrDvgA
  priority: 102
  providerName: Directory of Open Access Journals
Title Inductive Construction of Variational Quantum Circuit for Constrained Combinatorial Optimization
URI https://ieeexplore.ieee.org/document/10975781
https://www.proquest.com/docview/3199514849
https://doaj.org/article/44bea698f6e24a31854faff3ed1852d1
Volume 13
WOSCitedRecordID wos001481864700030&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVAON
  databaseName: DOAJ Directory of Open Access Journals
  customDbUrl:
  eissn: 2169-3536
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000816957
  issn: 2169-3536
  databaseCode: DOA
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://www.doaj.org/
  providerName: Directory of Open Access Journals
– providerCode: PRVHPJ
  databaseName: ROAD: Directory of Open Access Scholarly Resources
  customDbUrl:
  eissn: 2169-3536
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000816957
  issn: 2169-3536
  databaseCode: M~E
  dateStart: 20130101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1BT9swFLag4rAdYDAmunXIB44E4tiO4yNUoB02YNI2cTN2ni1Voi0qLUd-O8-OW5AQk7hEUfScOP5ebH923vcIOXCWlc41UOBsRCJBAVY4EK7gACDRaerSJRHXn-riorm-1lc5WD3Fwnjv089n_iiepr18mLaLuFR2HHdL0cOQ7KwrVXfBWqsFlZhBQkuVlYXQ9PhkOMSXQA5YySMucShOOpTPo08S6c9ZVV51xWl8Od96Z80-kc08kaQnHfLbZM1PdsjHF_KCn8lNzMuR-jMa83IulWLpNNB_SJHzMiD9vcDWXYzpcDRrF6M5xWlstrd4L8DzMdLnSM7RV-kl9jHjHLy5S_6en_0Z_ihyRoWiFYzNC6VDVSoX6hag1UFZYOCwz2MgaqvbypW2kZKDYFVQQVqmnA3Wag4heCEC_0J6k-nE7xEKlYUS7Z0rubAeGs8rp7l3qhHclrJPqmVLmzbLjcd635pEO0ptOnhMhMdkePrkcFXorlPb-L_5aYRwZRqlstMFxMbkL88I4bytdRNqXwkbg8VFsCFwDzFuHFif7EY8Xzyvg7JPBkuPMPm7vjc8RrQjgxT66xvFvpEPsYrdKs2A9BBb_51stA_z0f1sP1F-PP56PNtP7vsEC0ru2w
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3fT9swELYmmLTtgf0CUWDMDzwuEMd2Ej9CNQRa1zGJTbx5ds6WKtF2gnZ__-4ctyBNm7S3KDonjr_z2XfOfcfYkXei9L6FAncjGh0UEIUH5QsJABqVpi59InEdNeNxe3NjrnKyesqFCSGkn8_CMV2ms3yYd0sKlZ3QaSlqGDo7m1Q6K6drrUMqVEPC6CZzC6HwyelwiJ-BXmClj6XGxTgxUT6sP4mmP9dV-cMYpxXm_OV_9u0V28pbSX7aY_-aPQmzN-zFI4LBt-wHVeZIFo1TZc4VVyyfR_4dneQcCORflzi-yykfTu665WTBcSOb5R0-C_B6ig40ueeorfwLWplpTt_cZt_OP14PL4pcU6HolBCLojGxKhsf6w6gM7FxIMCj1ROgame6ypeu1VqCElVsonai8S46ZyTEGJSKcodtzOazsMs4VA5KlPe-lMoFaIOsvJHBN62SrtQDVq1G2naZcJz6fWuT41Ea28NjCR6b4RmwD-tGP3u-jX-LnxGEa1Eiy043EBub555VygdXmzbWoVKO0sVVdDHKAJQ5DmLAtgnPR-_roRywg5VG2Dyz762knHb0IZXZ-0uz9-zZxfXnkR1djj_ts-fU3T5mc8A2EOfwjj3tfi0m93eHSX1_A1rW7_4
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Inductive+Construction+of+Variational+Quantum+Circuit+for+Constrained+Combinatorial+Optimization&rft.jtitle=IEEE+access&rft.au=Nakada%2C+Hyakka&rft.au=Tanahashi%2C+Kotaro&rft.au=Tanaka%2C+Shu&rft.date=2025&rft.issn=2169-3536&rft.eissn=2169-3536&rft.volume=13&rft.spage=73096&rft.epage=73108&rft_id=info:doi/10.1109%2FACCESS.2025.3563960&rft.externalDBID=n%2Fa&rft.externalDocID=10_1109_ACCESS_2025_3563960
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2169-3536&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2169-3536&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2169-3536&client=summon