DOCSLIB.ORG

Quantum Algorithms

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Quantum Algorithms Quantum Algorithms Student Seminar RWTH Aachen Winter Semester 2020/2021 Contents 1 Gate Set Tomography 6 Lucas Marcogliese (under the supervision of Maarten Wegewijs) 1.1 Introduction....................................6 1.2 Operational representation of quantum processors...............7 1.2.1 Quantum circuits and open quantum systems.............7 1.2.2 Superoperator formalism.........................8 1.2.3 Physical constraints in the canonical gauge..............9 1.2.4 Black box model.............................9 1.3 Breaking self-referentiality in traditional quantum tomography.................................... 10 1.3.1 The self-referentiality problem...................... 11 1.3.2 SPAM errors............................... 12 1.4 Linear gate set tomography........................... 13 1.4.1 Self-consistent approach to quantum tomography........... 13 1.5 Applications of a gate set estimate....................... 15 1.5.1 Predictions for arbitrary sequences................... 16 1.5.2 Figures of merit and the lack of gauge invariance........... 16 1.6 Gauge fixing simulation with pyGSTi ...................... 18 1.6.1 Overview of pyGSTi algorithm..................... 19 1.6.2 Simulation results and analysis..................... 22 1.7 Conclusion..................................... 25 App. 1.A Example: Pauli transfer matrix representation............. 26 App. 1.B Physical constraints on gate set under the blame gauge transformation 26 App. 1.C Overcomplete data with least squares.................. 27 App. 1.D Algorithm scaling analysis......................... 27 App. 1.E Long-sequence GST: commuting errors and amplificational completeness 28 App. 1.F Motivation for maximum likelihood estimation............. 28 App. 1.G Target and estimate gate PTMs..................... 29 App. 1.H Simulation: native state and effect analysis............... 30 2 Variational Quantum Algorithms 32 Bavithra Govintharajah (under the supervision of Fabian Hassler) 2.1 Introduction.................................... 32 2.2 Variational quantum algorithms......................... 34 2.2.1 Outline of the algorithm......................... 34 2.2.2 The variational paradigm and general quantum systems....... 35 2.3 Variational ansatz construction......................... 37 2.3.1 Arbitrary unitary evolution....................... 38 2.3.2 Problem-inspired ansatz construction.................. 39 2.3.3 Hardware-efficient ansatz construction................. 40 CONTENTS 3 2.4 Cost function................................... 41 2.5 Measurement scheme............................... 43 2.5.1 Precision and Chebyshev’s inequality.................. 43 2.5.2 Measurement scheme optimization................... 44 2.6 Optimization routine............................... 44 2.7 Qiskit hands-on example: Molecular quantum simulation using the VQE.. 47 2.7.1 Classical pre-processing......................... 47 2.7.2 Simulating the Hydrogen molecule................... 51 2.8 Outlook and conclusions............................. 58 App. 2.A The variation principle.......................... 58 App. 2.B Pauli basis................................. 60 3 Topological Quantum Error Correction: Codes and Decoders 61 Orkun Şensebat (under the supervision of Eliana Fiorelli) 3.1 Introduction.................................... 61 3.2 Quantum Error Correction............................ 64 3.2.1 The Stabilizer Formalism........................ 64 3.2.2 Comparison of Quantum Codes..................... 66 3.3 Topological Error Correction.......................... 69 3.3.1 The Toric Code.............................. 69 3.3.2 Planar Codes............................... 73 3.3.3 Code Thresholds............................. 75 3.4 Conclusion..................................... 79 3.5 Acknowledgments................................. 80 4 Quantum Walk and its Universality 81 Kiran Adhikari (under the supervision of Thomas Botzung) 4.1 Introduction.................................... 81 4.2 Quick review of Classical Random walk.................... 82 4.2.1 Classical random walk on an unrestricted line............. 82 4.3 Quantum walk.................................. 84 4.3.1 Discrete quantum walk on a line.................... 84 4.3.2 Continuous-time quantum walk (CTQW)............... 87 4.3.3 Universal Computation by Quantum walk............... 90 4.4 Conclusion..................................... 93 App. 4.A Notebook for Discrete quantum walk simulation............ 93 5 Adiabatic Quantum Computing 98 Ananya Singh (under the supervision of Markus Müller) 5.1 Introduction.................................... 98 5.1.1 Overview of the report.......................... 99 5.2 Adiabatic Theorem................................ 99 5.2.1 Adiabatic quantum algorithm...................... 100 5.2.2 Landau-Zener transition......................... 101 5.3 Adiabatic Quantum Computing......................... 103 5.3.1 The ingredients.............................. 103 5.3.2 Some simple examples.......................... 105 5.3.3 A simple application - 2-SAT with 3 qubits.............. 106 5.4 Adiabatic Quantum Algorithm......................... 107 5.4.1 Needle in the haystack.......................... 108 5.4.2 Finding the needle adiabatically..................... 109 4 CONTENTS 5.5 Universality of AQC............................... 111 5.5.1 Gate model can efficiently simulate AQC................ 112 5.6 Summary..................................... 114 5.6.1 NP-Complete problems......................... 114 App. 5.A Adaibatic theorem calculation...................... 115 App. 5.B Codes.................................... 116 6 Topological Quantum Error Correction: Magic State Distillation 117 Dmitrii Dobrynin (under the supervision of Lorenzo Cardarelli) 6.1 Introduction.................................... 117 6.2 Theory of Quantum Error Correction...................... 118 6.2.1 Basic Codes................................ 118 6.2.2 Stabilizer Formalism........................... 119 6.2.3 Fault-tolerance and Universality.................... 121 6.2.4 Topological Error Correction: Surface Code.............. 122 6.3 Magic State Distillation............................. 124 6.3.1 Magic States............................... 124 6.3.2 Distillation Algorithm.......................... 125 6.3.3 Costs of Computation with Magic States................ 128 6.3.4 Implications of Magic States....................... 129 6.4 Conclusion..................................... 129 App. 6.A Program for MSD plots.......................... 130 CONTENTS 5 These notes are the result of a student seminar that took place during the win- ter semester 2020/2021 at RWTH Aachen. The seminar was geared towards beginning master’s students. The goal of the seminar was to introduce the stu- dents to ‘advanced’ quantum algorithms that are not covered in the introductory lecture on quantum information theory. The students were asked to consult the literature, realize some analytical or numerical work on the chosen topic, pre- pare a talk, as well as these notes. The students were assigned a supervisor that offered guidance. The result of the seminar can be found in these notes. Please be aware that the notes are written by the students with little to no corrections. As such, they should be read critically and taken with a grain of salt. Still we hope that the notes might be of use, in particular as a first introduction and as a guide to future literature. The supervisors Chapter 1 Gate Set Tomography Lucas Marcogliese Supervisor: Maarten Wegewijs Gate set tomography (GST) is a quantum algorithm that self-consistently char- acterizes a quantum processor’s set of available operations. By extracting in- formationally complete sets of fiducial states and effects from the original gate set, it successfully overcomes the self-referentiality problem associated with tra- ditional quantum process tomography. In this report, the derivation of the lin- ear GST algorithm is presented. The intrinsic gauge freedom in tomography is shown to emerge naturally from the Born rule and does not prevent one from using the GST estimate to predict experimental observations for arbitrary sequences. Moreover, the dangers of using standard, gauge-variant figures of merit with GST estimates to quantify device performance are considered and a suitable, gauge-invariant alternative is discussed. Advanced techniques tech- niques for higher accuracy, namely long-sequence GST, are introduced and an overview of the software package pyGSTi is given. Finally, the results of a simulation probing the influence of pyGSTi’s gauge fixing procedure on GST’s estimates are analyzed. 1.1 Introduction Modern quantum computing platforms such as ion traps, superconducting qubits and semi- conductor spin qubits, all share a common functionality: the qubit register is initialized in some state, a clever quantum algorithm is performed and the resulting output state is measured yielding a certain outcome. These promising candidates also have the common fragility of interacting with their environment which is on one hand necessary to control the qubits and on the other hand constitutes a channel for noise and decoherence. Luckily, fault-tolerant quantum error correction (FTQEC) schemes predict the feasibility of univer- sal quantum computation with noisy systems as long as their error rates are below certain thresholds. But how do we characterize a quantum processor to evaluate whether it meets FTQEC thresholds and, more generally, to quantify its overall performance with respect
Load more

