Improving Quantum Optimization Algorithms by Constraint Relaxation

Quantum optimization is a significant area of quantum computing research with anticipated near-term quantum advantages. Current quantum optimization algorithms, most of which are hybrid variational-Hamiltonian-based algorithms, struggle to present quantum devices due to noise and decoherence. Existi...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Applied sciences Ročník 14; číslo 18; s. 8099
Hlavní autoři: Pecyna, Tomasz, Różycki, Rafał
Médium: Journal Article
Jazyk:angličtina
Vydáno: Basel MDPI AG 01.09.2024
Témata:
ISSN:2076-3417, 2076-3417
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Abstract Quantum optimization is a significant area of quantum computing research with anticipated near-term quantum advantages. Current quantum optimization algorithms, most of which are hybrid variational-Hamiltonian-based algorithms, struggle to present quantum devices due to noise and decoherence. Existing techniques attempt to mitigate these issues through employing different Hamiltonian encodings or Hamiltonian clause pruning, but they often rely on optimistic assumptions rather than a deep analysis of the problem structure. We demonstrate how to formulate the problem Hamiltonian for a quantum approximate optimization algorithm that satisfies all the requirements to correctly describe the considered tactical aircraft deconfliction problem, achieving higher probabilities for finding solutions compared to previous works. Our results indicate that constructing Hamiltonians from an unconventional, quantum-specific perspective with a high degree of entanglement results in a linear instead of exponential number of entanglement gates instead and superior performance compared to standard formulations. Specifically, we achieve a higher probability of finding feasible solutions: finding solutions in nine out of nine instances compared to standard Hamiltonian formulations and quadratic programming formulations known from quantum annealers, which only found solutions in seven out of nine instances. These findings suggest that there is substantial potential for further research in quantum Hamiltonian design and that gate-based approaches may offer superior optimization performance over quantum annealers in the future.
AbstractList Quantum optimization is a significant area of quantum computing research with anticipated near-term quantum advantages. Current quantum optimization algorithms, most of which are hybrid variational-Hamiltonian-based algorithms, struggle to present quantum devices due to noise and decoherence. Existing techniques attempt to mitigate these issues through employing different Hamiltonian encodings or Hamiltonian clause pruning, but they often rely on optimistic assumptions rather than a deep analysis of the problem structure. We demonstrate how to formulate the problem Hamiltonian for a quantum approximate optimization algorithm that satisfies all the requirements to correctly describe the considered tactical aircraft deconfliction problem, achieving higher probabilities for finding solutions compared to previous works. Our results indicate that constructing Hamiltonians from an unconventional, quantum-specific perspective with a high degree of entanglement results in a linear instead of exponential number of entanglement gates instead and superior performance compared to standard formulations. Specifically, we achieve a higher probability of finding feasible solutions: finding solutions in nine out of nine instances compared to standard Hamiltonian formulations and quadratic programming formulations known from quantum annealers, which only found solutions in seven out of nine instances. These findings suggest that there is substantial potential for further research in quantum Hamiltonian design and that gate-based approaches may offer superior optimization performance over quantum annealers in the future.
Audience Academic
Author Pecyna, Tomasz
Różycki, Rafał
Author_xml – sequence: 1
  givenname: Tomasz
  orcidid: 0000-0001-7473-3360
  surname: Pecyna
  fullname: Pecyna, Tomasz
– sequence: 2
  givenname: Rafał
  orcidid: 0000-0002-2973-8266
  surname: Różycki
  fullname: Różycki, Rafał
