{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,25]],"date-time":"2026-04-25T08:36:34Z","timestamp":1777106194656,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,5,7]],"date-time":"2017-05-07T00:00:00Z","timestamp":1494115200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,5,7]]},"DOI":"10.1145\/3102980.3102993","type":"proceedings-article","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T17:51:38Z","timestamp":1500573098000},"page":"76-81","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Quantum Operating Systems"],"prefix":"10.1145","author":[{"given":"Henry","family":"Corrigan-Gibbs","sequence":"first","affiliation":[{"name":"Stanford University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David J.","family":"Wu","sequence":"additional","affiliation":[{"name":"Stanford University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Boneh","sequence":"additional","affiliation":[{"name":"Stanford University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,5,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1038\/scientificamerican0308-62"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1038\/nphys3272"},{"key":"e_1_3_2_1_3_1","volume-title":"A simple proof that Toffoli and Hadamard are quantum universal. arXiv preprint quant-ph\/0301040","author":"Aharonov Dorit","year":"2003","unstructured":"Dorit Aharonov . 2003. A simple proof that Toffoli and Hadamard are quantum universal. arXiv preprint quant-ph\/0301040 ( 2003 ). Dorit Aharonov. 2003. A simple proof that Toffoli and Hadamard are quantum universal. arXiv preprint quant-ph\/0301040 (2003)."},{"key":"e_1_3_2_1_4_1","volume-title":"A quantum algorithm for finding the maximum. arXiv preprint quant-ph\/9911082","author":"Ahuja Ashish","year":"1999","unstructured":"Ashish Ahuja and Sanjiv Kapoor . 1999. A quantum algorithm for finding the maximum. arXiv preprint quant-ph\/9911082 ( 1999 ). Ashish Ahuja and Sanjiv Kapoor. 1999. A quantum algorithm for finding the maximum. arXiv preprint quant-ph\/9911082 (1999)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/3081738.3081751"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/992287.992296"},{"key":"e_1_3_2_1_7_1","volume-title":"Martinis","author":"Barends R.","year":"2014","unstructured":"R. Barends , J. Kelly , A. Megrant , A. Veitia , D. Sank , E. Jeffrey , T. C. White , J. Mutus , A. G. Fowler , B. Campbell , Y. Chen , Z. Chen , B. Chiaro , A. Dunsworth , C. Neill , P. O\/' Malley , P. Roushan , A. Vainsencher , J. Wenner , A. N. Korotkov , A. N. Cleland , and John M . Martinis . 2014 . Superconducting quantum circuits at the surface code threshold for fault tolerance. Nature 508, 7497 (04 2014), 500--503. R. Barends, J. Kelly, A. Megrant, A. Veitia, D. Sank, E. Jeffrey, T. C. White, J. Mutus, A. G. Fowler, B. Campbell, Y. Chen, Z. Chen, B. Chiaro, A. Dunsworth, C. Neill, P. O\/'Malley, P. Roushan, A. Vainsencher, J. Wenner, A. N. Korotkov, A. N. Cleland, and John M. Martinis. 2014. Superconducting quantum circuits at the surface code threshold for fault tolerance. Nature 508, 7497 (04 2014), 500--503."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060662"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.176.0525"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796300933"},{"key":"e_1_3_2_1_11_1","volume-title":"Quantum Cryptography: Public Key Distribution and Coin Tossing. In International Conference on Computers, Systems & Signal Processing.","author":"Charles","unstructured":"Charles H. Bennett and Gilles Brassard. 1984 . Quantum Cryptography: Public Key Distribution and Coin Tossing. In International Conference on Computers, Systems & Signal Processing. Charles H. Bennett and Gilles Brassard. 1984. Quantum Cryptography: Public Key Distribution and Coin Tossing. In International Conference on Computers, Systems & Signal Processing."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.69.2881"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-88702-7_1"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796300921"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/EuroSP.2016.31"},{"key":"e_1_3_2_1_16_1","unstructured":"Dan Boneh Henry Corrigan-Gibbs and Stuart Schechter. 2016. Balloon Hashing: a Provably Memory-Hard Function with a Data-Independent Access Pattern. In ASIACRYPT.  Dan Boneh Henry Corrigan-Gibbs and Stuart Schechter. 2016. Balloon Hashing: a Provably Memory-Hard Function with a Data-Independent Access Pattern. In ASIACRYPT."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2012.49"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2012.44"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1521-3978(199806)46:4\/5<493::AID-PROP493>3.0.CO;2-P"},{"key":"e_1_3_2_1_20_1","volume-title":"Experimenting with Post-Quantum Cryptography. https:\/\/security.googleblog.com\/2016\/07\/experimenting-with-post-quantum.html. (July 7","author":"Braithwaite Matt","year":"2016","unstructured":"Matt Braithwaite . 2016. Experimenting with Post-Quantum Cryptography. https:\/\/security.googleblog.com\/2016\/07\/experimenting-with-post-quantum.html. (July 7 , 2016 ). Accessed 21 January 2017. Matt Braithwaite. 2016. Experimenting with Post-Quantum Cryptography. https:\/\/security.googleblog.com\/2016\/07\/experimenting-with-post-quantum.html. (July 7, 2016). Accessed 21 January 2017."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0055105"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1412700.1412717"},{"key":"e_1_3_2_1_23_1","first-page":"7635","article-title":"Quantum computers ready to leap out of the lab in 2017","volume":"541","author":"Castelvecchi Davide","year":"2016","unstructured":"Davide Castelvecchi . 2016 . Quantum computers ready to leap out of the lab in 2017 . Nature News 541 , 7635 (January 3, 2016). Davide Castelvecchi. 2016. Quantum computers ready to leap out of the lab in 2017. Nature News 541, 7635 (January 3, 2016).","journal-title":"Nature News"},{"key":"e_1_3_2_1_24_1","volume-title":"Google's Quantum Dream May Be Just Around the Corner. https:\/\/www.technologyreview.com\/s\/602283\/googles-quantum-dream-may-be-just-around-the-corner\/. (September 1","author":"Condliffe Jamie","year":"2016","unstructured":"Jamie Condliffe . 2016. Google's Quantum Dream May Be Just Around the Corner. https:\/\/www.technologyreview.com\/s\/602283\/googles-quantum-dream-may-be-just-around-the-corner\/. (September 1 2016 ). Jamie Condliffe. 2016. Google's Quantum Dream May Be Just Around the Corner. https:\/\/www.technologyreview.com\/s\/602283\/googles-quantum-dream-may-be-just-around-the-corner\/. (September 1 2016)."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.510000"},{"key":"e_1_3_2_1_26_1","volume-title":"CVE-2014-3570: Bignum squaring may produce incorrect results. (May","year":"2014","unstructured":"CVE-2014-3570 2014. CVE-2014-3570: Bignum squaring may produce incorrect results. (May 2014 ). CVE-2014-3570 2014. CVE-2014-3570: Bignum squaring may produce incorrect results. (May 2014)."},{"key":"e_1_3_2_1_27_1","unstructured":"Jeffrey Dean and Sanjay Ghemawat. 2004. MapReduce: Simplified Data Processing on Large Clusters. In OSDI. 137--150.  Jeffrey Dean and Sanjay Ghemawat. 2004. MapReduce: Simplified Data Processing on Large Clusters. In OSDI. 137--150."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1327452.1327492"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"S. Debnath N. M. Linke C. Figgatt K. A. Landsman K. Wright and C. Monroe. 2016. Demonstration of a small programmable quantum computer with atomic qubits. Nature 536 7614 (08 2016) 63--66.  S. Debnath N. M. Linke C. Figgatt K. A. Landsman K. Wright and C. Monroe. 2016. Demonstration of a small programmable quantum computer with atomic qubits. Nature 536 7614 (08 2016) 63--66.","DOI":"10.1038\/nature18648"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1992.0167"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/0375-9601(82)90084-6"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02650179"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-45608-8_16"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.100.160501"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237866"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1147\/rd.53.0183"},{"key":"e_1_3_2_1_37_1","volume-title":"How IBM's new five-qubit universal quantum computer works. https:\/\/arstechnica.com\/science\/2016\/05\/how-ibms-new-five-qubit-universal-quantum-computer-works\/. (May 4","author":"Lee Chris","year":"2016","unstructured":"Chris Lee . 2016. How IBM's new five-qubit universal quantum computer works. https:\/\/arstechnica.com\/science\/2016\/05\/how-ibms-new-five-qubit-universal-quantum-computer-works\/. (May 4 2016 ). Chris Lee. 2016. How IBM's new five-qubit universal quantum computer works. https:\/\/arstechnica.com\/science\/2016\/05\/how-ibms-new-five-qubit-universal-quantum-computer-works\/. (May 4 2016)."},{"key":"e_1_3_2_1_38_1","volume-title":"Quantum algorithms for supervised and unsupervised machine learning. arXiv preprint arXiv:1307.0411","author":"Lloyd Seth","year":"2013","unstructured":"Seth Lloyd , Masoud Mohseni , and Patrick Rebentrost . 2013. Quantum algorithms for supervised and unsupervised machine learning. arXiv preprint arXiv:1307.0411 ( 2013 ). Seth Lloyd, Masoud Mohseni, and Patrick Rebentrost. 2013. Quantum algorithms for supervised and unsupervised machine learning. arXiv preprint arXiv:1307.0411 (2013)."},{"key":"e_1_3_2_1_39_1","volume-title":"Microsoft Lattice Cryptography Library. https:\/\/www.microsoft.com\/en-us\/research\/project\/lattice-cryptography-library\/. (April 19","author":"Microsoft","year":"2016","unstructured":"Microsoft 2016. Microsoft Lattice Cryptography Library. https:\/\/www.microsoft.com\/en-us\/research\/project\/lattice-cryptography-library\/. (April 19 , 2016 ). Accessed 21 January 2017. Microsoft 2016. Microsoft Lattice Cryptography Library. https:\/\/www.microsoft.com\/en-us\/research\/project\/lattice-cryptography-library\/. (April 19, 2016). Accessed 21 January 2017."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/359168.359172"},{"key":"e_1_3_2_1_41_1","unstructured":"National Institute of Standards and Technology. 2016. Post-Quantum Crypto Project. http:\/\/csrc.nist.gov\/groups\/ST\/post-quantum-crypto\/. (December 15 2016). Accessed 21 January 2017.  National Institute of Standards and Technology. 2016. Post-Quantum Crypto Project. http:\/\/csrc.nist.gov\/groups\/ST\/post-quantum-crypto\/. (December 15 2016). Accessed 21 January 2017."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"crossref","unstructured":"Nissim Ofek Andrei Petrenko Reinier Heeres Philip Reinhold Zaki Leghtas Brian Vlastakis Yehan Liu Luigi Frunzio SM Girvin L Jiang etal 2016. Extending the lifetime of a quantum bit with error correction in superconducting circuits. Nature (2016).  Nissim Ofek Andrei Petrenko Reinier Heeres Philip Reinhold Zaki Leghtas Brian Vlastakis Yehan Liu Luigi Frunzio SM Girvin L Jiang et al. 2016. Extending the lifetime of a quantum bit with error correction in superconducting circuits. Nature (2016).","DOI":"10.1038\/nature18949"},{"key":"e_1_3_2_1_43_1","unstructured":"Colin Percival. 2009. Stronger key derivation via sequential memory-hard functions. In BSDCan.  Colin Percival. 2009. Stronger key derivation via sequential memory-hard functions. In BSDCan."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795293172"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796298637"},{"key":"e_1_3_2_1_46_1","volume-title":"Resource hints. https:\/\/www.w3.org\/TR\/resource-hints\/#prefetch. (Dec","author":"C.","year":"2016","unstructured":"W3 C. 2016. Resource hints. https:\/\/www.w3.org\/TR\/resource-hints\/#prefetch. (Dec . 2016 ). Accessed 21 January 2017. W3C. 2016. Resource hints. https:\/\/www.w3.org\/TR\/resource-hints\/#prefetch. (Dec. 2016). Accessed 21 January 2017."},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/321796.321811"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1038\/299802a0"}],"event":{"name":"HotOS '17: Workshop on Hot Topics in Operating Systems","location":"Whistler BC Canada","acronym":"HotOS '17","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems"]},"container-title":["Proceedings of the 16th Workshop on Hot Topics in Operating Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3102980.3102993","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3102980.3102993","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:37:06Z","timestamp":1750217826000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3102980.3102993"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,5,7]]},"references-count":48,"alternative-id":["10.1145\/3102980.3102993","10.1145\/3102980"],"URL":"https:\/\/doi.org\/10.1145\/3102980.3102993","relation":{},"subject":[],"published":{"date-parts":[[2017,5,7]]},"assertion":[{"value":"2017-05-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}