{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T22:00:24Z","timestamp":1781906424293,"version":"3.54.5"},"reference-count":35,"publisher":"National Academy of Sciences","issue":"13","license":[{"start":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T00:00:00Z","timestamp":1490054400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.pnas.org\/site\/misc\/userlicense.xhtml"}],"funder":[{"name":"IARPA LogiQ Program","award":["3130638"],"award-info":[{"award-number":["3130638"]}]},{"name":"AFOSR MURI Program","award":["5710003628"],"award-info":[{"award-number":["5710003628"]}]},{"name":"NSF Physics Frontier Centers","award":["PHY0822671"],"award-info":[{"award-number":["PHY0822671"]}]}],"content-domain":{"domain":["www.pnas.org"],"crossmark-restriction":true},"short-container-title":["Proc. Natl. Acad. Sci. U.S.A."],"published-print":{"date-parts":[[2017,3,28]]},"abstract":"<jats:title>Significance<\/jats:title>\n                  <jats:p>Quantum computers are an emerging technology promising to be vastly more powerful at solving certain problems than any conventional computer. These devices are now moving out of the laboratory and becoming generally programmable. This allows identical quantum tasks or algorithms to be implemented on radically different technologies to inform further development and scaling. We run a series of algorithms on the two leading platforms: trapped atomic ions and superconducting circuits. Whereas the superconducting system offers faster gate clock speeds and a solid-state platform, the ion-trap system features superior qubits and reconfigurable connections. The performance of these systems is seen to reflect the topology of connections in the base hardware, supporting the idea that quantum computer applications and hardware should be codesigned.<\/jats:p>","DOI":"10.1073\/pnas.1618020114","type":"journal-article","created":{"date-parts":[[2017,3,21]],"date-time":"2017-03-21T20:40:44Z","timestamp":1490128844000},"page":"3305-3310","update-policy":"https:\/\/doi.org\/10.1073\/pnas.cm10313","source":"Crossref","is-referenced-by-count":409,"title":["Experimental comparison of two quantum computing architectures"],"prefix":"10.1073","volume":"114","author":[{"given":"Norbert M.","family":"Linke","sequence":"first","affiliation":[{"name":"Joint Quantum Institute, Department of Physics, University of Maryland, College Park, MD 20742;"},{"name":"Joint Center for Quantum Information and Computer Science, University of Maryland, College Park, MD 20742;"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Dmitri","family":"Maslov","sequence":"additional","affiliation":[{"name":"National Science Foundation, Arlington, VA 22230;"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Martin","family":"Roetteler","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA 98052;"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shantanu","family":"Debnath","sequence":"additional","affiliation":[{"name":"Joint Quantum Institute, Department of Physics, University of Maryland, College Park, MD 20742;"},{"name":"Joint Center for Quantum Information and Computer Science, University of Maryland, College Park, MD 20742;"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Caroline","family":"Figgatt","sequence":"additional","affiliation":[{"name":"Joint Quantum Institute, Department of Physics, University of Maryland, College Park, MD 20742;"},{"name":"Joint Center for Quantum Information and Computer Science, University of Maryland, College Park, MD 20742;"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kevin A.","family":"Landsman","sequence":"additional","affiliation":[{"name":"Joint Quantum Institute, Department of Physics, University of Maryland, College Park, MD 20742;"},{"name":"Joint Center for Quantum Information and Computer Science, University of Maryland, College Park, MD 20742;"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kenneth","family":"Wright","sequence":"additional","affiliation":[{"name":"Joint Quantum Institute, Department of Physics, University of Maryland, College Park, MD 20742;"},{"name":"Joint Center for Quantum Information and Computer Science, University of Maryland, College Park, MD 20742;"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christopher","family":"Monroe","sequence":"additional","affiliation":[{"name":"Joint Quantum Institute, Department of Physics, University of Maryland, College Park, MD 20742;"},{"name":"Joint Center for Quantum Information and Computer Science, University of Maryland, College Park, MD 20742;"},{"name":"IonQ Inc., College Park, MD 20742"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"341","published-online":{"date-parts":[[2017,3,21]]},"reference":[{"key":"e_1_3_3_1_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature13171"},{"key":"e_1_3_3_2_2","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms7979"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1038\/ncomms7983"},{"key":"e_1_3_3_4_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature18949"},{"key":"e_1_3_3_5_2","doi-asserted-by":"crossref","unstructured":"M Takita Demonstration of weight-four parity measurements in the surface code architecture. arXiv:1605.01351v2. (2016).","DOI":"10.1103\/PhysRevLett.117.210505"},{"key":"e_1_3_3_6_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature18648"},{"key":"e_1_3_3_7_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.aad9480"},{"key":"e_1_3_3_8_2","unstructured":"D Cheung D Maslov S Severini Translation techniques between quantum circuit architectures. Workshop on Quantum Information Processing . Available at www.umiacs.umd.edu\/\u223cdmaslov\/papers\/qip07.pdf. Accessed July 6 2016. (2007)."},{"key":"e_1_3_3_9_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.76.052314"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.82.1835"},{"key":"e_1_3_3_11_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.59.R2539"},{"key":"e_1_3_3_12_2","doi-asserted-by":"publisher","DOI":"10.1002\/1521-3978(200009)48:9\/11<801::AID-PROP801>3.0.CO;2-1"},{"key":"e_1_3_3_13_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.97.050505"},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.112.190502"},{"key":"e_1_3_3_15_2","volume-title":"Quantum Computation and Quantum Information: 10th Anniversary Edition","author":"Nielsen MA","year":"2011","unstructured":"MA Nielsen, IL Chuang Quantum Computation and Quantum Information: 10th Anniversary Edition (Cambridge Univ Press, 10th Ed, New York, 2011).","edition":"10"},{"key":"e_1_3_3_16_2","doi-asserted-by":"publisher","DOI":"10.1126\/science.1231930"},{"key":"e_1_3_3_17_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.76.042319"},{"key":"e_1_3_3_18_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.110.120501"},{"key":"e_1_3_3_19_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.82.040305"},{"key":"e_1_3_3_20_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevLett.107.080502"},{"key":"e_1_3_3_21_2","doi-asserted-by":"publisher","DOI":"10.1088\/1367-2630\/aa5e47"},{"key":"e_1_3_3_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2013.2244643"},{"key":"e_1_3_3_23_2","unstructured":"Wecker D Svore KM (2014) LIQUi|>: A software design architecture and domain-specific language for quantum computing. arXiv:1402.4467."},{"key":"e_1_3_3_24_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevApplied.6.054013"},{"key":"e_1_3_3_25_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.52.3457"},{"key":"e_1_3_3_26_2","first-page":"461","article-title":"On the CNOT-cost of Toffoli gates","volume":"9","author":"Shende VV","year":"2009","unstructured":"VV Shende, IL Markov, On the CNOT-cost of Toffoli gates. Quant Inform Comput 9, 461\u2013486 (2009).","journal-title":"Quant Inform Comput"},{"key":"e_1_3_3_27_2","doi-asserted-by":"publisher","DOI":"10.1098\/rspa.1998.0159"},{"key":"e_1_3_3_28_2","first-page":"361","article-title":"Optimal realizations of simplified Toffoli gates","volume":"4","author":"Song G","year":"2004","unstructured":"G Song, A Klappenecker, Optimal realizations of simplified Toffoli gates. Quant Inform Comput 4, 361\u2013372 (2004).","journal-title":"Quant Inform Comput"},{"key":"e_1_3_3_29_2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796300921"},{"key":"e_1_3_3_30_2","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970343141X"},{"key":"e_1_3_3_31_2","first-page":"50","volume-title":"Proceedings TQC 2013, Leibniz International Proceedings in Informatics (LIPIcs)","author":"Childs A","year":"2013","unstructured":"A Childs, R Kothari, M Ozols, M Roetteler, Easy and hard functions for the Boolean hidden shift problem. Proceedings TQC 2013, Leibniz International Proceedings in Informatics (LIPIcs), eds S Severini, FGSL Brand (Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Guelph, Canada) Vol 22, 50\u201379 (2013)."},{"key":"e_1_3_3_32_2","first-page":"448","volume-title":"Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201910)","author":"Roetteler M","year":"2010","unstructured":"M Roetteler, Quantum algorithms for highly non-linear Boolean functions. Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA\u201910), ed M Charikar (Siam, Austin, TX), pp. 448\u2013457 (2010)."},{"key":"e_1_3_3_33_2","doi-asserted-by":"publisher","DOI":"10.1038\/npjqi.2016.2"},{"key":"e_1_3_3_34_2","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevA.89.022317"},{"key":"e_1_3_3_35_2","doi-asserted-by":"publisher","DOI":"10.1038\/nature00784"}],"container-title":["Proceedings of the National Academy of Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.pnas.org\/syndication\/doi\/10.1073\/pnas.1618020114","content-type":"unspecified","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/pnas.org\/doi\/pdf\/10.1073\/pnas.1618020114","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,13]],"date-time":"2022-04-13T02:03:15Z","timestamp":1649815395000},"score":1,"resource":{"primary":{"URL":"https:\/\/pnas.org\/doi\/full\/10.1073\/pnas.1618020114"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,21]]},"references-count":35,"journal-issue":{"issue":"13","published-print":{"date-parts":[[2017,3,28]]}},"alternative-id":["10.1073\/pnas.1618020114"],"URL":"https:\/\/doi.org\/10.1073\/pnas.1618020114","relation":{},"ISSN":["0027-8424","1091-6490"],"issn-type":[{"value":"0027-8424","type":"print"},{"value":"1091-6490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,3,21]]},"assertion":[{"value":"2017-03-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}