{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T04:07:25Z","timestamp":1773979645712,"version":"3.50.1"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,10,6]],"date-time":"2023-10-06T00:00:00Z","timestamp":1696550400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,10,6]],"date-time":"2023-10-06T00:00:00Z","timestamp":1696550400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Mach. Intell."],"published-print":{"date-parts":[[2023,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>To execute quantum circuits on a quantum processor, they must be modified to meet the physical constraints of the quantum device. This process, called <jats:italic>quantum circuit mapping<\/jats:italic>, results in a gate\/circuit depth overhead that depends on both the circuit properties and the hardware constraints, being the limited qubit connectivity a crucial restriction. In this paper, we propose to extend the characterization of quantum circuits by including qubit interaction graph properties using graph theory-based metrics in addition to previously used circuit-describing parameters. This approach allows for an in-depth analysis and clustering of quantum circuits and a comparison of performance when run on different quantum processors, aiding in developing better mapping techniques. Our study reveals a correlation between interaction graph-based parameters and mapping performance metrics for various existing configurations of quantum devices. We also provide a comprehensive collection of quantum circuits and algorithms for benchmarking future compilation techniques and quantum devices.<\/jats:p>","DOI":"10.1007\/s42484-023-00124-1","type":"journal-article","created":{"date-parts":[[2023,10,6]],"date-time":"2023-10-06T15:01:41Z","timestamp":1696604501000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Interaction graph-based characterization of quantum benchmarks for improving quantum circuit mapping techniques"],"prefix":"10.1007","volume":"5","author":[{"given":"Medina","family":"Bandic","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carmen G.","family":"Almudever","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sebastian","family":"Feld","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,6]]},"reference":[{"key":"124_CR1","doi-asserted-by":"publisher","unstructured":"Anis MS et al. (2021) Qiskit: an open-source framework for quantum computing. https:\/\/doi.org\/10.5281\/zenodo.2573505","DOI":"10.5281\/zenodo.2573505"},{"key":"124_CR2","unstructured":"A quadratic unconstrained binary optimization approach for qubit mapping (2023) unpublished, Master Thesis"},{"issue":"3","key":"124_CR3","first-page":"29","volume":"12","author":"T Bahreini","year":"2015","unstructured":"Bahreini T, Mohammadzadeh N (2015) An MINLP model for scheduling and placement of quantum circuits with a heuristic solution approach. J Emerhing Technol Comput 12(3):29","journal-title":"J Emerhing Technol Comput"},{"key":"124_CR4","doi-asserted-by":"crossref","unstructured":"Baker JM, Duckering C, Hoover A, Chong FT (2020) Time-sliced quantum circuit partitioning for modular architectures. In: Proceedings of the 17th ACM International Conference on Computing Frontiers, pp 98\u2013107","DOI":"10.1145\/3387902.3392617"},{"key":"124_CR5","doi-asserted-by":"crossref","unstructured":"Bandic M, Feld S, Almudever CG (2022) Full-stack quantum computing systems in the nisq era: algorithm-driven and hardware-aware compilation techniques. In: 2022 Design, Automation & Test in Europe Conference & Exhibition (DATE),\u00a0IEEE, pp 1\u20136","DOI":"10.23919\/DATE54114.2022.9774643"},{"key":"124_CR6","doi-asserted-by":"crossref","unstructured":"Bandic M, Prielinger L, N\u00fc\u00dflein J, Ovide A, Rodrigo S, Abadal S, van Someren H, Vardoyan G, Alarcon E, Almudever CG, et al (2023) Mapping quantum circuits to modular architectures with QUBO. arXiv preprint\u00a0arXiv:2305.06687","DOI":"10.1109\/QCE57702.2023.00094"},{"key":"124_CR7","doi-asserted-by":"crossref","unstructured":"Bandic M, Zarein H, Alarcon E, Almudever CG (2020) On structured design space exploration for mapping of quantum algorithms. In: 2020 XXXV Conference on Design of Circuits and Integrated Systems (DCIS),\u00a0IEEE, pp 1\u20136","DOI":"10.1109\/DCIS51330.2020.9268670"},{"issue":"1","key":"124_CR8","doi-asserted-by":"publisher","first-page":"015004","DOI":"10.1103\/revmodphys.94.015004","volume":"94","author":"K Bharti","year":"2022","unstructured":"Bharti K, Cervera-Lierta A, Kyaw TH, Haug T, Alperin-Lea S, Anand A, Degroote M, Heimonen H, Kottmann JS, Menke T, Mok W-K, Sim S, Kwek L-C, Aspuru-Guzik A (2022) Noisy intermediate-scale quantum algorithms. Rev Mod Phys 94(1):015004. https:\/\/doi.org\/10.1103\/revmodphys.94.015004","journal-title":"Rev Mod Phys"},{"key":"124_CR9","doi-asserted-by":"publisher","unstructured":"Blume-Kohout R, Young KC (2020) A volumetric framework for quantum computer benchmarks. Quantum 4:362. https:\/\/doi.org\/10.22331\/q-2020-11-15-362","DOI":"10.22331\/q-2020-11-15-362"},{"key":"124_CR10","unstructured":"Cross A (2018) The IBM Q experience and QISKit open-source quantum computing software. In: APS March Meeting Abstracts, vol. 2018, pp 58\u2013003"},{"issue":"3","key":"124_CR11","doi-asserted-by":"publisher","first-page":"032328","DOI":"10.1103\/PhysRevA.100.032328","volume":"100","author":"AW Cross","year":"2019","unstructured":"Cross AW, Bishop LS, Sheldon S, Nation PD, Gambetta JM (2019) Validating quantum computers using randomized model circuits. Phys Rev A 100(3):032328","journal-title":"Phys Rev A"},{"key":"124_CR12","doi-asserted-by":"publisher","unstructured":"Developers, C (n.d.) Cirq. See full list of authors on Github: https:\/\/github.com\/quantumlib\/Cirq\/graphs\/contributors. https:\/\/doi.org\/10.5281\/zenodo.6599601","DOI":"10.5281\/zenodo.6599601"},{"key":"124_CR13","doi-asserted-by":"crossref","unstructured":"Dousti MJ, Pedram M (2012) Minimizing the latency of quantum circuits during mapping to the ion-trap circuit fabric. In: Design Automation and Test in Europe","DOI":"10.1109\/DATE.2012.6176612"},{"key":"124_CR14","unstructured":"Freedman D, Pisani R, Purves R (2007) Statistics (international student edition). Pisani, R. Purves, 4th edn. WW Norton & Company, New York"},{"key":"124_CR15","unstructured":"Guerreschi GG (2019) Scheduler of quantum circuits based on dynamical pattern improvement and its application to hardware design.\u00a0arXiv:1912.00035"},{"issue":"4","key":"124_CR16","doi-asserted-by":"publisher","first-page":"045003","DOI":"10.1088\/2058-9565\/aacf0b","volume":"3","author":"GG Guerreschi","year":"2018","unstructured":"Guerreschi GG, Park J (2018) Two-step approach to scheduling quantum circuits. Quantum Sci Technol 3(4):045003","journal-title":"Quantum Sci Technol"},{"key":"124_CR17","unstructured":"Herbert S, Sengupta A (2018) Using reinforcement learning to find efficient qubit routing policies for deployment in near-term quantum computers. arXiv:1812.11619"},{"key":"124_CR18","unstructured":"Hern\u00e1ndez JM, Van Mieghem P (2011) Classification of graph metrics. Delft University of Technology: Mekelweg, The Netherlands, pp 1\u201320"},{"key":"124_CR19","doi-asserted-by":"crossref","unstructured":"Hillmich S, Zulehner A, Wille R (2021) Exploiting quantum teleportation in quantum circuit mapping. In: 2021 26th Asia and South Pacific Design Automation Conference (ASP-DAC),\u00a0IEEE, pp 792\u2013797","DOI":"10.1145\/3394885.3431604"},{"key":"124_CR20","unstructured":"IBM (n.d.) https:\/\/www.ibm.com\/. Accessed 2022\u201311"},{"key":"124_CR21","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/j.vlsi.2019.10.004","volume":"70","author":"T Itoko","year":"2020","unstructured":"Itoko T, Raymond R, Imamichi T, Matsuo A (2020) Optimization of quantum circuit mapping using gate transformation and commutation. Integration 70:43\u201350","journal-title":"Integration"},{"key":"124_CR22","unstructured":"Jiang H, Deng Y, Xu M (2021) Quantum circuit transformation based on subgraph isomorphism and tabu search.arXiv preprint\u00a0arXiv:2104.05214"},{"key":"124_CR23","unstructured":"JKU: Quantum Circuit Test Set (Zulehner) (2018) JKU"},{"issue":"1","key":"124_CR24","first-page":"1","volume":"18","author":"N Khammassi","year":"2021","unstructured":"Khammassi N, Ashraf I, Someren J, Nane R, Krol A, Rol MA, Lao L, Bertels K, Almudever CG (2021) Openql: a portable quantum programming framework for quantum accelerators. ACM J Emerg Technol Comput Syst (JETC) 18(1):1\u201324","journal-title":"ACM J Emerg Technol Comput Syst (JETC)"},{"key":"124_CR25","doi-asserted-by":"publisher","unstructured":"Lao L, Browne DE (2021a) 2QAN: A quantum compiler for 2-local qubit Hamiltonian simulation algorithms. arXiv. https:\/\/doi.org\/10.48550\/ARXIV.2108.02099. https:\/\/arxiv.org\/abs\/2108.02099","DOI":"10.48550\/ARXIV.2108.02099"},{"key":"124_CR26","doi-asserted-by":"crossref","unstructured":"Lao L, Browne D (2021b) 2qan: a quantum compiler for 2-local qubit hamiltonian simulation algorithms. arXiv preprint\u00a0arXiv:2108.02099","DOI":"10.1145\/3470496.3527394"},{"key":"124_CR27","unstructured":"Lao L, Manzano DM, van Someren H, Ashraf I, Almudever CG (2019b) Mapping of quantum circuits onto NISQ superconducting processors. arXiv preprint\u00a0arXiv:1908.04226"},{"key":"124_CR28","doi-asserted-by":"publisher","unstructured":"Lao L, van Someren H, Ashraf I, Almudever CG (2022) Timing and resource-aware mapping of quantum circuits to superconducting processors. IEEE Trans Comput Aided Des Integr Circuits Syst 41(2):359\u2013371. https:\/\/doi.org\/10.1109\/TCAD.2021.3057583","DOI":"10.1109\/TCAD.2021.3057583"},{"key":"124_CR29","doi-asserted-by":"crossref","unstructured":"Lao L, van Wee B, Ashraf I, van Someren J, Khammassi N, Bertels K, Almudever C (2019a) Mapping of lattice surgery-based quantum circuits on surface code architectures. Quantum Sci Technol 4:015005","DOI":"10.1088\/2058-9565\/aadd1a"},{"key":"124_CR30","doi-asserted-by":"publisher","unstructured":"Last T, Samkharadze N, Eendebak P, Versluis R, Xue X, Sammak A, Brousse D, Loh K, Polinder H, Scappucci G, Veldhorst M, Vandersypen L, Maturov\u00e1 K, Veltin J, Alberts G (2020) Quantum inspire - qutech\u2019s platform for co-development and collaboration in quantum computing. In: Sanchez, M., Panning, E. (eds.) Novel Patterning Technologies for Semiconductors, MEMS\/NEMS and MOEMS 2020. Proceedings of SPIE - The International Society for Optical Engineering, vol. 11324. SPIE, United States. https:\/\/doi.org\/10.1117\/12.2551853","DOI":"10.1117\/12.2551853"},{"key":"124_CR31","volume-title":"OpenQASM Benchmarks Collection","author":"A Li","year":"2019","unstructured":"Li A (2019) OpenQASM Benchmarks Collection. GitHub"},{"key":"124_CR32","unstructured":"Li A, Krishnamoorthy S (2020) Qasmbench: a low-level qasm benchmark suite for nisq evaluation and simulation. arXiv preprint\u00a0arXiv:2005.13018"},{"key":"124_CR33","doi-asserted-by":"crossref","unstructured":"Li G, Ding Y, Xie Y (2019) Tackling the qubit mapping problem for NISQ-era quantum devices. In: International Conference on Architectural Support for Programming Languages and Operating Systems, pp 1001\u20131014","DOI":"10.1145\/3297858.3304023"},{"key":"124_CR34","doi-asserted-by":"crossref","unstructured":"Li G, Ding Y, Xie Y (2020) Towards efficient superconducting quantum processor architecture design. In: Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems, pp 1031\u20131045","DOI":"10.1145\/3373376.3378500"},{"key":"124_CR35","doi-asserted-by":"crossref","unstructured":"Li G, Shi Y, Javadi-Abhari A (2021a) Software-hardware co-optimization for computational chemistry on superconducting quantum processors.arXiv preprint\u00a0arXiv:2105.07127","DOI":"10.1109\/ISCA52012.2021.00070"},{"key":"124_CR36","doi-asserted-by":"publisher","unstructured":"Li S, Zhou X, Feng Y (2021b) Qubit mapping based on subgraph isomorphism and filtered depth-limited search. IEEE Trans Comput 70(11):1777\u20131788. https:\/\/doi.org\/10.1109\/TC.2020.3023247","DOI":"10.1109\/TC.2020.3023247"},{"issue":"2","key":"124_CR37","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1109\/TIT.1982.1056489","volume":"28","author":"S Lloyd","year":"1982","unstructured":"Lloyd S (1982) Least squares quantization in PCM. IEEE Trans Inf Theory 28(2):129\u2013137. https:\/\/doi.org\/10.1109\/TIT.1982.1056489","journal-title":"IEEE Trans Inf Theory"},{"key":"124_CR38","unstructured":"Lubinski T, Johri S, Varosy P, Coleman J, Zhao L, Necaise J, Baldwin CH, Mayer K, Proctor T (2021) Application-oriented performance benchmarks for quantum computing. arXiv preprint\u00a0arXiv:2110.03137"},{"key":"124_CR39","doi-asserted-by":"crossref","unstructured":"Lye A, Wille R, Drechsler R (2015) Determining the minimal number of swap gates for multi-dimensional nearest neighbor quantum circuits. In: Asia and South Pacific Design Automation Conference, pp 178\u2013183","DOI":"10.1109\/ASPDAC.2015.7059001"},{"key":"124_CR40","unstructured":"Microsoft: Microsoft QDK (2020) https:\/\/docs.microsoft.com\/en-us\/quantum\/"},{"key":"124_CR41","doi-asserted-by":"publisher","unstructured":"Mills D, Sivarajah S, Scholten TL, Duncan R (2021) Application-motivated, holistic benchmarking of a full quantum computing stack. Quantum 5:415. https:\/\/doi.org\/10.22331\/q-2021-03-22-415","DOI":"10.22331\/q-2021-03-22-415"},{"key":"124_CR42","doi-asserted-by":"publisher","unstructured":"M\u00f6ller M, Schalkers M (2020) A cross-platform programming framework for quantum-accelerated scientific computing. In: Krzhizhanovskaya VV, Z\u00e1vodszky G, Lees MH, Dongarra JJ, Sloot PMA, Brissos S, Teixeira J (eds) Computational science \u2013 ICCS 2020: 20th International Conference, Amsterdam, The Netherlands, June 3\u20135, 2020, Proceedings, Part VI. Springer International Publishing, Cham, pp 451\u2013464. https:\/\/doi.org\/10.1007\/978-3-030-50433-5_35","DOI":"10.1007\/978-3-030-50433-5_35"},{"key":"124_CR43","doi-asserted-by":"crossref","unstructured":"Murali P, Baker JM, Javadi-Abhari A, Chong FT, Martonosi M (2019a) Noise-adaptive compiler mappings for noisy intermediate-scale quantum computers. In: International Conference on Architectural Support for Programming Languages and Operating Systems, pp 1015\u20131029","DOI":"10.1145\/3297858.3304075"},{"key":"124_CR44","doi-asserted-by":"crossref","unstructured":"Murali P, Linke NM, Martonosi M, Abhari AJ, Nguyen NH, Alderete CH (2019b) Full-stack, real-system quantum computer studies: architectural comparisons and design insights. In: 2019b ACM\/IEEE 46th Annual International Symposium on Computer Architecture (ISCA),\u00a0 IEEE, pp 527\u2013540","DOI":"10.1145\/3307650.3322273"},{"key":"124_CR45","doi-asserted-by":"publisher","unstructured":"Nielsen MA, Chuang I (2002) Quantum computation and quantum information. Am J Phys 70(5):558\u2013559. https:\/\/doi.org\/10.1145\/3386162","DOI":"10.1145\/3386162"},{"key":"124_CR46","doi-asserted-by":"publisher","unstructured":"Nishio S, Pan Y, Satoh T, Amano H, Meter RV (2020) Extracting success from IBM\u2019s 20-qubit machines using error-aware compilation. ACM J Emerg Technol Comput Syst 16(3):1\u201325. https:\/\/doi.org\/10.1119\/1.1463744","DOI":"10.1119\/1.1463744"},{"key":"124_CR47","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TQE.2022.3174017","volume":"3","author":"RW Overwater","year":"2022","unstructured":"Overwater RW, Babaie M, Sebastiano F (2022) Neural-network decoders for quantum error correction using surface codes: a space exploration of the hardware cost-performance tradeoffs. IEEE Transactions on Quantum Engineering 3:1\u201319","journal-title":"IEEE Transactions on Quantum Engineering"},{"key":"124_CR48","unstructured":"Pozzi MG, Herbert SJ, Sengupta A, Mullins RD (2020) Using reinforcement learning to perform qubit routing in quantum compilers. arXiv preprint\u00a0arXiv:2007.15957"},{"key":"124_CR49","unstructured":"qbench benchmark suite (2021) https:\/\/github.com\/QE-Lab\/qbench"},{"key":"124_CR50","unstructured":"QuTech: python quantum inspire benchmarks (n.d.) GitHub"},{"key":"124_CR51","unstructured":"QUTECH: Quantum inspire (2020). https:\/\/www.quantum-inspire.com"},{"key":"124_CR52","unstructured":"Resch S, Karpuzcu UR (2019) Quantum computing: an overview across the system stack.arXiv preprint\u00a0arXiv:1905.07240"},{"key":"124_CR53","unstructured":"Rigetti (n.d.) https:\/\/medium.com\/rigetti\/. Accessed 2022\u201311"},{"key":"124_CR54","doi-asserted-by":"publisher","unstructured":"Rousseeuw PJ (1987) Silhouettes: a graphical aid to the interpretation and validation of cluster analysis. J Comput Appl Math 20:53\u201365. https:\/\/doi.org\/10.1016\/0377-0427(87)90125-7","DOI":"10.1016\/0377-0427(87)90125-7"},{"key":"124_CR55","doi-asserted-by":"crossref","unstructured":"Siraichi MY, Santos VFd, Collange S, Pereira FMQ (2018) Qubit allocation. In: International Symposium on Code Generation and Optimization, pp 113\u2013125","DOI":"10.1145\/3168822"},{"issue":"1","key":"124_CR56","doi-asserted-by":"publisher","first-page":"014003","DOI":"10.1088\/2058-9565\/ab8e92","volume":"6","author":"S Sivarajah","year":"2020","unstructured":"Sivarajah S, Dilkes S, Cowtan A, Simmons W, Edgington A, Duncan R (2020) t\u202f: a retargetable compiler for NISQ devices. Quantum Sci Technol 6(1):014003. https:\/\/doi.org\/10.1088\/2058-9565\/ab8e92","journal-title":"Quantum Sci Technol"},{"key":"124_CR57","unstructured":"Smith RS, Curtis MJ, Zeng WJ (2016) A practical quantum instruction set architecture"},{"key":"124_CR58","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TQE.2022.3160015","volume":"3","author":"MA Steinberg","year":"2022","unstructured":"Steinberg MA, Feld S, Almudever CG, Marthaler M, Reiner J-M (2022) Topological-graph dependencies and scaling properties of a heuristic qubit-assignment algorithm. IEEE Trans Quantum Eng 3:1\u201314. https:\/\/doi.org\/10.1109\/TQE.2022.3160015","journal-title":"IEEE Trans Quantum Eng"},{"key":"124_CR59","doi-asserted-by":"crossref","unstructured":"Tan B, Cong J (2021) Optimal qubit mapping with simultaneous gate absorption. arXiv preprint\u00a0arXiv:2109.06445","DOI":"10.1109\/ICCAD51958.2021.9643554"},{"key":"124_CR60","doi-asserted-by":"crossref","unstructured":"Tannu SS, Qureshi MK (2019) Not all qubits are created equal: a case for variability-aware policies for NISQ-era quantum computers. In: International Conference on Architectural Support for Programming Languages and Operating Systems, pp 987\u2013999","DOI":"10.1145\/3297858.3304007"},{"key":"124_CR61","doi-asserted-by":"crossref","unstructured":"Tomesh T, Gokhale P, Omole V, Ravi GS, Smith KN, Viszlai J, Wu X-C, Hardavellas N, Martonosi MR, Chong FT (2022) Supermarq: a scalable quantum benchmark suite. In: 2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA),\u00a0 IEEE, pp 587\u2013603","DOI":"10.1109\/HPCA53966.2022.00050"},{"key":"124_CR62","unstructured":"UCLA: QUEKO benchmark (2020) UCLA"},{"key":"124_CR63","volume-title":"OpenQl Random circuits","author":"D Valada","year":"2020","unstructured":"Valada D (2020) OpenQl Random circuits. GitHub"},{"key":"124_CR64","unstructured":"Venturelli D, Do M, O\u2019Gorman B, Frank J, Rieffel E, Booth KE, Nguyen T, Narayan P, Nanda S (2019) Quantum circuit compilation: an emerging application for automated reasoning. In:\u00a0Proceedings of the Scheduling and Planning Applications Workshop (SPARK)"},{"issue":"2","key":"124_CR65","doi-asserted-by":"publisher","first-page":"025004","DOI":"10.1088\/2058-9565\/aaa331","volume":"3","author":"D Venturelli","year":"2018","unstructured":"Venturelli D, Do M, Rieffel E, Frank J (2018) Compiling quantum circuits to realistic hardware architectures using temporal planners. Quantum Sci Technol 3(2):025004","journal-title":"Quantum Sci Technol"},{"key":"124_CR66","doi-asserted-by":"crossref","unstructured":"Wille R, Gro\u00dfe D, Teuber L, Dueck GW, Drechsler R (2008) Revlib: an online resource for reversible functions and reversible circuits. In: 38th International Symposium on Multiple Valued Logic (ismvl 2008), IEEE, pp 220\u2013225","DOI":"10.1109\/ISMVL.2008.43"},{"key":"124_CR67","doi-asserted-by":"crossref","unstructured":"Wille R, Keszocze O, Walter M, Rohrs P, Chattopadhyay A, Drechsler R (2016) Look-ahead schemes for nearest neighbor optimization of 1D and 2D quantum circuits. In: Asia and South Pacific Design Automation Conference, pp 292\u2013297","DOI":"10.1109\/ASPDAC.2016.7428026"},{"key":"124_CR68","doi-asserted-by":"crossref","unstructured":"Zulehner A, Paler A, Wille R (2018) An efficient methodology for mapping quantum circuits to the IBM QX architectures. IEEE Trans Comput-Aided Des Integr Circ Syst","DOI":"10.23919\/DATE.2018.8342181"}],"container-title":["Quantum Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-023-00124-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42484-023-00124-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-023-00124-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,18]],"date-time":"2023-12-18T10:03:53Z","timestamp":1702893833000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42484-023-00124-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,6]]},"references-count":68,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2023,12]]}},"alternative-id":["124"],"URL":"https:\/\/doi.org\/10.1007\/s42484-023-00124-1","relation":{},"ISSN":["2524-4906","2524-4914"],"issn-type":[{"value":"2524-4906","type":"print"},{"value":"2524-4914","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,10,6]]},"assertion":[{"value":"15 March 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 July 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 October 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"40"}}