DOCSLIB.ORG

Afonso Rodrigues Validation of Quantum Simulations

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Afonso Rodrigues Validation of Quantum Simulations Universidade do Minho Escola de Engenharia Departamento de Informática Afonso Rodrigues Validation of quantum simulations Assessing efficiency and reliability in experimental implementations November 2018 Universidade do Minho Escola de Engenharia Departamento de Informática Afonso Rodrigues Validation of quantum simulations Assessing efficiency and reliability in experimental implementations Master dissertation Master Degree in Engineering Physics Dissertation supervised by Luís Barbosa Carlos Tavares November 2018 ACKNOWLEDGEMENTS This work was only possible thanks to the contribution of several people to which I want to express my gratitude. To my supervisor prof. Luís Barbosa, for giving me the opportunity to undertake this project, and for his constant support, availability and patience; also to my co-supervisor Carlos Tavares, for his early insight. In no particular order of importance, to Miguel Nogueira, Ricardo Alves, Rui Costa, João Fonseca, Miguel Sanches, Joaquim Santos, and José Bruno, my friends and colleagues who accompanied me in this course and provided invaluable help. To my parents and sister, and Maria Coelho, André Souto and Gil Pimentel for their unconditional encouragement on the difficult days. Finally, I wish to thank University of Minho for these five years of learning, INESC TEC and specifically the HASLab team for supporting me in my first steps as a researcher. I acknowledge use of the IBM Q for this work. i ABSTRACT Quantum simulation is one of the most relevant applications of quantum computation for the near future, due to its scientific impact and also because quantum simulation algorithms are typically less demanding than generalized quantum computations. Ultimately, the success of a quantum simulation depends on the amount and reliability of information one is able to extract from the results. In such a context, this work reviews the theory behind quantum simulation, with a focus on digital quantum simulation. The concepts of efficiency and reliability in quantum simulations are discussed, particularly for implementations of digital simulation algorithms in state-of-the-art quantum computers. A review of approaches for quantum characterization, verification and validation techniques (QCVV) is also presented. A digital quantum simulation of the Schrödinger equation for a single particle in 1 spatial dimension was experimentally implemented and analyzed, along with a quantum state tomography procedure for characterization of the final quantum state and evaluation of simulation reliability. From the literature, it is shown that digital quantum simulation is theoretically sound and experimentally feasible, with several applications in a wide range of physics-related fields. Nonetheless, a number of conditions arise that must be observed for a truly efficient im- plementation of a digital quantum simulation, from theoretical conception to experimental circuit design. The review of QCVV techniques highlights the need for characterization and validation techniques that could be efficiently implemented for current models of quantum computation, particularly in instances where classical verification is not tractable. However, there are proposals for efficient verification procedures when a set of parameters defining the final result of the simulation is known. The experimental simulation demonstrated partial success in comparison with an ideal quantum simulation. From the results it is apparent that better coherence times, better reliability and finer control are as decisive for the advancement of quantum computing power as the more-publicized number of qubits of a given device. ii RESUMO A simulação quântica é uma das aplicações mais relevantes da computação quântica num fu- turo próximo, não só devido ao seu impacto científico como também porque os algoritmos de simulação quântica são tipicamente menos exigentes do que algoritmos quânticos numéricos. Em última análise, o sucesso de uma simulação quântica depende da quantidade e fiabilidade das informações que é possível extrair dos resultados. Neste contexto, este trabalho apresenta uma revisão da teoria da simulação quântica, com ênfase na simulação quântica digital. Os conceitos de eficiência e fiabilidade em simulações quânticas são discutidos, particularmente para implementações de algoritmos de simulação digital. Uma revisão de técnicas de caracter- ização, verificação e validação de sistemas quânticos (QCVV) é também apresentada. Uma simulação quântica digital da equação de Schrödinger para uma única partícula a uma dimen- são espacial foi implementada experimentalmente e analisada, juntamente com um método de tomografia de estado quântico para a caracterização do estado quântico final e avaliação da fiabilidade da simulação. A partir da literatura, é demonstrado que a simulação quântica digital é teoricamente sólida e experimentalmente viávei, com várias aplicações em diversas áreas da física. No entanto, existem várias condições a ter em conta para uma implementação verdadeiramente eficiente de uma simulação quântica digital, da sua concepção teórica até à implementação experimental de circuitos. A revisão de técnicas QCVV destaca a necessidade de técnicas de caracterização e validação que possam ser eficientemente implementadas para modelos atuais de computação quântica, particularmente em instâncias em que a verificação clássica não é possível ou desejável. No entanto, existem propostas para técnicas de verificação que são eficientes quando se conhece, a priori, um conjunto de parâmetros característicos do resultado final da simulação. A simulação experimental demonstrou sucesso parcial relativamente a uma simulação quân- tica ideal. A partir dos resultados, evidencia-se que melhores tempos de coerência, maior fiabilidade e controlo mais refinado são tão decisivos para o avanço da computação quântica quanto o número de qubits de um dispositivo. iii CONTENTS 1 introduction 1 1.1 The context: quantum simulation1 1.2 Schrödinger equation3 1.3 Objectives5 1.4 Outline6 2 quantum simulation 8 2.1 Digital quantum simulation 11 2.2 Towards an efficient implementation of DQS 13 2.3 Analog quantum simulation 16 2.4 Physical realizations 17 2.5 Applications 20 2.6 Summary 23 3 quantum characterization, verification and validation 24 3.1 Quantum state tomography 25 3.2 Quantum process tomography 30 3.3 Randomized benchmarking 32 3.4 Other verification and validation methods 34 3.5 Summary 37 4 experimental procedure 38 4.1 Quantum devices 38 4.2 Simulation algorithm 41 4.2.1 2-qubit implementation 45 4.2.2 3-qubit implementation 47 4.3 Quantum state tomography 49 4.4 Procedure 51 5 results and discussion 54 5.1 2-qubit simulation 55 5.2 3-qubit simulation 60 5.3 Discussion 61 6 conclusions 65 6.1 Future work 67 iv Contents v a quantum computing 80 a.1 Hilbert space and the bra-ket notation 80 a.2 Quantum computing programming model 81 a.3 Quantum gates 83 b qiskit implementation 85 b.1 2-qubit algorithms 85 b.2 3-qubit algorithms 101 c qiskit results 122 c.1 Device parameters 122 c.2 Output quantum circuits 136 c.2.1 2-qubit implementation 136 c.2.2 3-qubit implementation 148 1 INTRODUCTION 1.1 the context: quantum simulation The possibility of performing computational tasks deemed inefficient, or even impossible, on available classical computing power has increased the momentum on quantum computation and simulation research over the past decade. However, there are still major milestones to be reached before the first fault-tolerant, universal quantum computer is built. As of 2018, available quantum devices work by approximating quantum computations on physical qubits; quantum information and computation research is entering the NISQ (Noisy intermediate- scale quantum) era. Before a noise-resilient logical qubit - one that performs as theoretically predicted, holding its state in arbitrarily long quantum algorithms - is reached, error rates and coherence times need to be further improved, and error correcting codes allowing for implementation of a universal set of gates while keeping low overhead, need to be devised (Campbell et al., 2017). Quantum simulation is currently one of the most relevant applications of quantum computa- tion. This is true not only due to its scientific and industrial impact, but also because quantum simulation algorithms are typically less demanding than general quantum computations. For example, a quantum simulator with tens of qubits could already perform useful simulations under current technology, whereas thousands of qubits would be needed to factorize modest numbers using Shor’s algorithm (Buluta and Nori, 2009). In fact, quantum simulators could even explore the presence of environmental errors and decoherence to simulate the presence of same phenomena on the simulated system (Lloyd, 1996). It is also believed that no known classical algorithm can, without compromises, efficiently simulate the dynamics of a quantum system (Preskill, 2018). The biggest demonstrated classical numerical simulation of a quantum system was per- formed by a team of researchers from IBM on a conventional supercomputer, in October 2017. The team managed to effectively simulate a 56-qubit quantum system, which implicates that a scenario of quantum supremacy Boixo et al.(2018) would be achieved on a quantum computer with a greater amount of qubits and reasonable fidelity. Of course, quantum supremacy is dependent on many factors other than qubit number (e.g. universality, fidelity, entanglement 1 1.1. The context: quantum simulation 2 capabilities, decoherence), and, as classical computational
Load more

