DOCSLIB.ORG

Controlling Quantum Information

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Controlling Quantum Information Controlling Quantum Information Thesis by Andrew J. Landahl In Partial Ful¯llment of the Requirements for the Degree of Doctor of Philosophy California Institute of Technology Pasadena, California 2002 (Defended May 21, 2002) ii c 2002 ° Andrew J. Landahl All rights Reserved iii Dedicated to my parents Nancy and John Landahl and to the memory of my grandparents Barbara and Aldo Martin iv Acknowledgements I am pleased to acknowledge all of the people who have contributed to my per- sonal and professional development during my graduate career. My most heartfelt gratitude goes to my friends and family, especially to my parents Nancy and John, to my sister Heidi, and to my aunt Carol for their collective unwavering love and support. I am also especially grateful to my mentor, colleague, and friend John Preskill. John provided me with research suggestions when I ¯rst began my studies, the opportunity to travel and establish scienti¯c collaborations, the freedom to pursue my own intellectual interests, and the steadfast encouragement to help me see my research through. John's organization of thought and clarity of expression continue to be deep personal inspirations. I will be fortunate indeed if even a fraction of those qualities have rubbed o® on me through my years of study in his company at Caltech. This thesis would not have been possible were it not from the long list of collaborators from whom I have learned so much: Charlene Ahn, Andrew Childs, Eric Dennis, Enrico Deotto, Andrew Doherty, Eddie Farhi, Sam Gutmann, Je®rey Goldstone, Alexei Kitaev, and John Preskill. Their insights have been invaluable. I also thank Je® Kimble, Hideo Mabuchi, and Kip Thorne who graciously gave of their time to sit on both my candidacy and thesis defense committees. I consider them additional mentors, from whom I have learned greatly, both through formal instruction and informal discussions. A special thanks goes to Ike Chuang and his quanta research group in the Media Lab at MIT for their hospitality during a fruitful visit which both initiated the research described in Chapter 5 and which has generated an ongoing research collaboration. One of the wonderful things about my Caltech research experience has been the vast number of quantum information scientists I have met and learned so much from, many of whom who have graciously come and visited Caltech, bringing with v them new ideas and fresh perspectives. I would like to thank the following people for lively and engaging scienti¯c interactions: Scott Aaronsen, Dorit Aharonov, Srinivas Aji, Paul Alsing, Dave Bacon, Howard Barnum, Dave Beckman, Charlie Bennett, Herb Bernstein, Ken Brown, Carl Caves, Nicholas Cerf, Richard Cleve, John Cortese, Sumit Daftuar, Win van Dam, Keshav Dani, Eric Dennis, Ivan Deutsch, David DiVincenzo, Steven van Enk, Chris Fuchs, Daniel Gottesman, Bob Gingrich, Salman Habib, Sean Hallgren, Jim Harrington, Aram Harrow, Patrick Hayden, Peter H¿yer, Lawrence Ip, Kurt Jacobs, Daniel Jonathan, Richard Jozsa, Julia Kempe, Rowan Killip, Manny Knill, Inna Kozinsky, Greg Kuperberg, Debbie Leung, Seth Lloyd, Hoi-Kwong Lo, Gerard Milburn, Paul McFadden, Carlos Mon- chon, Mike Mosca, Ashwin Nayak, Michael Nielsen, Tobias Osbourne, Ben Rahn, Eric Rains, Ben Recht, Mary-Beth Ruskai, RudigerÄ Schack, Leonard Schulman, Yaoyun Shi, Ben Schumacher, Peter Shor, John Smolin, Federico Spedialari, Dan Stamper-Kurn, Andrew Steane, Dan Steck, Barbara Terhal, Ashish Thalpiyal, Ben Toner, Umesh Vazarani, Guifre Vidal, Lorenza Viola, Chenyang Wang, Mike Westmoreland, Birgitta Whaley, Clint White, Howard Wiseman, Dave Wineland, Ronald de Wolf, Bill Wootters, and Nathan Wozny. I would also like to thank my many friends and colleagues in experimental quantum optics at Caltech who have taught me about the importance of keeping close to experiment in theoretical research. Never again will I begin a sentence with \Suppose you have three spins in a box." Thanks to: Mike Armen, John Au, Andy Berglund, Kevin Birnbaum, Andreea Boca, Glov Boi, Dave Boozer, Joe Buck, James Chou, Akira Furusawa, JM Geremia, Win Goh, Christina Hood, Alex Kuzmich, Ron Legere, Ben Lev, Peter Lodahl, Theresa Lynn, Jason McK- eever, Christof Naegerl, Dominik Schraeder, John Stockton, David Vernooy, Jon Williams, and Jun Ye. The administrative assistance I received from Beth Adams, Donna Driscoll, Ann Harvey, Sheri Stoll, and Helen Tuck has been phenomenal; I thank them for going the extra mile so many times. Without them I would have surely been lost in so many ways. vi As this thesis signals the end of my formal education, but certainly not the end of a lifetime of learning, I would like to take this opportunity to thank some of the teachers I have had over the years who had major impacts on my intellectual development. In particular, I would like to thank Mrs. Elaine Romanias, my ¯fth- and sixth-grade teacher who encouraged me to explore problems from creative points-of-view, Mr. Michael Stueben, my geometry teacher who challenged me with the puzzles he developed for his Discover Magazine Brain Bogglers column, Mr. Don Hyatt, my computer science teacher who mentored me as I undertook a Westinghouse Science Talent Search project and opened my eyes to the exciting ¯eld of research science, Dr. John Dell, my AP physics teacher who gave so gen- erously of his time, lent me many of his physics books, answered my seemingly endless list of physics and math questions, and by whose example I strengthened my resolve to become a physicist, Prof. Yoshi Oono, my Research Experience for Undergraduates mentor who taught me that fundamental physics isn't de¯ned by energy scales, Prof. Lay-Nam Chang, my honors thesis advisor who encouraged me to pursue my research interests in quantum information science, Prof. Kip Thorne, who taught me how to appreciate physics independently from mathemat- ics, and lastly Prof. John Preskill, my Ph.D. advisor who taught me by example that excellence in research and excellence in teaching are not mutually exclusive alternatives. Since the dawn of science, generous patrons have enabled scienti¯c progress. In my case, I would like to thank Caltech, DARPA, the NSF, and IBM for their ¯nancial support during my graduate career. Without their assistance, this thesis would surely not have been possible. Finally, I would like to thank the following diversions for preserving my sanity during my graduate career: table tennis, fantasy baseball, swing dancing, the a- hats softball team, and Carl's Jr. hamburgers. vii Controlling Quantum Information by Andrew J. Landahl In Partial Ful¯llment of the Requirements for the Degree of Doctor of Philosophy Abstract Quantum information science explores ways in which quantum physical laws can be harnessed to control the acquisition, transmission, protection, and processing of information. This ¯eld has seen explosive growth in the past several years from progress on both theoretical and experimental fronts. Essential to this endeavor are methods for controlling quantum information. In this thesis, I present three new approaches for controlling quantum informa- tion. First, I present a new protocol for continuously protecting unknown quantum states from noise. This protocol combines and expands ideas from the theories of quantum error correction and quantum feedback control. The result can outper- form either approach by itself. I generalize this protocol to all known quantum stabilizer codes, and study its application to the three-qubit repetition code in detail via Monte Carlo simulations. Next, I present several new protocols for controlling quantum information that are fault-tolerant. These protocols require only local quantum processing due to the topological properties of the quantum error correcting codes upon which they are built. I show that each protocol's fault-dependence behavior exhibits an order- disorder phase transition when mapped onto an associated statistical-mechanical model. I review the critical error rates of these protocols found by numerical study of the associated models, and I present new analytic bounds for them using a self- avoiding random walk argument. Moreover, I discuss fault-tolerant procedures for viii encoding, error-correction, computing, and decoding quantum information using these protocols, and calculate the accuracy threshold of fault-tolerant quantum memory for protocols using them. I end by presenting a new class of quantum algorithms that solve combinatorial optimization problems solely by measurement. I compute the running times of these algorithms by establishing an explicit dynamical model for the measurement process. This model, the digitized version of von Neumann's measurement model, is recognized as Kitaev's phase estimation algorithm. I show that the running times of these algorithms are closely related to the running times of adiabatic quantum algorithms. Finally, I present a two-measurement algorithm that achieves a quadratic speedup for Grover's unstructured search problem. ix Preface In the spring of 1996, I visited Caltech as a prospective graduate student eager to pursue research in the nascent ¯eld of quantum computing. I was drawn to Caltech by the recent experimental demonstration of quantum logic by Je® Kimble's group. Here was a place where ground-breaking research was being done! Although I leaned more towards theory, I was willing to convert to an experimentalist if it meant being involved in this exciting new ¯eld. What a surprise it was to meet John Preskill that fateful week|a theoretical physicist at Caltech
Load more

