DOCSLIB.ORG

Thesis Is Based on the Following Papers

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Thesis Is Based on the Following Papers UvA-DARE (Digital Academic Repository) Quantum algorithms and learning theory Arunachalam, S. Publication date 2018 Document Version Final published version License Other Link to publication Citation for published version (APA): Arunachalam, S. (2018). Quantum algorithms and learning theory. 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:26 Sep 2021 Quantum Algorithms and Learning Theory Algorithms and Learning Quantum Quantum Algorithms and Learning Theory Srinivasan Arunachalam Srinivasan Arunachalam Quantum Algorithms and Learning Theory Srinivasan Arunachalam 517939-L-bw-Arunachalam Processed on: 12-4-2018 PDF page: 1 517939-L-bw-Arunachalam Processed on: 12-4-2018 PDF page: 2 Quantum Algorithms and Learning Theory 517939-L-bw-Arunachalam Processed on: 12-4-2018 PDF page: 3 ILLC Dissertation Series DS-2018-08 For further information about ILLC-publications, please contact Institute for Logic, Language and Computation Universiteit van Amsterdam Science Park 107 1098 XG Amsterdam phone: +31-20-525 6051 e-mail: [email protected] homepage: http://www.illc.uva.nl/ The investigations were supported by the ERC Consolidator Grant QPROGRESS. Copyright c 2018 by Srinivasan Arunachalam Printed and bound by Ipskamp Printing. ISBN: 978-94-028-0984-8 517939-L-bw-Arunachalam Processed on: 12-4-2018 PDF page: 4 Quantum Algorithms and Learning Theory Academisch Proefschrift ter verkrijging van de graad van doctor aan de Universiteit van Amsterdam op gezag van de Rector Magnificus prof. dr. ir. K.I.J. Maex ten overstaan van een door het College voor Promoties ingestelde commissie, in het openbaar te verdedigen in de Agnietenkapel op woensdag 25 april 2018, te 14.00 uur door Srinivasan Arunachalam geboren te Bangalore, India 517939-L-bw-Arunachalam Processed on: 12-4-2018 PDF page: 5 Promotiecommisie Promotores: Prof. dr. R. M. de Wolf Universiteit van Amsterdam Prof. dr. H. M. Buhrman Universiteit van Amsterdam Overige leden: Prof. dr. E. M. Opdam Universiteit van Amsterdam Prof. dr. C. J. M. Schoutens Universiteit van Amsterdam Prof. dr. P. D. Gr¨unwald Universiteit Leiden Dr. M. Ozols Universiteit van Amsterdam Dr. A. Montanaro University of Bristol, UK Faculteit der Natuurwetenschappen, Wiskunde en Informatica 517939-L-bw-Arunachalam Processed on: 12-4-2018 PDF page: 6 v This thesis is based on the following papers. For the first five papers, the authors are ordered alphabetically and the co-authorship is shared equally. For the sixth paper, the authors are ordered based on their contribution. 1. [AW17c] Srinivasan Arunachalam and Ronald de Wolf. Optimizing the Number of Gates in Quantum Search. In Quantum Information & Compu- tation, 17(3&4):251-261, 2017. 2. [ABP18] Srinivasan Arunachalam, Jop Bri¨et, and Carlos Palazuelos. Quan- tum query algorithms are completely bounded forms. In Proceedings of the 9th Conference on Innovations in Theoretical Computer Science (ITCS), pages 3:1-3:21, 2018. 3. [AW17a] Srinivasan Arunachalam and Ronald de Wolf. Guest column: A survey of quantum learning theory. In SIGACT News, 48(2):41-67, 2017. 4. [AW17b] Srinivasan Arunachalam and Ronald de Wolf. Optimal quantum sample complexity of learning algorithms. In 32nd Computational Com- plexity Conference (CCC), pages 25:1-25:31, 2017. 5. [ACLW18] Srinivasan Arunachalam, Sourav Chakraborty, Troy Lee, and Ronald de Wolf. Two new results on quantum exact learning. Manuscript. 6. [GAW17] Andr´as Gily´en, Srinivasan Arunachalam, and Nathan Wiebe. Optimizing quantum optimization algorithms via faster quantum gradient computation. Preprint available at arXiv:1711.00465 [quant-ph]. In the course of his PhD, the author has additionally (co-)authored the fol- lowing articles that are not included in this thesis (most of the work in these projects was done for his Master’s degree). 1. [AMR17] Srinivasan Arunachalam, Abel Molina, and Vincent Russo. Quan- tum hedging in two-round prover-verifier interactions. In 12th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2017). 2. [AGJO+15] Srinivasan Arunachalam, Vlad Gheorghiu, Tomas Jochym-O’ Connor, Michele Mosca, and Priyaa Varshinee Srinivasan. On the robust- ness of bucket brigade quantum RAM. In 10th Conference on the Theory of Quantum Computation, Communication and Cryptography (TQC 2015). Also in New Journal of Physics, 17(12): 123010, 2015. 3. [AJR15] Srinivasan Arunachalam, Nathaniel Johnston, and Vincent Russo Is absolute separability determined by the partial transpose? In Quantum Information & Computation, 15(7&8):694-720, 2015. 517939-L-bw-Arunachalam Processed on: 12-4-2018 PDF page: 7 517939-L-bw-Arunachalam Processed on: 12-4-2018 PDF page: 8 Contents Acknowledgments ix 1 Overview 1 1.1 Introduction .............................. 1 1.2 Quantum algorithms ......................... 3 1.3 Learning in a quantum world .................... 6 Part One: Quantum algorithms 2 Preliminaries and query complexity 13 2.1 Mathematical objects of interest ................... 14 2.2 Quantum information ......................... 16 2.3 Query models ............................. 20 2.4 Lower bound methods for quantum query complexity ....... 25 2.5 Quantum search in a database .................... 30 3 Gate complexity of quantum search 37 3.1 Introduction .............................. 38 3.2 Overview of the proof ......................... 39 3.3 Gate complexity of exact amplitude amplification ......... 41 3.4 Improving the gate complexity for quantum search ........ 43 3.5 Conclusion and future work ..................... 52 4 Refining the polynomial method 53 4.1 Introduction .............................. 54 4.2 Our results .............................. 56 4.3 Preliminaries ............................. 60 4.4 Characterizing quantum query algorithms ............. 64 vii 517939-L-bw-Arunachalam Processed on: 12-4-2018 PDF page: 9 viii Contents 4.5 Separations for quartic polynomials ................. 70 4.6 Short proof of Theorem 4.1.1 ..................... 77 4.7 Conclusion and future work ..................... 81 5 Quantum gradient-based optimization 83 5.1 Introduction .............................. 84 5.2 Gradient-based optimization ..................... 85 5.3 Quantum gradient calculation algorithm .............. 90 5.4 Other results ............................. 101 5.5 Conclusion and future work ..................... 104 Part Two: Learning in a quantum world 6 Survey of quantum learning theory 109 6.1 Introduction .............................. 110 6.2 Quantum subroutines ......................... 113 6.3 Learning models ............................ 114 6.4 Results on query complexity ..................... 117 6.5 Results on sample complexity .................... 125 6.6 The learnability of quantum states ................. 127 6.7 Time complexity ........................... 132 6.8 Conclusion and future work ..................... 137 7 Quantum sample complexity 139 7.1 Sample complexity and VC dimension ............... 140 7.2 Our results .............................. 142 7.3 Preliminaries ............................. 146 7.4 Information-theoretic lower bounds ................. 150 7.5 A lower bound by analysis of state identification .......... 158 7.6 Additional results. .......................... 168 7.7 Conclusion and future work ..................... 171 Bibliography 173 Abstract 195 Samenvatting 199 517939-L-bw-Arunachalam Processed on: 12-4-2018 PDF page: 10 Acknowledgments First and foremost, I would like to thank my advisor Ronald de Wolf, without whom this thesis would definitely have not been possible. Apart from his patient supervision and beautiful insights into various problems that we worked on, most importantly (and I can’t stress this enough) he had faith in me. The first two years of my PhD were slow, depressing, felt never-ending and needless to say, scientifically unproductive. When I thought it was time to quit, Ronald continued encouraging me, reiterating that things were going fine. Since you are reading this, I guess Ronald was right after all and his faith in me was justified maybe. I really thank him for this. There were two memorable moments in these four years. First, when Ronald went nuts when I was sloppy (and didn’t know!) when using the Kleene star notation1 and this emphasized the importance of rigor in his style of research. Second, when Ronald finally agreed to work on quantum learning theory with me and those collaborations contributed to a major part of this thesis. Overall, it has been an amazing learning experience being a student and collaborator of Ronald. Thanks for the opportunity. I am grateful to the members of my PhD committee, Harry Buhrman, Eric Op- dam, Kareljan Schoutens, Peter
Load more

