02349nas a2200313 4500008004100000245007100041210006900112260001400181520145100195100001601646700003401662700001701696700001801713700001301731700001801744700001901762700002101781700001401802700002201816700001601838700002501854700001801879700001901897700002001916700002001936700001801956700002401974856003701998 2021 eng d00aInteractive Protocols for Classically-Verifiable Quantum Advantage0 aInteractive Protocols for ClassicallyVerifiable Quantum Advantag c12/9/20213 a
Achieving quantum computational advantage requires solving a classically intractable problem on a quantum device. Natural proposals rely upon the intrinsic hardness of classically simulating quantum mechanics; however, verifying the output is itself classically intractable. On the other hand, certain quantum algorithms (e.g. prime factorization via Shor's algorithm) are efficiently verifiable, but require more resources than what is available on near-term devices. One way to bridge the gap between verifiability and implementation is to use "interactions" between a prover and a verifier. By leveraging cryptographic functions, such protocols enable the classical verifier to enforce consistency in a quantum prover's responses across multiple rounds of interaction. In this work, we demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer. We execute two complementary protocols -- one based upon the learning with errors problem and another where the cryptographic construction implements a computational Bell test. To perform multiple rounds of interaction, we implement mid-circuit measurements on a subset of trapped ion qubits, with subsequent coherent evolution. For both protocols, the performance exceeds the asymptotic bound for classical behavior; maintaining this fidelity at scale would conclusively demonstrate verifiable quantum advantage.
1 aZhu, Daiwei1 aKahanamoku-Meyer, Gregory, D.1 aLewis, Laura1 aNoel, Crystal1 aKatz, Or1 aHarraz, Bahaa1 aWang, Qingfeng1 aRisinger, Andrew1 aFeng, Lei1 aBiswas, Debopriyo1 aEgan, Laird1 aGheorghiu, Alexandru1 aNam, Yunseong1 aVidick, Thomas1 aVazirani, Umesh1 aYao, Norman, Y.1 aCetina, Marko1 aMonroe, Christopher uhttps://arxiv.org/abs/2112.0515601947nas a2200397 4500008004100000245005400041210005400095260001500149520085000164100001801014700001601032700002301048700002301071700002201094700002401116700001901140700001801159700001801177700002001195700002501215700001801240700001801258700001901276700001901295700001601314700002301330700001901353700001701372700002401389700001901413700002201432700001901454700001901473700002001492856003701512 2019 eng d00aQuantum Computer Systems for Scientific Discovery0 aQuantum Computer Systems for Scientific Discovery c12/16/20193 aThe great promise of quantum computers comes with the dual challenges of building them and finding their useful applications. We argue that these two challenges should be considered together, by co-designing full stack quantum computer systems along with their applications in order to hasten their development and potential for scientific discovery. In this context, we identify scientific and community needs, opportunities, and significant challenges for the development of quantum computers for science over the next 2-10 years. This document is written by a community of university, national laboratory, and industrial researchers in the field of Quantum Information Science and Technology, and is based on a summary from a U.S. National Science Foundation workshop on Quantum Computing held on October 21-22, 2019 in Alexandria, VA.
1 aAlexeev, Yuri1 aBacon, Dave1 aBrown, Kenneth, R.1 aCalderbank, Robert1 aCarr, Lincoln, D.1 aChong, Frederic, T.1 aDeMarco, Brian1 aEnglund, Dirk1 aFarhi, Edward1 aFefferman, Bill1 aGorshkov, Alexey, V.1 aHouck, Andrew1 aKim, Jungsang1 aKimmel, Shelby1 aLange, Michael1 aLloyd, Seth1 aLukin, Mikhail, D.1 aMaslov, Dmitri1 aMaunz, Peter1 aMonroe, Christopher1 aPreskill, John1 aRoetteler, Martin1 aSavage, Martin1 aThompson, Jeff1 aVazirani, Umesh uhttps://arxiv.org/abs/1912.0757701599nas a2200133 4500008004100000245006800041210006800109520117300177100001801350700002001368700002001388700002001408856003701428 2018 eng d00aQuantum Supremacy and the Complexity of Random Circuit Sampling0 aQuantum Supremacy and the Complexity of Random Circuit Sampling3 aA critical milestone on the path to useful quantum computers is quantum supremacy - a demonstration of a quantum computation that is prohibitively hard for classical computers. A leading near-term candidate, put forth by the Google/UCSB team, is sampling from the probability distributions of randomly chosen quantum circuits, which we call Random Circuit Sampling (RCS). In this paper we study both the hardness and verification of RCS. While RCS was defined with experimental realization in mind, we show complexity theoretic evidence of hardness that is on par with the strongest theoretical proposals for supremacy. Specifically, we show that RCS satisfies an average-case hardness condition - computing output probabilities of typical quantum circuits is as hard as computing them in the worst-case, and therefore #P-hard. Our reduction exploits the polynomial structure in the output amplitudes of random quantum circuits, enabled by the Feynman path integral. In addition, it follows from known results that RCS satisfies an anti-concentration property, making it the first supremacy proposal with both average-case hardness and anti-concentration.
1 aBouland, Adam1 aFefferman, Bill1 aNirkhe, Chinmay1 aVazirani, Umesh uhttps://arxiv.org/abs/1803.04402