BookMark eNptkd1KJDEQhYO4oM56tS_Q4KWMpjrpn1yOg6sDgrjsXofq6vSYoTtp0xlZ9-k3zoiImBASiq9Oqk6dsEPnnWHsB_ALIRS_xHEECXXNlTpgxzmvyrmQUB1-eB-x02na8LQUiBr4MbtaDWPwz9ats4cturgdsvsx2sH-w2i9yxb92gcbH4cpa16ypXdTDGhdzH6ZHv_umO_sW4f9ZE7f7hn78_P69_J2fnd_s1ou7uYkuYjzXNZFaxpuoGxqDiSgA6Suw6bhJNsK0BQkqcxFJ1HJmggVN5gQKPO2NGLGVnvd1uNGj8EOGF60R6t3AR_WGkO01BtdUgEVtUBVW0hZKCxyZdqCm0KkD4iS1tleKzX_tDVT1Bu_DS6VrwUAF7mqVJWoiz21xiRqXedT85R2awZLyf3OpviiBhAgeDozdr5PoOCnKZjuvUzg-nVI-sOQEg2faLJxZ-mrx_2XOf8B96SW7Q
CitedBy_id crossref_primary_10_1109_ACCESS_2025_3550788
Cites_doi 10.1007/BF01343193
10.1016/j.ejor.2023.03.013
10.1137/S0036144598347011
10.1103/PhysRevResearch.4.033029
10.1287/trsc.2021.1056
10.1145/237814.237866
10.1145/3478519
10.1145/3665225.3665446
10.1007/978-3-031-63778-0_22
10.1103/PhysRevResearch.5.023171
10.22331/q-2018-08-06-79
10.1090/S0002-9939-1959-0108732-6
10.1007/978-94-015-8330-5_4
10.1016/j.physrep.2024.03.002
10.1103/PhysRevA.88.062314
10.1103/PhysRevA.103.042405
ContentType Journal Article
Copyright COPYRIGHT 2024 MDPI AG
2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
Copyright_xml – notice: COPYRIGHT 2024 MDPI AG
– notice: 2024 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.
DBID AAYXX
CITATION
ABUWG
AFKRA
AZQEC
BENPR
CCPQU
DWQXO
PHGZM
PHGZT
PIMPY
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
DOA
DOI 10.3390/app14188099
DatabaseName CrossRef
ProQuest Central (Alumni)
ProQuest Central UK/Ireland
ProQuest Central Essentials
ProQuest Central
ProQuest One Community College
ProQuest Central Korea
ProQuest Central Premium
ProQuest One Academic
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest One Academic Eastern Edition (DO NOT USE)
ProQuest One Academic (retired)
ProQuest One Academic UKI Edition
ProQuest Central China
DOAJ Directory of Open Access Journals
DatabaseTitle CrossRef
Publicly Available Content Database
ProQuest One Academic Middle East (New)
ProQuest Central Essentials
ProQuest One Academic Eastern Edition
ProQuest Central (Alumni Edition)
ProQuest One Community College
ProQuest Central China
ProQuest Central
ProQuest One Academic UKI Edition
ProQuest Central Korea
ProQuest Central (New)
ProQuest One Academic
ProQuest One Academic (New)
DatabaseTitleList
Publicly Available Content Database
CrossRef

Database_xml – sequence: 1
  dbid: DOA
  name: DOAJ Directory of Open Access Journals
  url: https://www.doaj.org/
  sourceTypes: Open Website
– sequence: 2
  dbid: PIMPY
  name: Publicly Available Content Database
  url: http://search.proquest.com/publiccontent
  sourceTypes: Aggregation Database
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Sciences (General)
EISSN 2076-3417
ExternalDocumentID oai_doaj_org_article_6c517cd1c7d54459a529ed50e53c62cc
A811313031
10_3390_app14188099
GroupedDBID .4S
2XV
5VS
7XC
8CJ
8FE
8FG
8FH
AADQD
AAFWJ
AAYXX
ADBBV
ADMLS
AFFHD
AFKRA
AFPKN
AFZYC
ALMA_UNASSIGNED_HOLDINGS
APEBS
ARCSS
BCNDV
BENPR
CCPQU
CITATION
CZ9
D1I
D1J
D1K
GROUPED_DOAJ
IAO
IGS
ITC
K6-
K6V
KC.
KQ8
L6V
LK5
LK8
M7R
MODMG
M~E
OK1
P62
PHGZM
PHGZT
PIMPY
PROAC
TUS
ABUWG
AZQEC
DWQXO
PKEHL
PQEST
PQQKQ
PQUKI
PRINS
ID FETCH-LOGICAL-c403t-2485deb0e16b801c31f1acffabb0c4d71ae5c4c623f4a948cca90eaacf162d6e3
IEDL.DBID BENPR
ISICitedReferencesCount 1
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=001323560400001&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 2076-3417
IngestDate Fri Oct 03 12:50:57 EDT 2025
Mon Jun 30 15:45:14 EDT 2025
Tue Nov 04 18:15:16 EST 2025
Tue Nov 18 21:34:47 EST 2025
Sat Nov 29 07:16:08 EST 2025
IsDoiOpenAccess true
IsOpenAccess true
IsPeerReviewed true
IsScholarly true
Issue 18
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c403t-2485deb0e16b801c31f1acffabb0c4d71ae5c4c623f4a948cca90eaacf162d6e3
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ORCID 0000-0001-7473-3360
0000-0002-2973-8266
OpenAccessLink https://www.proquest.com/docview/3110329797?pq-origsite=%requestingapplication%
PQID 3110329797
PQPubID 2032433
ParticipantIDs doaj_primary_oai_doaj_org_article_6c517cd1c7d54459a529ed50e53c62cc
proquest_journals_3110329797
gale_infotracacademiconefile_A811313031
crossref_primary_10_3390_app14188099
crossref_citationtrail_10_3390_app14188099
PublicationCentury 2000
PublicationDate 2024-09-01
PublicationDateYYYYMMDD 2024-09-01
PublicationDate_xml – month: 09
  year: 2024
  text: 2024-09-01
  day: 01
