DOCSLIB.ORG

Preskill NISQ Article - Student Summaries (Fall 2020)

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Preskill NISQ Article - Student Summaries (Fall 2020) Preskill NISQ Article - Student Summaries (Fall 2020) Quantum computing leverages quantum complexity to do calculations that are inaccessible with classical devices - Current quantum computing (QC) technology seeks to (a) capitalize on quantum complexity (arising from quantum correlations of highly entangled states) that could solve problems inaccessible classically, and (b) reduce quantum errors and at the same time make QC less sensitive to said errors (fault-tolerance) to enable large-scale systems that perform reliably. - Due to the intrinsic difference in how information is stored/processed in a QC, there are problems that are theorized to be difficult classically but easy with a QC. - Quantum computers are needed because of the inability of classical computers to efficiently simulate quantum systems. However, this also means that validation of results from quantum computers is hard. - The information content of a system of entangled qubits of moderate size cannot be represented classically - Quantum computing is expected to solve problems and simulate quantum mechanical systems that classical digital computers will likely never be able to handle. - Part of the current field of quantum computing rests on finding useful problems that are easy for quantum computers to solve but difficult for classical computers to solve. - He makes it a point to clarify that the extravagant complexity of the quantum world doesn’t automatically equate to utility in a classical world. But he gives a minimum of three reasons to insinuate quantum complexity will be useful: - Interesting that Laughlin and Pines said no computer now or in the future will ever break the barrier of solving equations describing many entangled particles. And this was after Feynman had popularized the idea that it would be possible. Feynman’s argument is only now appearing to finally be vindicated, possibly. - Quantum entanglement. This is one of the strongest characteristics in a quantum system. It gives us two principles, quantum complexity and quantum error correction to explore a new frontier. - The power of quantum computing. A quantum computer can efficiently simulate any process in Nature, because Nature is quantum - Quantum supremacy. This is an impending milestone for human civilization. No classical device can perform some tasks by quantum computers. Quantum computation presents new challenges due to the nature of quantum mechanics - Developing quantum computers is hard mainly because of the measurement problem: observing a system necessarily involves interacting with that system. As a consequence, measurement uncontrollably disturbs the quantum state of a system, and so we must reliably isolate a quantum system from the outside world. However, we need qubits to interact with each other strongly and we need to be able to control the system reliably form the outside. - The main barrier slowing down progress in quantum computing is the difficulty of designing and making a system that is isolated from the environment, allows qubits to strongly interact, and allows us to probe the internal state accurately - The fundamental tension between isolating a system of qubits from surrounding environment while allowing certain interaction with that system (to perform measurements, perform gate operations etc.) currently inhibits hardware improvements. Even small error rates pose catastrophic for certain classes of algorithms-including algorithms that have been given lots of press and financial investment. Until a sufficiently low error rate is reduced, reality of quantum computation remains a distant dream for certain classes of algorithms. - Difficulty of quantum computing. It’s a contradiction that we want to keep the system perfectly isolated from the outside and at the same time we want to control the system from the outside. Error correction and fault tolerance is vital to the future of Quantum Computing, but requires a large overhead - In order to make quantum states robust, a qubit should be encoded in a highly entangled system so that it will be robust against interaction with the environment - Quantum error correction will be necessary for large QC’s, but it requires significant overhead - Quantum error correction can fix the noise problems with current quantum computers but requires an infeasible overhead cost in physical qubits to do so. Need less noise. - Quantum error correction requires a significant number of extra qubits, forming a huge bottleneck to quantum computation. Because of this, improving fault-tolerance is one of the most important goals towards the development of quantum computers. - Quantum errors are the major challenge (qubits interacting with their environment). Protecting them with entanglement also comes with a large overhead There are exciting opportunities and applications for Quantum Computation - Quantum computation has potentially world-transforming possibilities through things like simulating truly quantum systems (i.e. Nature) - Quantum “supremacy”/”speed-up”: the paper lists several applications --- with varying likelihoods of near-future realization --- that would establish that QC surpasses classical computing in some, not all aspects. For example: Analog quantum simulation, Optimization algorithms, Prime factorization, Linear algebra, Quantum-enhanced deep learning, and possibly more - With the arrival of 50-100 bit quantum computers, a new era of “Noisy Intermediate-Scale Quantum” technology has begun. The goal of the article is to explore the potential of this era. - While Preskill envisions the specialized NISQ devices to have (compared to what is to come) limited functionality, they are anticipated to have functional uses as well. - There exist algorithms which have been found to solve problems easily on quantum computers which are known to be hard on classical computers. - Quantum algorithms exist that provide exponential speedups as compared with the best known classical algorithms; this provides motivation for industrial applications in addition to purely academic applications - One place we’re fairly confident they have an advantage over classical computers is simulating many body quantum systems - Quantum optimizers, though they may not be able to solve NP-hard problems with significant advantage over classical machines, do seem to have an advantage at finding approximate solutions to such problems. There are two classes of such problems: Quantum Approx. Optimization Algorithms (QAOA) which apply QC to classical combinatorial problems; and Variational Quantum Eigensolvers (VQE) which apply QC to quantum combinatorial problems. - He mentions a handful of potential applications: Matrix inversions for solving linear systems, recommendation systems, semidefinite programming, etc., details of which put me well beyond the quota for this report. - There are good reasons to believe the claim that quantum computers will one day be able to do useful computations that we cannot do classically - There are particular problems to which quantum computing is particularly advantageous when compared with classical computing. The NISQ era is an opportunity to enumerate such a list. - Quantum computing is powerful. We know it's effective on factoring algorithms, sampling and simulating the nature of physics. - 50 qubits is a significant milestone because it can simulate things better than most powerful existing digital supercomputers by brute force. But we’ll have imperfect control over qubits which places serious limitations. - Possible speadups using NISQ technology: The field of Quantum Information is rich with many areas of study - Quantum Information Processing is not limited to Quantum Computing but also includes cryptography, key distribution, networks, and sensing. - He says he won’t discuss much about quantum cryptography, networks, repeaters, randomness generation and expansion, or sensing, but he says these are critically intertwined with quantum computing in general. We need more experiments to test the usefulness of quantum computers - Near-term technologies or procedures like quantum annealing or the Variational Quantum Eigensolver provide test beds for the limits of our current quantum computing power. - As in the development of classical computing, there may be “heuristic” advantages to quantum computing which are theoretically hard to predict but experimentally evident. - NISQ technology may shed light on these advantages. - Even though current QC systems are limited, there are realizable applications worth pursuing that can motivate further exploration of Quantum technology (NISQ devices). - NISQ-era computers may or may not be able to do anything useful, but we don’t really know yet so more experiment is needed - He eventually admits that his conclusion early in the paper about NISQ-era QC being limited to ~100 gates might be overly pessimistic, as there are quantum simulation algorithms that don’t require much circuit depth; or where depth is required, errors might decay away on their own faster than they accumulate. - Experimental realizations of quantum algorithms on quantum computers will inevitably come before we have any reasonable grasp of the underlying theory, similar to the current example playing out in deep learning. - A quantum testbed might help us find ways to push the NISQ era to its limits – be it by finding experimental heuristics or by allowing us to accurately assess and probe the current state of the field - The current era of quantum computing (termed NISQ era) is not the era in which we
Load more

