What is a quantum computer? Quantum Architecture. Quantum Mechanics. Quantum Superposition. Quantum Entanglement. What is a Quantum Computer (contd.
|
|
- Gwendolyn Collins
- 6 years ago
- Views:
Transcription
1 What is a quantum computer? Quantum Architecture by Murat Birben A quantum computer is a device designed to take advantage of distincly quantum phenomena in carrying out a computational task. A quantum system can be put in a superposition of multiple states and can evolve along multiple trajectories simultaneously, only to choose a definite state at the time of measurement. A quantum computer tries to exploit this parallelism that classical computers do not utilize. What is a Quantum Computer (contd.) At any time the computer can be in a superposition of all possible machine states. This gives quantum computing the potential power of proceeding through all computational paths simultaneously. Between measurements, the machine state evolves unitarily. This restricts the power of quantum computing. Only reversible computations are possible. Quantum Mechanics Quantum mechanics is a probabilistic theory, and it is this randomness that places limitations on the accuracy of characterizing a system. Let us consider a particle, say an electron, moving through space. We describe the electron's motion in terms of its position and momentum. Classically we can measure both quantities to infinite precision. However in Quantum Mechanics we can never know both quantities absolutely precisely. This is because by taking a measurement we inadvertantly disturb the system as well. Quantum Superposition Quantum superposition is the fundamental law of quantum kinematics. It defines the allowed state space of a quantum mechanical system. The principle of superposition states that if the world can be in any configuration, any possible arrangement of particles or fields, and if the world could also be in another configuration, then the world can also be in a state which is a mixture of the two, where the amount of each configuration that is in the mixture is specified by a complex number. Quantum Entanglement Quantum entanglement is a quantum mechanical phenomenon in which the quantum states of two or more objects are linked together so that one object cannot be adequately described without full mention of its counterpart even though the individual objects may be spatially separated. 1
2 Schrödinger's cat Schrödinger's famous thought experiment poses the question: when does a quantum system stop existing as a mixture of states and become one or the other? Copenhagen interpretation In the Copenhagen interpretation of quantum mechanics, a system stops being a superposition of states and becomes either one or the other when an observation takes place. Qubit The basic information bearing element of quantum computation is qubit(quantum bit). Qubit is a two-dimensional quantum system Ψ> = α 0> + β 1> Where α 2 + β 2 = 1 Multiple Qubits For two qubits, the state space is 4 dimensional 0> = 00> = 0> XOR 0> 1> = 01> = 0> XOR 1> 2> = 10> = 1> XOR 0> 3> = 11> = 1> XOR 1> For n qubits, state space is 2ⁿ dimensional with basis vectors i> = i 1 i 2...i n > = i 1 > XOR... XOR i n > Quantum Gates A collection of n qubits is called a quantum register of size n. Quantum gates are the functional building blocks of a quantum computer. A single gate in a quantum circuit with one or more input qubits in the initial state Ψ> transforms the state to a different state Ψ`> by changing all probability amplitudes that describe the state vector [c 0, c 1,..., c n 1] T. Basic quantum gates and their matrix representations. 2
3 Basic Quantum Gates (contd.) The classical NOT has the quantum analogue X which inverts the probabilities of measuring 0 and 1. The quantum analogue of XOR is the two-qubit CNOT gate: the target qubit is inverted for those states where the source qubit is 1. Most quantum gates, however, have no classical analogue. The combination of T, H, and CNOT provide a universal set: just as any Boolean circuit can be composed from AND, OR, and NOT gates, any polynomially describable multiqubit quantum transform can be efficiently approximated by composing just these three quantum gates into a circuit. A quantum SWAP can be implemented as three CNOTs. Quantum Teleportation Quantum teleportation is the recreation of a quantum state at a distance, using only classical communication. Why bother with teleportation? First, we can precommunicate EPR pairs with extensive pipelining without stalling computations. Second, it is easier to transport EPR pairs than real data. Third, transmitting the two classical bits resulting from the measurements is more reliable than transmitting quantum data. EPR Paradox In quantum mechanics, the EPR paradox is a thought experiment which challenged long-held ideas about the relation between the observed values of physical quantities and the values that can be accounted for by a physical theory The EPR paradox draws on a phenomenon predicted by quantum mechanics, known as quantum entanglement, to show that measurements performed on spatially separated parts of a quantum system can apparently have an instantaneous influence on one another. Basic elements sufficient to build a scalable quantum computer have been described by DiVincenzo and Preskill. The five DiVincenzo criteria for building a quantum computer are: a scalable physical system with well characterized qubits the ability to initialize the state of the qubits to a simple fiducial state long relevant decoherence times a universal set of quantum gates a qubit specific measurement capability. In addition, Preskill lists other elements necessary for fault tolerant computation in order to maintain a reasonable accuracy threshold. Two of these are maximal parallelism and gates that can act on any pair of qubits. DiVincenzo mentions two additional criteria essential for quantum communications namely: the ability to interconvert stationary and flying qubits the ability to faithfully transmit flying qubits between specified locations. 3
4 Toward a Scalable, Silicon-Based Quantum Computing Architecture Propose quantum teleportation as a means to communicate data over longer distances on a chip. In particular, transporting quantum data is a critical requirement for upcoming siliconbased quantum computing technologies. SOLID-STATE TECHNOLOGIES The key feature of these solid-state platforms are as follows. Quantum bits are laid out in silicon in a two-dimensional (2-D) fashion, similar to traditional CMOS VLSI. Quantum interactions are near-neighbor between bits. Quantum bits cannot move physically, but quantum data can be swapped between neighbors. The control structures necessary to manipulate the bits prevent a dense 2-D grid of bits. Instead, we have linear structures of bits which can cross, but there is a minimum distance between such intersections that is on the order of 20 bits for our primary technology model. This restriction is similar to a design rule in traditional CMOS VLSI. SOLID-STATE TECHNOLOGIES (contd.) All quantum computing proposals, uses classical signals to control the timing and sequence of operations. All known quantum algorithms, including basic error correction for quantum data, require the determinism and reliability of classical control. Without efficient classical control, fundamental results demonstrating the feasibility of quantum computation do not apply Transferring quantum states between atomicand photon-based technologies is currently extremely difficult. Transporting Quantum Information One of the most important distinctions between quantum and classical wires arises from the no-cloning theorem is that quantum information cannot be copied but must rather be transported from source to destination Short Wires: Swapping Channel In solid-state technologies, a line of qubits is one plausible approach to transporting quantum data. Figure below provides a schematic of a swapping channel in which information is progressively swapped between pairs of qubits in the quantum datapath somewhat like a bubble sort. Swapping Channel (contd.) A quantum swapping channel presents significant technical challenges. The placement of the phosphorus atoms themselves. The scale of classical control. The temperature of the device. Producing a line of quantum bits that overcomes all of the above challenges is possible. 4
5 Long Wires: Teleportation Channel This architecture makes use of the quantum primitive of teleportation. Three important architectural building blocks: The entropy exchange unit The EPR generator The purification unit. Entropy Exchange Unit The physics of quantum computation requires that operations are reversible and conserve energy. The entropy of the system increases through qubits coupling with the external environment. The process can be viewed as one of thermodynamic cooling. Cool qubits are distributed throughout the processor, analogous to a ground plane in a conventional CMOS chip. The cool qubits are in a nearly zero state. They are created by measuring the qubit, and inverting if 1>. EPR Generator Constructing an EPR pair of qubits is straightforward. We start with two state qubits from our entropy exchange unit. End up with a two-qubit entangled state of 1/sqrt(2) ( 00> + 11>): an ERP pair. The input is directly piped from the entropy exchange unit and the output is the entangled EPR pair. EPR Purification Unit This unit takes as input n EPR pairs, which have been partially corrupted by errors, and outputs ne asymptotically perfect EPR pairs. E is the entropy of entanglement, a measure of the number of quantum errors which the pairs suffered. The quantum inputs to this block are the input EPR states and a supply of 0> qubits. The outputs are pure EPR states. Note that the block is carefully designed to correct only up to a certain number of errors; if more errors than this threshold occur, then the unit fails with increasing probability. Architecture for a Quantum Wire Analysis of the Teleportation Channel The bandwidth of a teleportation channel is proportional to the speed with which reliable EPR pairs are communicated. Efficiency of the purification process must be taken into account. The overall bandwidth of this long quantum wire is less than the simple wiring scheme, but the decoherence introduced does not change with the wire length which makes an important difference. Unlike the short wire, this bandwidth is not constrained by a maximum distance related to the Threshold Theorem since teleportation is unaffected by distance. 5
6 Fault Tolerant Architecture Key system requirement for quantum computing. The ability to tolerate and dynamically handle internal faults while preserving the integrity of the computation. Unlike present classical computing systems, where the gate failure probability is extremely low current and projected quantum gates have to probabilities of to 10 9 times more failure per operation. Key to this study of quantum wires was a tradeoff between the geometric design of the system and the noise generated during operation Overview of Quantum Fault- Tolerant Strategy In order for a system to operate reliably despite a partial corruption of the data it processes, it must introduce a certain amount of redundancy in the form of an error-correction code. It is possible to develop a fault-tolerant strategy for quantum systems based on the recursive encoding of states by concatenation of quantum error-correction codes Quantum Error Correction The only errors which can occur to a classical bit are bitflips and erasures, which can be modeled as conditional and random NOT gates. Quantum bits suffer more kinds of error, because of the greater degree of freedom in their state representation; surprisingly, however, there are general strategies for reducing the universe of possible quantum errors to only two kinds: bit-flips (random X gates) and phase-flips (random Z gates). Quantum states collapse upon measurement, so strategies must be employed for determining errors without actually measuring encoded data. Quantum Error Correction (contd.) Because of the no-cloning theorem, quantum information cannot be simply duplicated. Instead, redundancy is achieved through entangled states with known properties. Computing on Encoded Data No single gate failure can lead to more than one error in each encoded qubit block. The impact of this requirement: no single operation may cause multiple failures measurement errors must not be allowed to propagate excessively. To achieve first one, no two encoding qubits are allowed to both interact directly with a third qubit. To achieve second one, measurements are performed in a multiple fashion. Recursive Error Correction A very simple construction allows us to tolerate additional errors. If a logical qubit is encoded in a block of n qubits, it is possible to encode each of those qubits with an m-qubit code to produce an mn encoding. Such recursion, or concatenation,of codes can reduce the overall probability of error even further. 6
7 ERROR-CORRECTION ALGORITHMS the notation [n,k,d], where n is the number of physical qubits, k is the number of logical qubits encoded, and d is the quantum Hamming distance of the code. A code with distance d is able to correct (d-1)/2 errors. [7,1,3] Code A parity measurement consists of the following steps. Prepare a cat state from four ancillae, using a Hadamard gate and three CNOT gates. Verify the cat state by taking the parity of each pair of qubits. If any pair has odd parity, return to step 1. This requires six additional ancillae, one for each pair. Perform a CNOT between each of the qubits in the cat state and the data qubits whose parity is to be measured Uncreate the cat state by applying the same operators used to create it in reverse order. After applying the Hadamard gate to the final qubit, A 0 >, that qubit contains the parity. Measure A0>: A With A0> = α 0> +β 1>, create the three-qubit state α 000> +β 111> by using A0> as the control for two CNOT gates, and two fresh 0> ancillae as the targets B Measure each of the three qubits. Use the majority measured value as the parity of the cat state. 7
Toward a Scalable, Silicon-Based Quantum Computing Architecture
1552 IEEE JOURNAL OF SELECTED TOPICS IN QUANTUM ELECTRONICS, VOL. 9, NO. 6, NOVEMBER/DECEMBER 2003 Toward a Scalable, Silicon-Based Quantum Computing Architecture Dean Copsey, Mark Oskin, Francois Impens,
More information2.0 Basic Elements of a Quantum Information Processor. 2.1 Classical information processing The carrier of information
QSIT09.L03 Page 1 2.0 Basic Elements of a Quantum Information Processor 2.1 Classical information processing 2.1.1 The carrier of information - binary representation of information as bits (Binary digits).
More informationQuantum Computer Architecture
Quantum Computer Architecture Scalable and Reliable Quantum Computers Greg Byrd (ECE) CSC 801 - Feb 13, 2018 Overview 1 Sources 2 Key Concepts Quantum Computer 3 Outline 4 Ion Trap Operation The ion can
More informationQuantum Error Correction and Fault Tolerance. Classical Repetition Code. Quantum Errors. Barriers to Quantum Error Correction
Quantum Error Correction and Fault Tolerance Daniel Gottesman Perimeter Institute The Classical and Quantum Worlds Quantum Errors A general quantum error is a superoperator: ρ ΣA k ρ A k (Σ A k A k = I)
More informationExample: sending one bit of information across noisy channel. Effects of the noise: flip the bit with probability p.
Lecture 20 Page 1 Lecture 20 Quantum error correction Classical error correction Modern computers: failure rate is below one error in 10 17 operations Data transmission and storage (file transfers, cell
More informationIBM quantum experience: Experimental implementations, scope, and limitations
IBM quantum experience: Experimental implementations, scope, and limitations Plan of the talk IBM Quantum Experience Introduction IBM GUI Building blocks for IBM quantum computing Implementations of various
More informationphys4.20 Page 1 - the ac Josephson effect relates the voltage V across a Junction to the temporal change of the phase difference
Josephson Effect - the Josephson effect describes tunneling of Cooper pairs through a barrier - a Josephson junction is a contact between two superconductors separated from each other by a thin (< 2 nm)
More information*WILEY- Quantum Computing. Joachim Stolze and Dieter Suter. A Short Course from Theory to Experiment. WILEY-VCH Verlag GmbH & Co.
Joachim Stolze and Dieter Suter Quantum Computing A Short Course from Theory to Experiment Second, Updated and Enlarged Edition *WILEY- VCH WILEY-VCH Verlag GmbH & Co. KGaA Contents Preface XIII 1 Introduction
More informationIntroduction to Quantum Computing
Introduction to Quantum Computing Part I Emma Strubell http://cs.umaine.edu/~ema/quantum_tutorial.pdf April 12, 2011 Overview Outline What is quantum computing? Background Caveats Fundamental differences
More informationMemory Hierarchies for Quantum Data
Memory ierarchies for Quantum Data Dean Copsey z, Mark Oskin y, Frederic T. Chong z, Isaac Chuang Π and Khaled Abdel-Ghaffar z z University of California at Davis y University of Washington Π Massachusetts
More informationQuantum Information Processing and Diagrams of States
Quantum Information and Diagrams of States September 17th 2009, AFSecurity Sara Felloni sara@unik.no / sara.felloni@iet.ntnu.no Quantum Hacking Group: http://www.iet.ntnu.no/groups/optics/qcr/ UNIK University
More informationMore advanced codes 0 1 ( , 1 1 (
p. 1/24 More advanced codes The Shor code was the first general-purpose quantum error-correcting code, but since then many others have been discovered. An important example, discovered independently of
More informationQuantum Computers. Todd A. Brun Communication Sciences Institute USC
Quantum Computers Todd A. Brun Communication Sciences Institute USC Quantum computers are in the news Quantum computers represent a new paradigm for computing devices: computers whose components are individual
More informationLectures on Fault-Tolerant Quantum Computation
Lectures on Fault-Tolerant Quantum Computation B.M. Terhal, IBM Research I. Descriptions of Noise and Quantum States II. Quantum Coding and Error-Correction III. Fault-Tolerant Error-Correction. Surface
More informationQuantum Computing. Joachim Stolze and Dieter Suter. A Short Course from Theory to Experiment. WILEY-VCH Verlag GmbH & Co. KGaA
Joachim Stolze and Dieter Suter Quantum Computing A Short Course from Theory to Experiment Second, Updated and Enlarged Edition WILEY- VCH WILEY-VCH Verlag GmbH & Co. KGaA Preface XIII 1 Introduction and
More informationSeminar 1. Introduction to Quantum Computing
Seminar 1 Introduction to Quantum Computing Before going in I am also a beginner in this field If you are interested, you can search more using: Quantum Computing since Democritus (Scott Aaronson) Quantum
More informationIBM Systems for Cognitive Solutions
IBM Q Quantum Computing IBM Systems for Cognitive Solutions Ehningen 12 th of July 2017 Albert Frisch, PhD - albert.frisch@de.ibm.com 2017 IBM 1 st wave of Quantum Revolution lasers atomic clocks GPS sensors
More informationQuantum Error Correcting Codes and Quantum Cryptography. Peter Shor M.I.T. Cambridge, MA 02139
Quantum Error Correcting Codes and Quantum Cryptography Peter Shor M.I.T. Cambridge, MA 02139 1 We start out with two processes which are fundamentally quantum: superdense coding and teleportation. Superdense
More informationTalk by Johannes Vrana
Decoherence and Quantum Error Correction Talk by Johannes Vrana Seminar on Quantum Computing - WS 2002/2003 Page 1 Content I Introduction...3 II Decoherence and Errors...4 1. Decoherence...4 2. Errors...6
More information5. Communication resources
5. Communication resources Classical channel Quantum channel Entanglement How does the state evolve under LOCC? Properties of maximally entangled states Bell basis Quantum dense coding Quantum teleportation
More informationCSE 599d - Quantum Computing Fault-Tolerant Quantum Computation and the Threshold Theorem
CSE 599d - Quantum Computing Fault-Tolerant Quantum Computation and the Threshold Theorem Dave Bacon Department of Computer Science & Engineering, University of Washington In the last few lectures, we
More informationQuantum Switching Networks with Classical Routing
Quantum Switching Networks with Classical Routing Rahul Ratan, Manish Kumar Shukla, A. Yavuz Oruç Department of Electrical and Computer Engineering University of Maryland, College Park, MD 0 Email: [rahulr,
More informationQuantum error correction on a hybrid spin system. Christoph Fischer, Andrea Rocchetto
Quantum error correction on a hybrid spin system Christoph Fischer, Andrea Rocchetto Christoph Fischer, Andrea Rocchetto 17/05/14 1 Outline Error correction: why we need it, how it works Experimental realization
More informationA review on quantum teleportation based on: Teleporting an unknown quantum state via dual classical and Einstein- Podolsky-Rosen channels
JOURNAL OF CHEMISTRY 57 VOLUME NUMBER DECEMBER 8 005 A review on quantum teleportation based on: Teleporting an unknown quantum state via dual classical and Einstein- Podolsky-Rosen channels Miri Shlomi
More informationFourier Sampling & Simon s Algorithm
Chapter 4 Fourier Sampling & Simon s Algorithm 4.1 Reversible Computation A quantum circuit acting on n qubits is described by an n n unitary operator U. Since U is unitary, UU = U U = I. This implies
More informationSingle qubit + CNOT gates
Lecture 6 Universal quantum gates Single qubit + CNOT gates Single qubit and CNOT gates together can be used to implement an arbitrary twolevel unitary operation on the state space of n qubits. Suppose
More informationTechniques for fault-tolerant quantum error correction
Techniques for fault-tolerant quantum error correction Ben Reichardt UC Berkeley Quantum fault-tolerance problem C 0/1 Fault-tolerant, larger High tolerable noise Low overhead 1 Encoding for fault tolerance
More informationSecrets of Quantum Information Science
Secrets of Quantum Information Science Todd A. Brun Communication Sciences Institute USC Quantum computers are in the news Quantum computers represent a new paradigm for computing devices: computers whose
More informationQuantum Computing: From Circuit To Architecture
POLITECNICO DI MILANO Dipartimento di Elettronica, Informazione e Bioingegneria Quantum Computing: From Circuit To Architecture Nicholas Mainardi Email: nicholas.mainardi@polimi.it home.deib.polimi.it/nmainardi
More informationIntroduction to Quantum Computing for Folks
Introduction to Quantum Computing for Folks Joint Advanced Student School 2009 Ing. Javier Enciso encisomo@in.tum.de Technische Universität München April 2, 2009 Table of Contents 1 Introduction 2 Quantum
More informationA central problem in cryptography: the key distribution problem.
Scientific American 314, 48-55 (2016) A central problem in cryptography: the key distribution problem. Mathematics solution: public key cryptography. Public-key cryptography relies on the computational
More informationLecture 3: Constructing a Quantum Model
CS 880: Quantum Information Processing 9/9/010 Lecture 3: Constructing a Quantum Model Instructor: Dieter van Melkebeek Scribe: Brian Nixon This lecture focuses on quantum computation by contrasting it
More informationQuantum Computing: Foundations to Frontier Fall Lecture 3
Quantum Computing: Foundations to Frontier Fall 018 Lecturer: Henry Yuen Lecture 3 Scribes: Seyed Sajjad Nezhadi, Angad Kalra Nora Hahn, David Wandler 1 Overview In Lecture 3, we started off talking about
More informationLecture 6: Quantum error correction and quantum capacity
Lecture 6: Quantum error correction and quantum capacity Mark M. Wilde The quantum capacity theorem is one of the most important theorems in quantum hannon theory. It is a fundamentally quantum theorem
More informationIntroduction to Quantum Error Correction
Introduction to Quantum Error Correction Nielsen & Chuang Quantum Information and Quantum Computation, CUP 2000, Ch. 10 Gottesman quant-ph/0004072 Steane quant-ph/0304016 Gottesman quant-ph/9903099 Errors
More informationTutorial on Quantum Computing. Vwani P. Roychowdhury. Lecture 1: Introduction
Tutorial on Quantum Computing Vwani P. Roychowdhury Lecture 1: Introduction 1 & ) &! # Fundamentals Qubits A single qubit is a two state system, such as a two level atom we denote two orthogonal states
More informationQuantum computing! quantum gates! Fisica dell Energia!
Quantum computing! quantum gates! Fisica dell Energia! What is Quantum Computing?! Calculation based on the laws of Quantum Mechanics.! Uses Quantum Mechanical Phenomena to perform operations on data.!
More informationQuantum Gates, Circuits & Teleportation
Chapter 3 Quantum Gates, Circuits & Teleportation Unitary Operators The third postulate of quantum physics states that the evolution of a quantum system is necessarily unitary. Geometrically, a unitary
More informationTeleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters)
Teleportation of Quantum States (1993; Bennett, Brassard, Crepeau, Jozsa, Peres, Wootters) Rahul Jain U. Waterloo and Institute for Quantum Computing, rjain@cs.uwaterloo.ca entry editor: Andris Ambainis
More informationD.5 Quantum error correction
D. QUANTUM ALGORITHMS 157 Figure III.34: E ects of decoherence on a qubit. On the left is a qubit yi that is mostly isoloated from its environment i. Ontheright,aweakinteraction between the qubit and the
More informationQuantum Computing. Quantum Computing. Sushain Cherivirala. Bits and Qubits
Quantum Computing Bits and Qubits Quantum Computing Sushain Cherivirala Quantum Gates Measurement of Qubits More Quantum Gates Universal Computation Entangled States Superdense Coding Measurement Revisited
More informationLarge-Scale Quantum Architectures
Large-Scale Quantum Architectures Fred Chong Director of Computer Engineering Professor of Computer Science University of California at Santa Barbara With Daniel Kudrow, Tzvetan Metodi, Darshan Thaker,
More informationHilbert Space, Entanglement, Quantum Gates, Bell States, Superdense Coding.
CS 94- Bell States Bell Inequalities 9//04 Fall 004 Lecture Hilbert Space Entanglement Quantum Gates Bell States Superdense Coding 1 One qubit: Recall that the state of a single qubit can be written as
More informationSimple scheme for efficient linear optics quantum gates
PHYSICAL REVIEW A, VOLUME 65, 012314 Simple scheme for efficient linear optics quantum gates T. C. Ralph,* A. G. White, W. J. Munro, and G. J. Milburn Centre for Quantum Computer Technology, University
More informationQuantum non-demolition measurements:
Quantum non-demolition measurements: One path to truly scalable quantum computation Kae Nemoto Tim Spiller Sean Barrett Ray Beausoleil Pieter Kok Bill Munro HP Labs (Bristol) Why should optical quantum
More informationb) (5 points) Give a simple quantum circuit that transforms the state
C/CS/Phy191 Midterm Quiz Solutions October 0, 009 1 (5 points) Short answer questions: a) (5 points) Let f be a function from n bits to 1 bit You have a quantum circuit U f for computing f If you wish
More informationCS257 Discrete Quantum Computation
CS57 Discrete Quantum Computation John E Savage April 30, 007 Lect 11 Quantum Computing c John E Savage Classical Computation State is a vector of reals; e.g. Booleans, positions, velocities, or momenta.
More informationLecture 2: From Classical to Quantum Model of Computation
CS 880: Quantum Information Processing 9/7/10 Lecture : From Classical to Quantum Model of Computation Instructor: Dieter van Melkebeek Scribe: Tyson Williams Last class we introduced two models for deterministic
More information6.896 Quantum Complexity Theory September 18, Lecture 5
6.896 Quantum Complexity Theory September 18, 008 Lecturer: Scott Aaronson Lecture 5 Last time we looked at what s known about quantum computation as it relates to classical complexity classes. Today we
More informationChapter 10. Quantum algorithms
Chapter 10. Quantum algorithms Complex numbers: a quick review Definition: C = { a + b i : a, b R } where i = 1. Polar form of z = a + b i is z = re iθ, where r = z = a 2 + b 2 and θ = tan 1 y x Alternatively,
More informationIntroduction into Quantum Computations Alexei Ashikhmin Bell Labs
Introduction into Quantum Computations Alexei Ashikhmin Bell Labs Workshop on Quantum Computing and its Application March 16, 2017 Qubits Unitary transformations Quantum Circuits Quantum Measurements Quantum
More informationQuantum Computing. Separating the 'hope' from the 'hype' Suzanne Gildert (D-Wave Systems, Inc) 4th September :00am PST, Teleplace
Quantum Computing Separating the 'hope' from the 'hype' Suzanne Gildert (D-Wave Systems, Inc) 4th September 2010 10:00am PST, Teleplace The Hope All computing is constrained by the laws of Physics and
More information6. Quantum error correcting codes
6. Quantum error correcting codes Error correcting codes (A classical repetition code) Preserving the superposition Parity check Phase errors CSS 7-qubit code (Steane code) Too many error patterns? Syndrome
More informationQuantum Information & Quantum Computation
CS90A, Spring 005: Quantum Information & Quantum Computation Wim van Dam Engineering, Room 509 vandam@cs http://www.cs.ucsb.edu/~vandam/teaching/cs90/ Administrative The Final Examination will be: Monday
More informationIntroduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871
Introduction to Quantum Information Processing QIC 710 / CS 768 / PH 767 / CO 681 / AM 871 Lecture 1 (2017) Jon Yard QNC 3126 jyard@uwaterloo.ca TAs Nitica Sakharwade nsakharwade@perimeterinstitute.ca
More informationLecture 11 September 30, 2015
PHYS 7895: Quantum Information Theory Fall 015 Lecture 11 September 30, 015 Prof. Mark M. Wilde Scribe: Mark M. Wilde This document is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike
More informationScalable Quantum Computing With Enhancement Quantum Dots
Scalable Quantum Computing With Enhancement Quantum Dots Y. B. Lyanda-Geller a, M. J. Yang b and C. H. Yang c a Department of Physics, Purdue University, West Lafayette, IN 47907 b Naval Research Laboratory,
More information2.2 Classical circuit model of computation
Chapter 2 Classical Circuit Models for Computation 2. Introduction A computation is ultimately performed by a physical device. Thus it is a natural question to ask what are the fundamental limitations
More informationGeneral Qubit Errors Cannot Be Corrected
arxiv:quant-ph/0206144v4 27 Jun 2002 General Qubit Errors Cannot Be Corrected Subhash Kak June27, 2002 Abstract Error correction in the standard meaning of the term implies the ability to correct all small
More informationQUANTUM INFORMATION -THE NO-HIDING THEOREM p.1/36
QUANTUM INFORMATION - THE NO-HIDING THEOREM Arun K Pati akpati@iopb.res.in Instititute of Physics, Bhubaneswar-751005, Orissa, INDIA and Th. P. D, BARC, Mumbai-400085, India QUANTUM INFORMATION -THE NO-HIDING
More informationCSCI 2570 Introduction to Nanocomputing. Discrete Quantum Computation
CSCI 2570 Introduction to Nanocomputing Discrete Quantum Computation John E Savage November 27, 2007 Lect 22 Quantum Computing c John E Savage What is Quantum Computation It is very different kind of computation
More informationQuantum computing and mathematical research. Chi-Kwong Li The College of William and Mary
and mathematical research The College of William and Mary Classical computing Classical computing Hardware - Beads and bars. Classical computing Hardware - Beads and bars. Input - Using finger skill to
More informationRequirements for scaleable QIP
p. 1/25 Requirements for scaleable QIP These requirements were presented in a very influential paper by David Divincenzo, and are widely used to determine if a particular physical system could potentially
More informationThe Future. Currently state of the art chips have gates of length 35 nanometers.
Quantum Computing Moore s Law The Future Currently state of the art chips have gates of length 35 nanometers. The Future Currently state of the art chips have gates of length 35 nanometers. When gate lengths
More informationComplex numbers: a quick review. Chapter 10. Quantum algorithms. Definition: where i = 1. Polar form of z = a + b i is z = re iθ, where
Chapter 0 Quantum algorithms Complex numbers: a quick review / 4 / 4 Definition: C = { a + b i : a, b R } where i = Polar form of z = a + b i is z = re iθ, where r = z = a + b and θ = tan y x Alternatively,
More informationPostselection threshold against biased noise (A probabilistic mixing lemma and quantum fault tolerance) Ben W. Reichardt Caltech
Postselection threshold against biased noise (A probabilistic mixing lemma and quantum fault tolerance) Ben W. Reichardt Caltech Results xistence of tolerable noise rates for many fault-tolerance schemes,
More informationQuantum Computation 650 Spring 2009 Lectures The World of Quantum Information. Quantum Information: fundamental principles
Quantum Computation 650 Spring 2009 Lectures 1-21 The World of Quantum Information Marianna Safronova Department of Physics and Astronomy February 10, 2009 Outline Quantum Information: fundamental principles
More informationA Brief Introduction to Quantum Error Correction
A Brief Introduction to Quantum rror Correction Samuel James Bader MIT Department of Physics, (4-304) 77 Massachusetts Ave., Cambridge, MA 0139 (Dated: May 4, 01) This paper introduces quantum noise, surveys
More informationMultipath and polarization entanglement of photons
Multipath and polarization entanglement of photons. Chiuri, G. Vallone*, P. Mataloni Quantum Optics Group, Dipartimento di Fisica Sapienza Università di Roma, 0085, Italy INO CNR, 5025 Firenze, Italy *
More informationThe information content of a quantum
The information content of a quantum A few words about quantum computing Bell-state measurement Quantum dense coding Teleportation (polarisation states) Quantum error correction Teleportation (continuous
More informationSolution 4 for USTC class Physics of Quantum Information
Solution 4 for 2018 2019 USTC class Physics of Quantum Information Shuai Zhao, Xin-Yu Xu, Kai Chen National Laboratory for Physical Sciences at Microscale and Department of Modern Physics, University of
More informationarxiv:quant-ph/ v2 23 Aug 2003
An Architecture of Deterministic Quantum Central Processing Unit arxiv:quant-ph/0207032v2 23 Aug 2003 Fei Xue a, Zeng-Bing Chen a Mingjun Shi a Xianyi Zhou a Jiangfeng Du a Rongdian Han a a Department
More informationOther Topics in Quantum Information
p. 1/23 Other Topics in Quantum Information In a course like this there is only a limited time, and only a limited number of topics can be covered. Some additional topics will be covered in the class projects.
More informationQuantum Memory Hierarchies
Quantum Memory Hierarchies Efficient Designs that Match Available Parallelism in Quantum Processors Darshan D. Thaker Tzvetan S. Metodi UC Davis Andrew W. Cross Issac L. Chuang MIT Frederic T. Chong UC
More informationA Performance Simulator for Quantitative Analysis of the Implications of Fault-Tolerance in Distributed Quantum Computer Architectures
A Performance Simulator for Quantitative Analysis of the Implications of Fault-Tolerance in Distributed Quantum Computer Architectures Jeff Hussmann Advisor: Jungsang Kim Duke University Abstract Successfully
More informationQuantum Computing. 6. Quantum Computer Architecture 7. Quantum Computers and Complexity
Quantum Computing 1. Quantum States and Quantum Gates 2. Multiple Qubits and Entangled States 3. Quantum Gate Arrays 4. Quantum Parallelism 5. Examples of Quantum Algorithms 1. Grover s Unstructured Search
More informationSuperconducting Qubits Lecture 4
Superconducting Qubits Lecture 4 Non-Resonant Coupling for Qubit Readout A. Blais, R.-S. Huang, A. Wallraff, S. M. Girvin, and R. J. Schoelkopf, PRA 69, 062320 (2004) Measurement Technique Dispersive Shift
More informationPromise of Quantum Computation
Quantum Computation, and Epilog: The Future of Computing 1 Promise of Quantum Computation Classical computers have their limitations: Factoring large numbers takes exponential time. No faster algorithm
More informationQuantum Computing with Very Noisy Gates
Quantum Computing with Very Noisy Gates Produced with pdflatex and xfig Fault-tolerance thresholds in theory and practice. Available techniques for fault tolerance. A scheme based on the [[4, 2, 2]] code.
More informationA Brief Comparison: Ion-Trap and Silicon-Based Implementations of Quantum Computation
A Brief Comparison: Ion-Trap and Silicon-Based Implementations of Quantum Computation Tzvetan Metodiev, Dean Copsey, Frederic T. Chong, Isaac Chuang Π, Mark Oskin,and John Kubiatowicz ffi University of
More informationSurface Code Threshold in the Presence of Correlated Errors
Surface Code Threshold in the Presence of Correlated Errors USP-São Carlos - 2013 E. Novais, P. Jouzdani, and E. Mucciolo CCNH Universidade Federal do ABC Department of Physics University of Central Florida
More informationQuantum computers offer the prospect of
QUANTUM COMPUTING A Practical Architecture for Reliable Quantum Computers Quantum computation has advanced to the point where system-level solutions can help close the gap between emerging quantum technologies
More informationA Quantum Logic Array Microarchitecture: Scalable Quantum Data Movement and Computation
To appear in the 2005 International Symposium on Microarchitecture (MICO-38) A uantum Logic Array Microarchitecture: Scalable uantum Data Movement and Computation Tzvetan S. Metodi, Darshan D. Thaker,
More informationLecture 2, March 2, 2017
Lecture 2, March 2, 2017 Last week: Introduction to topics of lecture Algorithms Physical Systems The development of Quantum Information Science Quantum physics perspective Computer science perspective
More informationInformation Theory Meets Quantum Physics
Information Theory Meets Quantum Physics The magic of wave dynamics Apoorva Patel Centre for High Energy Physics Indian Institute of Science, Bangalore 30 April 2016 (Commemorating the 100th birthday of
More informationQuantum information processing. Two become one
Quantum information processing Two become one Scientists experimentally demonstrate a scheme for quantum joining, which allow the number of qubits encoded per photon to be varied while keeping the overall
More informationDNA Computing Can we use DNA to do massive computations? Organisms do it DNA has very high information. Even more promising uses of DNA
CS252 raduate Computer Architecture Lecture 28 Esoteric Computer Architecture DNA Computing & Quantum Computing Prof John D. Kubiatowicz http:www.cs.berkeley.edu~kubitroncs252 DNA Computing Can we use
More information6.080/6.089 GITCS May 6-8, Lecture 22/23. α 0 + β 1. α 2 + β 2 = 1
6.080/6.089 GITCS May 6-8, 2008 Lecturer: Scott Aaronson Lecture 22/23 Scribe: Chris Granade 1 Quantum Mechanics 1.1 Quantum states of n qubits If you have an object that can be in two perfectly distinguishable
More informationarxiv: v2 [quant-ph] 14 May 2017
A Low-Overhead Hybrid Approach for Universal Fault-Tolerant Quantum Computation Eesa Nikahd, Morteza Saheb Zamani, and Mehdi Sedighi Quantum Design Automation Lab Amirkabir University of Technology, Tehran,
More informationQuantum Computing. Vraj Parikh B.E.-G.H.Patel College of Engineering & Technology, Anand (Affiliated with GTU) Abstract HISTORY OF QUANTUM COMPUTING-
Quantum Computing Vraj Parikh B.E.-G.H.Patel College of Engineering & Technology, Anand (Affiliated with GTU) Abstract Formerly, Turing Machines were the exemplar by which computability and efficiency
More informationQuantum Information Transfer and Processing Miloslav Dušek
Quantum Information Transfer and Processing Miloslav Dušek Department of Optics, Faculty of Science Palacký University, Olomouc Quantum theory Quantum theory At the beginning of 20 th century about the
More informationQuantum Technology 101: Overview of Quantum Computing and Quantum Cybersecurity
Quantum Technology 0: Overview of Quantum Computing and Quantum Cybersecurity Warner A. Miller* Department of Physics & Center for Cryptography and Information Security Florida Atlantic University NSF
More informationQuantum Computers. Peter Shor MIT
Quantum Computers Peter Shor MIT 1 What is the difference between a computer and a physics experiment? 2 One answer: A computer answers mathematical questions. A physics experiment answers physical questions.
More informationQuantum Computing An Overview
Quantum Computing An Overview NAS Division NASA Ames Research Center TR Govindan Program Manager, QIS U.S. Army Research Office Outline Motivation Essentials of the Quantum Computing (QC) model Challenges
More informationX row 1 X row 2, X row 2 X row 3, Z col 1 Z col 2, Z col 2 Z col 3,
1 Ph 219c/CS 219c Exercises Due: Thursday 9 March 2017.1 A cleaning lemma for CSS codes In class we proved the cleaning lemma for stabilizer codes, which says the following: For an [[n, k]] stabilizer
More informationLecture 4: Postulates of quantum mechanics
Lecture 4: Postulates of quantum mechanics Rajat Mittal IIT Kanpur The postulates of quantum mechanics provide us the mathematical formalism over which the physical theory is developed. For people studying
More informationSome Recent Research Issues in Quantum Logic
Some Recent Research Issues in Quantum Logic Marek Perkowski Part one What will be discussed?. Background. Quantum circuits synthesis 3. Quantum circuits simulation 4. Quantum logic emulation and evolvable
More informationQUANTUM COMPUTER SIMULATION
Chapter 2 QUANTUM COMPUTER SIMULATION Chapter 1 discussed quantum computing in non-technical terms and in reference to simple, idealized physical models. In this chapter we make the underlying mathematics
More informationCMSC 33001: Novel Computing Architectures and Technologies. Lecture 06: Trapped Ion Quantum Computing. October 8, 2018
CMSC 33001: Novel Computing Architectures and Technologies Lecturer: Kevin Gui Scribe: Kevin Gui Lecture 06: Trapped Ion Quantum Computing October 8, 2018 1 Introduction Trapped ion is one of the physical
More informationQUANTUM COMPUTER ARCHITECTURE FOR FAST ENTROPY EXTRACTION
Quantum Information and Computation, Vol. 1, No. 0 (2001) 000 000 c Rinton Press QUANTUM COMPUTER ARCHITECTURE FOR FAST ENTROPY EXTRACTION ANDREW M. STEANE Centre for Quantum Computation, Oxford University,
More information