DOCSLIB.ORG

Controlling Error-Correctable Bosonic Qubits

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Abstract Controlling Error-Correctable Bosonic Qubits Philip Reinhold 2019 The harmonic oscillator is a ubiquitous system in physics, describing a wide range of phenom- ena, both classically and quantum mechanically. While oscillators are relatively straightforward to control classically, they present much more of a challenge in the quantum realm where such systems, modeled as Bosonic modes, have many more degrees of freedom. Controlling Bosonic modes is a crucial task in light of proposals to use these systems to encode quantum information in a way that is protected from noise and dissipation. In this thesis a variety of approaches to controlling such systems are discussed, particularly in the superconducting microwave domain with cavity resonators. In the first part, an experiment demonstrates how a simple dispersively coupled auxiliary system results in universal control, and therefore allows the synthesis of arbi- trary manipulations of the system. This approach is employed to create and manipulate states that constitute an error-correctable qubit. The main drawback of this approach is the way in which errors and decoherence present in the auxiliary system are inherited by the oscillator. In the second part, I show how these effects can be suppressed using Hamiltonian engineering to produce a simple form of first-order ”fault-tolerance.” This approach allows us to demonstrate versions of cavity measurements and manipulations that are protected from dominant error mechanisms. Controlling Error-Correctable Bosonic Qubits A Dissertation Presented to the Faculty of the Graduate School of Yale University in Candidacy for the Degree of Doctor of Philosophy by Philip Reinhold Dissertation Director: Robert J. Schoelkopf December 2019 © 2020 by Philip Reinhold All rights reserved. ii Contents Contents iii List of Figures vi List of Tables ix List of Abbreviations and Symbols x Acknowledgments xiv 1 Introduction 1 1.1 Outline of thesis . .5 1.2 Background and suggested reading . .7 2 Controlling cavities 9 2.1 The limits of control in linear cavities . 10 2.2 Control in the Jaynes-Cummings model . 13 2.3 Control in the dispersive regime . 14 2.3.1 Applications: Parity map . 17 2.3.2 Applications: Wigner tomography . 19 2.3.3 Applications: qcMAP . 21 2.4 SNAP and universality . 22 2.5 Optimal control . 27 3 Doing more with less: error correction with harmonic oscillators 29 3.1 Error correction criteria . 30 3.2 Error models for qubits . 31 3.3 Making error correction work in practice . 32 3.4 Error models for cavities . 34 3.5 Error correction in damped harmonic oscillators . 35 3.6 Cat codes . 37 3.6.1 Choosing α ................................ 43 3.6.2 “No-jump” errors and autonomous stabilization . 44 3.7 Alternate cavity encodings . 46 3.7.1 Binomial codes . 46 3.7.2 Cat code generalizations . 48 3.7.3 Numerically optimized codes . 49 iii 3.7.4 GKP codes . 51 4 Numerical quantum optimal control 53 4.1 Defining the problem . 54 4.2 Calculating the gradient . 55 4.3 Cost function variations . 59 4.3.1 Open system GRAPE . 60 4.3.2 Robust control . 61 4.3.3 Gauge degrees of freedom . 62 4.4 Constraints and penalties . 63 4.4.1 Limiting the pulse amplitude . 63 4.4.2 Limiting the bandwidth . 64 4.5 Limiting the intermediate photon number . 66 4.6 Troubleshooting optimization convergence . 67 4.7 What if it doesn’t work?: Debugging optimal control pulses . 68 4.8 Closed-loop optimization methods . 71 5 Meet the samples 73 5.1 The seamless storage cavity . 73 5.2 The antenna transmon . 77 5.3 The stripline readout . 81 5.4 Coupling pins . 82 5.5 Putting it all together . 86 5.5.1 Fabrication . 86 5.5.2 Attenuators and filtering . 86 5.5.3 Readout amplification . 93 5.5.4 Electronics . 94 6 Universal control of a cat-code qubit 97 6.1 First things first: Characterizing the system . 98 6.2 Showing off a bit: Creating distant Fock states from scratch . 103 6.3 Alternating Hilbert spaces: Encode and decode . 105 6.4 Testing encoded operations . 109 6.5 Empirical tuning . 113 7 Venturing forth in frequency space: sideband drives 116 7.1 Four-wave mixing: A cornucopia of terms . 117 7.2 Q-Switching for faster system reset . 120 7.3 Creating photons one at a time . 121 7.4 Engineered dissipation . 123 8 A Fault-Tolerant Parity Measurement 125 8.1 Error Transparency: A paradigm for hardware-efficient fault-tolerance . 127 8.2 Cancelling χ: The simplest useful symmetry . 129 8.2.1 Choosing drive parameters . 132 8.3 Extending the cavity lifetime by protecting it from the transmon . 134 8.4 Parity measurement using |fi ........................... 137 iv 8.5 Postselecting on errors: Identifying transmon-induced cavity dephasing . 138 8.6 Performance analysis . 143 9 Fault-tolerant SNAP 147 9.1 An interaction picture for SNAP . 148 9.2 Analyzing fault propagation in SNAP . 150 9.3 Raman SNAP . 153 9.4 Some assembly required: The FT SNAP protocol . 153 9.5 Tuneup procedure . 156 9.6 Characterizing the FT SNAP . 159 10 Conclusion and Prospects 167 Bibliography 171 A Identities and derivations 183 A.1 Changing frames . 183 A.2 Commutator relations . 184 A.3 Rotating frame . 185 A.4 Displaced frame . 187 A.5 Dispersive Hamiltonian for a multi-level ancilla . 188 A.6 Damped harmonic oscillator master equation . 191 A.7 Fr´echet Derivative of the matrix exponential . 193 A.8 Approximate time-independent Hamiltonians . 194 A.8.1 Floquet formalism . 195 A.8.2 Block Diagonalization . 196 B Construction of unitary operations from a universal control set 198 C Tomographies, large and small 200 C.1 State tomography . 200 C.1.1 Optimizing tomography . 202 C.1.2 Wigner tomography . 203 C.2 Process tomography . 203 C.2.1 Pauli transfer representation . 206 C.3 Gate set tomography . 207 C.4 Randomized benchmarking . 208 D Taming the Black Mamba: Structure and software for the Yngwie FPGA quan- tum controller 211 D.1 Understanding the hardware . 211 D.2 The Yngwie VHDL logic . 213 D.2.1 Analog output chain . 213 D.2.2 Analog input chain . 215 D.2.3 Digital inputs and outputs . 216 D.2.4 Tables . 218 D.2.5 CPU . 219 D.3 The Yngwie python libraries . 221 v D.3.1 Basic sequencing . 221 D.3.2 Master table . 222 D.3.3 Analog tables . 223 D.3.4 Digital tables . 223 D.3.5 Result records . 224 D.4 The Yngwie FPGA instrument class . 224 D.4.1 Running experiments . 226 D.5 The fpga lib.dsl sequencing language . 227 D.5.1 Output . 228 D.5.2 Acquisition . 228 D.5.3 Control flow . ..
Recommended publications
  • Conversion of a General Quantum Stabilizer Code to an Entanglement

    Conversion of a General Quantum Stabilizer Code to an Entanglement

    Conversion of a general quantum stabilizer code to an entanglement distillation protocol∗ Ryutaroh Matsumoto Dept. of Communications and Integrated Systems Tokyo Institute of Technology, 152-8552 Japan Email: [email protected] April 4, 2003 Abstract We show how to convert a quantum stabilizer code to a one-way or two- way entanglement distillation protocol. The proposed conversion method is a generalization of those of Shor-Preskill and Nielsen-Chuang. The recurrence protocol and the quantum privacy amplification protocol are equivalent to the protocols converted from [[2, 1]] stabilizer codes. We also give an example of a two-way protocol converted from a stabilizer bet- ter than the recurrence protocol and the quantum privacy amplification protocol. The distillable entanglement by the class of one-way protocols converted from stabilizer codes for a certain class of states is equal to or greater than the achievable rate of stabilizer codes over the channel cor- responding to the distilled state, and they can distill asymptotically more entanglement from a very noisy Werner state than the hashing protocol. 1 Introduction arXiv:quant-ph/0209091v4 4 Apr 2003 In many applications of quantum mechanics to communication, the sender and the receiver have to share a maximally entangled quantum state of two particles. When there is a noiseless quantum communication channel, the sender can send one of two particles in a maximally entangled state to the receiver and sharing of it is easily accomplished. However, the quantum communication channel is usually noisy, that is, the quantum state of the received particle changes probabilistically from the original state of a particle.
  • A New Family of Fault Tolerant Quantum Reed-Muller Codes

    A New Family of Fault Tolerant Quantum Reed-Muller Codes

    Clemson University TigerPrints All Theses Theses December 2020 A New Family of Fault Tolerant Quantum Reed-Muller Codes Harrison Beam Eggers Clemson University, [email protected] Follow this and additional works at: https://tigerprints.clemson.edu/all_theses Recommended Citation Eggers, Harrison Beam, "A New Family of Fault Tolerant Quantum Reed-Muller Codes" (2020). All Theses. 3463. https://tigerprints.clemson.edu/all_theses/3463 This Thesis is brought to you for free and open access by the Theses at TigerPrints. It has been accepted for inclusion in All Theses by an authorized administrator of TigerPrints. For more information, please contact [email protected]. A New Family of Fault Tolerant Quantum Reed-Muller Codes A Thesis Presented to the Graduate School of Clemson University In Partial Fulfillment of the Requirements for the Degree Master of Science Mathematics by Harrison Eggers December 2020 Accepted by: Dr. Felice Manganiello, Committee Chair Dr. Shuhong Gao Dr. Kevin James Abstract Fault tolerant quantum computation is a critical step in the development of practical quan- tum computers. Unfortunately, not every quantum error correcting code can be used for fault tolerant computation. Rengaswamy et. al. define CSS-T codes, which are CSS codes that admit the transversal application of the T gate, which is a key step in achieving fault tolerant computation. They then present a family of quantum Reed-Muller fault tolerant codes. Their family of codes admits a transversal T gate, but the asymptotic rate of the family is zero. We build on their work by reframing their CSS-T conditions using the concept of self-orthogonality.
  • (CST Part II) Lecture 14: Fault Tolerant Quantum Computing

    (CST Part II) Lecture 14: Fault Tolerant Quantum Computing

    Quantum Computing (CST Part II) Lecture 14: Fault Tolerant Quantum Computing The history of the universe is, in effect, a huge and ongoing quantum computation. The universe is a quantum computer. Seth Lloyd 1 / 21 Resources for this lecture Nielsen and Chuang p474-495 covers the material of this lecture. 2 / 21 Why we need fault tolerance Classical computers perform complicated operations where bits are repeatedly \combined" in computations, therefore if an error occurs, it could in principle propagate to a huge number of other bits. Fortunately, in modern digital computers errors are so phenomenally unlikely that we can forget about this possibility for all practical purposes. Errors do, however, occur in telecommunications systems, but as the purpose of these is the simple transmittal of some information, it suffices to perform error correction on the final received data. In a sense, quantum computing is the worst of both of these worlds: errors do occur with significant frequency, and if uncorrected they will propagate, rendering the computation useless. Thus the solution is that we must correct errors as we go along. 3 / 21 Fault tolerant quantum computing set-up For fault tolerant quantum computing: We use encoded qubits, rather than physical qubits. For example we may use the 7-qubit Steane code to represent each logical qubit in the computation. We use fault tolerant quantum gates, which are defined such thata single error in the fault tolerant gate propagates to at most one error in each encoded block of qubits. By a \block of qubits", we mean (for example) each block of 7 physical qubits that represents a logical qubit using the Steane code.
  • Arxiv:Quant-Ph/9705031V3 26 Aug 1997 Eddt Rvn Unu Optrfo Crashing

    Arxiv:Quant-Ph/9705031V3 26 Aug 1997 Eddt Rvn Unu Optrfo Crashing

    CALT-68-2112 QUIC-97-030 quant-ph/9705031 Reliable Quantum Computers John Preskill1 California Institute of Technology, Pasadena, CA 91125, USA Abstract The new field of quantum error correction has developed spectacularly since its origin less than two years ago. Encoded quantum information can be protected from errors that arise due to uncontrolled interactions with the environment. Recovery from errors can work effectively even if occasional mistakes occur during the recovery procedure. Furthermore, encoded quantum information can be processed without serious propagation of errors. Hence, an arbitrarily long quantum computation can be performed reliably, provided that the average probability of error per quantum gate is less than a certain critical value, the accuracy threshold. A quantum computer storing about 106 qubits, with a probability of error per quantum gate of order 10−6, would be a formidable factoring engine. Even a smaller, less accurate quantum computer would be able to perform many useful tasks. This paper is based on a talk presented at the ITP Conference on Quantum Coherence and Decoherence, 15-18 December 1996. 1 The golden age of quantum error correction Many of us are hopeful that quantum computers will become practical and useful computing devices some time during the 21st century. It is probably fair to say, though, that none of us can now envision exactly what the hardware of that machine of the future will be like; surely, it will be much different than the sort of hardware that experimental physicists are investigating these days. But of one thing we can be quite confident—that a practical quantum computer will incorporate some type of error correction into its operation.
  • Fault-Tolerant Quantum Gates Ph/CS 219 2 February 2011

    Fault-Tolerant Quantum Gates Ph/CS 219 2 February 2011

    Fault-tolerant quantum gates Ph/CS 219 2 February 2011 Last time we considered the requirements for fault-tolerant quantum gates that act nontrivially on the codespace of a quantum error-correcting code. In the special case of a code that corrects t=1 error, the requirements are: -- if the gate gadget is ideal (has no faults) and its input is a codeword, then the gadget realizes the encoded operation U acting on the code space. -- if the gate gadget is ideal and its input has at most one error (is one-deviated from the codespace), then the output has at most one error in each output block. -- if the gate has one fault and its input has no errors, then the output has at most one error in each block (the errors are correctable). We considered the Clifford group, the finite subgroup of the m-qubit unitary group generated by the Hadamard gate H, the phase gate P (rotation by Pi/2 about the z-axis) and the CNOT gate. For a special class of codes, the generators of the Clifford group can be executed transversally (i.e., bitwise). The logical U can be done by applying a product of n U (or inverse of U) gates in parallel (where n is the code's length). If we suppose that the number of encoded qubits is k=1, then: -- the CNOT gate is transversal for any CSS code. -- the H gate is transversal for a CSS code that uses the same classical code to correct X errors and Z errors.
  • LI-DISSERTATION-2020.Pdf

    LI-DISSERTATION-2020.Pdf

    FAULT-TOLERANCE ON NEAR-TERM QUANTUM COMPUTERS AND SUBSYSTEM QUANTUM ERROR CORRECTING CODES A Dissertation Presented to The Academic Faculty By Muyuan Li In Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in the School of Computational Science and Engineering Georgia Institute of Technology May 2020 Copyright c Muyuan Li 2020 FAULT-TOLERANCE ON NEAR-TERM QUANTUM COMPUTERS AND SUBSYSTEM QUANTUM ERROR CORRECTING CODES Approved by: Dr. Kenneth R. Brown, Advisor Department of Electrical and Computer Dr. C. David Sherrill Engineering School of Chemistry and Biochemistry Duke University Georgia Institute of Technology Dr. Edmond Chow Dr. Richard Vuduc School of Computational Science and School of Computational Science and Engineering Engineering Georgia Institute of Technology Georgia Institute of Technology Dr. T.A. Brian Kennedy Date Approved: March 19, 2020 School of Physics Georgia Institute of Technology I think it is safe to say that no one understands quantum mechanics. R. P. Feynman To my family and my friends. ACKNOWLEDGEMENTS I would like to thank my advisor, Ken Brown, who has guided me through my graduate studies with his patience, wisdom, and generosity. He has always been supportive and helpful, and always makes himself available when I needed. I have been constantly inspired by his depth of knowledge in research, as well as his immense passion for life. I would also like to thank my committee members, Professors Edmond Chow, T.A. Brian Kennedy, C. David Sherrill, and Richard Vuduc, for their time and helpful sugges- tions. One half of my graduate career was spent at Georgia Tech and the other half at Duke University.
  • Arxiv:2104.09539V1 [Quant-Ph] 19 Apr 2021

    Arxiv:2104.09539V1 [Quant-Ph] 19 Apr 2021

    Practical quantum error correction with the XZZX code and Kerr-cat qubits Andrew S. Darmawan,1, 2 Benjamin J. Brown,3 Arne L. Grimsmo,3 David K. Tuckett,3 and Shruti Puri4, 5 1Yukawa Institute for Theoretical Physics (YITP), Kyoto University, Kitashirakawa Oiwakecho, Sakyo-ku, Kyoto 606-8502, Japan∗ 2JST, PRESTO, 4-1-8 Honcho, Kawaguchi, Saitama 332-0012, Japan 3Centre for Engineered Quantum Systems, School of Physics, University of Sydney, Sydney, New South Wales 2006, Australia 4 Department of Applied Physics, Yale University, New Haven, Connecticut 06511, USAy 5Yale Quantum Institute, Yale University, New Haven, Connecticut 06511, USA (Dated: April 21, 2021) The development of robust architectures capable of large-scale fault-tolerant quantum computa- tion should consider both their quantum error-correcting codes, and the underlying physical qubits upon which they are built, in tandem. Following this design principle we demonstrate remarkable error correction performance by concatenating the XZZX surface code with Kerr-cat qubits. We contrast several variants of fault-tolerant systems undergoing different circuit noise models that reflect the physics of Kerr-cat qubits. Our simulations show that our system is scalable below a threshold gate infidelity of pCX 6:5% within a physically reasonable parameter regime, where ∼ pCX is the infidelity of the noisiest gate of our system; the controlled-not gate. This threshold can be reached in a superconducting circuit architecture with a Kerr-nonlinearity of 10MHz, a 6:25 photon cat qubit, single-photon lifetime of > 64µs, and thermal photon population < 8%.∼ Such parameters are routinely achieved in superconducting∼ circuits. ∼ I. INTRODUCTION qubit [22, 34, 35].
  • Assessing the Progress of Trapped-Ion Processors Towards Fault-Tolerant Quantum Computation

    Assessing the Progress of Trapped-Ion Processors Towards Fault-Tolerant Quantum Computation

    PHYSICAL REVIEW X 7, 041061 (2017) Assessing the Progress of Trapped-Ion Processors Towards Fault-Tolerant Quantum Computation A. Bermudez,1,2 X. Xu,3 R. Nigmatullin,4,3 J. O’Gorman,3 V. Negnevitsky,5 P. Schindler,6 T. Monz,6 U. G. Poschinger,7 C. Hempel,8 J. Home,5 F. Schmidt-Kaler,7 M. Biercuk,8 R. Blatt,6,9 S. Benjamin,3 and M. Müller1 1Department of Physics, College of Science, Swansea University, Singleton Park, Swansea SA2 8PP, United Kingdom 2Instituto de Física Fundamental, IFF-CSIC, Madrid E-28006, Spain 3Department of Materials, University of Oxford, Oxford OX1 3PH, United Kingdom 4Complex Systems Research Group, Faculty of Engineering and IT, The University of Sydney, Sydney, Australia 5Institute for Quantum Electronics, ETH Zürich, Otto-Stern-Weg 1, 8093 Zürich, Switzerland 6Institute for Experimental Physics, University of Innsbruck, 6020 Innsbruck, Austria 7Institut für Physik, Universität Mainz, Staudingerweg 7, 55128 Mainz, Germany 8ARC Centre for Engineered Quantum Systems, School of Physics, The University of Sydney, Sydney, NSW 2006, Australia 9Institute for Quantum Optics and Quantum Information of the Austrian Academy of Sciences, A-6020 Innsbruck, Austria (Received 24 May 2017; revised manuscript received 11 August 2017; published 13 December 2017) A quantitative assessment of the progress of small prototype quantum processors towards fault-tolerant quantum computation is a problem of current interest in experimental and theoretical quantum information science. We introduce a necessary and fair criterion for quantum error correction (QEC), which must be achieved in the development of these quantum processors before their sizes are sufficiently big to consider the well-known QEC threshold.
  • Quantum Error-Correcting Codes by Concatenation QEC11

    Quantum Error-Correcting Codes by Concatenation QEC11

    Quantum Error-Correcting Codes by Concatenation QEC11 Second International Conference on Quantum Error Correction University of Southern California, Los Angeles, USA December 5–9, 2011 Quantum Error-Correcting Codes by Concatenation Markus Grassl joint work with Bei Zeng Centre for Quantum Technologies National University of Singapore Singapore Markus Grassl – 1– 07.12.2011 Quantum Error-Correcting Codes by Concatenation QEC11 Why Bei isn’t here Jonathan, November 24, 2011 Markus Grassl – 2– 07.12.2011 Quantum Error-Correcting Codes by Concatenation QEC11 Overview Shor’s nine-qubit code revisited • The code [[25, 1, 9]] • Concatenated graph codes • Generalized concatenated quantum codes • Codes for the Amplitude Damping (AD) channel • Conclusions • Markus Grassl – 3– 07.12.2011 Quantum Error-Correcting Codes by Concatenation QEC11 Shor’s Nine-Qubit Code Revisited Bit-flip code: 0 000 , 1 111 . | → | | → | Phase-flip code: 0 + ++ , 1 . | → | | → | − −− Effect of single-qubit errors on the bit-flip code: X-errors change the basis states, but can be corrected • Z-errors at any of the three positions: • Z 000 = 000 | | “encoded” Z-operator Z 111 = 111 | −| = Bit-flip code & error correction convert the channel into a phase-error ⇒ channel = Concatenation of bit-flip code and phase-flip code yields [[9, 1, 3]] ⇒ Markus Grassl – 4– 07.12.2011 Quantum Error-Correcting Codes by Concatenation QEC11 The Code [[25, 1, 9]] The best single-error correcting code is = [[5, 1, 3]] • C0 Re-encoding each of the 5 qubits with yields = [[52, 1, 32]]
  • Entangled Many-Body States As Resources of Quantum Information Processing

    Entangled Many-Body States As Resources of Quantum Information Processing

    ENTANGLED MANY-BODY STATES AS RESOURCES OF QUANTUM INFORMATION PROCESSING LI YING A thesis submitted for the Degree of Doctor of Philosophy CENTRE FOR QUANTUM TECHNOLOGIES NATIONAL UNIVERSITY OF SINGAPORE 2013 DECLARATION I hereby declare that the thesis is my original work and it has been written by me in its entirety. I have duly acknowledged all the sources of information which have been used in the thesis. This thesis has also not been submitted for any degree in any university previously. LI YING 23 July 2013 Acknowledgments I am very grateful to have spent about four years at CQT working with Leong Chuan Kwek. He always brings me new ideas in science and has helped me to establish good collaborative relationships with other scien- tists. Kwek helped me a lot in my life. I am also very grateful to Simon C. Benjamin. He showd me how to do high quality researches in physics. Simon also helped me to improve my writing and presentation. I hope to have fruitful collaborations in the near future with Kwek and Simon. For my project about the ground-code MBQC (Chapter2), I am thank- ful to Tzu-Chieh Wei, Daniel E. Browne and Robert Raussendorf. In one afternoon, Tzu-Chieh showed me the idea of his recent paper in this topic in the quantum cafe, which encouraged me to think about the ground- code MBQC. Dan and Robert have a high level of comprehension on the subject of the MBQC. And we had some very interesting discussions and communications. I am grateful to Sean D.
  • Lecture 6: Quantum Error Correction and Quantum Capacity

    Lecture 6: Quantum Error Correction and Quantum Capacity

    Lecture 6: Quantum error correction and quantum capacity Mark M. Wilde∗ The quantum capacity theorem is one of the most important theorems in quantum Shannon theory. It is a fundamentally \quantum" theorem in that it demonstrates that a fundamentally quantum information quantity, the coherent information, is an achievable rate for quantum com- munication over a quantum channel. The fact that the coherent information does not have a strong analog in classical Shannon theory truly separates the quantum and classical theories of information. The no-cloning theorem provides the intuition behind quantum error correction. The goal of any quantum communication protocol is for Alice to establish quantum correlations with the receiver Bob. We know well now that every quantum channel has an isometric extension, so that we can think of another receiver, the environment Eve, who is at a second output port of a larger unitary evolution. Were Eve able to learn anything about the quantum information that Alice is attempting to transmit to Bob, then Bob could not be retrieving this information|otherwise, they would violate the no-cloning theorem. Thus, Alice should figure out some subspace of the channel input where she can place her quantum information such that only Bob has access to it, while Eve does not. That the dimensionality of this subspace is exponential in the coherent information is perhaps then unsurprising in light of the above no-cloning reasoning. The coherent information is an entropy difference H(B) − H(E)|a measure of the amount of quantum correlations that Alice can establish with Bob less the amount that Eve can gain.
  • Classical Zero-Knowledge Arguments for Quantum Computations

    Classical Zero-Knowledge Arguments for Quantum Computations

    Classical zero-knowledge arguments for quantum computations Thomas Vidick∗ Tina Zhangy Abstract We show that every language in BQP admits a classical-verifier, quantum-prover zero-knowledge ar- gument system which is sound against quantum polynomial-time provers and zero-knowledge for classical (and quantum) polynomial-time verifiers. The protocol builds upon two recent results: a computational zero-knowledge proof system for languages in QMA, with a quantum verifier, introduced by Broadbent et al. (FOCS 2016), and an argument system for languages in BQP, with a classical verifier, introduced by Mahadev (FOCS 2018). 1 Introduction The paradigm of the interactive proof system is a versatile tool in complexity theory. Although traditional complexity classes are usually defined in terms of a single Turing machine|NP, for example, can be defined as the class of languages which a non-deterministic Turing machine is able to decide|many have reformulations in the language of interactive proofs, and such reformulations often inspire natural and fruitful variants on the traditional classes upon which they are based. (The class MA, for example, can be considered a natural extension of NP under the interactive-proof paradigm.) Intuitively speaking, an interactive proof system is a model of computation involving two entities, a verifier and a prover, the former of whom is computationally efficient, and the latter of whom is unbounded but untrusted. The verifier and the prover exchange messages, and the prover attempts to `convince' the verifier that a certain problem instance is a yes-instance. We can define some particular complexity class as the set of languages for which there exists an interactive proof system that 1) is complete, 2) is sound, and 3) has certain other properties which vary depending on the class in question.