Recommended publications
  • On the Tightness of the Buhrman-Cleve-Wigderson Simulation
    On the tightness of the Buhrman-Cleve-Wigderson simulation Shengyu Zhang Department of Computer Science and Engineering, The Chinese University of Hong Kong. [email protected] Abstract. Buhrman, Cleve and Wigderson gave a general communica- 1 1 n n tion protocol for block-composed functions f(g1(x ; y ); ··· ; gn(x ; y )) by simulating a decision tree computation for f [3]. It is also well-known that this simulation can be very inefficient for some functions f and (g1; ··· ; gn). In this paper we show that the simulation is actually poly- nomially tight up to the choice of (g1; ··· ; gn). This also implies that the classical and quantum communication complexities of certain block- composed functions are polynomially related. 1 Introduction Decision tree complexity [4] and communication complexity [7] are two concrete models for studying computational complexity. In [3], Buhrman, Cleve and Wigderson gave a general method to design communication 1 1 n n protocol for block-composed functions f(g1(x ; y ); ··· ; gn(x ; y )). The basic idea is to simulate the decision tree computation for f, with queries i i of the i-th variable answered by a communication protocol for gi(x ; y ). In the language of complexity measures, this result gives CC(f(g1; ··· ; gn)) = O~(DT(f) · max CC(gi)) (1) i where CC and DT are the communication complexity and the decision tree complexity, respectively. This simulation holds for all the models: deterministic, randomized and quantum1. It is also well known that the communication protocol by the above simulation can be very inefficient.
    [Show full text]
  • Thesis Is Owed to Him, Either Directly Or Indirectly
    UvA-DARE (Digital Academic Repository) Quantum Computing and Communication Complexity de Wolf, R.M. Publication date 2001 Document Version Final published version Link to publication Citation for published version (APA): de Wolf, R. M. (2001). Quantum Computing and Communication Complexity. Institute for Logic, Language and Computation. General rights It is not permitted to download or to forward/distribute the text or part of it without the consent of the author(s) and/or copyright holder(s), other than for strictly personal, individual use, unless the work is under an open content license (like Creative Commons). Disclaimer/Complaints regulations If you believe that digital publication of certain material infringes any of your rights or (privacy) interests, please let the Library know, stating your reasons. In case of a legitimate complaint, the Library will make the material inaccessible and/or remove it from the website. Please Ask the Library: https://uba.uva.nl/en/contact, or a letter to: Library of the University of Amsterdam, Secretariat, Singel 425, 1012 WP Amsterdam, The Netherlands. You will be contacted as soon as possible. UvA-DARE is a service provided by the library of the University of Amsterdam (https://dare.uva.nl) Download date:30 Sep 2021 Quantum Computing and Communication Complexity Ronald de Wolf Quantum Computing and Communication Complexity ILLC Dissertation Series 2001-06 For further information about ILLC-publications, please contact Institute for Logic, Language and Computation Universiteit van Amsterdam Plantage Muidergracht 24 1018 TV Amsterdam phone: +31-20-525 6051 fax: +31-20-525 5206 e-mail: [email protected] homepage: http://www.illc.uva.nl/ Quantum Computing and Communication Complexity Academisch Proefschrift ter verkrijging van de graad van doctor aan de Universiteit van Amsterdam op gezag van de Rector Magni¯cus prof.dr.
    [Show full text]
  • Efficient Quantum Algorithms for Simulating Lindblad Evolution
    Efficient Quantum Algorithms for Simulating Lindblad Evolution∗ Richard Cleveyzx Chunhao Wangyz Abstract We consider the natural generalization of the Schr¨odingerequation to Markovian open system dynamics: the so-called the Lindblad equation. We give a quantum algorithm for simulating the evolution of an n-qubit system for time t within precision . If the Lindbladian consists of poly(n) operators that can each be expressed as a linear combination of poly(n) tensor products of Pauli operators then the gate cost of our algorithm is O(t polylog(t/)poly(n)). We also obtain similar bounds for the cases where the Lindbladian consists of local operators, and where the Lindbladian consists of sparse operators. This is remarkable in light of evidence that we provide indicating that the above efficiency is impossible to attain by first expressing Lindblad evolution as Schr¨odingerevolution on a larger system and tracing out the ancillary system: the cost of such a reduction incurs an efficiency overhead of O(t2/) even before the Hamiltonian evolution simulation begins. Instead, the approach of our algorithm is to use a novel variation of the \linear combinations of unitaries" construction that pertains to channels. 1 Introduction The problem of simulating the evolution of closed systems (captured by the Schr¨odingerequation) was proposed by Feynman [11] in 1982 as a motivation for building quantum computers. Since then, several quantum algorithms have appeared for this problem (see subsection 1.1 for references to these algorithms). However, many quantum systems of interest are not closed but are well-captured by the Lindblad Master equation [20, 12].
    [Show full text]
  • Arxiv:1611.07995V1 [Quant-Ph] 23 Nov 2016
    Factoring using 2n + 2 qubits with Toffoli based modular multiplication Thomas H¨aner∗ Station Q Quantum Architectures and Computation Group, Microsoft Research, Redmond, WA 98052, USA and Institute for Theoretical Physics, ETH Zurich, 8093 Zurich, Switzerland Martin Roettelery and Krysta M. Svorez Station Q Quantum Architectures and Computation Group, Microsoft Research, Redmond, WA 98052, USA We describe an implementation of Shor's quantum algorithm to factor n-bit integers using only 2n+2 qubits. In contrast to previous space-optimized implementations, ours features a purely Toffoli based modular multiplication circuit. The circuit depth and the overall gate count are in (n3) and (n3 log n), respectively. We thus achieve the same space and time costs as TakahashiO et al. [1], Owhile using a purely classical modular multiplication circuit. As a consequence, our approach evades most of the cost overheads originating from rotation synthesis and enables testing and localization of faults in both, the logical level circuit and an actual quantum hardware implementation. Our new (in-place) constant-adder, which is used to construct the modular multiplication circuit, uses only dirty ancilla qubits and features a circuit size and depth in (n log n) and (n), respectively. O O I. INTRODUCTION Cuccaro [5] Takahashi [6] Draper [4] Our adder Size Θ(n) Θ(n) Θ(n2) Θ(n log n) Quantum computers offer an exponential speedup over Depth Θ(n) Θ(n) Θ(n) Θ(n) their classical counterparts for solving certain problems, n the most famous of which is Shor's algorithm [2] for fac- Ancillas n+1 (clean) n (clean) 0 2 (dirty) toring a large number N | an algorithm that enables the breaking of many popular encryption schemes including Table I.
    [Show full text]
  • Hamiltonian Simulation with Nearly Optimal Dependence on All Parameters
    Hamiltonian simulation with nearly optimal dependence on all parameters Dominic W. Berry∗ Andrew M. Childsy Robin Kothariz We present an algorithm for sparse Hamiltonian simulation that has optimal dependence on all pa- rameters of interest (up to log factors). Previous algorithms had optimal or near-optimal scaling in some parameters at the cost of poor scaling in others. Hamiltonian simulation via quantum walk has optimal dependence on the sparsity d at the expense of poor scaling in the allowed error . In contrast, an ap- proach based on fractional-query simulation provides optimal scaling in at the expense of poor scaling in d. Here we combine the two approaches, achieving the best features of both. By implementing a linear combination of quantum walk steps with coefficients given by Bessel functions, our algorithm achieves near-linear scaling in τ := dkHkmaxt and sublogarithmic scaling in 1/. Our dependence on is optimal, and we prove a new lower bound ruling out sublinear dependence on τ. The problem of simulating the dynamics of quantum systems was the original motivation for quantum com- puters [14] and remains one of their major potential applications. The first explicit quantum simulation algorithm [16] gave a method for simulating Hamiltonians that are sums of local interaction terms. Aharonov and Ta-Shma gave an efficient simulation algorithm for the more general class of sparse Hamiltonians [2], and much subsequent work has given improved simulations [4,5,6,7,8, 12, 17, 18]. Sparse Hamiltonians include most physically realistic Hamiltonians as a special case. In addition, sparse Hamiltonian simulation can also be used to design other quantum algorithms [9, 10, 15].
    [Show full text]
  • Quantum Computing: Lecture Notes
    Quantum Computing: Lecture Notes Ronald de Wolf Preface These lecture notes were formed in small chunks during my “Quantum computing” course at the University of Amsterdam, Feb-May 2011, and compiled into one text thereafter. Each chapter was covered in a lecture of 2 45 minutes, with an additional 45-minute lecture for exercises and × homework. The first half of the course (Chapters 1–7) covers quantum algorithms, the second half covers quantum complexity (Chapters 8–9), stuff involving Alice and Bob (Chapters 10–13), and error-correction (Chapter 14). A 15th lecture about physical implementations and general outlook was more sketchy, and I didn’t write lecture notes for it. These chapters may also be read as a general introduction to the area of quantum computation and information from the perspective of a theoretical computer scientist. While I made an effort to make the text self-contained and consistent, it may still be somewhat rough around the edges; I hope to continue polishing and adding to it. Comments & constructive criticism are very welcome, and can be sent to [email protected] Attribution and acknowledgements Most of the material in Chapters 1–6 comes from the first chapter of my PhD thesis [71], with a number of additions: the lower bound for Simon, the Fourier transform, the geometric explanation of Grover. Chapter 7 is newly written for these notes, inspired by Santha’s survey [62]. Chapters 8 and 9 are largely new as well. Section 3 of Chapter 8, and most of Chapter 10 are taken (with many changes) from my “quantum proofs” survey paper with Andy Drucker [28].
    [Show full text]
  • Quantum Information Theory by Michael Aaron Nielsen
    Quantum Information Theory By Michael Aaron Nielsen B.Sc., University of Queensland, 1993 B.Sc. (First Class Honours), Mathematics, University of Queensland, 1994 M.Sc., Physics, University of Queensland, 1998 DISSERTATION Submitted in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy Physics The University of New Mexico Albuquerque, New Mexico, USA December 1998 c 1998, Michael Aaron Nielsen ii Dedicated to the memory of Michael Gerard Kennedy 24 January 1951 – 3 June 1998 iii Acknowledgments It is a great pleasure to thank the many people who have contributed to this Dissertation. My deepest thanks goes to my friends and family, especially my parents, Howard and Wendy, for their support and encouragement. Warm thanks also to the many other people who have con- tributed to this Dissertation, especially Carl Caves, who has been a terrific mentor, colleague, and friend; to Gerard Milburn, who got me started in physics, in research, and in quantum in- formation; and to Ben Schumacher, whose boundless enthusiasm and encouragement has provided so much inspiration for my research. Throughout my graduate career I have had the pleasure of many enjoyable and helpful discussions with Howard Barnum, Ike Chuang, Chris Fuchs, Ray- mond Laflamme, Manny Knill, Mark Tracy, and Wojtek Zurek. In particular, Howard Barnum, Carl Caves, Chris Fuchs, Manny Knill, and Ben Schumacher helped me learn much of what I know about quantum operations, entropy, and distance measures for quantum information. The material reviewed in chapters 3 through 5 I learnt in no small measure from these people. Many other friends and colleagues have contributed to this Dissertation.
    [Show full text]
  • Andrew Childs University of Maryland Arxiv:1711.10980
    Toward the first quantum simulation with quantum speedup Andrew Childs University of Maryland Dmitri Maslov Yunseong Nam Neil Julien Ross Yuan Su arXiv:1711.10980 Simulating Hamiltonian dynamics on a small quantum computer Andrew Childs Department of Combinatorics & Optimization and Institute for Quantum Computing University of Waterloo based in part on joint work with Dominic Berry, Richard Cleve, Robin Kothari, and Rolando Somma Workshop on What do we do with a small quantum computer? IBM Watson, 9 December 2013 Toward practical quantum speedup IBM Google/UCSB Delft Maryland Important early goal: demonstrate quantum computational advantage … but can we find a practical application of near-term devices? Challenges • Improve experimental systems • Improve algorithms and their implementation, making the best use of available hardware Our goal: Produce concrete resource estimates for the simplest possible practical application of quantum computers Quantum simulation “… nature isn’t classical, dammit, A classical computer cannot even represent and if you want to make a the state efficiently. simulation of nature, you’d better make it quantum mechanical, and by golly it’s a wonderful problem, A quantum computer cannot produce a because it doesn’t look so easy.” complete description of the state. Richard Feynman (1981) Simulating physics with computers But given succinct descriptions of • the initial state (suitable for a quantum computer to prepare it efficiently) and Quantum simulation problem: Given a • a final measurement (say, measurements description of the Hamiltonian H, an of the individual qubits in some basis), evolution time t, and an initial state (0) , a quantum computer can efficiently answer produce the final state ( t ) (to within| i questions that (apparently) a classical one some error tolerance ²|) i cannot.
    [Show full text]
  • Exponential Improvement in Precision for Simulating Sparse Hamiltonians
    Exponential improvement in precision for simulating sparse Hamiltonians , , Dominic W. Berry∗ Andrew M. Childs† ‡ Richard Cleve§ ‡ Robin Kothari§ Rolando D. Somma¶ Abstract We provide a quantum algorithm for simulating the dynamics of sparse Hamiltonians with complexity sublogarithmic in the inverse error, an exponential improvement over previous meth- ods. Specifically, we show that a d-sparse Hamiltonian H acting on n qubits can be simulated 2 log(τ/ǫ) log (τ/ǫ) for time t with precision ǫ using O τ log log(τ/ǫ) queries and O τ log log(τ/ǫ) n additional 2-qubit 2 gates, where τ = d H maxt. Unlike previous approaches based on product formulas, the query complexity is independentk k of the number of qubits acted on, and for time-varying Hamiltonians, the gate complexity is logarithmic in the norm of the derivative of the Hamiltonian. Our al- gorithm is based on a significantly improved simulation of the continuous- and fractional-query models using discrete quantum queries, showing that the former models are not much more powerful than the discrete model even for very small error. We also simplify the analysis of this conversion, avoiding the need for a complex fault correction procedure. Our simplification relies on a new form of “oblivious amplitude amplification” that can be applied even though the reflection about the input state is unavailable. Finally, we prove new lower bounds showing that our algorithms are optimal as a function of the error. 1 Introduction Simulation of quantum mechanical systems is a major potential application of quantum computers. Indeed, the problem of simulating Hamiltonian dynamics was the original motivation for the idea of quantum computation [21].
    [Show full text]
  • Elementary Gates for Quantum Computation
    PHYSICAL REVIEW A VOLUME 52, NUMBER 5 NOVEMBER 1995 Elementary gates for quantum computation Adriano Barenco, ' Charles H. Bennett, '~ Richard Cleve, '~ David P. DiVincenzo, '~ Norman Margolus, '~ Peter Shor, Tycho Sleator, ~ John A. Smolin, and Harald Weinfurter 'Clarendon Laboratory, Oxford University, Oxford OXI 3PU, United Kingdom IBM Research, Yorktown Heights, ¹wYork 10598 Department of Computer Science, University of Calgary, Calgary, Alberta, Canada T2N IN4 Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139 ATckT Bell Laboratories, Murray Hill, New Jersey 07974 Physics Department, New York University, New York, New York 10003 Physics Department, University of California at Los Angeles, Los Angeles, California 90024 Institute for Experimental Physics, University of Innsbruck, A-6020 Innsbruck, Austria (Received 22 March 1995) We show that a set of gates that consists of all one-bit quantum gates [U(2)] and the two-bit exclusive-oR gate [that maps Boolean values (x,y) to (x,x&y)] is universal in the sense that all unitary operations on arbitrarily many bits n [U(2")] can be expressed as compositions of these gates. We investigate the number of the above gates required to implement other gates, such as generalized Deutsch-Toffoli gates, that apply a specific U(2) transformation to one input bit if and only if the logical AND of all remaining input bits is satisfied. These gates play a central role in many proposed constructions of quantum computational networks. We derive upper and lower bounds on the exact number of elementary gates required to build up a variety of two- and three-bit quantum gates, the asymptotic number required for n-bit Deutsch-Toffoli gates, and make some observations about the number required for arbitrary n-bit unitary operations.
    [Show full text]
  • Quantum Interpolation of Polynomials
    Quantum interpolation of polynomials Daniel M. Kane∗ Samuel A. Kutin† August 2009 Abstract We consider quantum interpolation of polynomials. We imagine a quantum com- puter with black-box access to input/output pairs (xi,f(xi)), where f is a degree-d polynomial, and we wish to compute f(0). We give asymptotically tight quantum lower bounds for this problem, even in the case where 0 is among the possible values of xi. 1 Introduction Can a quantum computer efficiently interpolate polynomials? Can it distinguish low-degree from high-degree polynomials? We consider black-box algorithms that seek to learn infor- mation about a polynomial f from input/output pairs (xi, f(xi)). We define a more general class of (d,S)-independent function properties, where, outside of a set S of exceptions, know- ing d input values does not help one predict the answer. There are essentially two strategies to computing such a function: query d + 1 random input values, or search for one of the S | | exceptions. We show that, up to constant factors, we cannot beat these two approaches. Let be a collection of functions from some domain D to some range R. A property F is a (nontrivial) map : 0, 1 . We say that is (d,S)-independent for some subset P F →{ } P S D if, for any z , ..., zd D with z , ..., zr S and zr , ..., zd / S (where ⊆ 1 ∈ 1 ∈ +1 ∈ r = zi S ), the (d r)-tuple of values (f(zr ),...,f(zd)) is independent of the (r + 1)- |{ } ∩ | − +1 tuple (f(z1),...,f(zr), (f)).
    [Show full text]
  • Computational Problems Related to Open Quantum Systems
    Computational Problems Related to Open Quantum Systems by Chunhao Wang A thesis presented to the University of Waterloo in fulfillment of the thesis requirement for the degree of Doctor of Philosophy in Computer Science Waterloo, Ontario, Canada, 2018 © Chunhao Wang 2018 Examining Committee Membership The following served on the Examining Committee for this thesis. The decision of the Examining Committee is by majority vote. External Examiner: Hoi Fung Chau Professor, Department of Physics, The University of Hong Kong Supervisor(s): Richard Cleve Professor, Cheriton School of Computer Science, University of Waterloo Internal Member: Debbie Leung Professor, Department of Combinatorics and Optimization, University of Waterloo Internal Member: John Watrous Professor, Cheriton School of Computer Science, University of Waterloo Internal-External Member: Ashwin Nayak Professor, Department of Combinatorics and Optimization, University of Waterloo ii I hereby declare that I am the sole author of this thesis. This is a true copy of the thesis, including any required final revisions, as accepted by my examiners. I understand that my thesis may be made electronically available to the public. iii Abstract A quantum system that has interaction with external resources, such as probability dis- tribution, dissipation, and noise, is referred to as an open quantum system. Not only do open quantum systems play a vital role in the field of quantum physics, but they are also fundamental objects in quantum information and quantum computing. In this thesis, we focus on computational problems related to open quantum systems. In particular, we study efficient constructions of open quantum systems and their algorithmic applications. A unitary 2-design is a quantum analogue of universal 2-hash functions.
    [Show full text]