{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,25]],"date-time":"2026-02-25T17:08:39Z","timestamp":1772039319608,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":19,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,10,1]],"date-time":"2022-10-01T00:00:00Z","timestamp":1664582400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100002418","name":"Intel Corporation","doi-asserted-by":"publisher","award":["Gift"],"award-info":[{"award-number":["Gift"]}],"id":[{"id":"10.13039\/100002418","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CNS-1814710, DGE-1821766, CNS-2129675, CCF-2210963, DGE-2113839, ITE-2040667"],"award-info":[{"award-number":["CNS-1814710, DGE-1821766, CNS-2129675, CCF-2210963, DGE-2113839, ITE-2040667"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1145\/3569562.3569569","type":"proceedings-article","created":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T04:09:08Z","timestamp":1695355748000},"page":"45-52","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":18,"title":["Robust and Secure Hybrid Quantum-Classical Computation on Untrusted Cloud-Based Quantum Hardware"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3874-3937","authenticated-orcid":false,"given":"Suryansh","family":"Upadhyay","sequence":"first","affiliation":[{"name":"Penn State, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8753-490X","authenticated-orcid":false,"given":"Swaroop","family":"Ghosh","sequence":"additional","affiliation":[{"name":"Penn State, USA"}]}],"member":"320","published-online":{"date-parts":[[2023,9,21]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Qiskit: An open-source framework for quantum computing","author":"Abraham H\u00e9ctor","year":"2019","unstructured":"H\u00e9ctor Abraham , Ismail\u00a0Yunus Akhalwaya , Gadi Aleksandrowicz , Thomas Alexander , G Alexandrowics , E Arbel , A Asfaw , C Azaustre , P Barkoutsos , G Barron , 2019 . Qiskit: An open-source framework for quantum computing , 2019. URL https:\/\/doi. org\/10.5281\/zenodo 2562110 (2019). H\u00e9ctor Abraham, Ismail\u00a0Yunus Akhalwaya, Gadi Aleksandrowicz, Thomas Alexander, G Alexandrowics, E Arbel, A Asfaw, C Azaustre, P Barkoutsos, G Barron, 2019. Qiskit: An open-source framework for quantum computing, 2019. URL https:\/\/doi. org\/10.5281\/zenodo 2562110 (2019)."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3400302.3415684"},{"key":"e_1_3_2_1_3_1","unstructured":"Fernando\u00a0GSL Brandao Michael Broughton Edward Farhi Sam Gutmann and Hartmut Neven. 2018. For fixed control parameters the quantum approximate optimization algorithm\u2019s objective function value concentrates for typical instances. arXiv preprint arXiv:1812.04170(2018).  Fernando\u00a0GSL Brandao Michael Broughton Edward Farhi Sam Gutmann and Hartmut Neven. 2018. For fixed control parameters the quantum approximate optimization algorithm\u2019s objective function value concentrates for typical instances. arXiv preprint arXiv:1812.04170(2018)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1147\/JRD.2018.2888987"},{"key":"e_1_3_2_1_5_1","volume-title":"Computing","author":"Q.","year":"2021","unstructured":"C.\u00a0 Q. Computing . 2021 . pytket. (2021). C.\u00a0Q. Computing. 2021. pytket. (2021)."},{"key":"e_1_3_2_1_6_1","unstructured":"Zapata Computing. 2021. Orquestra. (2021).  Zapata Computing. 2021. Orquestra. (2021)."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41567-019-0648-8"},{"key":"e_1_3_2_1_8_1","unstructured":"Edward Farhi Jeffrey Goldstone and Sam Gutmann. 2014. A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028(2014).  Edward Farhi Jeffrey Goldstone and Sam Gutmann. 2014. A quantum approximate optimization algorithm. arXiv preprint arXiv:1411.4028(2014)."},{"key":"e_1_3_2_1_9_1","volume-title":"QAOA for Max-Cut requires hundreds of qubits for quantum speed-up. Scientific reports 9, 1","author":"Guerreschi Gian\u00a0Giacomo","year":"2019","unstructured":"Gian\u00a0Giacomo Guerreschi and Anne\u00a0 Y Matsuura . 2019. QAOA for Max-Cut requires hundreds of qubits for quantum speed-up. Scientific reports 9, 1 ( 2019 ), 1\u20137. Gian\u00a0Giacomo Guerreschi and Anne\u00a0Y Matsuura. 2019. QAOA for Max-Cut requires hundreds of qubits for quantum speed-up. Scientific reports 9, 1 (2019), 1\u20137."},{"key":"e_1_3_2_1_10_1","volume-title":"Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets. Nature 549, 7671","author":"Kandala Abhinav","year":"2017","unstructured":"Abhinav Kandala , Antonio Mezzacapo , Kristan Temme , Maika Takita , Markus Brink , Jerry\u00a0 M Chow , and Jay\u00a0 M Gambetta . 2017. Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets. Nature 549, 7671 ( 2017 ), 242\u2013246. Abhinav Kandala, Antonio Mezzacapo, Kristan Temme, Maika Takita, Markus Brink, Jerry\u00a0M Chow, and Jay\u00a0M Gambetta. 2017. Hardware-efficient variational quantum eigensolver for small molecules and quantum magnets. Nature 549, 7671 (2017), 242\u2013246."},{"key":"e_1_3_2_1_11_1","volume-title":"Complexity of computer computations","author":"Karp M","unstructured":"Richard\u00a0 M Karp . 1972. Reducibility among combinatorial problems . In Complexity of computer computations . Springer , 85\u2013103. Richard\u00a0M Karp. 1972. Reducibility among combinatorial problems. In Complexity of computer computations. Springer, 85\u2013103."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62233"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/JETCAS.2021.3077024"},{"key":"e_1_3_2_1_14_1","volume-title":"Split Compilation for Security of Quantum Circuits. In 2021 IEEE\/ACM International Conference On Computer Aided Design (ICCAD). IEEE, 1\u20137.","author":"Saki Abdullah\u00a0Ash","year":"2021","unstructured":"Abdullah\u00a0Ash Saki , Aakarshitha Suresh , Rasit\u00a0Onur Topaloglu , and Swaroop Ghosh . 2021 . Split Compilation for Security of Quantum Circuits. In 2021 IEEE\/ACM International Conference On Computer Aided Design (ICCAD). IEEE, 1\u20137. Abdullah\u00a0Ash Saki, Aakarshitha Suresh, Rasit\u00a0Onur Topaloglu, and Swaroop Ghosh. 2021. Split Compilation for Security of Quantum Circuits. In 2021 IEEE\/ACM International Conference On Computer Aided Design (ICCAD). IEEE, 1\u20137."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1088\/2058-9565\/ab9acb"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Aakarshitha Suresh Abdullah\u00a0Ash Saki Mahabubul Alam Dr Ghosh 2021. A quantum circuit obfuscation methodology for security and privacy. arXiv preprint arXiv:2104.05943(2021).  Aakarshitha Suresh Abdullah\u00a0Ash Saki Mahabubul Alam Dr Ghosh 2021. A quantum circuit obfuscation methodology for security and privacy. arXiv preprint arXiv:2104.05943(2021).","DOI":"10.1145\/3505253.3505260"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Swamit\u00a0S Tannu and Moinuddin Qureshi. 2019. Ensemble of diverse mappings: Improving reliability of quantum computers by orchestrating dissimilar mistakes. (2019) 253\u2013265.  Swamit\u00a0S Tannu and Moinuddin Qureshi. 2019. Ensemble of diverse mappings: Improving reliability of quantum computers by orchestrating dissimilar mistakes. (2019) 253\u2013265.","DOI":"10.1145\/3352460.3358257"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.94.022309"},{"key":"e_1_3_2_1_19_1","article-title":"Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices","author":"Zhou Leo","year":"2020","unstructured":"Leo Zhou , Sheng-Tao Wang , Soonwon Choi , Hannes Pichler , and Mikhail\u00a0 D Lukin . 2020 . Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices . Physical Review X 10, 2 (2020), 021067. Leo Zhou, Sheng-Tao Wang, Soonwon Choi, Hannes Pichler, and Mikhail\u00a0D Lukin. 2020. Quantum approximate optimization algorithm: Performance, mechanism, and implementation on near-term devices. Physical Review X 10, 2 (2020), 021067.","journal-title":"Physical Review"}],"event":{"name":"HASP '22: Hardware and Architectural Support for Security and Privacy","location":"Chicago IL USA","acronym":"HASP '22"},"container-title":["Proceedings of the 11th International Workshop on Hardware and Architectural Support for Security and Privacy"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3569562.3569569","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3569562.3569569","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3569562.3569569","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T17:48:57Z","timestamp":1750182537000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3569562.3569569"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10]]},"references-count":19,"alternative-id":["10.1145\/3569562.3569569","10.1145\/3569562"],"URL":"https:\/\/doi.org\/10.1145\/3569562.3569569","relation":{},"subject":[],"published":{"date-parts":[[2022,10]]},"assertion":[{"value":"2023-09-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}