DOCSLIB.ORG

Thesis Are Based on Material Contained in the Following Papers: • Cryptography from Noisy Storage S

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Thesis Are Based on Material Contained in the Following Papers: • Cryptography from Noisy Storage S UvA-DARE (Digital Academic Repository) Cryptography in a quantum world Wehner, S.D.C. Publication date 2008 Document Version Final published version Link to publication Citation for published version (APA): Wehner, S. D. C. (2008). Cryptography in a quantum world. 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 Cryptography in a Quantum World Stephanie Wehner Cryptography in a Quantum World ILLC Dissertation Series DS-2008-01 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/ Cryptography in a Quantum World 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 woensdag 27 februari 2008, te 14.00 uur door Stephanie Dorothea Christine Wehner geboren te W¨urzburg, Duitsland. Promotiecommissie: Promotor: prof.dr. H.M. Buhrman Overige leden: prof.dr.ir. F.A. Bais prof.dr. R.J.F. Cramer prof.dr. R.H. Dijkgraaf prof.dr. A.J. Winter dr. R.M. de Wolf Faculteit der Natuurwetenschappen, Wiskunde en Informatica The investigations were supported by EU projects RESQ IST-2001-37559, QAP IST 015848 and the NWO vici project 2004-2009. Copyright c 2008 by Stephanie Wehner Cover design by Frans Bartels. Printed and bound by PrintPartners Ipskamp. ISBN: 90-6196-544-6 Parts of this thesis are based on material contained in the following papers: • Cryptography from noisy storage S. Wehner, C. Schaffner, and B. Terhal Submitted (Chapter 11) • Higher entropic uncertainty relations for anti-commuting observ- ables S. Wehner and A. Winter Submitted (Chapter 4) • Security of Quantum Bit String Commitment depends on the in- formation measure H. Buhrman, M. Christandl, P. Hayden, H.K. Lo and S. Wehner In Physical Review Letters, 97, 250501 (2006) (long version submitted to Physical Review A) (Chapter 10) • State Discrimination with Post-Measurement Information M. Ballester, S. Wehner and A. Winter To appear in IEEE Transactions on Information Theory (Chapter 3) • Entropic uncertainty relations and locking: tight bounds for mu- tually unbiased bases M. Ballester and S. Wehner In Physical Review A, 75, 022319 (2007) (Chapters 4 and 5) • Tsirelson bounds for generalized CHSH inequalities S. Wehner In Physical Review A, 73, 022110 (2006) (Chapter 7) • Entanglement in Interactive Proof Systems with Binary Answers S. Wehner In Proceedings of STACS 2006, LNCS 3884, pages 162-171 (2006) (Chapter 9) Other papers to which the author contributed during her time as a PhD student: v • The quantum moment problem A. Doherty, Y. Liang, B. Toner and S. Wehner Submitted • Security in the Bounded Quantum Storage Model S. Wehner and J. Wullschleger Submitted • A simple family of non-additive codes J.A. Smolin, G. Smith and S. Wehner In Physical Review Letters, 99, 130505 (2007) • Analyzing Worms and Network Traffic using Compression S. Wehner Journal of Computer Security, Vol 15, Number 3, 303-320 (2007) • Implications of Superstrong Nonlocality for Cryptography H. Buhrman, M. Christandl, F. Unger, S. Wehner and A. Winter In Proceedings of the Royal Society A, vol. 462 (2071), pages 1919-1932 (2006) • Quantum Anonymous Transmissions M. Christandl and S. Wehner In Proceedings of ASIACRYPT 2005, LNCS 3788, pages 217-235 (2005) vi C’est v´eritablement utile puisque c’est joli. Le Petit Prince, Antoine de Saint-Exup´ery vii Contents Acknowledgments xv I Introduction 1 1 Quantum cryptography 3 1.1 Introduction . 3 1.2 Setting the state . 5 1.2.1 Terminology . 5 1.2.2 Assumptions . 6 1.2.3 Quantum properties . 7 1.3 Primitives . 9 1.3.1 Bit commitment . 9 1.3.2 Secure function evaluation . 11 1.3.3 Secret sharing . 17 1.3.4 Anonymous transmissions . 18 1.3.5 Other protocols . 19 1.4 Challenges . 19 1.5 Conclusion . 20 II Information in quantum states 23 2 Introduction 25 2.1 Quantum mechanics . 25 2.1.1 Quantum states . 25 2.1.2 Multipartite systems . 27 2.1.3 Quantum operations . 29 2.2 Distinguishability . 32 ix 2.3 Information measures . 36 2.3.1 Classical . 36 2.3.2 Quantum . 37 2.4 Mutually unbiased bases . 39 2.4.1 Latin squares . 39 2.4.2 Generalized Pauli matrices . 41 2.5 Conclusion . 42 3 State discrimination with post-measurement information 43 3.1 Introduction . 43 3.1.1 Outline . 45 3.1.2 Related work . 46 3.2 Preliminaries . 47 3.2.1 Notation and tools . 47 3.2.2 Definitions . 47 3.2.3 A trivial bound: guessing the basis . 48 3.3 No post-measurement information . 49 3.3.1 Two simple examples . 49 3.3.2 An upper bound for all Boolean functions . 50 3.3.3 AND function . 50 3.3.4 XOR function . 51 3.4 Using post-measurement information . 54 3.4.1 A lower bound for balanced functions . 54 3.4.2 Optimal bounds for the AND and XOR function . 57 3.5 Using post-measurement information and quantum memory . 63 3.5.1 An algebraic framework for perfect prediction . 63 3.5.2 Using two bases . 66 3.5.3 Using three bases . 70 3.6 Conclusion . 72 4 Uncertainty relations 75 4.1 Introduction . 75 4.2 Limitations of mutually unbiased bases . 78 4.2.1 MUBs in square dimensions . 79 4.2.2 MUBs based on Latin squares . 80 4.2.3 Using a full set of MUBs . 80 4.3 Good uncertainty relations . 83 4.3.1 Preliminaries . 84 4.3.2 A meta-uncertainty relation . 89 4.3.3 Entropic uncertainty relations . 89 4.4 Conclusion . 91 x 5 Locking classical information 93 5.1 Introduction . 93 5.1.1 A locking protocol . 94 5.1.2 Locking and uncertainty relations . 95 5.2 Locking using mutually unbiased bases . 96 5.2.1 An example . 96 5.2.2 MUBs from generalized Pauli matrices . 99 5.2.3 MUBs from Latin squares . 101 5.3 Conclusion . 101 III Entanglement 103 6 Introduction 105 6.1 Introduction . 105 6.1.1 Bell’s inequality . 106 6.1.2 Tsirelson’s bound . 108 6.2 Setting the stage . 109 6.2.1 Entangled states . 109 6.2.2 Other Bell inequalities . 110 6.2.3 Non-local games . 110 6.3 Observations . 113 6.3.1 Simple structural observations . 113 6.3.2 Vectorizing measurements . 115 6.4 The use of post-measurement information . 116 6.5 Conclusion . 119 7 Finding optimal quantum strategies 121 7.1 Introduction . 121 7.2 A simple example: Tsirelson’s bound . 123 7.3 The generalized CHSH inequality . 125 7.4 General approach and its applications . 128 7.4.1 General approach . 128 7.4.2 Applications . 129 7.5 Conclusion . 130 8 Bounding entanglement in NL-games 131 8.1 Introduction . 131 8.2 Preliminaries . 132 8.2.1 Random access codes . 132 8.2.2 Non-local games and state discrimination . 134 8.3 A lower bound . 134 8.4 Upper bounds . 136 xi 8.5 Conclusion . 138 9 Interactive Proof Systems 139 9.1 Introduction . 139 9.1.1 Classical interactive proof systems . 139 9.1.2 Quantum multi-prover interactive proof systems . 140 9.2 Proof systems and non-local games . 142 9.2.1 Non-local games . 142 9.2.2 Multiple classical provers . 143 9.2.3 A single quantum prover . 145 9.3 Simulating two classical provers with one quantum prover . 145 9.4 Conclusion . 148 IV Consequences for Crytography 149 10 Limitations 151 10.1 Introduction . 151 10.2 Preliminaries . 152 10.2.1 Definitions . 152 10.2.2 Model . 153 10.2.3 Tools . 154 10.3 Impossibility of quantum string commitments . 156 10.4 Possibility . ..
Load more