PublicationDecade 2020
PublicationPlace Basel
PublicationPlace_xml – name: Basel
PublicationTitle Applied sciences
PublicationYear 2024
Publisher MDPI AG
Publisher_xml – name: MDPI AG
References Trotter (ref_9) 1959; 10
Young (ref_10) 2013; 88
(ref_17) 2022; 56
Preskill (ref_4) 2018; 2
Shor (ref_1) 1999; 41
McCoy (ref_11) 2021; 103
Kurowski (ref_16) 2023; 310
ref_13
ref_12
ref_3
ref_2
Blekos (ref_7) 2024; 1068
ref_19
ref_18
Hadfield (ref_5) 2021; 2
Zhu (ref_14) 2022; 4
ref_15
ref_6
Born (ref_8) 1928; 51
References_xml – ident: ref_6
– volume: 51
  start-page: 165
  year: 1928
  ident: ref_8
  article-title: Beweis des adiabatensatzes
  publication-title: Z. Für Phys.
  doi: 10.1007/BF01343193
– volume: 310
  start-page: 518
  year: 2023
  ident: ref_16
  article-title: Application of quantum approximate optimization algorithm to job shop scheduling problem
  publication-title: Eur. J. Oper. Res.
  doi: 10.1016/j.ejor.2023.03.013
– ident: ref_3
– ident: ref_12
– volume: 41
  start-page: 303
  year: 1999
  ident: ref_1
  article-title: Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
  publication-title: SIAM Rev.
  doi: 10.1137/S0036144598347011
– volume: 4
  start-page: 033029
  year: 2022
  ident: ref_14
  article-title: Adaptive quantum approximate optimization algorithm for solving combinatorial problems on a quantum computer
  publication-title: Phys. Rev. Res.
  doi: 10.1103/PhysRevResearch.4.033029
– volume: 56
  start-page: 118
  year: 2022
  ident: ref_17
  article-title: Aircraft deconfliction via mathematical programming: Review and insights
  publication-title: Transp. Sci.
  doi: 10.1287/trsc.2021.1056
– ident: ref_2
  doi: 10.1145/237814.237866
– volume: 2
  start-page: 1
  year: 2021
  ident: ref_5
  article-title: On the representation of Boolean and real functions as Hamiltonians for quantum computing
  publication-title: ACM Trans. Quantum Comput.
  doi: 10.1145/3478519
– ident: ref_13
  doi: 10.1145/3665225.3665446
– ident: ref_18
  doi: 10.1007/978-3-031-63778-0_22
– ident: ref_15
  doi: 10.1103/PhysRevResearch.5.023171
– volume: 2
  start-page: 79
  year: 2018
  ident: ref_4
  article-title: Quantum computing in the NISQ era and beyond
  publication-title: Quantum
  doi: 10.22331/q-2018-08-06-79
– volume: 10
  start-page: 545
  year: 1959
  ident: ref_9
  article-title: On the product of semi-groups of operators
  publication-title: Proc. Am. Math. Soc. USA
  doi: 10.1090/S0002-9939-1959-0108732-6
– ident: ref_19
  doi: 10.1007/978-94-015-8330-5_4
– volume: 1068
  start-page: 1
  year: 2024
  ident: ref_7
  article-title: A review on quantum approximate optimization algorithm and its variants
  publication-title: Phys. Rep.
  doi: 10.1016/j.physrep.2024.03.002
– volume: 88
  start-page: 062314
  year: 2013
  ident: ref_10
  article-title: Adiabatic quantum optimization with the wrong Hamiltonian
  publication-title: Phys. Rev. A—At. Mol. Opt. Phys.
  doi: 10.1103/PhysRevA.88.062314
– volume: 103
  start-page: 042405
  year: 2021
  ident: ref_11
  article-title: Improving Hamiltonian encodings with the Gray code
  publication-title: Phys. Rev. A
  doi: 10.1103/PhysRevA.103.042405