Recommended publications
  • Programm 5 Layout 1
    SPONSORS Pauli Center for Theoretical Studies QAP European Project PAULI CENTER for Theoretical Studies Sandia National Laboratories The Swiss National Science Foundation Institute for Quantum Computing ETH Zurich (Computer Science and Physics Department) id Quantique Quantum Science and Technology (ETH) CQT Singapore VENUE W-LAN ETH Zürich, Rämistrasse 101, CH-8092 Zürich 1. Check available WLAN’s Main building / Hauptgebäude 2. Connect to WLAN „public“ Conference Helpline 0041 (0)79 770 84 29 3. Open browser 4.Login at welcome page with Login: qip2010 Password: 2010qipconf Main entrance FLOOR E Registration/Information desk Poster session Computer room E 26.3 Main entrance Registration desk Information Computer room E 26.3 Poster session 1 FLOOR E. 0 Poster session FLOOR F Auditorium F 5: Tutorial (January 15 – 17, 2010) Auditorium maximum F 30: Scientific programme (January 18 – 22, 2010) F 33.1: Congress-Office, F 33.2: Cloak room Foyer and “Uhrenhalle”: Coffee breaks, Poster session Auditorium Maximum F 30 Scientific programmme January 18 – 22, 2010 F 33.1: Congress-Office Foyer: F 33.2 Cloak room Coffee breaks Poster session Auditorium F 5 Tutorial January 15 – 17, 2010 Uhrenhalle: Coffee breaks 2 RUMP SESSION StuZ, ETH Zürich, Universitätsstrasse 6, CH-8092 Zürich CAB Building room No. CAB F21 to CAB F27 18.30 – 23.00 h (January 20, 2010) Entry ETH CAB Building ETH Main Building 3 CONFERENCE DINNER Thursday, January 21, 2010, 19.00h Restaurant Lake Side Bellerivestrasse 170 CH-8008 Zürich Phone: +41 (0) 44 385 86 00 Directions from ETH main building • (Tram No. 9 to “Bellevue” (direction “Triemli”).
    [Show full text]
  • Painstakingly-Edited Typeset Lecture Notes
    Physics 239: Topology from Physics Winter 2021 Lecturer: McGreevy These lecture notes live here. Please email corrections and questions to mcgreevy at physics dot ucsd dot edu. Last updated: May 26, 2021, 14:36:17 1 Contents 0.1 Introductory remarks............................3 0.2 Conventions.................................8 0.3 Sources....................................9 1 The toric code and homology 10 1.1 Cell complexes and homology....................... 21 1.2 p-form ZN toric code............................ 23 1.3 Some examples............................... 26 1.4 Higgsing, change of coefficients, exact sequences............. 32 1.5 Independence of cellulation......................... 36 1.6 Gapped boundaries and relative homology................ 39 1.7 Duality.................................... 42 2 Supersymmetric quantum mechanics and cohomology, index theory, Morse theory 49 2.1 Supersymmetric quantum mechanics................... 49 2.2 Differential forms consolidation...................... 61 2.3 Supersymmetric QM and Morse theory.................. 66 2.4 Global information from local information................ 74 2.5 Homology and cohomology......................... 77 2.6 Cech cohomology.............................. 80 2.7 Local reconstructability of quantum states................ 86 3 Quantum Double Model and Homotopy 89 3.1 Notions of `same'.............................. 89 3.2 Homotopy equivalence and cohomology.................. 90 3.3 Homotopy equivalence and homology................... 91 3.4 Morse theory and homotopy
    [Show full text]
  • Superconducting Quantum Simulator for Topological Order and the Toric Code
    Superconducting Quantum Simulator for Topological Order and the Toric Code Mahdi Sameti,1 Anton Potoˇcnik,2 Dan E. Browne,3 Andreas Wallraff,2 and Michael J. Hartmann1 1Institute of Photonics and Quantum Sciences, Heriot-Watt University Edinburgh EH14 4AS, United Kingdom 2Department of Physics, ETH Z¨urich,CH-8093 Z¨urich,Switzerland 3Department of Physics and Astronomy, University College London, Gower Street, London WC1E 6BT, United Kingdom (Dated: March 20, 2017) Topological order is now being established as a central criterion for characterizing and classifying ground states of condensed matter systems and complements categorizations based on symmetries. Fractional quantum Hall systems and quantum spin liquids are receiving substantial interest because of their intriguing quantum correlations, their exotic excitations and prospects for protecting stored quantum information against errors. Here we show that the Hamiltonian of the central model of this class of systems, the Toric Code, can be directly implemented as an analog quantum simulator in lattices of superconducting circuits. The four-body interactions, which lie at its heart, are in our concept realized via Superconducting Quantum Interference Devices (SQUIDs) that are driven by a suitably oscillating flux bias. All physical qubits and coupling SQUIDs can be individually controlled with high precision. Topologically ordered states can be prepared via an adiabatic ramp of the stabilizer interactions. Strings of qubit operators, including the stabilizers and correlations along non-contractible loops, can be read out via a capacitive coupling to read-out resonators. Moreover, the available single qubit operations allow to create and propagate elementary excitations of the Toric Code and to verify their fractional statistics.
    [Show full text]
  • Using Graph States for Quantum Computation and Communication
    Using Graph States for Quantum Computation and Communication Thesis by Kovid Goyal In Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy California Institute of Technology Pasadena, California 2009 (Submitted May 27, 2009) ii c 2009 Kovid Goyal All Rights Reserved iii To Dr. Ajay Patwardhan, for inspiring a whole generation of physicists. iv Acknowledgements I would like to start by acknowledging my thesis adviser, John Preskill, for giving me the freedom to pursue my interests and for setting a very high standard for me to aspire to. John has also provided the direction I needed at critical points in my career. I would like to thank Robert Raussendorf for sharing a lot of his ideas with me and patiently explaining them when needed. Most of the great ideas in Chapter 2 were orig- inated by him. Robert has been a mentor and a guide. I would like to thank Jim Harrington for introducing me to the numerical techniques needed for the analysis of the measurement based quantum computer and for writing relatively clear and easy to follow code. I would like to thank Austin Fowler for asking me a lot of questions and thereby greatly improving the clarity and depth of my understanding. Austin also inspired me to make this work as clear and easy to follow as possible. The magic state distillation circuit diagrams and the CNOT gate construction in Chapter 2 are his. I would like to thank Ben Toner, Panos Aliferis, Greg Ver Steeg and Prabha Mandayam Dodamanne for many stimulating discussions. I would like to thank my parents, Ashima and Niraj, for supporting my desire to be- come a physicist and for providing me with a stimulating and enjoyable childhood.
    [Show full text]
  • Booklet of Abstracts
    Booklet of abstracts Thomas Vidick California Institute of Technology Tsirelson's problem and MIP*=RE Boris Tsirelson in 1993 implicitly posed "Tsirelson's Problem", a question about the possible equivalence between two different ways of modeling locality, and hence entanglement, in quantum mechanics. Tsirelson's Problem gained prominence through work of Fritz, Navascues et al., and Ozawa a decade ago that establishes its equivalence to the famous "Connes' Embedding Problem" in the theory of von Neumann algebras. Recently we gave a negative answer to Tsirelson's Problem and Connes' Embedding Problem by proving a seemingly stronger result in quantum complexity theory. This result is summarized in the equation MIP* = RE between two complexity classes. In the talk I will present and motivate Tsirelson's problem, and outline its connection to Connes' Embedding Problem. I will then explain the connection to quantum complexity theory and show how ideas developed in the past two decades in the study of classical and quantum interactive proof systems led to the characterization (which I will explain) MIP* = RE and the negative resolution of Tsirelson's Problem. Based on joint work with Ji, Natarajan, Wright and Yuen available at arXiv:2001.04383. Joonho Lee, Dominic Berry, Craig Gidney, William Huggins, Jarrod McClean, Nathan Wiebe and Ryan Babbush Columbia University | Macquarie University | Google | Google Research | Google | University of Washington | Google Efficient quantum computation of chemistry through tensor hypercontraction We show how to achieve the highest efficiency yet for simulations with arbitrary basis sets by using a representation of the Coulomb operator known as tensor hypercontraction (THC). We use THC to express the Coulomb operator in a non-orthogonal basis, which we are able to block encode by separately rotating each term with angles that are obtained via QROM.
    [Show full text]
  • 1 Objectives of the Workshop 2 Open Problem Discussion
    Final Report: BIRS Workshop 16w5029 Quantum Computer Science April 17–22, 2016 Co-organizers: Michele Mosca, Martin Roetteler, and Peter Selinger 1 Objectives of the workshop Shor’s famous quantum algorithms for integer factoring and to compute discrete logarithms helped to kick-start the field of quantum computing. A topic that has received significantly less attention is that of actually translating quantum algorithms into elementary instructions that can then be carried out on a future large-scale quantum computer. This leads to questions about automation of the translation process, a question that gives rise to several challenges that arise naturally from there, for instance: how to program a quantum computer? How to model the underlying instructions? How to compile and optimize code that has been written in a high level of abstraction? This interdisciplinary workshop aimed at making progress on these questions and brought to- gether over 40 researchers from a diverse set of research communities: those working in quan- tum computing, and those working on the mathematical foundations of programming languages and their implementations. We anticipate a vibrant exchange of novel ideas, to tackle important problems such as the optimization of large-scale quantum algorithms, and their synthesis into the instruction set of a fault-tolerant quantum computer. On the first day there was a very lively open problems debate, a summary of which is provided in this report. The problems ranged from big challenges that likely will remain open for some time, to concrete problems, some of which were tackled during the workshop. Besides the open problem discussion and a plethora of talks on recent topics of interests, salient features of the workshop were various software demo sessions in which some of the participants performed live demos of their software programs, and two tutorials about quantum programming languages.
    [Show full text]
  • Arxiv:1803.00026V4 [Cond-Mat.Str-El] 8 Feb 2019 3 Variational Quantum-Classical Simulation (VQCS) 5
    SciPost Physics Submission Efficient variational simulation of non-trivial quantum states Wen Wei Ho1*, Timothy H. Hsieh2,3, 1 Department of Physics, Harvard University, Cambridge, Massachusetts 02138, USA 2 Kavli Institute for Theoretical Physics, University of California, Santa Barbara, California 93106, USA 3 Perimeter Institute for Theoretical Physics, Waterloo, Ontario N2L 2Y5, Canada *[email protected] February 12, 2019 Abstract We provide an efficient and general route for preparing non-trivial quantum states that are not adiabatically connected to unentangled product states. Our approach is a hybrid quantum-classical variational protocol that incorporates a feedback loop between a quantum simulator and a classical computer, and is experimen- tally realizable on near-term quantum devices of synthetic quantum systems. We find explicit protocols which prepare with perfect fidelities (i) the Greenberger- Horne-Zeilinger (GHZ) state, (ii) a quantum critical state, and (iii) a topologically ordered state, with L variational parameters and physical runtimes T that scale linearly with the system size L. We furthermore conjecture and support numeri- cally that our protocol can prepare, with perfect fidelity and similar operational costs, the ground state of every point in the one dimensional transverse field Ising model phase diagram. Besides being practically useful, our results also illustrate the utility of such variational ans¨atzeas good descriptions of non-trivial states of matter. Contents 1 Introduction 2 2 Non-trivial quantum states
    [Show full text]
  • A Practical Phase Gate for Producing Bell Violations in Majorana Wires
    PHYSICAL REVIEW X 6, 021005 (2016) A Practical Phase Gate for Producing Bell Violations in Majorana Wires David J. Clarke, Jay D. Sau, and Sankar Das Sarma Department of Physics, Condensed Matter Theory Center, University of Maryland, College Park, Maryland 20742, USA and Joint Quantum Institute, University of Maryland, College Park, Maryland 20742, USA (Received 9 October 2015; published 8 April 2016) Carrying out fault-tolerant topological quantum computation using non-Abelian anyons (e.g., Majorana zero modes) is currently an important goal of worldwide experimental efforts. However, the Gottesman- Knill theorem [1] holds that if a system can only perform a certain subset of available quantum operations (i.e., operations from the Clifford group) in addition to the preparation and detection of qubit states in the computational basis, then that system is insufficient for universal quantum computation. Indeed, any measurement results in such a system could be reproduced within a local hidden variable theory, so there is no need for a quantum-mechanical explanation and therefore no possibility of quantum speedup [2]. Unfortunately, Clifford operations are precisely the ones available through braiding and measurement in systems supporting non-Abelian Majorana zero modes, which are otherwise an excellent candidate for topologically protected quantum computation. In order to move beyond the classically simulable subspace, an additional phase gate is required. This phase gate allows the system to violate the Bell-like Clauser- Horne-Shimony-Holt (CHSH) inequality that would constrain a local hidden variable theory. In this article, we introduce a new type of phase gate for the already-existing semiconductor-based Majorana wire systems and demonstrate how this phase gate may be benchmarked using CHSH measurements.
    [Show full text]
  • QIP 2010 Tutorial and Scientific Programmes
    QIP 2010 15th – 22nd January, Zürich, Switzerland Tutorial and Scientific Programmes asymptotically large number of channel uses. Such “regularized” formulas tell us Friday, 15th January very little. The purpose of this talk is to give an overview of what we know about 10:00 – 17:10 Jiannis Pachos (Univ. Leeds) this need for regularization, when and why it happens, and what it means. I will Why should anyone care about computing with anyons? focus on the quantum capacity of a quantum channel, which is the case we understand best. This is a short course in topological quantum computation. The topics to be covered include: 1. Introduction to anyons and topological models. 15:00 – 16:55 Daniel Nagaj (Slovak Academy of Sciences) 2. Quantum Double Models. These are stabilizer codes, that can be described Local Hamiltonians in quantum computation very much like quantum error correcting codes. They include the toric code This talk is about two Hamiltonian Complexity questions. First, how hard is it to and various extensions. compute the ground state properties of quantum systems with local Hamiltonians? 3. The Jones polynomials, their relation to anyons and their approximation by Second, which spin systems with time-independent (and perhaps, translationally- quantum algorithms. invariant) local interactions could be used for universal computation? 4. Overview of current state of topological quantum computation and open Aiming at a participant without previous understanding of complexity theory, we will discuss two locally-constrained quantum problems: k-local Hamiltonian and questions. quantum k-SAT. Learning the techniques of Kitaev and others along the way, our first goal is the understanding of QMA-completeness of these problems.
    [Show full text]
  • Limitations on Transversal Computation Through Quantum
    Limitations on Transversal Computation through Quantum Homomorphic Encryption Michael Newman1 and Yaoyun Shi2 1Department of Mathematics 2Department of Electrical Engineering and Computer Science University of Michigan, Ann Arbor, MI 48109, USA [email protected], [email protected] Abstract Transversality is a simple and effective method for implementing quantum computation fault- tolerantly. However, no quantum error-correcting code (QECC) can transversally implement a quantum universal gate set (Eastin and Knill, Phys. Rev. Lett., 102, 110502). Since reversible classical computation is often a dominating part of useful quantum computation, whether or not it can be implemented transversally is an important open problem. We show that, other than a small set of non-additive codes that we cannot rule out, no binary QECC can transversally implement a classical reversible universal gate set. In particular, no such QECC can implement the Toffoli gate transversally. We prove our result by constructing an information theoretically secure (but inefficient) quan- tum homomorphic encryption (ITS-QHE) scheme inspired by Ouyang et al. (arXiv:1508.00938). Homomorphic encryption allows the implementation of certain functions directly on encrypted data, i.e. homomorphically. Our scheme builds on almost any QECC, and implements that code’s transversal gate set homomorphically. We observe a restriction imposed by Nayak’s bound (FOCS 1999) on ITS-QHE, implying that any ITS quantum fully homomorphic scheme (ITS-QFHE) implementing the full set of classical reversible functions must be highly ineffi- cient. While our scheme incurs exponential overhead, any such QECC implementing Toffoli transversally would still violate this lower bound through our scheme. arXiv:1704.07798v3 [quant-ph] 13 Aug 2017 1 Introduction 1.1 Restrictions on transversal gates Transversal gates are surprisingly ubiquitous objects, finding applications in quantum cryptography [29], [25], quantum complexity theory [11], and of course quantum fault-tolerance.
    [Show full text]
  • Fault-Tolerant Quantum Computation: Theory and Practice
    FAULT-TOLERANT QUANTUM COMPUTATION: THEORY AND PRACTICE FAULT-TOLERANT QUANTUM COMPUTATION: THEORY AND PRACTICE Dissertation for the purpose of obtaining the degree of doctor at Delft University of Technology, by the authority of the Rector Magnificus prof. dr. ir. T.H.J.J. van der Hagen, Chair of the Board of Doctorates, to be defended publicly on Wednesday 15th, January 2020 at 12:30 o’clock by Christophe VUILLOT Master of Science in Computer Science, Université Paris Diderot, Paris, France, born in Clamart, France. This dissertation has been approved by the promotor. promotor: prof. dr. B. M. Terhal Composition of the doctoral committee: Rector Magnificus, chairperson Prof. dr. B. M. Terhal Technische Universiteit Delft, promotor Independent members: Prof. dr. C.W.J. Beenakker Universiteit Leiden Prof. dr. L. DiCarlo Technische Universiteit Delft Prof. dr. R.T. König Technische Universität München Dr. A. Leverrier Inria Paris Prof. dr. ir. L.M.K. Vandersypen Technische Universiteit Delft Prof. dr. R.M. de Wolf Centrum Wiskunde & Informatica Keywords: quantum computing, quantum error correction, fault-tolerance Printed by: Gildeprint - www.gildeprint.nl Front: Kandinsky Vassily (1866-1944), Auf Weiss II, 1923 Photo © Centre Pompidou, MNAM-CCI, Dist. RMN-Grand Palais / image Centre Pompidou, MNAM-CCI Copyright © 2019 by C. Vuillot ISBN 978-94-6384-097-2 An electronic version of this dissertation is available at http://repository.tudelft.nl/. This thesis is dedicated to my daughter Andréa and her mother Lisa. CONTENTS Summary xi Preface xiii 1 Introduction 1 1.1 Introduction to quantum computing . 2 1.1.1 Quantum mechanics. 2 1.1.2 Elementary quantum systems .
    [Show full text]
  • Performance of Various Low-Level Decoder for Surface Codes in the Presence of Measurement Error
    Air Force Institute of Technology AFIT Scholar Theses and Dissertations Student Graduate Works 3-2021 Performance of Various Low-level Decoder for Surface Codes in the Presence of Measurement Error Claire E. Badger Follow this and additional works at: https://scholar.afit.edu/etd Part of the Computer Sciences Commons Recommended Citation Badger, Claire E., "Performance of Various Low-level Decoder for Surface Codes in the Presence of Measurement Error" (2021). Theses and Dissertations. 4885. https://scholar.afit.edu/etd/4885 This Thesis is brought to you for free and open access by the Student Graduate Works at AFIT Scholar. It has been accepted for inclusion in Theses and Dissertations by an authorized administrator of AFIT Scholar. For more information, please contact [email protected]. Performance of Various Low-Level Decoders for Surface Codes in the Presence of Measurement Error THESIS Claire E Badger, B.S.C.S., 2d Lieutenant, USAF AFIT-ENG-MS-21-M-008 DEPARTMENT OF THE AIR FORCE AIR UNIVERSITY AIR FORCE INSTITUTE OF TECHNOLOGY Wright-Patterson Air Force Base, Ohio DISTRIBUTION STATEMENT A APPROVED FOR PUBLIC RELEASE; DISTRIBUTION UNLIMITED. The views expressed in this document are those of the author and do not reflect the official policy or position of the United States Air Force, the United States Department of Defense or the United States Government. This material is declared a work of the U.S. Government and is not subject to copyright protection in the United States. AFIT-ENG-MS-21-M-008 Performance of Various Low-Level Decoders for Surface Codes in the Presence of Measurement Error THESIS Presented to the Faculty Department of Electrical and Computer Engineering Graduate School of Engineering and Management Air Force Institute of Technology Air University Air Education and Training Command in Partial Fulfillment of the Requirements for the Degree of Master of Science in Computer Science Claire E Badger, B.S.C.S., B.S.E.E.
    [Show full text]