DOCSLIB.ORG

Quantum Computing and Cryptography Quantum Computers Can Be Highly Beneficial to Scientific Developments Due to the New, Speedy Way of Performing Computing

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Quantum Computing and Cryptography Quantum Computers Can Be Highly Beneficial to Scientific Developments Due to the New, Speedy Way of Performing Computing Issue 2 | 2020 Quantum Computing and Cryptography Quantum computers can be highly beneficial to scientific developments due to the new, speedy way of performing computing. Once available, they however could break currently used cryptography and undermine the protection of (personal) data. I. What is quantum computing? z 0 The physical laws of quantum mechanics allow for an alternative method to how today’s computers pro- ψ cess information. Whereas traditional computers θ use bits (0 or 1) as a building block, quantum com- puters employ quantum bits, or qubits, that can be at the same moment a combination of |0⟩ and |1⟩. φ y The possible spectrum of values one qubit can ad- opt is best depicted by the surface of the Bloch sphere x in Figure 1. While bits allow for two discrete values, qubits can store a point in a two-dimensional con- tinuum, a surface of a sphere. Quantum computing 1 can take advantage of those more powerful qubits and carry out operations not only for a determined Figure 1: The Bloch sphere is a geometrical repres- value |0⟩ or |1⟩, but also for all possible superpos- entation of a qubit. Qubits can take as value each itions at the same time. Consequently, quantum point on the surface described by the two angles computing attains an efficiency advantage over bin- 휑 and 휃. The pole points are |0⟩ or |1⟩. ary computing for selected tasks. Some tasks would be rendered only feasible due to this efficiency boost, tion in terms of data security and confidential- if the appropriate quantum computer hardware were ity of communications. One reason is the ability available. to break cryptography. Quantum computing can In sum, quantum computers have a speed advant- break many of today’s classical cryptography and age over classical computers for selected problems as such harm severely IT security. The risk extends and could therefore perform types of computation to the core internet security protocols. Nearly all not available to current classical computers. of today’s systems that demand security, privacy or trust, would be affected. II. What are the data protection issues? II.1. Impact on public-key cryptography There are many reasons why quantum computing Public-key cryptography, also known as asymmetric could have significant implications for data protec- encryption, is a method of encrypting data with the EDPS TechDispatch on Quantum Computing and Cryptography 1 II.3. Retrospective decryption The technological progress in binary computing hard- ware, meaning today’s widespread classic computers, is also a threat to IT security. With increasing com- puting power at decreasing costs, the retrospective decryption of data from the past becomes of use if the employed key lengths used at the time were suf- ficiently short. Security experts regularly call out for an increase of key lengths to keep data secure for a given period. Some governments’ secret services are reported to collect data purposefully for future ret- rospective decryption. Quantum computers though follow different laws and would allow retrospective Figure 2: Quantum Computer IBM Q. Source: Pierre decryption in many cases much earlier. Metivier (detail, licensed under cc-by-nc 2.0) II.4. Practical quantum computers use of cryptographic protocols based on algorithms. To be able to execute quantum algorithms with prac- It requires two separate keys, a private and a public tical impacts, quantum computers would need to key. The Rivest-Sharmir-Adleman (RSA) algorithm have thousands or millions of qubits with low error is a cryptographic system that is used for public-key rates. This is something which is beyond the reach cryptography, and is commonly used when sending of technology in the foreseeable future. sensitive data over the internet. The RSA algorithm In 2019, Google claimed to have demonstrated allows for both public and private keys to encrypt quantum supremacy with its 54-qubit quantum messages so their confidentiality and authenticity computer (Oliver 2019). The claim was that it took remain intact. their quantum computer hundreds of seconds to Quantum computers would allow for public-key perform computation that would take thousands of cryptography systems to be jeopardised by adversar- years for a powerful non-quantum supercomputer. ies in possession of a sufficiently powerful quantum While the solved task has no practical significance, computer, that could carry out the decryption it served as a proof of concept. It is likely that more without prior knowledge of the private key. Ef- similar results may be announced in this decade, but fected could be for instance digital signatures, essen- in the foreseeable future they will unlikely have a tial Internet protocols like HTTPS (TLS) required for practical impact. secure browsing, online banking, online shopping, According to current understanding, to execute etc. useful algorithms of practical relevance there is a need to build a quantum computer with more qubits II.2. Impact on symmetric cryptography and smaller error rates than what is possible today. The creation of a large and usable quantum com- Quantum computing can also bring negative con- puter within the next ten years is highly unlikely, sequences for security guarantees of symmetric cryp- but difficult to predict. It is this unpredictability tography systems such as the Advanced Encryption that eventually leads to risks for IT security today. Standard (AES). Asymmetric (e.g. RSA) and symmet- ric (e.g. AES) cryptography are often used together II.5. Post-quantum cryptography such as with the use of HTTPS. Symmetric crypto- graphy needs practical ways of exchanging private Post-quantum cryptography or quantum-safe cryp- keys in a confidential manner. To guarantee data se- tography refers to cryptography whose security is curity, the private key exchange must remain secure. believed to be unaffected by quantum computers. But the key exchange methods used in practice This is achieved by the use of very different math- today are based on problems that quantum comput- ematical building blocks, which incorporate math- ing may put at risk. To guarantee data confidentiality, ematical operations that quantum computers cannot the whole key exchange must remain secure. solve more efficiently than other computers. EDPS TechDispatch on Quantum Computing and Cryptography 2 Post-quantum cryptography however will likely III. Recommended Reading come with performance drawbacks and require lar- ger computing resources to e.g. encrypt and decrypt German Federal Office for Information Security data or sign and verify signatures and more network- (2020). Post-Quantum Cryptography. ing resources to exchange lengthier keys and certi- Giles, Martin (2019). Explainer: What is post-quantum ficates. Post-quantum cryptography is not yet stand- cryptography? In: MIT Technology Review. ardised. Sufficient and convincing knowledge must Montanaro, Ashley (2016). Quantum algorithms: an be available to conclude in a so-called cryptanalysis overview. In: npj Quantum Information 2.1. doi: that such a solution is safe for both quantum and 10.1038/npjqi.2015.23. binary computing. The US National Institute of National Academies of Sciences, Engineering, and Standards and Technology (NIST) is working to- Medicine (2019). Quantum Computing: Progress wards a Post-quantum cryptography standard and and Prospects. The National Academies Press. doi: estimates to publish a draft with a first algorithm 10.17226/25196. in 2022 or 2024. Once standardised, algorithms will Oliver, William D. (2019). Quantum computing takes need to be integrated with standard internet proto- flight. In: Nature 574.7779, pp. 487–488. doi: 10 . cols like HTTPS. 1038/d41586-019-03173-4. As of 2020, prototypes of (non-standardised) Preskill, John (2018). Quantum Computing in the postquantum cryptography are available for test- NISQ era and beyond. In: Quantum 2, p. 79. doi: ing in the form of source code, software libraries 10.22331/q-2018-08-06-79. (e.g. for OpenSSL), cloud services (e.g. Amazon AWS Shankland, Stephen (2019). IBM’s new 53-qubit and Cloudflare) and consumer software (e.g. Google quantum computer is its biggest yet. In: CNET. Chrome). It is estimated that a full transition could even take as long as 15-20 years in practice. Organisations should consider for how long they This publication is a brief report produced by the Techno- need to guarantee absolute confidentiality of data logy and Privacy Unit of the European Data Protection and protection from retrospective decryption. Based Supervisor (EDPS). It aims to provide a factual description of an emerging technology and discuss its possible impacts on what we know today there is no immediate on privacy and the protection of personal data. The con- threat posed by a quantum computer in the tents of this publication do not imply a policy position of foreseeable future. It may likely take decades to the EDPS. build a usable quantum computer that can execute Issue Author: Lukasz OLEJNIK, known algorithms. But for data that needs to remain Robert RIEMANN safe for very long, this uncertainty poses an issue Editor: Thomas ZERDICK that may require an early transition to post-quantum Contact: [email protected] cryptography. To subscribe or unsubscribe to the EDPS Tech- For this reason, some organisations may be in- Dispatch publications, please send a mail to terested in preparing appropriate risk assessment [email protected]. The data protection as well as contingency and migration plans. Such notice is online on the EDPS website. plans should always prioritise guaranteeing data se- © European Union, 2020. Except otherwise noted, the curity with respect to today’s non-quantum security. reuse of this document is authorised under a Creative When transitioning to post-quantum systems, Commons Attribution 4.0 International License (CC BY organisations should consider existing risks and the 4.0). This means that reuse is allowed provided appropriate usual considerations during migration of data that credit is given and any changes made are indicated.
Load more