SSID ssj0000913810
Score 2.3083503
Snippet Quantum optimization is a significant area of quantum computing research with anticipated near-term quantum advantages. Current quantum optimization...
SourceID doaj
proquest
gale
crossref
SourceType Open Website
Aggregation Database
Enrichment Source
Index Database
StartPage 8099
SubjectTerms Algorithms
Energy
Hamiltonian
Mathematical optimization
Optimization algorithms
quadratic unconstrained binary optimization
quantum approximate optimization algorithm
Quantum computing
quantum optimization
tactical aircraft deconfliction problem
SummonAdditionalLinks – databaseName: DOAJ Directory of Open Access Journals
  dbid: DOA
  link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV1LTxsxEB4h1AMcqvJSQ2nlA1IL0qrr2GvHx1AV9USLVCRull_bIpGAkg2Cf98Zrwk5UHHhGs1h9vsyD-96vgE49AbbkBhMVbcY5FjxU-WilJV2SRqhkmxan5dN6LOz0eWl-bWy6ovuhPXywD1wX1VouA6RBx1JN8a4ZmhSbOrUiKCGIVD2rbVZOUzlHGw4SVf1A3kCz_X0PZhLEh_LKq9PJSgr9f8vH-cic_oO3pbukI17r7ZgLU23YXNFM3Abtko0ztmXIhl9tAMny3cD7HyBWC0m7CfmgkkZsmTj6z83s6vu72TO_AOjJZ15NUTH6C7cfbbZhYvT77-__ajKdoQqyFp0FWmRxeTrxJXHMhMEb7kLbeu8r4OMmrvUBIkYiVY6I0dIlamTQxOuhlElsQfr05tpeg-saVKMHBsrRdMiyE6rovI6qOix945pAMePgNlQpMPJzWuLRwhC166gO4DDpfFtr5jxvNkJIb80IZnr_AOSbwv59iXyB_CZeLMUjOhQcGWmAB-LZK3seMS5oCrNB3DwSK0tUTq3gpOcoNFG77-GNx9gY4gtT38D7QDWu9kifYQ34a67ms8-5T_oP2xi65g
  priority: 102
  providerName: Directory of Open Access Journals
Title Improving Quantum Optimization Algorithms by Constraint Relaxation
URI https://www.proquest.com/docview/3110329797
https://doaj.org/article/6c517cd1c7d54459a529ed50e53c62cc
Volume 14
WOSCitedRecordID wos001323560400001&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: 2076-3417
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913810
  issn: 2076-3417
  databaseCode: DOA
  dateStart: 20110101
  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: 2076-3417
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913810
  issn: 2076-3417
  databaseCode: M~E
  dateStart: 20110101
  isFulltext: true
  titleUrlDefault: https://road.issn.org
  providerName: ISSN International Centre
– providerCode: PRVPQU
  databaseName: ProQuest Central
  customDbUrl:
  eissn: 2076-3417
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913810
  issn: 2076-3417
  databaseCode: BENPR
  dateStart: 20110101
  isFulltext: true
  titleUrlDefault: https://www.proquest.com/central
  providerName: ProQuest
