01894nas a2200301 4500008004100000245006400041210006300105260001400168520102800182100001601210700001701226700001801243700002101261700002201282700001601304700001701320700002201337700003001359700002201389700001901411700002101430700001801451700001801469700002301487700002101510700002401531856003701555 2021 eng d00aCross-Platform Comparison of Arbitrary Quantum Computations0 aCrossPlatform Comparison of Arbitrary Quantum Computations c7/27/20213 a
As we approach the era of quantum advantage, when quantum computers (QCs) can outperform any classical computer on particular tasks, there remains the difficult challenge of how to validate their performance. While algorithmic success can be easily verified in some instances such as number factoring or oracular algorithms, these approaches only provide pass/fail information for a single QC. On the other hand, a comparison between different QCs on the same arbitrary circuit provides a lower-bound for generic validation: a quantum computation is only as valid as the agreement between the results produced on different QCs. Such an approach is also at the heart of evaluating metrological standards such as disparate atomic clocks. In this paper, we report a cross-platform QC comparison using randomized and correlated measurements that results in a wealth of information on the QC systems. We execute several quantum circuits on widely different physical QC platforms and analyze the cross-platform fidelities.
1 aZhu, Daiwei1 aCian, Ze-Pei1 aNoel, Crystal1 aRisinger, Andrew1 aBiswas, Debopriyo1 aEgan, Laird1 aZhu, Yingyue1 aGreen, Alaina, M.1 aAlderete, Cinthia, Huerta1 aNguyen, Nhung, H.1 aWang, Qingfeng1 aMaksymov, Andrii1 aNam, Yunseong1 aCetina, Marko1 aLinke, Norbert, M.1 aHafezi, Mohammad1 aMonroe, Christopher uhttps://arxiv.org/abs/2107.1138702349nas a2200313 4500008004100000245007100041210006900112260001400181520145100195100001601646700003401662700001701696700001801713700001301731700001801744700001901762700002101781700001401802700002201816700001601838700002501854700001801879700001901897700002001916700002001936700001801956700002401974856003701998 2021 eng d00aInteractive Protocols for Classically-Verifiable Quantum Advantage0 aInteractive Protocols for ClassicallyVerifiable Quantum Advantag c12/9/20213 aAchieving 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.0515601625nas a2200229 4500008004100000245008800041210006900129260001400198520092400212100001801136700002101154700001601175700002101191700001601212700002201228700001801250700002501268700002101293700002001314700002401334856003701358 2021 eng d00aObservation of measurement-induced quantum phases in a trapped-ion quantum computer0 aObservation of measurementinduced quantum phases in a trappedion c6/10/20213 aMany-body open quantum systems balance internal dynamics against decoherence from interactions with an environment. Here, we explore this balance via random quantum circuits implemented on a trapped ion quantum computer, where the system evolution is represented by unitary gates with interspersed projective measurements. As the measurement rate is varied, a purification phase transition is predicted to emerge at a critical point akin to a fault-tolerent threshold. We probe the "pure" phase, where the system is rapidly projected to a deterministic state conditioned on the measurement outcomes, and the "mixed" or "coding" phase, where the initial state becomes partially encoded into a quantum error correcting codespace. We find convincing evidence of the two phases and show numerically that, with modest system scaling, critical properties of the transition clearly emerge.
1 aNoel, Crystal1 aNiroula, Pradeep1 aZhu, Daiwei1 aRisinger, Andrew1 aEgan, Laird1 aBiswas, Debopriyo1 aCetina, Marko1 aGorshkov, Alexey, V.1 aGullans, Michael1 aHuse, David, A.1 aMonroe, Christopher uhttps://arxiv.org/abs/2106.0588102128nas a2200229 4500008004100000245006400041210006200105260001400167520146400181100001601645700002301661700001801684700002101702700001601723700002201739700002001761700001501781700002301796700001801819700002401837856003701861 2020 eng d00aFault-Tolerant Operation of a Quantum Error-Correction Code0 aFaultTolerant Operation of a Quantum ErrorCorrection Code c9/24/20203 aQuantum error correction protects fragile quantum information by encoding it in a larger quantum system whose extra degrees of freedom enable the detection and correction of errors. An encoded logical qubit thus carries increased complexity compared to a bare physical qubit. Fault-tolerant protocols contain the spread of errors and are essential for realizing error suppression with an error-corrected logical qubit. Here we experimentally demonstrate fault-tolerant preparation, rotation, error syndrome extraction, and measurement on a logical qubit encoded in the 9-qubit Bacon-Shor code. For the logical qubit, we measure an average fault-tolerant preparation and measurement error of 0.6% and a transversal Clifford gate with an error of 0.3% after error correction. The result is an encoded logical qubit whose logical fidelity exceeds the fidelity of the entangling operations used to create it. We compare these operations with non-fault-tolerant protocols capable of generating arbitrary logical states, and observe the expected increase in error. We directly measure the four Bacon-Shor stabilizer generators and are able to detect single qubit Pauli errors. These results show that fault-tolerant quantum systems are currently capable of logical primitives with error rates lower than their constituent parts. With the future addition of intermediate measurements, the full power of scalable quantum error-correction can be achieved.
1 aEgan, Laird1 aDebroy, Dripto, M.1 aNoel, Crystal1 aRisinger, Andrew1 aZhu, Daiwei1 aBiswas, Debopriyo1 aNewman, Michael1 aLi, Muyuan1 aBrown, Kenneth, R.1 aCetina, Marko1 aMonroe, Christopher uhttps://arxiv.org/abs/2009.1148201551nas a2200193 4500008004100000245009300041210006900134260001300203520092900216100002101145700001901166700002201185700001601207700002401223700002401247700002601271700002301297856003701320 2020 eng d00aQuantum walks and Dirac cellular automata on a programmable trapped-ion quantum computer0 aQuantum walks and Dirac cellular automata on a programmable trap c2/6/20203 aThe quantum walk formalism is a widely used and highly successful framework for modeling quantum systems, such as simulations of the Dirac equation, different dynamics in both the low and high energy regime, and for developing a wide range of quantum algorithms. Here we present the circuit-based implementation of a discrete-time quantum walk in position space on a five-qubit trapped-ion quantum processor. We encode the space of walker positions in particular multi-qubit states and program the system to operate with different quantum walk parameters, experimentally realizing a Dirac cellular automaton with tunable mass parameter. The quantum walk circuits and position state mapping scale favorably to a larger model and physical systems, allowing the implementation of any algorithm based on discrete-time quantum walks algorithm and the dynamics associated with the discretized version of the Dirac equation.
1 aAlderete, Huerta1 aSingh, Shivani1 aNguyen, Nhung, H.1 aZhu, Daiwei1 aBalu, Radhakrishnan1 aMonroe, Christopher1 aChandrashekar, C., M.1 aLinke, Norbert, M. uhttps://arxiv.org/abs/2002.0253701624nas a2200193 4500008004100000245009000041210006900131260001500200520100400215100001701219700002401236700001801260700001601278700002301294700002401317700002401341700002801365856003701393 2019 eng d00aToward convergence of effective field theory simulations on digital quantum computers0 aToward convergence of effective field theory simulations on digi c04/18/20193 aWe report results for simulating an effective field theory to compute the binding energy of the deuteron nucleus using a hybrid algorithm on a trapped-ion quantum computer. Two increasingly complex unitary coupled-cluster ansaetze have been used to compute the binding energy to within a few percent for successively more complex Hamiltonians. By increasing the complexity of the Hamiltonian, allowing more terms in the effective field theory expansion and calculating their expectation values, we present a benchmark for quantum computers based on their ability to scalably calculate the effective field theory with increasing accuracy. Our result of E4=−2.220±0.179MeV may be compared with the exact Deuteron ground-state energy −2.224MeV. We also demonstrate an error mitigation technique using Richardson extrapolation on ion traps for the first time. The error mitigation circuit represents a record for deepest quantum circuit on a trapped-ion quantum computer.
1 aShehab, Omar1 aLandsman, Kevin, A.1 aNam, Yunseong1 aZhu, Daiwei1 aLinke, Norbert, M.1 aKeesan, Matthew, J.1 aPooser, Raphael, C.1 aMonroe, Christopher, R. uhttps://arxiv.org/abs/1904.0433801499nas a2200193 4500008004100000245007800041210006900119260001500188520089900203100002401102700001401126700002101140700001601161700002301177700002301200700001701223700002801240856003701268 2019 eng d00aTwo-qubit entangling gates within arbitrarily long chains of trapped ions0 aTwoqubit entangling gates within arbitrarily long chains of trap c05/28/20193 aIon trap systems are a leading platform for large scale quantum computers. Trapped ion qubit crystals are fully-connected and reconfigurable, owing to their long range Coulomb interaction that can be modulated with external optical forces. However, the spectral crowding of collective motional modes could pose a challenge to the control of such interactions for large numbers of qubits. Here, we show that high-fidelity quantum gate operations are still possible with very large trapped ion crystals, simplifying the scaling of ion trap quantum computers. To this end, we present analytical work that determines how parallel entangling gates produce a crosstalk error that falls off as the inverse cube of the distance between the pairs. We also show experimental work demonstrating entangling gates on a fully-connected chain of seventeen 171Yb+ ions with fidelities as high as 97(1)%.
1 aLandsman, Kevin, A.1 aWu, Yukai1 aLeung, Pak, Hong1 aZhu, Daiwei1 aLinke, Norbert, M.1 aBrown, Kenneth, R.1 aDuan, Luming1 aMonroe, Christopher, R. uhttps://arxiv.org/abs/1905.10421