{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,30]],"date-time":"2026-01-30T02:13:56Z","timestamp":1769739236743,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":39,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T00:00:00Z","timestamp":1715040000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,5,7]]},"DOI":"10.1145\/3649153.3649184","type":"proceedings-article","created":{"date-parts":[[2024,7,2]],"date-time":"2024-07-02T10:21:29Z","timestamp":1719915689000},"page":"224-231","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Reconstructing Cut Quantum Circuits Maximising Fidelity between Quantum States"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-1983-8258","authenticated-orcid":false,"given":"Michael","family":"Hart","sequence":"first","affiliation":[{"name":"Queen's University Belfast, Belfast, United Kingdom"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4017-115X","authenticated-orcid":false,"given":"John","family":"McAllister","sequence":"additional","affiliation":[{"name":"Queen's University Belfast, Belfast, United Kingdom"}]}],"member":"320","published-online":{"date-parts":[[2024,7,2]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"A. Anuj G. Uchehara and M. Medvidovi\u0107. 2022. Quantum Circuit Cutting. https:\/\/pennylane.ai\/qml\/demos\/tutorial_quantum_circuit_cutting\/ Last accessed on 22\/11\/2023."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Marvin Bechtold Johanna Barzen Frank Leymann and Alexander Mandl. 2023. Circuit Cutting with Non-Maximally Entangled States. arXiv:2306.12084 [quant-ph]","DOI":"10.1109\/IPDPSW63119.2024.00185"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature23474"},{"key":"e_1_3_2_1_5_1","unstructured":"L. Bottou. 1998. Online Learning and Stochastic Approximations. https:\/\/api.semanticscholar.org\/CorpusID:2101184"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"H. P. Breuer and F. Petruccione. 2002. The Theory of Open Quantum Systems. Oxford University Press London.","DOI":"10.1007\/3-540-44874-8_4"},{"key":"e_1_3_2_1_7_1","volume-title":"Briegel","author":"Browne Dan E.","year":"2006","unstructured":"Dan E. Browne and Hans J. Briegel. 2006. One-way Quantum Computation - a tutorial introduction. arXiv:quant-ph\/0603226 [quant-ph]"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Daniel Chen Betis Baheri Vipin Chaudhary Qiang Guan Ning Xie and Shuai Xu. 2022. Approximate Quantum Circuit Cutting. arXiv:2212.01270 [quant-ph]","DOI":"10.1109\/QCE53715.2022.00073"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.59.4249"},{"key":"e_1_3_2_1_10_1","unstructured":"Atom Computing. 2023. Quantum startup Atom Computing first to exceed 1 000 qubits. https:\/\/atom-computing.com\/quantum-startup-atom-computing-first-to-exceed-1000-qubits\/?fbclid=PAAaZgQf245Liom_A9X_76nBa4jSb5cM6-Nlu9iVf3Il5PGW81-_TPN829B8g_aem_AXjOsGuvIX3sf6p3E0UVuwoYyBhje24S1zn7TMJlIPX72y6KfhobogtRp1yfgjEz8zQ Last accessed on 24\/10\/2023."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1943-07818-4"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRev.47.777"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1214\/ss"},{"key":"e_1_3_2_1_15_1","unstructured":"Daniel M. Greenberger Michael A. Horne and Anton Zeilinger. 2007. Going Beyond Bell's Theorem. arXiv:0712.0921 [quant-ph]"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.79.325"},{"key":"e_1_3_2_1_17_1","unstructured":"IBM. 2023. Charting the course to 100 000 qubits. https:\/\/research.ibm.com\/blog\/100k-qubit-supercomputer Last accessed on 17\/11\/2023."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1080\/09500349414552171"},{"key":"e_1_3_2_1_19_1","volume-title":"Kingma and Jimmy Ba","author":"Diederik","year":"2017","unstructured":"Diederik P. Kingma and Jimmy Ba. 2017. Adam: A Method for Stochastic Optimization. arXiv:1412.6980 [cs.LG]"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1038\/nchem.483"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","unstructured":"C. Lemar\u00e9chal. 2012. Cauchy and the gradient method. 251---254 pages. https:\/\/doi.org\/10.4171\/DMS\/6\/27","DOI":"10.4171\/DMS"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1103\/RevModPhys.92.015003"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1038\/npjqi.2015.23"},{"key":"e_1_3_2_1_24_1","unstructured":"M. Nielsen and I. Chuang. 2009. Quantum Computation and Quantum Information. Cambridge University Press London."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1103\/physrevlett.125.150504"},{"key":"e_1_3_2_1_26_1","volume-title":"Perlin et al","author":"Michael","year":"2020","unstructured":"Michael A. Perlin et al. 2020. Quantum Circuit Cutting with Maximum Likelihood Tomography."},{"key":"e_1_3_2_1_27_1","volume-title":"Osborn","author":"Perlin Michael A.","year":"2021","unstructured":"Michael A. Perlin, Zain H. Saleem, Martin Suchara, and James C. Osborn. 2021. Quantum Circuit Cutting with Maximum Likelihood Tomography. arXiv:2005.12702 [quant-ph]"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"John Preskill. 2023. Quantum computing 40 years later. arXiv:2106.10522 [quant-ph]","DOI":"10.1201\/9781003358817-7"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1080\/09500340110107487"},{"key":"e_1_3_2_1_30_1","unstructured":"Sebastian Ruder. 2017. An overview of gradient descent optimization algorithms. arXiv:1609.04747 [cs.LG]"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1038\/323533a0"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2015.374"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/s0097539795293172"},{"key":"e_1_3_2_1_34_1","unstructured":"Wei Tang and Margaret Martonosi. 2022. ScaleQC: A Scalable Framework for Hybrid Computation on Quantum and Classical Processors. arXiv:2207.00933[cs.ET]"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3445814.3446758"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"crossref","unstructured":"Gideon Uchehara Tor M. Aamodt and Olivia Di Matteo. 2022. Rotation-inspired circuit cut optimization. arXiv:2211.07358 [quant-ph]","DOI":"10.1109\/QCS56647.2022.00011"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1103\/physreva.94.052325"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.40.4277"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1098\/rstl.1802.0004"}],"event":{"name":"CF '24: 21st ACM International Conference on Computing Frontiers","location":"Ischia Italy","acronym":"CF '24","sponsor":["SIGMICRO ACM Special Interest Group on Microarchitectural Research and Processing"]},"container-title":["Proceedings of the 21st ACM International Conference on Computing Frontiers"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649153.3649184","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3649153.3649184","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T22:50:02Z","timestamp":1750287002000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649153.3649184"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,7]]},"references-count":39,"alternative-id":["10.1145\/3649153.3649184","10.1145\/3649153"],"URL":"https:\/\/doi.org\/10.1145\/3649153.3649184","relation":{},"subject":[],"published":{"date-parts":[[2024,5,7]]},"assertion":[{"value":"2024-07-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}