CSE 599d - Quantum Computing When Quantum Computers Fall Apart
|
|
- Gerald O’Brien’
- 5 years ago
- Views:
Transcription
1 CSE 599d - Quantum Comuting When Quantum Comuters Fall Aart Dave Bacon Deartment of Comuter Science & Engineering, University of Washington In this lecture we are going to begin discussing what haens to quantum comuters when we move away from the closed system view of quantum theory and encounter the reality that real quantum system are oen quantum systems. Oen quantum systems interact with their environment and decohere. When we try to control real quantum systems, we aren t able to erfectly control them. When we try to erform rojective measurements on a real quantum systems, we don t erform exactly erfect rojective measurements. When we try to reare real quantum systems into a articular state, we don t succeed in rearing this state with erfect certainty. All of these issues must be addressed if we are really going to ( build a quantum comuter, ( accet that quantum comutation is a valid model deserving of the moniker digital comuter. I. QUANTUM NOISE Suose that our hay qubit ψ is sitting there minding its business, when the cold hard reality that is not alone in the universe shows its head. In articular another qubit, in the state + comes along and interacts with our qubit by a controlled-not, controlled from the extra qubit. What will the effect of this evolution be on our qubit? Well we can calculate the Kraus oerators: A = B C X ( B + B = I The evolution of our initial state ρ = ψ ψ is then given by A = B C X ( B + B = X ( ρ A ρa + A ρa = ( ρ + XρX. ( We can interret this evolution as describing the rocedure of doing nothing to our qubit with robability and with robability alying the unitary oerator X to our qubit. This is an examle of quantum noise on our qubit. But notice that this quantum noise is very similar to what we might call classical noise in the comutational basis. In the comutational basis, this reresents nothing more that fliing the bit. Now suose that we relace the controlled-not in this oeration with a controlled-u oeration. Then we can similarly calculate that A = B C X ( B + B = I A = B C X ( B + B = U (3 The evolution of this sueroerator can be interreted as doing nothing with robability and alying U with robability. Now if U is the Z gate, then, this evolution does something kind of strange to our qubit, when exressed in the comutational basis. In articular the Z gate does not change the amlitude of a state in the comutational basis: α + β α β. Thus if we are talking about measurements in the comutational basis the effect of this noise does not change the robabilities of the two outcomes. But if we examine the density matrix, then something has haened to our system: αβ α β β ( αβ α β β + [ αβ α β β = ( αβ Thus we see that the off diagonal elements of the the density matrix have decayed. If, for examle =, then the density matrix has gone from a coherent mixture to an incoherent mixture. This is a articulary nasty form of quantum noise, because if, say and are energy eigenstates, then the energy of the qubit has not changed, but the system has lost some of it s coherent roerties. Now what is bad about the quantum noise we have described above? Well the real roblem is that it is not reversible. Suose that the interactions we describe above haen, but then the extra qubit with with our qubit (4
2 interacted becomes inaccessible to us. Well then can we restore our qubit back to it s original state? The answer is no! Why? Well one way to see this to examine the action of the noise rocesses which can occur to a qubit on the Bloch ball. A rocess like our first noise rocess, roduces the evolution (I + n xx + n y Y + n z Z (I + n xx + n y Y + n z Z + (I + n xx n y Y n z Z = (I + n xx ( (n y Y + n z Z. (5 Thus we see that the states in the Bloch ball are shrunk around the Y and Z directions (into a Bloch ellisoid. If we are to reverse this shrinking, there must be a rocess which reverses this shrinking. But no such valid oerator sum reresentation evolution can roduce this. Why? Because it would need to take states with n < to states with n =. But sueroerators are linear, $[am + bn = a$[m + b$[n. So if the there exists a sueroerator which erforms this for our above oeration, it must take (I ±( Y (I ±Y. This imlies ($[I+( $[Y = (I + Y and ($[I ( $[Y = (I Y, or ( $[Y = Y and $[I = I. So alying this to sueroerator to (I + Y we obtain (I + Y which is not a valid density matrix from >. Thus, since sueroerators ma density matrices to density matrices, we have obtained a contradiction, and there must exist no such sueroerator which erforms this ma. Thus we see that the above rocess we have described is irreversible, given that we throw away the system with which our system has interact to roduce the original sueroerator. Let s describe a few of the more imortant mechanism which we encounter in studying quantum systems. In articular we will focus on the action of these quantum noise rocesses on a single qubit. A. Deolarizing Channel In a deolarizing channel, with robability the qubit is left untouched and with robability the qubit is fully mixed. Fully mixed? This means that (I + n σ I. How can we achieve this rocess? One way is to note that XρX + Y ρy + ZρZ = 3 I (6 To seen this note that XXX = X, XY X = X, and XZX = Z so that if ρ = (I + n xx + n y Y + n z Z, then XρX = (I + n xx n y Y n z Z. Similarly Y ρy = (I n xx + n y Y n z Z and ZρZ = (I n xx n y Y + n z Z. Putting these together yeilds the exression. Thus we see that we can roduce the deolarizing channel if we have the four Kraus oerators A = I, A = 3 X A = 3 Y A 3 = 3 Z (7 Then the evolution of ρ will be ρ ( ρ + I (8 What does this do on the Bloch ball? Well it simly shrinks the ball along all directs equally: n ( n (9 B. Phase Daming Channel Suose that our qubit is sitting there, minding its business. The environment, however is always out there and always lanning devious business for our qubit. Suose that the environment is in a state but every once in a while, it scatters off of the qubit. In articular this scattering may deend on the state of the qubit, i.e. if the qubit is in the state, then there may be an amlitude that the environment scatters into the state and if the qubit is in the state, there may be a different amlitude that the environment scatters into the state. Consider, for examle, the situation where the magnitude of the evolution is the same: ( + ( + (
3 The Kraus oerators for this rocess can be calculated, assuming the environment starts in the state, and is given by [ [ A = A = A = ( What does this evolution do to an arbitrary inut density matrix? It is easy to see that it only effects the off diagonal matrix elements: [ αβ α β β ( αβ α β β + β = ( αβ ( α β β ( But notice that this is the same as the evolution we described by couling a controlled-z to our system. But that evolution had different Kraus oerators. That s kind of interesting. In fact these two evolutions, which are call hase daming, reresent (u to that scaling the same sueroerator. There is a degree of freedom in our sueroerators which we haven t discussed, and we will now remedy that situation 3. Unitary Freedom of the Oerator Sum Reresentation To understand the freedom in the oerator sum reresentation Kraus oerators, it is useful to first understand a very cool way to fully characterize a sueroerator. Suose we have some sueroerator $ with Kraus oerator A i. Now one way to characterize this sueroerator is to check how it oerators on different states and, given enough of these states, one can regain all of the information describing the sueroerator. This is known as rocess tomograhy, and we won t discuss it here. But there is a much cooler way to secify a sueroerator. Let our system have a Hilbert sace H A. Attach an ancilla system of the same dimension as our Hilbert sace to H A so our full Hilbert sace is H = H A H B. Now define the (unnormalized state on this joint system ψ AB = i A i B (3 where d = dimh A. This is the maximally entangled states (if we had roerly normalized it shared between H A and H B. Now the cool thing about ψ is that it allows us to secify states on subsystem A using states on subsystem B. In articular note that is we let φ B = d a i i B, then φ B ψ AB = a i i A = φ B. (4 Evidentally, ψ AB can serve as a ma from states on B to states on A. What consequence does this have for sueroerators? Well define the oerator τ = ($ I[ ψ AB ψ AB (5 Now what is cool is that τ gives us all of the information about $ that we need to reconstruct $! By looking at how a sueroerator acts on half of a maximally entangled quantum state, we can comletely characterize the sueroerator. How do we see this? Well again defining φ B = d a i i B, we can calculate φ B τ φ B φ B τ φ B = φ B ($ I[ ψ AB ψ AB φ B = ($[ φ B ψ AB ψ AB φ B = $[ φ A φ A (6 Suose that we decomose τ as τ = k v k AB v k AB. Then define ma A k ( φ A = φ B v k AB. This ma is certainly linear, so we can just think about it as a linear oerator. But then we have A k φ A φ A A k = φ B v k AB v k AB φ B = φ B τ φ B = $[ φ A φ A (7 k k Thus we have seen that by seeing how $ acts on half of a maximally entangled state, we can calculate τ, and using τ we can then find the oerator sum reresentation of $. Okay now that we ve got that cool result out of the way, we can discuss the freedom in the oerator sum reresentation. Suose that we have two sueroerators with Kraus oerator {A k } and {B k }. Assume that they have the
4 same number of oerators and if they do not, then just ad on of the sets with zero oerators. Then we will show that if these reresent the same oerator then these reresent the same sueroerator iff there exists a unitary matrix with entries u mn such that 4 A k = l u kl B l (8 Again attach an ancilla sace B with the same dimension as A. Then define the states resulting from acting with A k or B l on one half of (not roerly normalized maximally entangled state between A and B. a k = b l = (A k i A i B (B l i A i B (9 Then it must be that the oerator which was τ above, reresenting the result of acting with I $ on the maximally entangled state, are, for these two sueroerators, τ = k a k a k and σ l = l b l b l. But these are (u to that normalization valid density matrices. The only way these can be the same density matrices and hence reresent the same sueroerator is, from a few lectures back, if a k = l u kl b l ( for some unitary matrix with entries u kl. Now for arbitrary states ψ, we find that A k ψ A = ψ B a k = l ψ B u kl b l = l u kl B l ψ ( Since this must hold for arbitrary ψ this imlies that A k = l u kl B l ( as desired. Conversely, suose that A k = l u klb l. Then k A kρa k = k l u klb l ρ m u km B m. But k u klu km = δ lm, so this imlies that k A kρa k = l B lρb l. Thus we have shown that two sueroerators are the same iff the sets of Kraus oerators for these sueroerators can be related to each other by a unitary transform over the different oerators (not on the oerators themselves. Let s see this for the two channels where we first noted this. In the first sueroerator the Krauss oerators were A = I A = Z (3 and in the second case the Kraus oerators were [ B = B = [ B = (where we have rescaled the first to make this corresondence correct. We can rewrite these second Kraus oerators as B = I B = (I + Z B = (I Z (5 Then it the question becomes whether we can find a unitary which transforms between these two sets o matrices. Indeed we can, and it is given by U = ( ( ( (4 (6 How did I find this? Well I looked at the coefficients in from of the I and Z searately and derived equations from these conditions. Of course the answer I got is not unique: the final row can have an arbitrary hase, for examle.
5 5 C. Amlitude Daming Channel A final, very interesting channel is the amlitude daming channel. This channel is used to describe, say the decay of an a two level system. Suose that our environment is initially in the state E reresenting the vacuum. Then if the system is in its lower energy state, which we take to be, then nothing haens. However if the system is in its higher energy state, which we take to be the state, then there is an amlitude for the system to relax to the ground state and emit a hoton. The unitary descrition of this rocess is E E E E + E (7 Calculating the Kraus oerators we find that they are given by A = A = [ (8 Notice that A is not a hermitian oerator (as in our revious Kraus oerators. How does a density matrix evolve under this evolution? Well we can calculate that [ αβ α β β αβ [ α β β β + = ( + β αβ ( α β β (9 ( Thus we see that there is oulation transfer between the and state, along with an daming of the off diagonal elements of the density matrix. If reresents the amlitude for this to occur er unit time ste, for a time t, then the oulation of the higher energy level state decays like ( t t t ex( t. So this is just the exonential decay of a higher energy state to a lower energy state. Notice also that the amlitude daming channel does not send I to I. Quantum noise which reserve the maximally mixed state (like I for a qubit are called unital. Thus amlitude daming is not a unital sueroerator. D. Quantum Noise We ve seen some ossible quantum noise rocesses in this lecture. The question we will worry about next is how we might ossibly overcome this quantum noise. One articular worry is that the noise is secified by Kraus oerator {A k } and these form a continuous set of oerators. Of course, if we really think about classical noise, then it will also form a continuous set. We aren t worried there because we can think about noise in the classical case as deterministic rocedures occurring with robabilities. Are their equivalent notions for quantum theory? Stay tuned and you will find out!
Lecture 21: Quantum Communication
CS 880: Quantum Information Processing 0/6/00 Lecture : Quantum Communication Instructor: Dieter van Melkebeek Scribe: Mark Wellons Last lecture, we introduced the EPR airs which we will use in this lecture
More information1 More General von Neumann Measurements [10 Points]
Ph5c Sring 07 Prof. Sean Carroll seancarroll@gmail.com Homework - 3 Solutions Assigned TA: Thom Bohdanowicz thom@caltech.edu Due: 5:00m, 5/03/07 More General von Neumann Measurements [0 Points] Recall
More informationMATH 2710: NOTES FOR ANALYSIS
MATH 270: NOTES FOR ANALYSIS The main ideas we will learn from analysis center around the idea of a limit. Limits occurs in several settings. We will start with finite limits of sequences, then cover infinite
More informationQuantum decoherence. Éric Oliver Paquette (U. Montréal) -Traces Worshop [Ottawa]- April 29 th, Quantum decoherence p. 1/2
Quantum decoherence p. 1/2 Quantum decoherence Éric Oliver Paquette (U. Montréal) -Traces Worshop [Ottawa]- April 29 th, 2007 Quantum decoherence p. 2/2 Outline Quantum decoherence: 1. Basics of quantum
More informationPHY305: Notes on Entanglement and the Density Matrix
PHY305: Notes on Entanglement and the Density Matrix Here follows a short summary of the definitions of qubits, EPR states, entanglement, the density matrix, pure states, mixed states, measurement, and
More informationSTA 250: Statistics. Notes 7. Bayesian Approach to Statistics. Book chapters: 7.2
STA 25: Statistics Notes 7. Bayesian Aroach to Statistics Book chaters: 7.2 1 From calibrating a rocedure to quantifying uncertainty We saw that the central idea of classical testing is to rovide a rigorous
More informationFault Tolerant Quantum Computing Robert Rogers, Thomas Sylwester, Abe Pauls
CIS 410/510, Introduction to Quantum Information Theory Due: June 8th, 2016 Sring 2016, University of Oregon Date: June 7, 2016 Fault Tolerant Quantum Comuting Robert Rogers, Thomas Sylwester, Abe Pauls
More informationElementary Analysis in Q p
Elementary Analysis in Q Hannah Hutter, May Szedlák, Phili Wirth November 17, 2011 This reort follows very closely the book of Svetlana Katok 1. 1 Sequences and Series In this section we will see some
More informationCSC165H, Mathematical expression and reasoning for computer science week 12
CSC165H, Mathematical exression and reasoning for comuter science week 1 nd December 005 Gary Baumgartner and Danny Hea hea@cs.toronto.edu SF4306A 416-978-5899 htt//www.cs.toronto.edu/~hea/165/s005/index.shtml
More informationHENSEL S LEMMA KEITH CONRAD
HENSEL S LEMMA KEITH CONRAD 1. Introduction In the -adic integers, congruences are aroximations: for a and b in Z, a b mod n is the same as a b 1/ n. Turning information modulo one ower of into similar
More informationPROFIT MAXIMIZATION. π = p y Σ n i=1 w i x i (2)
PROFIT MAXIMIZATION DEFINITION OF A NEOCLASSICAL FIRM A neoclassical firm is an organization that controls the transformation of inuts (resources it owns or urchases into oututs or roducts (valued roducts
More informationMP 472 Quantum Information and Computation
MP 472 Quantum Information and Computation http://www.thphys.may.ie/staff/jvala/mp472.htm Outline Open quantum systems The density operator ensemble of quantum states general properties the reduced density
More information1-way quantum finite automata: strengths, weaknesses and generalizations
1-way quantum finite automata: strengths, weaknesses and generalizations arxiv:quant-h/9802062v3 30 Se 1998 Andris Ambainis UC Berkeley Abstract Rūsiņš Freivalds University of Latvia We study 1-way quantum
More informationNamed Entity Recognition using Maximum Entropy Model SEEM5680
Named Entity Recognition using Maximum Entroy Model SEEM5680 Named Entity Recognition System Named Entity Recognition (NER): Identifying certain hrases/word sequences in a free text. Generally it involves
More informationQuantum Game Beats Classical Odds Thermodynamics Implications
Entroy 05, 7, 7645-7657; doi:0.3390/e77645 Article OPEN ACCESS entroy ISSN 099-4300 www.mdi.com/journal/entroy Quantum Game Beats Classical Odds Thermodynamics Imlications George Levy Entroic Power Cororation,
More information4. Score normalization technical details We now discuss the technical details of the score normalization method.
SMT SCORING SYSTEM This document describes the scoring system for the Stanford Math Tournament We begin by giving an overview of the changes to scoring and a non-technical descrition of the scoring rules
More informationFeedback-error control
Chater 4 Feedback-error control 4.1 Introduction This chater exlains the feedback-error (FBE) control scheme originally described by Kawato [, 87, 8]. FBE is a widely used neural network based controller
More informationTitle. Author(s)Okamoto, Ryo; Hofmann, Holger F.; Takeuchi, Shigeki; CitationPhysical Review Letters, 95: Issue Date
Title Demonstration of an Otical Quantum Controlled-NOT G Author(s)Okamoto, Ryo; Hofmann, Holger F.; Takeuchi, Shigeki; CitationPhysical Review Letters, 95: 210506 Issue Date 2005-11-18 Doc URL htt://hdl.handle.net/2115/5550
More informationNotes on Instrumental Variables Methods
Notes on Instrumental Variables Methods Michele Pellizzari IGIER-Bocconi, IZA and frdb 1 The Instrumental Variable Estimator Instrumental variable estimation is the classical solution to the roblem of
More informationState Estimation with ARMarkov Models
Deartment of Mechanical and Aerosace Engineering Technical Reort No. 3046, October 1998. Princeton University, Princeton, NJ. State Estimation with ARMarkov Models Ryoung K. Lim 1 Columbia University,
More informationConvolutional Codes. Lecture 13. Figure 93: Encoder for rate 1/2 constraint length 3 convolutional code.
Convolutional Codes Goals Lecture Be able to encode using a convolutional code Be able to decode a convolutional code received over a binary symmetric channel or an additive white Gaussian channel Convolutional
More informationSECTION 5: FIBRATIONS AND HOMOTOPY FIBERS
SECTION 5: FIBRATIONS AND HOMOTOPY FIBERS In this section we will introduce two imortant classes of mas of saces, namely the Hurewicz fibrations and the more general Serre fibrations, which are both obtained
More information0.6 Factoring 73. As always, the reader is encouraged to multiply out (3
0.6 Factoring 7 5. The G.C.F. of the terms in 81 16t is just 1 so there is nothing of substance to factor out from both terms. With just a difference of two terms, we are limited to fitting this olynomial
More informationCMSC 425: Lecture 4 Geometry and Geometric Programming
CMSC 425: Lecture 4 Geometry and Geometric Programming Geometry for Game Programming and Grahics: For the next few lectures, we will discuss some of the basic elements of geometry. There are many areas
More informationExtension of Minimax to Infinite Matrices
Extension of Minimax to Infinite Matrices Chris Calabro June 21, 2004 Abstract Von Neumann s minimax theorem is tyically alied to a finite ayoff matrix A R m n. Here we show that (i) if m, n are both inite,
More informationImpossibility of a Quantum Speed-up with a Faulty Oracle
Imossibility of a Quantum Seed-u with a Faulty Oracle Oded Regev Liron Schiff Abstract We consider Grover s unstructured search roblem in the setting where each oracle call has some small robability of
More informationConvex Optimization methods for Computing Channel Capacity
Convex Otimization methods for Comuting Channel Caacity Abhishek Sinha Laboratory for Information and Decision Systems (LIDS), MIT sinhaa@mit.edu May 15, 2014 We consider a classical comutational roblem
More information8 STOCHASTIC PROCESSES
8 STOCHASTIC PROCESSES The word stochastic is derived from the Greek στoχαστικoς, meaning to aim at a target. Stochastic rocesses involve state which changes in a random way. A Markov rocess is a articular
More informationCSE 311 Lecture 02: Logic, Equivalence, and Circuits. Emina Torlak and Kevin Zatloukal
CSE 311 Lecture 02: Logic, Equivalence, and Circuits Emina Torlak and Kevin Zatloukal 1 Toics Proositional logic A brief review of Lecture 01. Classifying comound roositions Converse, contraositive, and
More informationECE 534 Information Theory - Midterm 2
ECE 534 Information Theory - Midterm Nov.4, 009. 3:30-4:45 in LH03. You will be given the full class time: 75 minutes. Use it wisely! Many of the roblems have short answers; try to find shortcuts. You
More informationChapter 7 Rational and Irrational Numbers
Chater 7 Rational and Irrational Numbers In this chater we first review the real line model for numbers, as discussed in Chater 2 of seventh grade, by recalling how the integers and then the rational numbers
More informationLecture 14: Quantum information revisited
CPSC 59/69: Quantum Computation John Watrous, University of Calgary Lecture 4: Quantum information revisited March 4, 006 So far, this course has focused almost entirely on quantum algorithms The next
More informationApproximating min-max k-clustering
Aroximating min-max k-clustering Asaf Levin July 24, 2007 Abstract We consider the roblems of set artitioning into k clusters with minimum total cost and minimum of the maximum cost of a cluster. The cost
More informationModule 8. Lecture 3: Markov chain
Lecture 3: Markov chain A Markov chain is a stochastic rocess having the roerty that the value of the rocess X t at time t, deends only on its value at time t-1, X t-1 and not on the sequence X t-2, X
More informationIntroduction to Group Theory Note 1
Introduction to Grou Theory Note July 7, 009 Contents INTRODUCTION. Examles OF Symmetry Grous in Physics................................. ELEMENT OF GROUP THEORY. De nition of Grou................................................
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 informationTopic 7: Using identity types
Toic 7: Using identity tyes June 10, 2014 Now we would like to learn how to use identity tyes and how to do some actual mathematics with them. By now we have essentially introduced all inference rules
More informationChater Matrix Norms and Singular Value Decomosition Introduction In this lecture, we introduce the notion of a norm for matrices The singular value de
Lectures on Dynamic Systems and Control Mohammed Dahleh Munther A Dahleh George Verghese Deartment of Electrical Engineering and Comuter Science Massachuasetts Institute of Technology c Chater Matrix Norms
More informationε(ω,k) =1 ω = ω'+kv (5) ω'= e2 n 2 < 0, where f is the particle distribution function and v p f v p = 0 then f v = 0. For a real f (v) v ω (kv T
High High Power Power Laser Laser Programme Programme Theory Theory and Comutation and Asects of electron acoustic wave hysics in laser backscatter N J Sircombe, T D Arber Deartment of Physics, University
More informationD.1 Deutsch-Jozsa algorithm
4 CHAPTER III. QUANTUM COMPUTATION Figure III.: Quantum circuit for Deutsch algorithm. [fig. from Nielsen & Chuang (00)] D Quantum algorithms D. Deutsch-Jozsa algorithm D..a Deutsch s algorithm In this
More informationarxiv: v2 [quant-ph] 17 Nov 2011
Three-layer quantum Kolkata restaurant roblem under decoherence M. Ramzan Deartment of Physics Quaid-i-Azam University Islamabad 4, Pakistan (Dated: Setember 11, 17) arxiv:1111.91v [quant-h] 17 Nov 11
More informationImproved Capacity Bounds for the Binary Energy Harvesting Channel
Imroved Caacity Bounds for the Binary Energy Harvesting Channel Kaya Tutuncuoglu 1, Omur Ozel 2, Aylin Yener 1, and Sennur Ulukus 2 1 Deartment of Electrical Engineering, The Pennsylvania State University,
More informationarxiv: v1 [quant-ph] 22 Apr 2017
Quaternionic Quantum Particles SERGIO GIARDINO Institute of Science and Technology, Federal University of São Paulo (Unifes) Avenida Cesare G. M. Lattes 101, 147-014 São José dos Camos, SP, Brazil arxiv:1704.06848v1
More informationEconomics 101. Lecture 7 - Monopoly and Oligopoly
Economics 0 Lecture 7 - Monooly and Oligooly Production Equilibrium After having exlored Walrasian equilibria with roduction in the Robinson Crusoe economy, we will now ste in to a more general setting.
More informationIntroduction to Probability and Statistics
Introduction to Probability and Statistics Chater 8 Ammar M. Sarhan, asarhan@mathstat.dal.ca Deartment of Mathematics and Statistics, Dalhousie University Fall Semester 28 Chater 8 Tests of Hyotheses Based
More informationLecture 13B: Supplementary Notes on Advanced Topics. 1 Inner Products and Outer Products for Single Particle States
Lecture 13B: Supplementary Notes on Advanced Topics Outer Products, Operators, Density Matrices In order to explore the complexity of many particle systems a different way to represent multiparticle states
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 9 (2017) Jon Yard QNC 3126 jyard@uwaterloo.ca http://math.uwaterloo.ca/~jyard/qic710 1 More state distinguishing
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 informationRound-off Errors and Computer Arithmetic - (1.2)
Round-off Errors and Comuter Arithmetic - (.). Round-off Errors: Round-off errors is roduced when a calculator or comuter is used to erform real number calculations. That is because the arithmetic erformed
More information1 Gambler s Ruin Problem
Coyright c 2017 by Karl Sigman 1 Gambler s Ruin Problem Let N 2 be an integer and let 1 i N 1. Consider a gambler who starts with an initial fortune of $i and then on each successive gamble either wins
More informationAvailability and Maintainability. Piero Baraldi
Availability and Maintainability 1 Introduction: reliability and availability System tyes Non maintained systems: they cannot be reaired after a failure (a telecommunication satellite, a F1 engine, a vessel
More informationarxiv: v1 [hep-th] 6 Oct 2017
Dressed infrared quantum information Daniel Carney, Laurent Chaurette, Domini Neuenfeld, and Gordon Walter Semenoff Deartment of Physics and Astronomy, University of British Columbia, BC, Canada We study
More informationCryptanalysis of Pseudorandom Generators
CSE 206A: Lattice Algorithms and Alications Fall 2017 Crytanalysis of Pseudorandom Generators Instructor: Daniele Micciancio UCSD CSE As a motivating alication for the study of lattice in crytograhy we
More informationLecture 13 Heat Engines
Lecture 3 Heat Engines hermodynamic rocesses and entroy hermodynamic cycles Extracting work from heat - How do we define engine efficiency? - Carnot cycle: the best ossible efficiency Reading for this
More informationQuantum Measurements: some technical background
Quantum Measurements: some technical background [From the projection postulate to density matrices & (introduction to) von Neumann measurements] (AKA: the boring lecture) First: One more example I wanted
More informationEvaluating Circuit Reliability Under Probabilistic Gate-Level Fault Models
Evaluating Circuit Reliability Under Probabilistic Gate-Level Fault Models Ketan N. Patel, Igor L. Markov and John P. Hayes University of Michigan, Ann Arbor 48109-2122 {knatel,imarkov,jhayes}@eecs.umich.edu
More informationarxiv: v1 [quant-ph] 3 Feb 2015
From reversible comutation to quantum comutation by Lagrange interolation Alexis De Vos and Stin De Baerdemacker 2 arxiv:502.0089v [quant-h] 3 Feb 205 Cmst, Imec v.z.w., vakgroe elektronica en informatiesystemen,
More informationδ(xy) = φ(x)δ(y) + y p δ(x). (1)
LECTURE II: δ-rings Fix a rime. In this lecture, we discuss some asects of the theory of δ-rings. This theory rovides a good language to talk about rings with a lift of Frobenius modulo. Some of the material
More informationAnytime communication over the Gilbert-Eliot channel with noiseless feedback
Anytime communication over the Gilbert-Eliot channel with noiseless feedback Anant Sahai, Salman Avestimehr, Paolo Minero Deartment of Electrical Engineering and Comuter Sciences University of California
More informationReal Analysis 1 Fall Homework 3. a n.
eal Analysis Fall 06 Homework 3. Let and consider the measure sace N, P, µ, where µ is counting measure. That is, if N, then µ equals the number of elements in if is finite; µ = otherwise. One usually
More informationIntroduction to quantum information processing
Introduction to quantum information processing Fidelity and other distance metrics Brad Lackey 3 November 2016 FIDELITY AND OTHER DISTANCE METRICS 1 of 17 OUTLINE 1 Noise channels 2 Fidelity 3 Trace distance
More informationLecture 6. 2 Recurrence/transience, harmonic functions and martingales
Lecture 6 Classification of states We have shown that all states of an irreducible countable state Markov chain must of the same tye. This gives rise to the following classification. Definition. [Classification
More informationLecture: Condorcet s Theorem
Social Networs and Social Choice Lecture Date: August 3, 00 Lecture: Condorcet s Theorem Lecturer: Elchanan Mossel Scribes: J. Neeman, N. Truong, and S. Troxler Condorcet s theorem, the most basic jury
More informationHARMONIC EXTENSION ON NETWORKS
HARMONIC EXTENSION ON NETWORKS MING X. LI Abstract. We study the imlication of geometric roerties of the grah of a network in the extendibility of all γ-harmonic germs at an interior node. We rove that
More informationSums of independent random variables
3 Sums of indeendent random variables This lecture collects a number of estimates for sums of indeendent random variables with values in a Banach sace E. We concentrate on sums of the form N γ nx n, where
More informationElliptic Curves Spring 2015 Problem Set #1 Due: 02/13/2015
18.783 Ellitic Curves Sring 2015 Problem Set #1 Due: 02/13/2015 Descrition These roblems are related to the material covered in Lectures 1-2. Some of them require the use of Sage, and you will need to
More informationTopic: Lower Bounds on Randomized Algorithms Date: September 22, 2004 Scribe: Srinath Sridhar
15-859(M): Randomized Algorithms Lecturer: Anuam Guta Toic: Lower Bounds on Randomized Algorithms Date: Setember 22, 2004 Scribe: Srinath Sridhar 4.1 Introduction In this lecture, we will first consider
More informationGeneral Linear Model Introduction, Classes of Linear models and Estimation
Stat 740 General Linear Model Introduction, Classes of Linear models and Estimation An aim of scientific enquiry: To describe or to discover relationshis among events (variables) in the controlled (laboratory)
More informationModel checking, verification of CTL. One must verify or expel... doubts, and convert them into the certainty of YES [Thomas Carlyle]
Chater 5 Model checking, verification of CTL One must verify or exel... doubts, and convert them into the certainty of YES or NO. [Thomas Carlyle] 5. The verification setting Page 66 We introduce linear
More informationLECTURE 3 BASIC QUANTUM THEORY
LECTURE 3 BASIC QUANTUM THEORY Matter waves and the wave function In 194 De Broglie roosed that all matter has a wavelength and exhibits wave like behavior. He roosed that the wavelength of a article of
More informationUniversal Finite Memory Coding of Binary Sequences
Deartment of Electrical Engineering Systems Universal Finite Memory Coding of Binary Sequences Thesis submitted towards the degree of Master of Science in Electrical and Electronic Engineering in Tel-Aviv
More informationGOOD MODELS FOR CUBIC SURFACES. 1. Introduction
GOOD MODELS FOR CUBIC SURFACES ANDREAS-STEPHAN ELSENHANS Abstract. This article describes an algorithm for finding a model of a hyersurface with small coefficients. It is shown that the aroach works in
More informationarxiv: v1 [physics.data-an] 26 Oct 2012
Constraints on Yield Parameters in Extended Maximum Likelihood Fits Till Moritz Karbach a, Maximilian Schlu b a TU Dortmund, Germany, moritz.karbach@cern.ch b TU Dortmund, Germany, maximilian.schlu@cern.ch
More information6 Binary Quadratic forms
6 Binary Quadratic forms 6.1 Fermat-Euler Theorem A binary quadratic form is an exression of the form f(x,y) = ax 2 +bxy +cy 2 where a,b,c Z. Reresentation of an integer by a binary quadratic form has
More informationThe Graph Accessibility Problem and the Universality of the Collision CRCW Conflict Resolution Rule
The Grah Accessibility Problem and the Universality of the Collision CRCW Conflict Resolution Rule STEFAN D. BRUDA Deartment of Comuter Science Bisho s University Lennoxville, Quebec J1M 1Z7 CANADA bruda@cs.ubishos.ca
More informationarxiv: v2 [quant-ph] 2 Aug 2012
Qcomiler: quantum comilation with CSD method Y. G. Chen a, J. B. Wang a, a School of Physics, The University of Western Australia, Crawley WA 6009 arxiv:208.094v2 [quant-h] 2 Aug 202 Abstract In this aer,
More informationQUANTUM INFORMATION DELAY SCHEME USING ORTHOGONAL PRODUCT STATES
0 th March 0. Vol. No. 00-0 JATIT & LLS. All rights reserved. ISSN: -86 www.jatit.org E-ISSN: 87- QUANTUM INFORMATION DELAY SCHEME USING ORTHOGONAL PRODUCT STATES XIAOYU LI, LIJU CHEN School of Information
More informationStatics and dynamics: some elementary concepts
1 Statics and dynamics: some elementary concets Dynamics is the study of the movement through time of variables such as heartbeat, temerature, secies oulation, voltage, roduction, emloyment, rices and
More informationCHAPTER 5 STATISTICAL INFERENCE. 1.0 Hypothesis Testing. 2.0 Decision Errors. 3.0 How a Hypothesis is Tested. 4.0 Test for Goodness of Fit
Chater 5 Statistical Inference 69 CHAPTER 5 STATISTICAL INFERENCE.0 Hyothesis Testing.0 Decision Errors 3.0 How a Hyothesis is Tested 4.0 Test for Goodness of Fit 5.0 Inferences about Two Means It ain't
More informationHomework Solution 4 for APPM4/5560 Markov Processes
Homework Solution 4 for APPM4/556 Markov Processes 9.Reflecting random walk on the line. Consider the oints,,, 4 to be marked on a straight line. Let X n be a Markov chain that moves to the right with
More informationε i (E j )=δj i = 0, if i j, form a basis for V, called the dual basis to (E i ). Therefore, dim V =dim V.
Covectors Definition. Let V be a finite-dimensional vector sace. A covector on V is real-valued linear functional on V, that is, a linear ma ω : V R. The sace of all covectors on V is itself a real vector
More informationOn split sample and randomized confidence intervals for binomial proportions
On slit samle and randomized confidence intervals for binomial roortions Måns Thulin Deartment of Mathematics, Usala University arxiv:1402.6536v1 [stat.me] 26 Feb 2014 Abstract Slit samle methods have
More information15-451/651: Design & Analysis of Algorithms October 23, 2018 Lecture #17: Prediction from Expert Advice last changed: October 25, 2018
5-45/65: Design & Analysis of Algorithms October 23, 208 Lecture #7: Prediction from Exert Advice last changed: October 25, 208 Prediction with Exert Advice Today we ll study the roblem of making redictions
More informationCryptography. Lecture 8. Arpita Patra
Crytograhy Lecture 8 Arita Patra Quick Recall and Today s Roadma >> Hash Functions- stands in between ublic and rivate key world >> Key Agreement >> Assumtions in Finite Cyclic grous - DL, CDH, DDH Grous
More informationThe classical-statistical limit of quantum mechanics.
arxiv:quant-h/53191v1 23 Mar 25 The classical-statistical limit of quantum mechanics. Mario Castagnino Instituto de Astronomía y Física del Esacio. Casilla de Correos 67, Sucursal 28, 1428 Buenos Aires,
More information1 Probability Spaces and Random Variables
1 Probability Saces and Random Variables 1.1 Probability saces Ω: samle sace consisting of elementary events (or samle oints). F : the set of events P: robability 1.2 Kolmogorov s axioms Definition 1.2.1
More informationLecture 13. Heat Engines. Thermodynamic processes and entropy Thermodynamic cycles Extracting work from heat
Lecture 3 Heat Engines hermodynamic rocesses and entroy hermodynamic cycles Extracting work from heat - How do we define engine efficiency? - Carnot cycle: the best ossible efficiency Reading for this
More informationAn Introduction to Quantum Computing for Non-Physicists
An Introduction to Quantum Comuting for Non-hysicists Eleanor Rieffel F alo Alto Labratory and Wolfgang olak Consultant F alo Alto Laboratory, 3400 Hillview Avenue, alo Alto, CA 94304 Richard Feynman s
More informationA Social Welfare Optimal Sequential Allocation Procedure
A Social Welfare Otimal Sequential Allocation Procedure Thomas Kalinowsi Universität Rostoc, Germany Nina Narodytsa and Toby Walsh NICTA and UNSW, Australia May 2, 201 Abstract We consider a simle sequential
More informationLinear diophantine equations for discrete tomography
Journal of X-Ray Science and Technology 10 001 59 66 59 IOS Press Linear diohantine euations for discrete tomograhy Yangbo Ye a,gewang b and Jiehua Zhu a a Deartment of Mathematics, The University of Iowa,
More informationA Qualitative Event-based Approach to Multiple Fault Diagnosis in Continuous Systems using Structural Model Decomposition
A Qualitative Event-based Aroach to Multile Fault Diagnosis in Continuous Systems using Structural Model Decomosition Matthew J. Daigle a,,, Anibal Bregon b,, Xenofon Koutsoukos c, Gautam Biswas c, Belarmino
More informationNumerical Linear Algebra
Numerical Linear Algebra Numerous alications in statistics, articularly in the fitting of linear models. Notation and conventions: Elements of a matrix A are denoted by a ij, where i indexes the rows and
More information28 Lecture 28: Transfer matrix, Symmetry breaking
28. LECTURE 28: TRANSFER MATRIX, SYMMETRY BREAKING 251 28 Lecture 28: Transfer matrix, Symmetry breaking Summary A detailed examle of transfer matrix technique is given. From the roerty of the transfer
More informationA Game Theoretic Investigation of Selection Methods in Two Population Coevolution
A Game Theoretic Investigation of Selection Methods in Two Poulation Coevolution Sevan G. Ficici Division of Engineering and Alied Sciences Harvard University Cambridge, Massachusetts 238 USA sevan@eecs.harvard.edu
More informationCHAPTER 3: TANGENT SPACE
CHAPTER 3: TANGENT SPACE DAVID GLICKENSTEIN 1. Tangent sace We shall de ne the tangent sace in several ways. We rst try gluing them together. We know vectors in a Euclidean sace require a baseoint x 2
More informationc Copyright by Helen J. Elwood December, 2011
c Coyright by Helen J. Elwood December, 2011 CONSTRUCTING COMPLEX EQUIANGULAR PARSEVAL FRAMES A Dissertation Presented to the Faculty of the Deartment of Mathematics University of Houston In Partial Fulfillment
More information9 The Theory of Special Relativity
9 The Theory of Secial Relativity Assign: Read Chater 4 of Carrol and Ostlie (2006) Newtonian hysics is a quantitative descrition of Nature excet under three circumstances: 1. In the realm of the very
More informationSTABILITY ANALYSIS TOOL FOR TUNING UNCONSTRAINED DECENTRALIZED MODEL PREDICTIVE CONTROLLERS
STABILITY ANALYSIS TOOL FOR TUNING UNCONSTRAINED DECENTRALIZED MODEL PREDICTIVE CONTROLLERS Massimo Vaccarini Sauro Longhi M. Reza Katebi D.I.I.G.A., Università Politecnica delle Marche, Ancona, Italy
More informationComputations in Quantum Tensor Networks
Comutations in Quantum Tensor Networks T Huckle a,, K Waldherr a, T Schulte-Herbrüggen b a Technische Universität München, Boltzmannstr 3, 85748 Garching, Germany b Technische Universität München, Lichtenbergstr
More informationConsider the following propositions: p: lecture has started q: If I have a banana, then I have a pear r: I finished this problem
Pre-Lecture Problem Do it! Do it now! What are you waiting for?! Consider the following roositions: : lecture has started : If I have a banana, then I have a ear r: I finished this roblem (i) Which of
More information