Recommended publications
  • What Is Quantum Information?
    What Is Quantum Information? Robert B. Griffiths Carnegie-Mellon University Pittsburgh, Pennsylvania Research supported by the National Science Foundation References (work by R. B. Griffiths) • \Nature and location of quantum information." Ph◦ys. Rev. A 66 (2002) 012311; quant-ph/0203058 \Channel kets, entangled states, and the location of quan◦ tum information," Phys. Rev. A 71 (2005) 042337; quant-ph/0409106 Consistent Quantum Theory (Cambridge 2002) http://quan◦ tum.phys.cmu.edu/ What Is Quantum Information? 01. 100.01.tex Introduction What is quantum information? Precede by: • What is information? ◦ What is classical information theory? ◦ What is information? Example, newspaper • Symbolic representation of some situation ◦ Symbols in newspaper correlated with situation ◦ Information is about that situation ◦ What Is Quantum Information? 04. 100.04.tex Classical Information Theory Shannon: • \Mathematical Theory of Communication" (1948) ◦ One of major scientific developments of 20th century ◦ Proposed quantitative measure of information ◦ Information entropy • H(X) = p log p − X i i i Logarithmic measure of missing information ◦ Probabilistic model: pi are probabilities ◦ Applies to classical (macroscopic)f g signals ◦ Coding theorem: Bound on rate of transmission of information• through noisy channel What Is Quantum Information? 05. 100.05.tex Quantum Information Theory (QIT) Goal of QIT: \Quantize Shannon" • Extend Shannon's ideas to domain where quantum effects◦ are important Find quantum counterpart of H(X) ◦ We live in a quantum world, so • QIT should be the fundamental info theory ◦ Classical theory should emerge from QIT ◦ Analogy: relativity theory Newton for v c ◦ ! What Is Quantum Information? 06. 100.06.tex QIT: Current Status Enormous number of published papers • Does activity = understanding? ◦ Some topics of current interest: • Entanglement ◦ Quantum channels ◦ Error correction ◦ Quantum computation ◦ Decoherence ◦ Unifying principles have yet to emerge • At least, they are not yet widely recognized ◦ What Is Quantum Information? 07.
    [Show full text]
  • Key Concepts for Future QIS Learners Workshop Output Published Online May 13, 2020
    Key Concepts for Future QIS Learners Workshop output published online May 13, 2020 Background and Overview On behalf of the Interagency Working Group on Workforce, Industry and Infrastructure, under the NSTC Subcommittee on Quantum Information Science (QIS), the National Science Foundation invited 25 researchers and educators to come together to deliberate on defining a core set of key concepts for future QIS learners that could provide a starting point for further curricular and educator development activities. The deliberative group included university and industry researchers, secondary school and college educators, and representatives from educational and professional organizations. The workshop participants focused on identifying concepts that could, with additional supporting resources, help prepare secondary school students to engage with QIS and provide possible pathways for broader public engagement. This workshop report identifies a set of nine Key Concepts. Each Concept is introduced with a concise overall statement, followed by a few important fundamentals. Connections to current and future technologies are included, providing relevance and context. The first Key Concept defines the field as a whole. Concepts 2-6 introduce ideas that are necessary for building an understanding of quantum information science and its applications. Concepts 7-9 provide short explanations of critical areas of study within QIS: quantum computing, quantum communication and quantum sensing. The Key Concepts are not intended to be an introductory guide to quantum information science, but rather provide a framework for future expansion and adaptation for students at different levels in computer science, mathematics, physics, and chemistry courses. As such, it is expected that educators and other community stakeholders may not yet have a working knowledge of content covered in the Key Concepts.
    [Show full text]
  • A Quantitative Study of Advanced Encryption Standard Performance
    United States Military Academy USMA Digital Commons West Point ETD 12-2018 A Quantitative Study of Advanced Encryption Standard Performance as it Relates to Cryptographic Attack Feasibility Daniel Hawthorne United States Military Academy, [email protected] Follow this and additional works at: https://digitalcommons.usmalibrary.org/faculty_etd Part of the Information Security Commons Recommended Citation Hawthorne, Daniel, "A Quantitative Study of Advanced Encryption Standard Performance as it Relates to Cryptographic Attack Feasibility" (2018). West Point ETD. 9. https://digitalcommons.usmalibrary.org/faculty_etd/9 This Doctoral Dissertation is brought to you for free and open access by USMA Digital Commons. It has been accepted for inclusion in West Point ETD by an authorized administrator of USMA Digital Commons. For more information, please contact [email protected]. A QUANTITATIVE STUDY OF ADVANCED ENCRYPTION STANDARD PERFORMANCE AS IT RELATES TO CRYPTOGRAPHIC ATTACK FEASIBILITY A Dissertation Presented in Partial Fulfillment of the Requirements for the Degree of Doctor of Computer Science By Daniel Stephen Hawthorne Colorado Technical University December, 2018 Committee Dr. Richard Livingood, Ph.D., Chair Dr. Kelly Hughes, DCS, Committee Member Dr. James O. Webb, Ph.D., Committee Member December 17, 2018 © Daniel Stephen Hawthorne, 2018 1 Abstract The advanced encryption standard (AES) is the premier symmetric key cryptosystem in use today. Given its prevalence, the security provided by AES is of utmost importance. Technology is advancing at an incredible rate, in both capability and popularity, much faster than its rate of advancement in the late 1990s when AES was selected as the replacement standard for DES. Although the literature surrounding AES is robust, most studies fall into either theoretical or practical yet infeasible.
    [Show full text]
  • Free-Electron Qubits
    Free-Electron Qubits Ori Reinhardt†, Chen Mechel†, Morgan Lynch, and Ido Kaminer Department of Electrical Engineering and Solid State Institute, Technion - Israel Institute of Technology, 32000 Haifa, Israel † equal contributors Free-electron interactions with laser-driven nanophotonic nearfields can quantize the electrons’ energy spectrum and provide control over this quantized degree of freedom. We propose to use such interactions to promote free electrons as carriers of quantum information and find how to create a qubit on a free electron. We find how to implement the qubit’s non-commutative spin-algebra, then control and measure the qubit state with a universal set of 1-qubit gates. These gates are within the current capabilities of femtosecond-pulsed laser-driven transmission electron microscopy. Pulsed laser driving promise configurability by the laser intensity, polarizability, pulse duration, and arrival times. Most platforms for quantum computation today rely on light-matter interactions of bound electrons such as in ion traps [1], superconducting circuits [2], and electron spin systems [3,4]. These form a natural choice for implementing 2-level systems with spin algebra. Instead of using bound electrons for quantum information processing, in this letter we propose using free electrons and manipulating them with femtosecond laser pulses in optical frequencies. Compared to bound electrons, free electron systems enable accessing high energy scales and short time scales. Moreover, they possess quantized degrees of freedom that can take unbounded values, such as orbital angular momentum (OAM), which has also been proposed for information encoding [5-10]. Analogously, photons also have the capability to encode information in their OAM [11,12].
    [Show full text]
  • Software for Numerical Computation
    Purdue University Purdue e-Pubs Department of Computer Science Technical Reports Department of Computer Science 1977 Software for Numerical Computation John R. Rice Purdue University, [email protected] Report Number: 77-214 Rice, John R., "Software for Numerical Computation" (1977). Department of Computer Science Technical Reports. Paper 154. https://docs.lib.purdue.edu/cstech/154 This document has been made available through Purdue e-Pubs, a service of the Purdue University Libraries. Please contact [email protected] for additional information. SOFTWARE FOR NUMERICAL COMPUTATION John R. Rice Department of Computer Sciences Purdue University West Lafayette, IN 47907 CSD TR #214 January 1977 SOFTWARE FOR NUMERICAL COMPUTATION John R. Rice Mathematical Sciences Purdue University CSD-TR 214 January 12, 1977 Article to appear in the book: Research Directions in Software Technology. SOFTWARE FOR NUMERICAL COMPUTATION John R. Rice Mathematical Sciences Purdue University INTRODUCTION AND MOTIVATING PROBLEMS. The purpose of this article is to examine the research developments in software for numerical computation. Research and development of numerical methods is not intended to be discussed for two reasons. First, a reasonable survey of the research in numerical methods would require a book. The COSERS report [Rice et al, 1977] on Numerical Computation does such a survey in about 100 printed pages and even so the discussion of many important fields (never mind topics) is limited to a few paragraphs. Second, the present book is focused on software and thus it is natural to attempt to separate software research from numerical computation research. This, of course, is not easy as the two are intimately intertwined.
    [Show full text]
  • Constructing Low-Weight Dth-Order Correlation-Immune Boolean Functions Through the Fourier-Hadamard Transform Claude Carlet and Xi Chen*
    1 Constructing low-weight dth-order correlation-immune Boolean functions through the Fourier-Hadamard transform Claude Carlet and Xi Chen* Abstract The correlation immunity of Boolean functions is a property related to cryptography, to error correcting codes, to orthogonal arrays (in combinatorics, which was also a domain of interest of S. Golomb) and in a slightly looser way to sequences. Correlation-immune Boolean functions (in short, CI functions) have the property of keeping the same output distribution when some input variables are fixed. They have been widely used as combiners in stream ciphers to allow resistance to the Siegenthaler correlation attack. Very recently, a new use of CI functions has appeared in the framework of side channel attacks (SCA). To reduce the cost overhead of counter-measures to SCA, CI functions need to have low Hamming weights. This actually poses new challenges since the known constructions which are based on properties of the Walsh-Hadamard transform, do not allow to build unbalanced CI functions. In this paper, we propose constructions of low-weight dth-order CI functions based on the Fourier- Hadamard transform, while the known constructions of resilient functions are based on the Walsh-Hadamard transform. We first prove a simple but powerful result, which makes that one only need to consider the case where d is odd in further research. Then we investigate how constructing low Hamming weight CI functions through the Fourier-Hadamard transform (which behaves well with respect to the multiplication of Boolean functions). We use the characterization of CI functions by the Fourier-Hadamard transform and introduce a related general construction of CI functions by multiplication.
    [Show full text]
  • Quantum Computing: Principles and Applications
    Journal of International Technology and Information Management Volume 29 Issue 2 Article 3 2020 Quantum Computing: Principles and Applications Yoshito Kanamori University of Alaska Anchorage, [email protected] Seong-Moo Yoo University of Alabama in Huntsville, [email protected] Follow this and additional works at: https://scholarworks.lib.csusb.edu/jitim Part of the Communication Technology and New Media Commons, Computer and Systems Architecture Commons, Information Security Commons, Management Information Systems Commons, Science and Technology Studies Commons, Technology and Innovation Commons, and the Theory and Algorithms Commons Recommended Citation Kanamori, Yoshito and Yoo, Seong-Moo (2020) "Quantum Computing: Principles and Applications," Journal of International Technology and Information Management: Vol. 29 : Iss. 2 , Article 3. Available at: https://scholarworks.lib.csusb.edu/jitim/vol29/iss2/3 This Article is brought to you for free and open access by CSUSB ScholarWorks. It has been accepted for inclusion in Journal of International Technology and Information Management by an authorized editor of CSUSB ScholarWorks. For more information, please contact [email protected]. Journal of International Technology and Information Management Volume 29, Number 2 2020 Quantum Computing: Principles and Applications Yoshito Kanamori (University of Alaska Anchorage) Seong-Moo Yoo (University of Alabama in Huntsville) ABSTRACT The development of quantum computers over the past few years is one of the most significant advancements in the history of quantum computing. D-Wave quantum computer has been available for more than eight years. IBM has made its quantum computer accessible via its cloud service. Also, Microsoft, Google, Intel, and NASA have been heavily investing in the development of quantum computers and their applications.
    [Show full text]
  • Quantum Hypercomputation—Hype Or Computation?
    Quantum Hypercomputation—Hype or Computation? Amit Hagar,∗ Alex Korolev† February 19, 2007 Abstract A recent attempt to compute a (recursion–theoretic) non–computable func- tion using the quantum adiabatic algorithm is criticized and found wanting. Quantum algorithms may outperform classical algorithms in some cases, but so far they retain the classical (recursion–theoretic) notion of computability. A speculation is then offered as to where the putative power of quantum computers may come from. ∗HPS Department, Indiana University, Bloomington, IN, 47405. [email protected] †Philosophy Department, University of BC, Vancouver, BC. [email protected] 1 1 Introduction Combining physics, mathematics and computer science, quantum computing has developed in the past two decades from a visionary idea (Feynman 1982) to one of the most exciting areas of quantum mechanics (Nielsen and Chuang 2000). The recent excitement in this lively and fashionable domain of research was triggered by Peter Shor (1994) who showed how a quantum computer could exponentially speed–up classical computation and factor numbers much more rapidly (at least in terms of the number of computational steps involved) than any known classical algorithm. Shor’s algorithm was soon followed by several other algorithms that aimed to solve combinatorial and algebraic problems, and in the last few years the- oretical study of quantum systems serving as computational devices has achieved tremendous progress. According to one authority in the field (Aharonov 1998, Abstract), we now have strong theoretical evidence that quantum computers, if built, might be used as powerful computational tool, capable of per- forming tasks which seem intractable for classical computers.
    [Show full text]
  • Ohio IT Standard ITS-SEC-01 Data Encryption and Cryptography
    Statewide Standard State of Ohio IT Standard Standard Number: Title: ITS-SEC-01 Data Encryption and Cryptography Effective Date: Issued By: 03/12/2021 Ervan D. Rodgers II, Assistant Director/State Chief Information Officer Office of Information Technology Ohio Department of Administrative Services Version Identifier: Published By: 2.0 Investment and Governance Division Ohio Office of Information Technology 1.0 Purpose This state IT standard defines the minimum requirements for cryptographic algorithms that are cryptographically strong and are used in security services that protect at-risk or sensitive data as defined and required by agency or State policy, standard or rule. This standard does not classify data elements; does not define the security schemes and mechanisms for devices such as tape backup systems, storage systems, mobile computers or removable media; and does not identify or approve secure transmission protocols that may be used to implement security requirements. 2.0 Scope Pursuant to Ohio Administrative Policy IT-01, “Authority of the State Chief Information Officer to Establish Ohio IT Policy,” this state IT standard is applicable to every organized body, office, or agency established by the laws of the state for the exercise of any function of state government except for those specifically exempted. 3.0 Background The National Institute for Science and Technology (NIST) conducts extensive research and development in cryptography techniques. Their publications include technical standards for data encryption, digital signature and message authentication as well as guidelines for implementing information security and managing cryptographic keys. These standards and guidelines have been mandated for use in federal agencies and adopted by state governments and private enterprises.
    [Show full text]
  • Is Quantum Search Practical?
    Q UANTUM C OMPUTING IS QUANTUM SEARCH PRACTICAL? Gauging a quantum algorithm’s practical significance requires weighing it against the best conventional techniques applied to useful instances of the same problem. The authors show that several commonly suggested applications of Grover’s quantum search algorithm fail to offer computational improvements over the best conventional algorithms. ome researchers suggest achieving mas- polynomial-time algorithm for number factoring sive speedups in computing by exploiting is known, and the security of the RSA code used quantum-mechanical effects such as su- on the Internet relies on this problem’s difficulty. perposition (quantum parallelism) and If a large and error-tolerant quantum computer Sentanglement.1 A quantum algorithm typically were available today, running Shor’s algorithm on consists of applying quantum gates to quantum it could compromise e-commerce. states, but because the input to the algorithm Lov Grover’s quantum search algorithm is also might be normal classical bits (or nonquantum), widely studied. It must compete with advanced it only affects the selection of quantum gates. Af- classical search techniques in applications that use ter all the gates are applied, quantum measure- parallel processing3 or exploit problem structure, ment is performed, producing the algorithm’s often implicitly. Despite its promise, though, it is nonquantum output. Deutsch’s algorithm, for in- by no means clear whether, or how soon, quantum stance, solves a certain artificial problem in fewer computing methods will offer better performance steps than any classical (nonquantum) algorithm, in useful applications.4 Traditional complexity and its relative speedup grows with the problem analysis of Grover’s algorithm doesn’t consider the size.
    [Show full text]
  • Mathematics and Computation
    Mathematics and Computation Mathematics and Computation Ideas Revolutionizing Technology and Science Avi Wigderson Princeton University Press Princeton and Oxford Copyright c 2019 by Avi Wigderson Requests for permission to reproduce material from this work should be sent to [email protected] Published by Princeton University Press, 41 William Street, Princeton, New Jersey 08540 In the United Kingdom: Princeton University Press, 6 Oxford Street, Woodstock, Oxfordshire OX20 1TR press.princeton.edu All Rights Reserved Library of Congress Control Number: 2018965993 ISBN: 978-0-691-18913-0 British Library Cataloging-in-Publication Data is available Editorial: Vickie Kearn, Lauren Bucca, and Susannah Shoemaker Production Editorial: Nathan Carr Jacket/Cover Credit: THIS INFORMATION NEEDS TO BE ADDED WHEN IT IS AVAILABLE. WE DO NOT HAVE THIS INFORMATION NOW. Production: Jacquie Poirier Publicity: Alyssa Sanford and Kathryn Stevens Copyeditor: Cyd Westmoreland This book has been composed in LATEX The publisher would like to acknowledge the author of this volume for providing the camera-ready copy from which this book was printed. Printed on acid-free paper 1 Printed in the United States of America 10 9 8 7 6 5 4 3 2 1 Dedicated to the memory of my father, Pinchas Wigderson (1921{1988), who loved people, loved puzzles, and inspired me. Ashgabat, Turkmenistan, 1943 Contents Acknowledgments 1 1 Introduction 3 1.1 On the interactions of math and computation..........................3 1.2 Computational complexity theory.................................6 1.3 The nature, purpose, and style of this book............................7 1.4 Who is this book for?........................................7 1.5 Organization of the book......................................8 1.6 Notation and conventions.....................................
    [Show full text]
  • Marching Towards Quantum Supremacy
    Princeton Center for Theoretical Science The Princeton Center for Theoretical Science is dedicated to exploring the frontiers of theory in the natural sciences. Its purpose is to promote interaction among theorists and seed new directions in research, especially in areas cutting across traditional disciplinary boundaries. The Center is home to a corps of Center Postdoctoral Fellows, chosen from nominations made by senior theoretical scientists around the world. A group of senior Faculty Fellows, chosen from science and engineering departments across the campus, are responsible for guiding the Center. Center activities include focused topical programs chosen from proposals by Princeton faculty across the natural sciences. The Center is located on the fourth floor of Jadwin Hall, in the heart of the campus “science neighborhood”. The Center hopes to become the focus for innovation and cross-fertilization in theoretical natural science at Princeton. Faculty Fellows Igor Klebanov, Director Ned Wingreen, Associate Director Marching Towards Quantum Andrei Bernevig Jeremy Goodman Duncan Haldane Supremacy Andrew Houck Mariangela Lisanti Thanos Panagiotopoulos Frans Pretorius November 13-15, 2019 Center Postdoctoral Fellows Ricard Alert-Zenon 2018-2021 PCTS Seminar Room Nathan Benjamin 2018-2021 Andrew Chael 2019-2022 Jadwin Hall, Fourth Floor, Room 407 Amos Chan 2019-2022 Fani Dosopoulou 2018-2021 Biao Lian 2017-2020 Program Organizers Vladimir Narovlansky 2019-2022 Sergey Frolov Sabrina Pasterski 2019-2022 Abhinav Prem 2018-2021 Michael Gullans
    [Show full text]