– providerCode: PRVPQU
  databaseName: Publicly Available Content Database
  customDbUrl:
  eissn: 2076-3417
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0000913810
  issn: 2076-3417
  databaseCode: PIMPY
  dateStart: 20110101
  isFulltext: true
  titleUrlDefault: http://search.proquest.com/publiccontent
  providerName: ProQuest
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LbxMxEB5By6EcKC1FBNrKh0pApRXrrNcbn1BStWoPhIBAak-WX1uQmqRkNwj-PTOOk_bQ9sJxd0da25_n4bH9DcCBVRiGeKeyvEYlR48fMuOFyCoThCpkEGVtY7GJajjsnZ-rUUq4NelY5dImRkPtp45y5B8KTtRvqlLVx-tfGVWNot3VVELjMawTUxnO8_XB8XD0dZVlIdbLHs8XF_MKXN_TvjAXREIW2V5vXFFk7L_PLkdnc7L5v818Ds9SmMn6i3mxBY_CZBue3iIf3IatpNYNe5e4p9-_gMEqycC-zHHQ52P2GY3KON3WZP2rS_xb-2PcMPuXUbXPWGOiZXSo7k-U2YHvJ8ffjk6zVGYhcyIv2oxIzXyweeDSor9yBa-5cXVtrM2d8BU3oXTCYZxUC6NEDzFXeTAowmXXy1C8hLXJdBJeASvL4D3HCE3StROEuZZe2spJbzGI96EDh8sR1y5xkFMzrzSuRQgefQueDhyshK8X1Bt3iw0IupUI8WXHF9PZpU7qp6UreeU8d5Un9iFlyq4KvsxDWWDHnOvAWwJek1Zjg5xJlxOwW8SPpfs9zgty97wDu0vgdVL3Rt-g_vrhz29go4tR0eKQ2i6stbN52IMn7nf7s5ntp9m7HxMD-DQ6-zS6-AcWgf2C
linkProvider ProQuest
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V1Nb9QwEB2VLRJwKLSA2FLAhyI-pIg4cZL1AaEtUHXVdlmkIrUn49hOQerutpsspX-K38hM4mx7AG49cE1GkSd-fh5_zBuAzVxiGGKNDMICBznO-C7QVogg007IOHUiKfK62EQ2HPYOD-VoCX61uTB0rbLlxJqo7dTQHvmbmJP0m8xk9u70LKCqUXS62pbQaGCx6y7OcclWvh18wP59HkXbHw_e7wS-qkBgRBhXAWl4WZeHjqc50rOJecG1KQqd56ERNuPaJUYYDAsKoaXooYsydBpNeBrZ1MX43RuwLAjsHVgeDfZHR4tdHVLZ7PGwSQSMYxnSOTQXJHpWq8teTn11hYC_zQP15LZ993_7LfdgxYfRrN_gfhWW3GQN7lwRV1yDVU9bJXvptbVf3YetxSYK-zxHUM3H7BOS5thno7L-yTF6V30blyy_YFTNtK6hUTG6NPiztnkAX67Fs4fQmUwn7hGwJHHWcoxAU0qrQRgXqU3zzKQ2x0WKdV143fawMl5jnZp5onCtRXBQV-DQhc2F8WkjLfJnsy2CysKE9MDrB9PZsfL0olKT8MxYbjJL6kpSJ5F0NgldEqNjxnThBQFNEWthg4z2yRfoFul_qX6P85jCGd6FjRZoytNZqS5Rtv7v18_g1s7B_p7aGwx3H8PtCCPA5kLeBnSq2dw9gZvmR_W9nD31I4fB1-tG5W_LjVvE
linkToPdf http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMw1V3fb9MwED6NDiH2AGyAKAzwwxA_pGhx7CT1A5o6RkU1KEUCaXsyie0MpLXdmhTYv8Zft7vE6fYAvO2B1-QU-eLPd2f77juArVxhGGKNCsICFzl6fBdkVsogzZxUInEyLvK62UQ6GvUODtR4BX63tTCUVtnaxNpQ25mhM_JtwYn6TaUq3S58WsR4b7BzchpQBym6aW3baTQQ2XdnP3H7Vr4e7uFcP4uiwdvPb94FvsNAYGQoqoD4vKzLQ8eTHE21EbzgmSmKLM9DI23KMxcbaTBEKGSmZA_VVaHLUIQnkU2cwO9eg1UMyWXUgdXx8MP4cHnCQ4ybPR42RYFCqJDupLkkArSaafbCDdbdAv7mE2pHN7j9P_-iO3DLh9es36yHdVhx0w1Yu0S6uAHr3pyV7IXn3H55F3aXhyvs0wLBtpiwj2hMJ75KlfWPj1C76tukZPkZoy6ndW-NilEy4a9a5h58uRLN7kNnOpu6B8Di2FnLMTJNqNwG4V0kNslTk9gcNy_WdeFVO9vaeO51Guaxxj0YQUNfgkYXtpbCJw3lyJ_Fdgk2SxHiCa8fzOZH2psdnZiYp8Zyk1piXVJZHCln49DFAhUzpgvPCXSarBkOyGS-KAPVIl4w3e9xLijM4V3YbEGnvZkr9QXiHv779VO4gVDU74ej_UdwM8LAsMnT24RONV-4x3Dd_Ki-l_MnfhEx-HrVoDwHQXZkhA
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=Improving+Quantum+Optimization+Algorithms+by+Constraint+Relaxation&rft.jtitle=Applied+sciences&rft.au=Pecyna%2C+Tomasz&rft.au=R%C3%B3%C5%BCycki%2C+Rafa%C5%82&rft.date=2024-09-01&rft.issn=2076-3417&rft.eissn=2076-3417&rft.volume=14&rft.issue=18&rft.spage=8099&rft_id=info:doi/10.3390%2Fapp14188099&rft.externalDBID=n%2Fa&rft.externalDocID=10_3390_app14188099
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2076-3417&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2076-3417&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2076-3417&client=summon