Recommended publications
  • BCG) Is a Global Management Consulting Firm and the World’S Leading Advisor on Business Strategy
    The Next Decade in Quantum Computing— and How to Play Boston Consulting Group (BCG) is a global management consulting firm and the world’s leading advisor on business strategy. We partner with clients from the private, public, and not-for-profit sectors in all regions to identify their highest-value opportunities, address their most critical challenges, and transform their enterprises. Our customized approach combines deep insight into the dynamics of companies and markets with close collaboration at all levels of the client organization. This ensures that our clients achieve sustainable competitive advantage, build more capable organizations, and secure lasting results. Founded in 1963, BCG is a private company with offices in more than 90 cities in 50 countries. For more information, please visit bcg.com. THE NEXT DECADE IN QUANTUM COMPUTING— AND HOW TO PLAY PHILIPP GERBERT FRANK RUESS November 2018 | Boston Consulting Group CONTENTS 3 INTRODUCTION 4 HOW QUANTUM COMPUTERS ARE DIFFERENT, AND WHY IT MATTERS 6 THE EMERGING QUANTUM COMPUTING ECOSYSTEM Tech Companies Applications and Users 10 INVESTMENTS, PUBLICATIONS, AND INTELLECTUAL PROPERTY 13 A BRIEF TOUR OF QUANTUM COMPUTING TECHNOLOGIES Criteria for Assessment Current Technologies Other Promising Technologies Odd Man Out 18 SIMPLIFYING THE QUANTUM ALGORITHM ZOO 21 HOW TO PLAY THE NEXT FIVE YEARS AND BEYOND Determining Timing and Engagement The Current State of Play 24 A POTENTIAL QUANTUM WINTER, AND THE OPPORTUNITY THEREIN 25 FOR FURTHER READING 26 NOTE TO THE READER 2 | The Next Decade in Quantum Computing—and How to Play INTRODUCTION he experts are convinced that in time they can build a Thigh-performance quantum computer.
    [Show full text]
  • Quantum Computing in the NISQ Era and Beyond
    Quantum Computing in the NISQ era and beyond John Preskill Institute for Quantum Information and Matter and Walter Burke Institute for Theoretical Physics, California Institute of Technology, Pasadena CA 91125, USA 30 July 2018 Noisy Intermediate-Scale Quantum (NISQ) technology will be available in the near future. Quantum computers with 50-100 qubits may be able to perform tasks which surpass the capabilities of today’s classical digital computers, but noise in quantum gates will limit the size of quantum circuits that can be executed reliably. NISQ devices will be useful tools for exploring many-body quantum physics, and may have other useful applications, but the 100-qubit quantum computer will not change the world right away — we should regard it as a significant step toward the more powerful quantum technologies of the future. Quantum technologists should continue to strive for more accurate quantum gates and, eventually, fully fault-tolerant quantum computing. 1 Introduction Now is an opportune time for a fruitful discussion among researchers, entrepreneurs, man- agers, and investors who share an interest in quantum computing. There has been a recent surge of investment by both large public companies and startup companies, a trend that has surprised many quantumists working in academia. While we have long recognized the commercial potential of quantum technology, this ramping up of industrial activity has happened sooner and more suddenly than most of us expected. In this article I assess the current status and future potential of quantum computing. Because quantum computing technology is so different from the information technology we use now, we have only a very limited ability to glimpse its future applications, or to project when these applications will come to fruition.
    [Show full text]
  • Learning Nonlinear Input–Output Maps with Dissipative Quantum Systems
    Quantum Information Processing (2019) 18:198 https://doi.org/10.1007/s11128-019-2311-9 Learning nonlinear input–output maps with dissipative quantum systems Jiayin Chen1 · Hendra I. Nurdin1 Received: 17 October 2018 / Accepted: 3 May 2019 / Published online: 15 May 2019 © Springer Science+Business Media, LLC, part of Springer Nature 2019 Abstract In this paper, we develop a theory of learning nonlinear input–output maps with fading memory by dissipative quantum systems, as a quantum counterpart of the theory of approximating such maps using classical dynamical systems. The theory identifies the properties required for a class of dissipative quantum systems to be universal, in that any input–output map with fading memory can be approximated arbitrarily closely by an element of this class. We then introduce an example class of dissipative quantum systems that is provably universal. Numerical experiments illustrate that with a small number of qubits, this class can achieve comparable performance to classical learning schemes with a large number of tunable parameters. Further numerical analysis sug- gests that the exponentially increasing Hilbert space presents a potential resource for dissipative quantum systems to surpass classical learning schemes for input–output maps. Keywords Machine learning with quantum systems · Dissipative quantum systems · Universality property · Reservoir computing · Nonlinear input–output maps · Fading memory maps · Nonlinear time series · Stone–Weierstrass theorem 1 Introduction We are in the midst of the noisy intermediate-scale quantum (NISQ) technology era [1], marked by noisy quantum computers consisting of roughly tens to hundreds of qubits. Currently, there is a substantial interest in early applications of these machines that can accelerate the development of practical quantum computers, akin to how the humble hearing aid stimulated the development of integrated circuit (IC) technology [2].
    [Show full text]
  • Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices
    Tackling the Qubit Mapping Problem for NISQ-Era Quantum Devices Gushu Li Yufei Ding Yuan Xie University of California University of California University of California Santa Barbara, CA Santa Barbara, CA Santa Barbara, CA [email protected] [email protected] [email protected] Abstract 1 Introduction Due to little consideration in the hardware constraints, e.g., Quantum Computing (QC) has been rapidly growing in the limited connections between physical qubits to enable two- last few decades because of its potential in various important qubit gates, most quantum algorithms cannot be directly applications, including integer factorization [47], database executed on the Noisy Intermediate-Scale Quantum (NISQ) search [15], quantum simulation [36], etc. Recently, IBM, devices. Dynamically remapping logical qubits to physical Intel, and Google released their QC devices with 50, 49, and qubits in the compiler is needed to enable the two-qubit 72 qubits respectively [22, 23, 56]. IBM and Rigetti also pro- gates in the algorithm, which introduces additional oper- vide cloud QC services [18, 40], allowing more people to ations and inevitably reduces the fidelity of the algorithm. study real quantum hardware. We are expected to enter the Previous solutions in finding such remapping suffer from Noisy Intermediate-Scale Quantum (NISQ) era in the next high complexity, poor initial mapping quality, and limited few years [39], when QC devices with dozens to hundreds of flexibility and controllability. qubits will be available. Though the number of qubits is insuf- To address these drawbacks mentioned above, this paper ficient for Quantum Error Correction (QEC), .it is expected proposes a SWAP-based BidiREctional heuristic search al- that these devices will be used to solve real-world problems gorithm (SABRE), which is applicable to NISQ devices with beyond the capability of available classical computers [5, 38].
    [Show full text]
  • Dance with Noise in NISQ Era — a NASA Perspective on Quantum Computing
    Dance with Noise in NISQ Era — A NASA Perspective on Quantum Computing Zhihui Wang1,2 Eleanor Rieffel1 [email protected] [email protected] 1. NASA Quantum Artificial Intelligence Lab (QuAIL) 2. Universities Space Research Association ICCAD 2019, West Minster, CO Quantum Computing: Explore “bizarre” features of quantum mechanics Superposition Entanglement Quantum Tunneling Article developed fast, high-fidelity gates that can be executed simultaneously a across a two-dimensional qubit array. We calibrated and benchmarked the processor at both the component and system level using a powerful new tool: cross-entropy benchmarking11. Finally, we used component- level fidelities to accurately predict the performance of the whole sys- tem, further showing that quantum information behaves as expected when scaling to large systems. A suitable computational task To demonstrate quantum supremacy, we compare our quantum proces- sor against state-of-the-art classical computers in the task of sampling the output of a pseudo-random quantum circuit11,13,14. Random circuits are a suitable choice for benchmarking because they do not possess The Noisy Intermediate-Scale Quantum (NISQ) Era structure and therefore allow for limited guarantees of computational hardness10–12. We design the circuits to entangle a set of quantum bits (qubits) by repeated application of single-qubit and two-qubit logi- cal operations. Sampling the quantum circuit’s output produces a set Qubit Adjustable coupler of bitstrings, for example {0000101, 1011100, …}. Owing to quantum interference, the probability distribution of the bitstrings resembles b a speckled intensity pattern produced by light interference in laser Google scatter, such that some bitstrings are much more likely to occur than others.
    [Show full text]
  • T|Ket〉: a Retargetable Compiler for NISQ Devices
    View metadata, citation and similar papers at core.ac.uk brought to you by CORE Page 1 of 43 AUTHOR SUBMITTED MANUSCRIPT - QST-100727.R1 provided by University of Strathclyde Institutional Repository 1 2 3 4 5 6 7 8 9 10 t|keti: A Retargetable Compiler for NISQ Devices 11 12 Seyon Sivarajah1∗†, Silas Dilkes1∗, Alexander Cowtan1∗, 13 1∗ 1 1,2 14 Will Simmons , Alec Edgington , and Ross Duncan 15 1 Cambridge Quantum Computing Ltd, 9a Bridge Street, Cambridge, United Kingdom 16 2 Department of Computer and Information Sciences, University of Strathclyde, 17 26 Richmond Street, Glasgow, United Kingdom 18 19 ∗ These authors contributed equally to this work. 20 21 Abstract. We present t|keti, a quantum software development platform produced 22 by Cambridge Quantum Computing Ltd. The heart of t|keti is a language-agnostic 23 optimising compiler designed to generate code for a variety of NISQ devices, which has 24 25 several features designed to minimise the influence of device error. The compiler has 26 been extensively benchmarked and outperforms most competitors in terms of circuit 27 optimisation and qubit routing. 28 29 30 31 1. Introduction 32 33 Quantum computing devices promise significant advantages for a wide variety of 34 35 information processing tasks [1, 2, 3]. For some tasks, notably the simulation of condensed- 36 matter physics, the abstract structure of the problem may be sufficiently similar to 37 the physical structure of the device that translation from one to the other is natural 38 39 and (relatively) straightforward [4]. However, for most problems, and most quantum 40 computers, this is not the case.
    [Show full text]
  • What's Next After Quantum Supremacy?
    What’s Next After Quantum Supremacy? Credit: Erik Lucero/Google John Preskill Q2B 2019 11 December 2019 Quantum 2, 79 (2018), arXiv:1801.00862 Based on a Keynote Address delivered at Quantum Computing for Business, 5 December 2017 Nature 574, pages 505–510 (2019), 23 October 2019 The promise of quantum computers is that certain computational tasks might be executed exponentially faster on a quantum processor than on a classical processor. A fundamental challenge is to build a high-fidelity processor capable of running quantum algorithms in an exponentially large computational space. Here we report the use of a processor with programmable superconducting qubits to create quantum states on 53 qubits, corresponding to a computational state-space of dimension 253 (about 1016). Measurements from repeated experiments sample the resulting probability distribution, which we verify using classical simulations. Our Sycamore processor takes about 200 seconds to sample one instance of a quantum circuit a million times—our benchmarks currently indicate that the equivalent task for a state-of-the-art classical supercomputer would take approximately 10,000 years. This dramatic increase in speed compared to all known classical algorithms is an experimental realization of quantum supremacy for this specific computational task, heralding a much anticipated computing paradigm. Classical systems cannot simulate quantum systems efficiently (a widely believed but unproven conjecture). Arguably the most interesting thing we know about the difference between quantum and classical. Each qubit is also connected to its neighboring qubits using a new adjustable coupler [31, 32]. Our coupler design allows us to quickly tune the qubit-qubit coupling from completely off to 40 MHz.
    [Show full text]
  • Challenges at the Entanglement Frontier
    Challenges at the entanglement frontier John Preskill DOE Kickoff 31 January 2019 Quantum Information Science Quantum sensing Improving sensitivity and spatial resolution. Quantum cryptography Privacy founded on fundamental laws of quantum physics. Quantum networking Distributing quantumness around the world. Quantum simulation Probes of exotic quantum many-body phenomena. Quantum computing Speeding up solutions to hard problems. Hardware challenges cut across all these application areas. Frontiers of Physics short distance long distance complexity Higgs boson Large scale structure “More is different” Neutrino masses Cosmic microwave Many-body entanglement background Supersymmetry Phases of quantum Dark matter matter Quantum gravity Dark energy Quantum computing String theory Gravitational waves Quantum spacetime Two fundamental ideas (1) Quantum complexity Why we think quantum computing is powerful. (2) Quantum error correction Why we think quantum computing is scalable. A complete description of a typical quantum state of just 300 qubits requires more bits than the number of atoms in the visible universe. Why we think quantum computing is powerful (1) Problems believed to be hard classically, which are easy for quantum computers. Factoring is the best known example. (2) Complexity theory arguments indicating that quantum computers are hard to simulate classically. (3) We don’t know how to simulate a quantum computer efficiently using a digital (“classical”) computer. The cost of the best known simulation algorithm rises exponentially with the number of qubits. But … the power of quantum computing is limited . For example, we don’t believe that quantum computers can efficiently solve worst-case instances of NP-hard optimization problems (e.g., the traveling salesman problem).
    [Show full text]
  • Quantum Chemistry in the Age of Quantum Computing Arxiv:1812.09976V2 [Quant-Ph] 28 Dec 2018
    Quantum Chemistry in the Age of Quantum Computing , , , Yudong Cao,y z Jonathan Romero,y z Jonathan P. Olson,y z Matthias , , , , , #, Degroote,y { x Peter D. Johnson,y z M´aria Kieferov´a,k ? z Ian D. Kivlichan, y #,@, , Tim Menke, 4 Borja Peropadre,z Nicolas P. D. Sawaya,r Sukin Sim,y z Libor , , , , , , Veis,yy and Al´anAspuru-Guzik∗ y z { x zz {{ Department of Chemistry and Chemical Biology, Harvard University, Cambridge, MA 02138, y USA Zapata Computing Inc., Cambridge, MA 02139, USA z Department of Chemistry, University of Toronto, Toronto, Ontario M5G 1Z8, Canada { Department of Computer Science, University of Toronto, Toronto, Ontario M5G 1Z8, Canada x Department of Physics and Astronomy, Macquarie University, Sydney, NSW, 2109, Australia k Institute for Quantum Computing and Department of Physics and Astronomy, University of ? Waterloo, Waterloo, Ontario N2L 3G1, Canada #Department of Physics, Harvard University, Cambridge, MA 02138, USA @Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, MA 02139, USA Department of Physics, Massachusetts Institute of Technology, Cambridge, MA 02139, USA 4 Intel Labs, Intel Corporation, Santa Clara, CA 95054 USA arXiv:1812.09976v2 [quant-ph] 28 Dec 2018 r J. Heyrovsk´yInstitute of Physical Chemistry, Academy of Sciences of the Czech Republic v.v.i., yy Dolejˇskova3, 18223 Prague 8, Czech Republic Canadian Institute for Advanced Research, Toronto, Ontario M5G 1Z8, Canada zz Vector Institute for Artificial Intelligence, Toronto, Ontario M5S 1M1, Canada {{ E-mail: [email protected] 1 Abstract Practical challenges in simulating quantum systems on classical computers have been widely recognized in the quantum physics and quantum chemistry communities over the past century.
    [Show full text]
  • Qasmbench: a Low-Level Quantum Benchmark Suite for NISQ Evaluation and Simulation
    QASMBench: A Low-Level Quantum Benchmark Suite for NISQ Evaluation and Simulation ANG LI, SAMUEL STEIN, SRIRAM KRISHNAMOORTHY, and JAMES ANG, Pacific Northwest National Laboratory, USA The rapid development of quantum computing (QC) in the NISQ era urgently demands a low-level benchmark suite and insightful evaluation metrics for characterizing the properties of prototype NISQ devices, the efficiency of QC programming compilers, schedulers and assemblers, and the capability of quantum simulators in a classical computer. In this work, we fill this gap by proposing a low-level, easy-to-use benchmark suite called QASMBench based on the OpenQASM assembly representation. It consolidates commonly used quantum routines and kernels from a variety of domains including chemistry, simulation, linear algebra, searching, optimization, arithmetic, machine learning, fault tolerance, cryptography, etc., trading-off between generality and usability. To analyze these kernels in terms of NISQ device execution, in addition to circuit width and depth, we propose four circuit metrics including gate density, retention lifespan, measurement density, and entanglement variance, to extract more insights about the execution efficiency, the susceptibility to NISQ error, and the potential gain from machine-specific optimizations. Most of the QASMBench application code canbe launched and verified in IBM-Q directly. With the help from q-convert, QASMBench can be evaluated on various platforms and simulation environments. QASMBench is released at: http://github.com/pnnl/QASMBench. CCS Concepts: • Computer systems organization ! Quantum computing; • Hardware ! Quantum computation; • Software and its engineering ! Software libraries and repositories. Additional Key Words and Phrases: Benchmark, OpenQASM, quantum metrics, NISQ ACM Reference Format: Ang Li, Samuel Stein, Sriram Krishnamoorthy, and James Ang.
    [Show full text]
  • Classical Variational Simulation of the Quantum Approximate Optimization Algorithm ✉ Matija Medvidović 1,2 and Giuseppe Carleo3
    www.nature.com/npjqi ARTICLE OPEN Classical variational simulation of the Quantum Approximate Optimization Algorithm ✉ Matija Medvidović 1,2 and Giuseppe Carleo3 A key open question in quantum computing is whether quantum algorithms can potentially offer a significant advantage over classical algorithms for tasks of practical interest. Understanding the limits of classical computing in simulating quantum systems is an important component of addressing this question. We introduce a method to simulate layered quantum circuits consisting of parametrized gates, an architecture behind many variational quantum algorithms suitable for near-term quantum computers. A neural-network parametrization of the many-qubit wavefunction is used, focusing on states relevant for the Quantum Approximate Optimization Algorithm (QAOA). For the largest circuits simulated, we reach 54 qubits at 4 QAOA layers, approximately implementing 324 RZZ gates and 216 RX gates without requiring large-scale computational resources. For larger systems, our approach can be used to provide accurate QAOA simulations at previously unexplored parameter values and to benchmark the next generation of experiments in the Noisy Intermediate-Scale Quantum (NISQ) era. npj Quantum Information (2021) 7:101 ; https://doi.org/10.1038/s41534-021-00440-z 1234567890():,; INTRODUCTION perform a variational parameter sweep on a 1D cut of the The past decade has seen a fast development of quantum parameter space. The method is contrasted with state-of-the-art technologies and the achievement of an unprecedented level of classical simulations based on low-rank Clifford group decom- 26 control in quantum hardware1, clearing the way for demonstra- positions , whose complexity is exponential in the number of 29 tions of quantum computing applications for practical uses.
    [Show full text]
  • Quantum Computing in the NISQ Era
    Quantum Computing in the NISQ era Alba Cervera-Lierta University of Toronto UCL Quantum Technologies Winter School 2020 The MatterLab https://www.matter.toronto.edu/ Alán Aspuru-Guzik Our Mission To accelerate the discovery of new chemicals and materials that are useful to society by means of new technologies such as quantum computing, machine learning, and automation. The Quantum MatterLab Postdocs PhD students + visitors and undergrad https://www.matter.toronto.edu/ Outlook Brief introduction to quantum computing NISQ vs Fault-Tolerant QC Variational Quantum Algorithms Slides will be available at A tool for NISQ: Tequila albacl.github.io/talk/ A NISQ example: Meta-VQE Comments and Remarks Brief story of Quantum Computing The “Quantum Bible”: “Quantum Computation and Quantum Information”, Michael A. Nielsen & Isaac L. Chuang Practical approach: Qiskit and Pennylane quantum algorithm tutorials More learning resources (books, blogs, courses, …): https://qosf.org/learn_quantum/ Brief history of quantum mechanics Quantum 1.0 Quantum 2.0 1900-1930 1930-1950 1950-1980 1980-2000 2000- Prenatal Infancy Childhood Adolescence Youth Quantum theory First applications: Transistor (1947), Q Turing Machine, First Quantum birth (1900) e.g. nuclear Solar Cells (1954), Quantum chips (2005), Postulates (1926) energy,… GPS (1955), Laser simulation (1980), Quantum (1960), MRI (1971), Shor algorithm teleportation with … (1994), CNOT satellites (2017), (1995), Bose- Quantum Einstein advantage (2019) condensate (1997) Quantum Computing in the NISQ era, Alba Cervera-Lierta, UCL Quantum Tech Winter School 2020. Quantum 2.0 Quantum Quantum Quantum Communication Computing Sensing Quantums Quantum Quantum Metrology Applications Cryptography Simulation Quantum Information Information Theory framework Theoretical Theoretical Quantum Mechanics Quantum Computing in the NISQ era, Alba Cervera-Lierta, UCL Quantum Tech Winter School 2020.
    [Show full text]