Recommended publications
  • 2013 Industry Canada Report
    Industry Canada Report 2012/13 Reporting Period Institute for Quantum Computing University of Waterloo June 15, 2013 Industry Canada Report | 2 Note from the Executive Director Harnessing the quantum world will lead to new technologies and applications that will change the world. The quantum properties of nature allow the accomplishment of tasks which seem intractable with today’s technologies, offer new means of securing private information and foster the development of new sensors with precision yet unseen. In a short 10 years, the Institute for Quantum Computing (IQC) at the University of Waterloo has become a world-renowned institute for research in the quantum world. With more than 160 researchers, we are well on our way to reaching our goal of 33 faculty, 60 post doctoral fellows and 165 students. The research has been world class and many results have received international attention. We have recruited some of the world’s leading researchers and rising stars in the field. 2012 has been a landmark year. Not only did we celebrate our 10th anniversary, but we also expanded into our new headquarters in the Mike and Ophelia Lazaridis Quantum-Nano Centre in the heart of the University of Waterloo campus. This 285,000 square foot facility provides the perfect environment to continue our research, grow our faculty complement and attract the brightest students from around the globe. In this report, you will see many examples of the wonderful achievements we’ve celebrated this year. IQC researcher Andrew Childs and his team proposed a new computational model that has the potential to become an architecture for a scalable quantum computer.
    [Show full text]
  • Workshop on Quantum Algorithms and Devices Friday, July 15, 2016 - Microsoft Research Building 33
    Workshop on Quantum Algorithms and Devices Friday, July 15, 2016 - Microsoft Research Building 33 In 1981, Richard Feynman proposed a device called a “quantum computer” that would take advantage of methods founded on the laws of quantum physics and promise computational speed-ups over classical methods. In the last three decades, quantum algorithms have been developed that offer fast solutions to problems in a variety of fields including number theory, optimization, database search, chemistry, and physics. For quantum devices, this past year marks significant progress towards scalable quantum bits and gates. The workshop will highlight recent advances in quantum algorithms, quantum devices, control systems, and quantum error correction. Other quantum topics may be covered depending on the speakers’ preferences. 8:30 – 9:00 ARAM HARROW - QUANTUM MONTE CARLO VS TUNNELING IN ADIABATIC OPTIMIZATION 9:05 – 9:35 STEPHEN JORDAN - ADIABATIC OPTIMIZATION VERSUS DIFFUSION MONTE CARLO 9:40 – 10:10 FERNANDO BRANDAO - QUANTUM SPEED-UPS FOR SEMIDEFINITE PROGRAMMING 10:15 – 10:30 *COFFEE BREAK* 10:35 – 11:05 DMITRI MASLOV - HOW TO PROGRAM A TRAPPED IONS QUANTUM COMPUTER 11:10 – 11:40 JEREMY O’BRIEN & TERRY RUDOLPH - PHOTONIC QUANTUM COMPUTING 11:45 – 12:00 LIQUI|> CODING CHALLENGE WINNERS 12:00 – 1:00 *LUNCH* 1:05 – 1:35 BARBARA TERHAL - LOCAL DECODERS AND THEIR PERFORMANCE FOR 2D AND 4D TORIC CODES 1:40 – 2:10 DAVID POULIN - FAULT-TOLERANT QUANTUM MEMORY FOR NON-ABELIAN ANYONS (JOINT WORK WITH GUILLAUME DAUPHINAIS) 2:15 – 2:45 SCOTT AARONSON - QUANTUM
    [Show full text]
  • Estimating the Resources for Quantum Computation with the Qure Toolbox
    ESTIMATING THE RESOURCES FOR QUANTUM COMPUTATION WITH THE QuRE TOOLBOX MARTIN SUCHARA1;a, ARVIN FARUQUE2, CHING-YI LAI3, GERARDO PAZ3, FREDERIC T. CHONG2, JOHN KUBIATOWICZ1 1Computer Science Division, UC Berkeley, 387 Soda Hall Berkeley, CA 94720, U.S.A. 2Computer Science Department, UC Santa Barbara, Harold Frank Hall Santa Barbara, CA 93106, U.S.A. 3Department of Electrical Engineering Systems, University of Southern California Los Angeles, CA 90089, U.S.A. This report describes the methodology employed by the Quantum Resource Estimator (QuRE) toolbox to quantify the resources needed to run quantum algorithms on quantum computers with realistic properties. The QuRE toolbox estimates several quantities including the number of physical qubits required to run a specified quantum algorithm, the execution time on each of the specified physical technologies, the probability of success of the computation, as well as physical gate counts with a breakdown by gate type. Estimates are performed for error-correcting codes from both the concatenated and topological code families. Our work, which provides these resource estimates for a cross product of seven quantum algorithms, six physical machine descriptions, several quantum control protocols, and four error-correcting codes, represents the most comprehensive resource estimation effort in the field of quantum computation to date. 1 Introduction Estimating the running time, number of qubits and other resources needed by realistic models of quantum computers is the first necessary step to reducing these resource requirements. This report describes our Quantum Resource Estimator (QuRE) toolbox which we used to calculate resource estimates for a cross product of several quantum algorithms, quantum technologies, and error-correction techniques.
    [Show full text]
  • Female Physicists in the Netherlands
    Female Physicists in the Netherlands UvA Dr. Flavia de Almeida Dias - Experimental particle physics [email protected] (also Nikhef) Dr. Alejandra Castro Anich - string theory [email protected] Dr. Miranda Cheng – Theoretical Physics (string theory, quantum gravity…) [email protected] Dr. Nathalie Degenaar - Astrophysics [email protected] Dr. Clélia de Mulatier - Physics of Complex Systems [email protected] Dr. Kateřina Dohnalová Newell – Photophysics of Nanostructures [email protected] Dr. Sara Jabbari Farouji – Modeling & Simulation of Soft Matter, Active Matter [email protected] Prof. Sera Markoff – Theoretical Astrophysics [email protected] Dr. Samaya Nissanke – Gravitational Waves [email protected] Dr. Antonija Oklopčić – Astrophysics [email protected] Dr. Tina Pollmann – Exp. astroparticle physics [email protected] Dr. Antonia Rowlinson – Transient Astronomy [email protected] Dr Arghavan Safavi-Naini – Quantum simulations [email protected] Prof. Noushine Shahidzadeh – Wetting, Physics of Fluids [email protected] Dr. Hella Snoek – Experimental Particle Physics [email protected] (also Nikhef) Dr. Jory Sonneveld - Experimental Particle physics, Detector development (also Nikhef) [email protected] Dr Silvia Toonen – Astrophysics [email protected] Prof. Anna Watts – Astrophysics [email protected] Soon to come: Dr. Anna Isaeva – Condensed Matter Physics VU Dr. Lyuba Amitonova – Nanoscale Imaging and Metrology | [email protected] (also at ARCNL) Dr. Imran Avci – Biophotonics and Microscopy [email protected] Prof. Roberta Croce – Biophysics of Photosynthesis [email protected] Prof. Paola Gori Giorgi – Theory: Quantum Matter in Physics & Chemistry [email protected] Prof.
    [Show full text]
  • Fault Tolerant Architectures for Superconducting Qubits
    Fault tolerant architectures for superconducting qubits David P. DiVincenzo IBM Research Division, Thomas J. Watson Research Center, Yorktown Heights, NY 10598 (Dated: September 28, 2009) In this short review, I draw attention to new developments in the theory of fault tolerance in quantum computation that may give concrete direction to future work in the development of superconducting qubit systems. The basics of quantum error correction codes, which I will briefly review, have not significantly changed since their introduction fifteen years ago. But an interesting picture has emerged of an efficient use of these codes that may put fault tolerant operation within reach. It is now understood that two dimensional surface codes, close relatives of the original toric code of Kitaev, can be adapted as shown by Raussendorf and Harrington to effectively perform logical gate operations in a very simple planar architecture, with error thresholds for fault tolerant operation simulated to be 0.75%. This architecture uses topological ideas in its functioning, but it is not “topological quantum computation” -- there are no non-abelian anyons in sight. I offer some speculations on the crucial pieces of superconducting hardware that could be demonstrated in the next couple of years that would be clear stepping stones towards this surface-code architecture. 1 Introduction When I agreed to act as raconteur at this Symposium, the organizers created a title for my expected contribution, which the present article bears. I decided to accept the challenge of speaking and writing to such a title, even though it certainly implies a competency that I do not possess.
    [Show full text]
  • In Accordance with the 'Partnerconvenant Qutech'
    2017 Annual Report In accordance with the ‘Partnerconvenant QuTech’ 1 Foreword Annual report 2017 QuTech On behalf of the whole of QuTech, In 2017, QuTech has attracted some of the I am proud to present the yearly best researchers in quantum technology to join report for 2017. It presents an over- our mission. Prof. Barbara Terhal (0,8 FTE) and view of the research ‘roadmaps’ part-time Prof. David DiVincenzo, both leading along with several other activities, experts in quantum information theory and error such as QuTech partnerships, correction, started at QuTech in September. outreach and academy. From our own ranks, Dr. Srijit Goswami has been contracted as a senior researcher on topological In my view, 2017 marks the completion of the first qubits. phase of QuTech, in which we have transitioned to a mission-driven research program, enabled With the internal research programs now running by both scientific breakthroughs and engineering at full steam, QuTech is ready for its next phase, efforts. Most PhD students that started their in which we will form stronger connections to research in the pre-QuTech era have now the outside world. The demonstrator projects graduated. The roadmaps of QuTech have a will allow external researchers to connect to and clear direction and demonstrate a strong synergy use our hardware and software platforms. The between science and engineering. The scientific establishment of a Microsoft research lab – foundation of QuTech is stronger than ever with, formally agreed upon in a joint signing ceremony for example, four publications making it into top in June 2017 - marks the start of a Quantum scientific journals Nature and Science in 2017, Campus in Delft.
    [Show full text]
  • Sparse Quantum Codes from Quantum Circuits
    Sparse Quantum Codes from Quantum Circuits Dave Bacon,1 Steven T. Flammia,2 Aram W. Harrow,3 and Jonathan Shi4 1Department of Computer Science and Engineering, University of Washington, Seattle, WA 98195 USA∗ 2Centre for Engineered Quantum Systems, School of Physics, The University of Sydney, Sydney, NSW, Australia 3Center for Theoretical Physics, Massachusetts Institute of Technology, Cambridge, MA, USA 4Department of Computer Science, Cornell University, Ithaca, NY, USAy (Dated: February 20, 2017) We describe a general method for turning quantum circuits into sparse quantum subsystem codes. The idea is to turn each circuit element into a set of low-weight gauge generators that enforce the input-output relations of that circuit element. Using this prescription, we can map an arbitrary stabilizer code into a new subsystem code with the same distance and number of encoded qubits but where all the generators have constant weight, at the cost of adding some ancilla qubits. With an additional overhead of ancilla qubits, the new code can also be made spatially local. Applying our construction to certain concatenated stabilizer codes yields families of sub- system codes with constant-weight generators and with minimum distance d = n1−, where = O(1=plog n). For spatially local codes in D dimensions we nearly saturate a bound due to Bravyi and Terhal and achieve d = n1−−1=D. Previously the best code distance achievable with constant-weight generators in any dimension, due to Freedman, Meyer and Luo, was O(pn log n) for a stabilizer code. I. INTRODUCTION Sparse quantum error-correcting codes obey the simple constraint that only a constant number of qubits need to be measured at a time to extract syndrome bits.
    [Show full text]
  • Quantum Error Correction with the GKP Code and Concatenation with Stabilizer Codes
    Masterarbeit in Physik Quantum Error Correction with the GKP Code and Concatenation with Stabilizer Codes von Yang Wang Rheinisch-Westf¨alisch Technische Hochschule Aachen Fakult¨atf¨urMathematik, Informatik und Naturwissenschaften 07. Decmber 2017 angefertigt am arXiv:1908.00147v1 [quant-ph] 31 Jul 2019 JARA-Institut f¨urQuanteninformation vorgelegt bei Prof. Dr. rer. nat. Barbara M. Terhal Eidesstattliche Erkl¨arung Hiermit erkl¨areich, Yang Wang, an Eides statt, dass ich die vorliegende Masterarbeit mit dem Titel \Quantum Error Correction with the GKP code and Concatenatino with Stabilizer Codes " selbstst¨andigund ohne unzul¨assigefremde Hilfe verfasst habe. Ich habe keine anderen als die angegebenen Quellen und Hilfsmittel benutzt sowie w¨ortliche und sinngem¨aßeZitate kenntlich gemacht. Die Arbeit hat in gleicher oder ¨ahnlicher Form noch keiner Pr¨ufungsbeh¨ordevorgelegen. Aachen, den 07. December 2017 (Yang Wang) Acknowledgement First and foremost, I would like to express my gratitude to my supervisor Barbara Terhal for her guidance, patience and for many insightful discussions. She is so experienced and her knowledge in this field made my thesis possible. It's really good to have the opportunity to work under her supervision. I shall extend my thanks to Daniel Weigand and Kasper Duivenvoorden for their useful discussions as well as helping me with many technical things. There are also thanks to many friends in Aachen, especially Huanbo Sun, for their support when I was new in Germany. Finally, I want to thank my family. My parents funded my whole master study and always encourage me when I feel down. Also my boyfriend, Zhichuan Liang for his love and patience all the time.
    [Show full text]
  • Report of the Workshop on Quantum Information Science Quantum
    Report of the Workshop on Quantum Information Science 1 July 2009 In January 2009, the United States National Science and Technology Council issued a report entitled A Federal Vision for Quantum Information Science . The report proposes that “The United States ... create a scientific foundation for controlling, manipulating, and exploiting the behavior of quantum matter, and for identifying the physical, mathematical, and computational capabilities and limitations of quantum information processing systems in order to build a knowledge base for this 21 st century technology.” A Workshop on Quantum Information Science, organized in response to the NSTC report, was held 23-25 April 2009 at the Tysons Corner Marriott in Vienna, Virginia. The workshop brought together leading theorists and experimentalists drawn from physical science, computer science, mathematics, and engineering, who assessed recent progress in QIS and identified major goals and challenges for future research. The workshop also included open evening sessions so that all participants could express their views concerning the priorities for a national QIS initiative. The workshop program and list of participants have been included as appendices to this report. This report will highlight some of the recent developments that were discussed at the workshop. It is not our intent to provide a comprehensive overview of current QIS research, nor to prescribe in detail how a national QIS initiative should be structured. Instead, by emphasizing a few of the recent achievements of this field, we hope to convey that QIS research is advancing steadily across a wide front, and that a suitably broad national initiative can facilitate further high-impact advances in quantum science and technology in the near future.
    [Show full text]
  • Underdog Tech Makes Gains in Quantum Computer Race
    News in focus virologists and researchers with expertise in samples from March 2019 and found SARS- The investigation should also prioritize public health, animal health and food safety CoV-2 fragments, says Raina MacIntyre, an carnivorous mammals farmed for fur, such will lead the WHO’s COVID-19 investigation. epidemiologist at the University of New South as raccoon dogs and civets, which had a role The agency has not released their names. Wales in Sydney, Australia. “If this study was in the SARS outbreak, says Martin Beer, a The team held its first virtual meeting, correct, we have to ask how the virus was in virologist at the Federal Research Institute for including researchers in China, on 30 October, Spain in March last year,” she says. Animal Health in Riems, Germany. “It is surpris- and is reviewing the preliminary evidence and Plans to look beyond China are sensible, ing that there is no mention of these animals in developing study protocols, says the WHO. given that extensive surveillance in bats in the report, and we have no information from The initial phase of investigations in Wuhan China since the 2002 SARS outbreak has iden- China about whether these animals have been will probably be conducted by researchers tified only a distant relative of SARS-CoV-2, tested,” says Beer. who are already in China, and international says Wang. A growing number of experts think A spokesperson for the WHO says the researchers will travel to the country after that the immediate or close ancestors of SARS- mission will be guided by science, and “will reviewing those results, the agency says.
    [Show full text]
  • Level Reduction and the Quantum Threshold Theorem
    Level Reduction and the Quantum Threshold Theorem Thesis by Panos Aliferis In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy arXiv:quant-ph/0703230v2 11 Jul 2011 California Institute of Technology Pasadena, California 2007 (Defended December 11, 2006) ii Copyright notice: Chapters 2 and 3 contain some material from [1] and chapter 4 contains some material from [2] which are both copyrighted by Rinton Press. Chapter 5 contains some material from [3] which is copyrighted by the American Physical Society. The remaining material is c 2007 Panos Aliferis All Rights Reserved iii for Ayis and K., of course iv Foreword Living on the open air of the mountains of research and reaching the point of writing this thesis would not have been possible without the guidance, the encouragement, and the support of many people. To them I write the few thanking words that follow. First, I would like to thank my advisor John Preskill. He provided the vessel in the form of IQI and the guidance for my education at Caltech. From him I learned much. Most importantly, I learned how the successful scientific spirit combines depth with breadth, seriousness with cheerful- ness, abstract proofs with happy dancing. He introduced me to the field of fault-tolerant quantum computation and pointed out interesting problems in this area of research. Many of the results of this thesis came about from my collaboration with him and Daniel Gottesman and would not have been possible without their crucial contributions and insights. Second, I would like to thank my mentor and friend Debbie Leung.
    [Show full text]
  • Arxiv:1804.02926V2 [Quant-Ph] 18 Oct 2018
    Neural network decoder for topological color codes with circuit level noise P. Baireuther,1 M. D. Caio,1 B. Criger,2, 3 C. W. J. Beenakker,1 and T. E. O'Brien1 1Instituut-Lorentz, Universiteit Leiden, P.O. Box 9506, 2300 RA Leiden, The Netherlands 2QuTech, Delft University of Technology, P.O. Box 5046, 2600 GA Delft, The Netherlands 3Institute for Globally Distributed Open Research and Education (IGDORE) (Dated: October 2018) A quantum computer needs the assistance of a classical algorithm to detect and identify errors that affect encoded quantum information. At this interface of classical and quantum computing the technique of machine learning has appeared as a way to tailor such an algorithm to the specific error processes of an experiment | without the need for a priori knowledge of the error model. Here, we apply this technique to topological color codes. We demonstrate that a recurrent neural network with long short-term memory cells can be trained to reduce the error rate L of the encoded logical qubit to values much below the error rate phys of the physical qubits | fitting the expected (d+1)=2 power law scaling L / phys , with d the code distance. The neural network incorporates the information from “flag qubits" to avoid reduction in the effective code distance caused by the circuit. As a test, we apply the neural network decoder to a density-matrix based simulation of a superconducting quantum computer, demonstrating that the logical qubit has a longer life-time than the constituting physical qubits with near-term experimental parameters. I. INTRODUCTION a graph [22], for which there exists an efficient solution called the \blossom" algorithm [23].
    [Show full text]