Recommended publications
  • 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]
  • Noise in Quantum and Classical Computation & Non-Locality
    Noise in Quantum and Classical Computation & Non-locality Falk Unger Noise in Quantum and Classical Computation & Non-locality ILLC Dissertation Series DS-2008-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/ Noise in Quantum and Classical Computation & Non-locality Academisch Proefschrift ter verkrijging van de graad van doctor aan de Universiteit van Amsterdam op gezag van de Rector Magnificus prof. dr. D.C. van den Boom ten overstaan van een door het college voor promoties ingestelde commissie, in het openbaar te verdedigen in de Agnietenkapel op donderdag 18 september 2008, te 10.00 uur door Falk Peter Unger geboren te Dresden, Duitsland. Promotiecommissie: Promotor: prof. dr. H.M. Buhrman Overige Leden: prof. dr. R.E. Cleve prof. dr. R.D. Gill prof. dr. A. Schrijver dr. L. Torenvliet dr. R.M. de Wolf Faculteit der Natuurwetenschappen, Wiskunde en Informatica The investigations were financially supported by the EU project QAP (IST- 2005-15848) and by the Netherlands Organisation for Scientific Research (NWO) in the framework of the Innovational Research Incentives Scheme (in Dutch: Vernieuwingsimpuls), Vici-project 639.023.302. Copyright c 2008 by Falk Unger Printed and bound by PrintPartners Ipskamp. ISBN: 90-6196-547-0 The results in this thesis are based on the following articles Chapter 3 The results
    [Show full text]
  • Classical and Quantum Algorithms for Finding Cycles
    City University of New York (CUNY) CUNY Academic Works Publications and Research CUNY Graduate Center 2006 Classical and Quantum Algorithms for Finding Cycles Jill Cirasella CUNY Graduate Center How does access to this work benefit ou?y Let us know! More information about this work at: https://academicworks.cuny.edu/gc_pubs/169 Discover additional works at: https://academicworks.cuny.edu This work is made publicly available by the City University of New York (CUNY). Contact: [email protected] Classical and Quantum Algorithms for Finding Cycles MSc Thesis (Afstudeerscriptie) written by Jill Cirasella (born in 1976 in New Jersey, United States) under the supervision of Prof. Dr. Harry Buhrman, and submitted to the Board of Examiners in partial fulfillment of the requirements for the degree of MSc in Logic at the Universiteit van Amsterdam. Date of the public defense: Members of the Thesis Committee: January 26, 2006 Prof. Dr. Harry Buhrman Dr. Benedikt L¨owe Dr. Ronald de Wolf Abstract Quantum computing—so weird, so wonderful—inspires much speculation about the line be- tween the possible and the impossible. (Of course, there is still unclarity about how “impossi- ble” intractable problems are and about how “possible” quantum computers are.) This thesis takes a slightly different tack: instead of focusing on how to make the impossible possible, it focuses on how to make the possible easier. More specifically, this paper discusses quantum algorithms for finding cycles in graphs, a problem for which polynomial-time classical algorithms already exist. It explains and com- pares the classical and quantum algorithms, and it introduces a few new algorithms and observations.
    [Show full text]
  • A Survey of Quantum Property Testing
    UvA-DARE (Digital Academic Repository) A Survey of Quantum Property Testing Montanaro, A.; de Wolf, R. DOI 10.4086/toc.gs.2016.007 Publication date 2016 Document Version Final published version Published in Theory of Computing License CC BY Link to publication Citation for published version (APA): Montanaro, A., & de Wolf, R. (2016). A Survey of Quantum Property Testing. Theory of Computing, Theory of Computing Library, Graduate Surveys(7), 1-81. https://doi.org/10.4086/toc.gs.2016.007 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 THEORY OF COMPUTING LIBRARY GRADUATE SURVEYS 7 (2016), pp. 1–81 www.theoryofcomputing.org A Survey of Quantum Property Testing Ashley Montanaro∗ Ronald de Wolf† Received November 13, 2013; Published July 26, 2016 Abstract: The area of property testing tries to design algorithms that can efficiently handle very large amounts of data: given a large object that either has a certain property or is somehow “far” from having that property, a tester should efficiently distinguish between these two cases.
    [Show full text]
  • Quantum Proofs for Classical Theorems
    THEORY OF COMPUTING LIBRARY GRADUATE SURVEYS 2 (2011), pp. 1–54 www.theoryofcomputing.org Quantum Proofs for Classical Theorems Andrew Drucker∗ Ronald de Wolf† Received: October 18, 2009; published: March 9, 2011. Abstract: Alongside the development of quantum algorithms and quantum complexity theory in recent years, quantum techniques have also proved instrumental in obtaining results in diverse classical (non-quantum) areas, such as coding theory, communication complexity, and polynomial approximations. In this paper we survey these results and the quantum toolbox they use. ACM Classification: F.1.2 AMS Classification: 81P68 Key words and phrases: quantum arguments, quantum computing, quantum information, polynomial approximation ∗Supported by a DARPA YFA grant. †Partially supported by a Vidi grant from the Netherlands Organization for Scientific Research (NWO), and by the European Commission under the projects Qubit Applications (QAP, funded by the IST directorate as Contract Number 015848) and Quantum Computer Science (QCS). 2011 Andrew Drucker and Ronald de Wolf Licensed under a Creative Commons Attribution License DOI: 10.4086/toc.gs.2011.002 ANDREW DRUCKER AND RONALD DE WOLF Contents 1 Introduction 3 1.1 Surprising proof methods..................................3 1.2 A quantum method?.....................................4 1.3 Outline...........................................5 2 The quantum toolbox5 2.1 The quantum model.....................................6 2.2 Quantum information and its limitations..........................9 2.3 Quantum query algorithms................................. 11 3 Using quantum information theory 14 3.1 Communication lower bound for inner product...................... 14 3.2 Lower bounds on locally decodable codes......................... 16 3.3 Rigidity of Hadamard matrices............................... 18 4 Using the connection with polynomials 21 4.1 e-approximating polynomials for symmetric functions.................
    [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] Those who want to read more (much more. ): see the book by Nielsen and Chuang [89]. Attribution and acknowledgments Most of the material in Chapters 1–6 comes from the first chapter of my PhD thesis [108], 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 [95]. Chapters 8 and 9 are largely new as well.
    [Show full text]
  • Quantum Computing: Lecture Notes
    Quantum Computing: Lecture Notes Ronald de Wolf QuSoft, CWI and University of Amsterdam arXiv:1907.09415v2 [quant-ph] 20 Jan 2021 Dedicated to the memory of my father Abraham de Wolf (1942{2019) ii Preface from 2011 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] Those who want to read more (much more. ): see the book by Nielsen and Chuang [144] for the general area, the book of John Watrous [175] for quantum information theory, and the lecture notes of John Preskill [146] for the theoretical physics perspective. Attribution, acknowledgments, subsequent updates Most of the material in Chapters 1{6 [chapter numbers in this paragraph are for the 2011 ver- sion] comes from the first chapter of my PhD thesis [176], with a number of additions: the lower bound for Simon, the Fourier transform, the geometric explanation of Grover.
    [Show full text]
  • Quantum Computing and Communication Complexity
    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 Magnificus prof.dr. J.J.M. Franse ten overstaan van een door het college voor promoties ingestelde commissie, in het openbaar te verdedigen in de Aula der Universiteit op donderdag 6 september 2001, te 12.00 uur door Ronald Michiel de Wolf geboren te Zaandam. Promotiecommissie: Promotores: Prof.dr. H.M. Buhrman Prof.dr.ir. P.M.B. Vit´anyi Overige leden: Prof.dr. R.E. Cleve Dr. M. Santha Prof.dr. A. Schrijver Dr. L. Torenvliet Faculteit der Natuurwetenschappen, Wiskunde en Informatica Copyright c 2001 by Ronald de Wolf ° ISBN: 90–5776–068–1 Se non `evero, `eben trovato. v Contents Acknowledgments xiii 1 Quantum Computing 1 1.1 Introduction.............................. 1 1.2 QuantumMechanics ......................... 2 1.2.1 Superposition ......................... 3 1.2.2 Measurement ......................... 3 1.2.3 Unitaryevolution....................... 4 1.3 QuantumMemory .......................... 5 1.4 QuantumComputation........................ 7 1.4.1 Classical circuits . 7 1.4.2 Quantumcircuits ....................... 8 1.5 TheEarlyAlgorithms ........................ 10 1.5.1 Deutsch-Jozsa......................... 11 1.5.2 Bernstein-Vazirani . 13 1.5.3 Simon ............................. 13 1.6 Shor’sFactoringAlgorithm.
    [Show full text]
  • Near-Optimal and Explicit Bell Inequality Violations∗
    THEORY OF COMPUTING, Volume 8 (2012), pp. 623–645 www.theoryofcomputing.org Near-Optimal and Explicit Bell Inequality Violations∗ Harry Buhrman† Oded Regev‡ Giannicola Scarpa§ Ronald de Wolf¶ Received: September 15, 2011; revised: August 31, 2012; published: December 27, 2012. Abstract: Entangled quantum systems can exhibit correlations that cannot be simulated classically. For historical reasons such correlations are called “Bell inequality violations.” We give two new two-player games with Bell inequality violations that are stronger, fully explicit, and arguably simpler than earlier work. The first game is based on the Hidden Matching problem of quantum communication complexity, introduced by Bar-Yossef, Jayram, and Kerenidis. This game can be won with probability 1 by a strategy using a maximally entangled state with local dimension n (e. g., logn EPR-pairs), while we show that the winning probability of any classical strategy differs p from 1=2 by at most O((logn)= n). ∗An earlier version of this paper appeared in the Proceedings of the 26th IEEE Conference on Computational Complexity, pages 157–166, 2011. †Supported by a Vici grant from the Netherlands Organisation for Scientific Research (NWO), and by the European Commission under the project QCS (Grant No. 255961). ‡Supported by the Israel Science Foundation, by the Wolfson Family Charitable Trust, and by a European Research Council (ERC) Starting Grant. Part of the work done while a DIGITEO visitor in LRI, Orsay. §Supported by a Vidi grant from the Netherlands Organisation for Scientific Research (NWO), and by the European Commission under the project QCS (Grant No. 255961). ¶Supported by a Vidi grant from the Netherlands Organisation for Scientific Research (NWO), and by the European Commission under the project QCS (Grant No.
    [Show full text]
  • Self Evaluation 2012-2014
    Institute for Logic, Language and Computation Self-Evaluation 2012{2014 Contents Preface v A The Institute 1 1 The Institute for Logic, Language and Computation 1 1.1 The Institute for Logic, Language and Computation . .1 1.1.1 Mission of the ILLC . .1 1.1.2 Research Structure . .2 1.1.3 Organisational Structure . .2 1.2 Main developments 2012{2014 . .4 1.2.1 Staff . .4 1.2.2 Financing . .6 1.2.3 Research areas & collaborations . .7 1.2.4 Institutional embedding . 10 1.2.5 ILLC PhD programme . 12 1.2.6 Research Integrity . 12 1.3 Evaluation and Recommendations 2006{2011 . 13 1.3.1 Evaluation . 13 1.3.2 Recommendations and follow-up . 14 1.4 Quality and Relevance . 16 1.4.1 Scientific Quality . 16 1.4.2 Societal Relevance . 19 1.5 Strategy and Viability . 20 1.5.1 SWOT analysis . 20 1.5.2 Strategy . 22 B The Programmes 25 2 Logic and Language 27 2.1 Objectives . 27 2.2 Composition . 27 2.3 Academic Reputation . 28 i CONTENTS 2.4 Valorisation . 29 2.5 Research Income . 30 2.6 Highlights . 31 2.7 Key Publications . 32 2.8 Book Publications . 33 2.9 SWOT Analysis . 34 2.10 Strategy . 35 3 Logic and Computation 37 3.1 Objectives . 37 3.2 Composition . 37 3.3 Academic Reputation . 38 3.4 Valorisation . 39 3.5 Research Income . 40 3.6 Highlights . 40 3.7 Key Publications . 42 3.8 Book Publications . 42 3.9 SWOT Analysis . 43 3.10 Strategy .
    [Show full text]
  • Reflections for Quantum Query Complexity
    Reflections for quantum query complexity: The general adversary bound is tight for every boolean function Ben W. Reichardt Institute for Quantum Computing University of Waterloo Abstract We show that any boolean function can be evaluated optimally by a bounded-error quan- tum query algorithm that alternates a certain fixed, input-independent reflection with coherent queries to the input bits (a second reflection). Originally introduced for the unstructured search problem, this two-reflections paradigm is therefore a universal feature of quantum algorithms. Our proof goes via the general adversary bound, a semi-definite program (SDP) that lower- bounds the quantum query complexity of a function. By a quantum algorithm for evaluating span programs, this lower bound is known to be tight up to a sub-logarithmic factor. The extra factor comes from converting a continuous-time query algorithm into a discrete-query algorithm. We give a direct and simplified quantum algorithm based on the dual SDP, with a query complexity that matches the general adversary bound. Therefore, the general adversary lower bound is tight; it is in fact an SDP for quantum query complexity. This implies that the bounded-error quantum query complexity of the composition f ◦ (g; : : : ; g) of two boolean functions f and g matches the product of the query complexities of f and g, without a logarithmic factor for error reduction. It further shows that span programs are equivalent to quantum query algorithms. 1 Introduction The query complexity, or decision-tree complexity, of a function measures the number of input bits that must be read in order to evaluate the function.
    [Show full text]
  • Quantum Proofs for Classical Theorems
    Edinburgh Research Explorer Quantum Proofs for Classical Theorems Citation for published version: Drucker, A & Wolf, RD 2011, 'Quantum Proofs for Classical Theorems', Theory of Computing, Graduate Surveys, vol. 2, pp. 1-54. https://doi.org/10.4086/toc.gs.2011.002 Digital Object Identifier (DOI): 10.4086/toc.gs.2011.002 Link: Link to publication record in Edinburgh Research Explorer Document Version: Publisher's PDF, also known as Version of record Published In: Theory of Computing, Graduate Surveys General rights Copyright for the publications made accessible via the Edinburgh Research Explorer is retained by the author(s) and / or other copyright owners and it is a condition of accessing these publications that users recognise and abide by the legal requirements associated with these rights. Take down policy The University of Edinburgh has made every reasonable effort to ensure that Edinburgh Research Explorer content complies with UK legislation. If you believe that the public display of this file breaches copyright please contact [email protected] providing details, and we will remove access to the work immediately and investigate your claim. Download date: 04. Oct. 2021 THEORY OF COMPUTING LIBRARY GRADUATE SURVEYS 2 (2011), pp. 1–54 www.theoryofcomputing.org Quantum Proofs for Classical Theorems Andrew Drucker∗ Ronald de Wolf† Received: October 18, 2009; published: March 9, 2011. Abstract: Alongside the development of quantum algorithms and quantum complexity theory in recent years, quantum techniques have also proved instrumental in obtaining results in diverse classical (non-quantum) areas, such as coding theory, communication complexity, and polynomial approximations. In this paper we survey these results and the quantum toolbox they use.
    [Show full text]