Recommended publications
  • Qiskit Backend Specifications for Openqasm and Openpulse
    Qiskit Backend Specifications for OpenQASM and OpenPulse Experiments David C. McKay1,∗ Thomas Alexander1, Luciano Bello1, Michael J. Biercuk2, Lev Bishop1, Jiayin Chen2, Jerry M. Chow1, Antonio D. C´orcoles1, Daniel Egger1, Stefan Filipp1, Juan Gomez1, Michael Hush2, Ali Javadi-Abhari1, Diego Moreda1, Paul Nation1, Brent Paulovicks1, Erick Winston1, Christopher J. Wood1, James Wootton1 and Jay M. Gambetta1 1IBM Research 2Q-CTRL Pty Ltd, Sydney NSW Australia September 11, 2018 Abstract As interest in quantum computing grows, there is a pressing need for standardized API's so that algorithm designers, circuit designers, and physicists can be provided a common reference frame for designing, executing, and optimizing experiments. There is also a need for a language specification that goes beyond gates and allows users to specify the time dynamics of a quantum experiment and recover the time dynamics of the output. In this document we provide a specification for a common interface to backends (simulators and experiments) and a standarized data structure (Qobj | quantum object) for sending experiments to those backends via Qiskit. We also introduce OpenPulse, a language for specifying pulse level control (i.e. control of the continuous time dynamics) of a general quantum device independent of the specific arXiv:1809.03452v1 [quant-ph] 10 Sep 2018 hardware implementation. ∗[email protected] 1 Contents 1 Introduction3 1.1 Intended Audience . .4 1.2 Outline of Document . .4 1.3 Outside of the Scope . .5 1.4 Interface Language and Schemas . .5 2 Qiskit API5 2.1 General Overview of a Qiskit Experiment . .7 2.2 Provider . .8 2.3 Backend .
    [Show full text]
  • Direct Dispersive Monitoring of Charge Parity in Offset-Charge
    PHYSICAL REVIEW APPLIED 12, 014052 (2019) Direct Dispersive Monitoring of Charge Parity in Offset-Charge-Sensitive Transmons K. Serniak,* S. Diamond, M. Hays, V. Fatemi, S. Shankar, L. Frunzio, R.J. Schoelkopf, and M.H. Devoret† Department of Applied Physics, Yale University, New Haven, Connecticut 06520, USA (Received 29 March 2019; revised manuscript received 20 June 2019; published 26 July 2019) A striking characteristic of superconducting circuits is that their eigenspectra and intermode coupling strengths are well predicted by simple Hamiltonians representing combinations of quantum-circuit ele- ments. Of particular interest is the Cooper-pair-box Hamiltonian used to describe the eigenspectra of transmon qubits, which can depend strongly on the offset-charge difference across the Josephson element. Notably, this offset-charge dependence can also be observed in the dispersive coupling between an ancil- lary readout mode and a transmon fabricated in the offset-charge-sensitive (OCS) regime. We utilize this effect to achieve direct high-fidelity dispersive readout of the joint plasmon and charge-parity state of an OCS transmon, which enables efficient detection of charge fluctuations and nonequilibrium-quasiparticle dynamics. Specifically, we show that additional high-frequency filtering can extend the charge-parity life- time of our device by 2 orders of magnitude, resulting in a significantly improved energy relaxation time T1 ∼ 200 μs. DOI: 10.1103/PhysRevApplied.12.014052 I. INTRODUCTION charge states, like a usual transmon but with measurable offset-charge dispersion of the transition frequencies The basic building blocks of quantum circuits—e.g., between eigenstates, like a Cooper-pair box. This defines capacitors, inductors, and nonlinear elements such as what we refer to as the offset-charge-sensitive (OCS) Josephson junctions [1] and electromechanical trans- transmon regime.
    [Show full text]
  • A Scanning Transmon Qubit for Strong Coupling Circuit Quantum Electrodynamics
    ARTICLE Received 8 Mar 2013 | Accepted 10 May 2013 | Published 7 Jun 2013 DOI: 10.1038/ncomms2991 A scanning transmon qubit for strong coupling circuit quantum electrodynamics W. E. Shanks1, D. L. Underwood1 & A. A. Houck1 Like a quantum computer designed for a particular class of problems, a quantum simulator enables quantitative modelling of quantum systems that is computationally intractable with a classical computer. Superconducting circuits have recently been investigated as an alternative system in which microwave photons confined to a lattice of coupled resonators act as the particles under study, with qubits coupled to the resonators producing effective photon–photon interactions. Such a system promises insight into the non-equilibrium physics of interacting bosons, but new tools are needed to understand this complex behaviour. Here we demonstrate the operation of a scanning transmon qubit and propose its use as a local probe of photon number within a superconducting resonator lattice. We map the coupling strength of the qubit to a resonator on a separate chip and show that the system reaches the strong coupling regime over a wide scanning area. 1 Department of Electrical Engineering, Princeton University, Olden Street, Princeton 08550, New Jersey, USA. Correspondence and requests for materials should be addressed to W.E.S. (email: [email protected]). NATURE COMMUNICATIONS | 4:1991 | DOI: 10.1038/ncomms2991 | www.nature.com/naturecommunications 1 & 2013 Macmillan Publishers Limited. All rights reserved. ARTICLE NATURE COMMUNICATIONS | DOI: 10.1038/ncomms2991 ver the past decade, the study of quantum physics using In this work, we describe a scanning superconducting superconducting circuits has seen rapid advances in qubit and demonstrate its coupling to a superconducting CPWR Osample design and measurement techniques1–3.
    [Show full text]
  • Qubic: an Open Source FPGA-Based Control and Measurement System for Superconducting Quantum Information Processors
    1 QubiC: An open source FPGA-based control and measurement system for superconducting quantum information processors Yilun Xu,1 Gang Huang,1 Jan Balewski,1 Ravi Naik,2 Alexis Morvan,1 Bradley Mitchell,2 Kasra Nowrouzi,1 David I. Santiago,1 and Irfan Siddiqi1;2 1Lawrence Berkeley National Laboratory, Berkeley, CA 94720, USA 2University of California at Berkeley, Berkeley, CA 94720, USA Corresponding author: Gang Huang (email: [email protected]) Abstract—As quantum information processors grow in quan- for general purpose test and measurement applications, and tum bit (qubit) count and functionality, the control and measure- typically cannot keep pace both in terms of footprint and cost ment system becomes a limiting factor to large scale extensibility. as quantum system complexity increases [6]. A customized To tackle this challenge and keep pace with rapidly evolving classical control requirements, full control stack access is essential quantum engineering solution rooted in extensible primitives to system level optimization. We design a modular FPGA (field- is needed for the quantum computing community. programmable gate array) based system called QubiC to control The field-programmable gate array (FPGA) architecture and measure a superconducting quantum processing unit. The allows for customized solutions capable of growing and evolv- system includes room temperature electronics hardware, FPGA ing with the field [7]. Several FPGA frameworks have been gateware, and engineering software. A prototype hardware mod- ule is assembled from several commercial off-the-shelf evaluation developed for quantum control and measurement [8]–[11]. boards and in-house developed circuit boards. Gateware and Nevertheless, current FPGA-based control systems are not software are designed to implement basic qubit control and fully open to the broader quantum community so it is hard measurement protocols.
    [Show full text]
  • Introduction to Quantum Information Theory
    Introduction to Quantum Information Theory Carlos Palazuelos Instituto de Ciencias Matemáticas (ICMAT) [email protected] Madrid, Spain March 2013 Contents Chapter 1. A comment on these notes 3 Chapter 2. Postulates of quantum mechanics 5 1. Postulate I and Postulate II 5 2. Postulate III 7 3. Postulate IV 9 Chapter 3. Some basic results 13 1. No-cloning theorem 13 2. Quantum teleportation 14 3. Superdense coding 15 Chapter 4. The density operators formalism 17 1. Postulates of quantum mechanics: The density operators formalism 17 2. Partial trace 19 3. The Schmidt decomposition and purifications 20 4. Definition of quantum channel and its classical capacity 21 Chapter 5. Quantum nonlocality 25 1. Bell’s result: Correlations in EPR 25 2. Tsirelson’s theorem and Grothendieck’s theorem 27 Chapter 6. Some notions about classical information theory 33 1. Shannon’s noiseless channel coding theorem 33 2. Conditional entropy and Fano’s inequality 35 3. Shannon’s noisy channel coding theorem: Random coding 38 Chapter 7. Quantum Shannon Theory 45 1. Von Neumann entropy 45 2. Schumacher’s compression theorem 48 3. Accessible Information and Holevo bound 55 4. Classical capacity of a quantum channel 58 5. A final comment about the regularization 61 Bibliography 63 1 CHAPTER 1 A comment on these notes These notes were elaborated during the first semester of 2013, while I was preparing a course on quantum information theory as a subject for the PhD programme: Investigación Matemática at Universidad Complutense de Madrid. The aim of this work is to present an accessible introduction to some topics in the field of quantum information theory for those people who do not have any background on the field.
    [Show full text]
  • Higher Levels of the Transmon Qubit
    Higher Levels of the Transmon Qubit MASSACHUSETTS INSTITUTE OF TECHNirLOGY by AUG 15 2014 Samuel James Bader LIBRARIES Submitted to the Department of Physics in partial fulfillment of the requirements for the degree of Bachelor of Science in Physics at the MASSACHUSETTS INSTITUTE OF TECHNOLOGY June 2014 @ Samuel James Bader, MMXIV. All rights reserved. The author hereby grants to MIT permission to reproduce and to distribute publicly paper and electronic copies of this thesis document in whole or in part in any medium now known or hereafter created. Signature redacted Author........ .. ----.-....-....-....-....-.....-....-......... Department of Physics Signature redacted May 9, 201 I Certified by ... Terr P rlla(nd Professor of Electrical Engineering Signature redacted Thesis Supervisor Certified by ..... ..................... Simon Gustavsson Research Scientist Signature redacted Thesis Co-Supervisor Accepted by..... Professor Nergis Mavalvala Senior Thesis Coordinator, Department of Physics Higher Levels of the Transmon Qubit by Samuel James Bader Submitted to the Department of Physics on May 9, 2014, in partial fulfillment of the requirements for the degree of Bachelor of Science in Physics Abstract This thesis discusses recent experimental work in measuring the properties of higher levels in transmon qubit systems. The first part includes a thorough overview of transmon devices, explaining the principles of the device design, the transmon Hamiltonian, and general Cir- cuit Quantum Electrodynamics concepts and methodology. The second part discusses the experimental setup and methods employed in measuring the higher levels of these systems, and the details of the simulation used to explain and predict the properties of these levels. Thesis Supervisor: Terry P. Orlando Title: Professor of Electrical Engineering Thesis Supervisor: Simon Gustavsson Title: Research Scientist 3 4 Acknowledgments I would like to express my deepest gratitude to Dr.
    [Show full text]
  • Mapping Quantum Algorithms in a Crossbar Architecture
    Mapping QUANTUM ALGORITHMS IN A CROSSBAR ARCHITECTURE Alejandro MorAIS Mapping quantum algorithms in a crossbar architecture by Alejandro Morais to obtain the degree of Master of Science at the Delft University of Technology, to be defended publicly on the 25th of September 2019. Student number: 4747240 Project duration: November 1, 2018 – July 1, 2019 Thesis committee: Dr. ir. C.G. Almudever, QCA, TU Delft Dr. ir. Z. Al-Ars, CE, TU Delft Dr. ir. F. Sebastiano, AQUA, TU Delft Dr. ir. M. Veldhorst, QuTech, TU Delft Supervisor: Dr. ir. C.G. Almudever, QCA, TU Delft An electronic version of this thesis is available at https://repository.tudelft.nl/. Abstract In recent years, Quantum Computing has gone from theory to a promising reality, leading to quantum chips that in a near future might be able to exceed the computational power of any current supercomputer. For this to happen, there are some problems that must be overcome. For example, in a quantum processor, qubits are usually arranged in a 2D architecture with limited connectivity between them and in which only nearest-neighbour interactions are allowed. This restricts the execution of two-qubit gates and requires qubit to be moved to adjacent positions. Quantum algorithms, which are described as quantum circuits, neglect the quantum chip constraints and therefore cannot be directly executed. This is known as the mapping problem. This thesis focuses on the problem of mapping quantum algorithms into a quantum chip based on spin qubits, called the crossbar architecture. In this project we have developed the required compiler support (mapping) for making quantum circuits executable on the crossbar architecture based on the tools provided by OpenQL.
    [Show full text]
  • In Situ Quantum Control Over Superconducting Qubits
    ! In situ quantum control over superconducting qubits Anatoly Kulikov M.Sc. A thesis submitted for the degree of Doctor of Philosophy at The University of Queensland in 2020 School of Mathematics and Physics ARC Centre of Excellence for Engineered Quantum Systems (EQuS) ABSTRACT In the last decade, quantum information processing has transformed from a field of mostly academic research to an applied engineering subfield with many commercial companies an- nouncing strategies to achieve quantum advantage and construct a useful universal quantum computer. Continuing efforts to improve qubit lifetime, control techniques, materials and fab- rication methods together with exploring ways to scale up the architecture have culminated in the recent achievement of quantum supremacy using a programmable superconducting proces- sor { a major milestone in quantum computing en route to useful devices. Marking the point when for the first time a quantum processor can outperform the best classical supercomputer, it heralds a new era in computer science, technology and information processing. One of the key developments enabling this transition to happen is the ability to exert more precise control over quantum bits and the ability to detect and mitigate control errors and imperfections. In this thesis, ways to efficiently control superconducting qubits are explored from the experimental viewpoint. We introduce a state-of-the-art experimental machinery enabling one to perform one- and two-qubit gates focusing on the technical aspect and outlining some guidelines for its efficient operation. We describe the software stack from the time alignment of control pulses and triggers to the data processing organisation. We then bring in the standard qubit manipulation and readout methods and proceed to describe some of the more advanced optimal control and calibration techniques.
    [Show full text]
  • Superconducting Phase Qubits
    Noname manuscript No. (will be inserted by the editor) Superconducting Phase Qubits John M. Martinis Received: date / Accepted: date Abstract Experimental progress is reviewed for superconducting phase qubit research at the University of California, Santa Barbara. The phase qubit has a potential ad- vantage of scalability, based on the low impedance of the device and the ability to microfabricate complex \quantum integrated circuits". Single and coupled qubit ex- periments, including qubits coupled to resonators, are reviewed along with a discus- sion of the strategy leading to these experiments. All currently known sources of qubit decoherence are summarized, including energy decay (T1), dephasing (T2), and mea- surement errors. A detailed description is given for our fabrication process and control electronics, which is directly scalable. With the demonstration of the basic operations needed for quantum computation, more complex algorithms are now within reach. Keywords quantum computation ¢ qubits ¢ superconductivity ¢ decoherence 1 Introduction Superconducting qubits are a unique and interesting approach to quantum computation because they naturally allow strong coupling. Compared to other qubit implementa- tions, they are physically large, from » 1 ¹m to » 100 ¹m in size, with interconnection topology and strength set by simple circuit wiring. Superconducting qubits have the advantage of scalability, as complex circuits can be constructed using well established integrated-circuit microfabrication technology. A key component of superconducting qubits is the Josephson junction, which can be thought of as an inductor with strong non-linearity and negligible energy loss. Combined with a capacitance, coming from the tunnel junction itself or an external element, a inductor-capacitor resonator is formed that exhibits non-linearity even at the single photon level.
    [Show full text]
  • Efficient and Exact Quantum Compression
    Efficient and Exact Quantum Compression a; ;1 b;2 John H. Reif ∗ , Sukhendu Chakraborty aDepartment of Computer Science, Duke University, Durham, NC 27708-0129 bDepartment of Computer Science, Duke University, Durham, NC 27708-0129 Abstract We present a divide and conquer based algorithm for optimal quantum compression / de- compression, using O(n(log4 n) log log n) elementary quantum operations . Our result pro- vides the first quasi-linear time algorithm for asymptotically optimal (in size and fidelity) quantum compression and decompression. We also outline the quantum gate array model to bring about this compression in a quantum computer. Our method uses various classical algorithmic tools to significantly improve the bound from the previous best known bound of O(n3)(R. Cleve, D. P. DiVincenzo, Schumacher's quantum data compression as a quantum computation, Phys. Rev. A, 54, 1996, 2636-2650) for this operation. Key words: Quantum computing, quantum compression, algorithm 1 Introduction 1.1 Quantum Computation Quantum Computation (QC) is a computing model that applies quantum me- chanics to do computation. (Computations and methods not making use of quantum mechanics will be termed classical). A single molecule (or collection of .particles and/or atoms) may have n degrees of freedom known as qubits. Associated with each fixed setting X of the n qubits to boolean values is a basis state denoted a . Quantum mechanics allows for a linear superposition of these basis states to j i ∗ Corresponding author. Email addresses: [email protected] ( John H. Reif), [email protected] (Sukhendu Chakraborty). 1 The work is supported by NSF EMT Grants CCF-0523555 and CCF-0432038.
    [Show full text]
  • EE214/PHYS220 Quantum Computing Lecture 1: Introduction Textbook: N
    EE214/PHYS220 Quantum Computing Lecture 1: Introduction Textbook: N. D. Mermin, Quantum computer science (Cambridge Univ. Press, 2007) (errata at http://www.lassp.cornell.edu/mermin/errata-1-12-12.pdf); http://www.lassp.cornell.edu/mermin/qcomp/CS483.html (lecture notes) Other resources: http://www.theory.caltech.edu/~preskill/ph219/ (lecture notes, Caltech course) http://inst.eecs.berkeley.edu/~cs191 (lecture notes, UC Berkeley course) M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge Univ. Press, 2000) G. Benenti, G. Casati, and G. Strini, Principles of Quantum Computation and Information, Vol. I: Basic Concepts (World Scientific, 2005) Prospects for Quantum Computing (QC): not really clear Pessimistic view: never, possibly limited to very small QCs as servers for quantum cryptography networks Optimistic view: in 20-50 years large-scale QCs, capable of factoring large integers Very optimistic (overoptimistic): will partially or completely replace general-purpose computers What QC can do efficiently 1) Factoring large integers (exponential speedup) Best classical: exp[ log / ], 1 3 more∼ accurately exp log log log , log base 2 1⁄3 64 2⁄3 Quantum: log (Shor’s∼ algorithm)9 2) Search in unsorted database3 (quadratic speedup) ∼ Classical: (simply check all) Quantum: (Grover’s algorithm) ∼ 3) Simulation of quantum∼ systems (for study of materials, etc.) 4) Possibly something else important (still area of active research) Current status: numbers 15 and 21 “factored” (also 143 with adiabatic QC) 14 well-entangled qubits (trapped ions, 2011), <25 qubits quantum algorithms with 9 superconducting qubits (2015), 1,000 D-Wave “qubits” Truly interdisciplinary effort: physics, engineering, computer science, mathematics Classical vs.
    [Show full text]
  • Hacking the Superdense Coding Protocol on IBM's Quantum Computers
    Cyberattacks on Quantum Networked Computation and Communications – Hacking the Superdense Coding Protocol on IBM’s Quantum Computers Carlos Pedro Gonçalves May 18, 2021 Lusophone University of Humanities and Technologies, e-mail: [email protected] Abstract The development of automated gate specification for quantum com- munications and quantum networked computation opens up the way for malware designed at corrupting the automation software, changing the au- tomated quantum communications protocols and algorithms. We study two types of attacks on automated quantum communications protocols and simulate these attacks on the superdense coding protocol, using re- mote access to IBM’s Quantum Computers available through IBM Q Ex- perience to simulate these attacks on what would be a low noise quan- tum communications network. The first type of attack leads to a hacker- controlled bijective transformation of the final measured strings, the sec- ond type of attack is a unitary scrambling attack that modifies the au- tomated gate specification to effectively scramble the final measurement, disrupting quantum communications and taking advantage of quantum randomness upon measurement in a way that makes it difficult to distin- guish from hardware malfunction or from a sudden rise in environmental noise. We show that, due to quantum entanglement and symmetries, the second type of attack works as a way to strategically disrupt quantum arXiv:2105.07187v1 [quant-ph] 15 May 2021 communications networks and quantum networked computation in a way that makes it difficult to ascertain which node was attacked. The main findings are discussed in the wider setting of quantum cybersecurity and quantum networked computation, where ways of hacking including the role of insider threats are discussed.
    [Show full text]