Documents Found!
As seen in
Less Work, Better Grades
Join
Course Hero
Access
best resources
Ace
your classes
Ace your courses with Course Hero!

Limited, unformatted preview (showing 69 of 2290 words):
...Computing Quantum Dept. of Comp. Sci. & Electrical Engineering Sci. University of Maryland Baltimore County Baltimore, MD 21250 Email: Lomonaco@UMBC.EDU WebPage: http://www.csee.umbc.edu/~lomonaco WebPage: http://www.csee.umbc.edu/~lomonaco Samuel J. Lomonaco, Jr. Overview Four Talks Elementary Lecture 1 A Rosetta Stone for Quantum Computation Three Quantum Algorithms Quantum Hidden Subgroup Algorithms An Entangled Tale of Quantum Entanglement Advanced A Rosetta Stone for Quantum...
Study Smarter, Score Higher
 
Document Content (unformatted)
Course Hero has millions of student submitted documents similar to the one below including study guides, homework solutions, papers, exam answer keys and textbook solutions.
Computing Quantum Dept. of Comp. Sci. & Electrical Engineering Sci. University of Maryland Baltimore County Baltimore, MD 21250 Email: Lomonaco@UMBC.EDU WebPage: http://www.csee.umbc.edu/~lomonaco WebPage: http://www.csee.umbc.edu/~lomonaco Samuel J. Lomonaco, Jr. Overview Four Talks Elementary Lecture 1 A Rosetta Stone for Quantum Computation Three Quantum Algorithms Quantum Hidden Subgroup Algorithms An Entangled Tale of Quantum Entanglement Advanced A Rosetta Stone for Quantum Computation Dept. of Comp. Sci. & Electrical Engineering Sci. University of Maryland Baltimore County Baltimore, MD 21250 Email: Lomonaco@UMBC.EDU WebPage: http://www.csee.umbc.edu/~lomonaco WebPage: http://www.csee.umbc.edu/~lomonaco Samuel J. Lomonaco, Jr. This work is supported by: The Defense Advance Research Projects Agency (DARPA) & Air Force Research Laboratory (AFRL), Air Force Materiel Command, USAF Agreement Number F30602-01-2-0522. F30602-01- Research Institute (MSRI). The National Institute for Standards and Technology (NIST). The Mathematical Sciences L-O-O-P The L-O-O-P Fund. L- Adami, Barencol, Benioff, Bennett, Brassard, Calderbank, Crepeau, Deutsch, DiVincenzo, Ekert, Einstein, Feynman, Grover, Heisenberg, Jozsa, Knill, Laflamme, Lloyd, Lomonaco, Peres, Popescu, Preskill, Podolsky,Rosen, Schumacher, Shannon, Shor,Simon, Sloane, Schrodinger, Townsend, Unruh, von Neumann, Vazirani, Wootters, Yao, Zeh, Zurek & many more 1 Lomonaco, Samuel J., Jr., A Rosetta stone for quantum mechanics with an introduction to quantum computation, in AMS PSAPM/58, computation, (2002), pages 3 65. ? ? ? Why ? ? ? Quantum Computation Limits of small scale integration technology to be reached 2010-2020 2010Moore s Law, i.e., No Longer ! Moore Law, every year, double the computing power at half the price. No Longer ! A whole new industry will be built around the new & emerging quantum technology Collision Course Math Quantum Computation Comp Sci EE Multi-Disciplinary MultiPhysics The Classical World Classical Shannon Bit Decisive Individual 0 or 1 Classical Bits Can Be Copied Out Copying Machine In 2 The Quantum World Quantum Bit Introducing the Qubit Qubit ??? Indecisive Individual Can be both 0 & 1 at the same time !!! Quantum Representations of Qubits Example 1. A spin- 1 particle spin- Quantum Representations of Qubits (Cont.) Example 2. Polarization States of a Photon 2 1= , , 0= 0= or Spin Up Spin Down 1= 1 1 0 0 Where does a Qubit live ? H= Home Def. A Hilbert Space is a vector space H over together with an inner product , : H H such that 1) u +u2, v = u , v + u2, v & v, u +u = v, u + v, u 1 1 12 1 2 2) u, v = u, v 3) u, v = v , u 4) Cauchy seq u1 , u2 , in H , lim un H n The elements of H will be called kets, and kets, will be denoted by label A Qubit is a quantum system whose state is represented by a Ket lying in a 2-D Hilbert 2Space H 3 Superposition of States A typical Qubit is In de ci siv e Collapse of the Wave Function Collapse Qubit ??? 0 0 + 0 1 = Observer W ho os h = 0 0 + 1 1 2 where 0 + 1 = 1 2 !!! The above Qubit is in a Superposition of states 0 1 and It is simultaneously both 0 and 1 !!! i Kets as Column Vectors over Let Tensor Product of Hilbert Spaces The tensor product of two Hilbert spaces and K is the simplest Hilbert space such that the map ( h, k ) h k is bilinear, i.e., such that H = Pr ob |a | i2 be a 2-D Hilbert space with orthonormal basis H 0, 1 In this basis, each ket can be thought of as a column vector. For example, H K H K 1 0 = 0 and 0 1 = 1 And in general, we have = a 0 + b 1 = a + b = 1 0 b 0 1 a ( h1 + h2 ) k = h1 k + h2 k h ( k1 + k2 ) = h k1 + h k2 ( h) k = h ( k ) We define the action of on H K as ( h k ) ( h) k = h ( k ) In other words, H K is constructed in the simplest nontrivial way such that: Kronecker (Tensor) Product of Matrices ( h1 + h2 ) k = h1 k + h2 k h ( k1 + k2 ) = h k1 + h k2 ( h) k = h ( k ) ( h k ) , The Kronecker(tensor) product is defined as: a 11 A B = a 21 b1 1 b21 b11 b21 b1 2 b22 b1 2 b22 b1 1 a12 b21 b1 1 a 22 b21 b12 b22 b1 2 b22 a A = 11 a21 a12 a22 and b B = 11 b21 b12 b22 a11b11 a b = 11 21 a21b11 a b 21 21 a11b12 a11b22 a21b12 a21b22 a12b11 a12b21 a22b11 a22b21 a12b12 a12b22 a22b12 a22b22 4 So Representing Integers in Quantum Computation Let H 2 be a 2-D Hilbert space with orthonormal basis 1 0 01 = 0 1 = 0 1 = 0 1 0 0 1i 1 1 = = 0 0 0i 0 1 0,1 Then H = 0 H 2 is a 2n-D Hilbert space with induced orthonormal basis n 1 0 00 , 0 01 , 0 10 , 0 11 , 1 11 b1 b0 where we are using the convention bn 1bn 2 b1b0 = bn 1 bn 2 Representing Integers in Quantum Computation So in the Hilbert orthonormal basis 2n-D Indexing Convention for Matrices The indices of matrices start at 0, not 1. For example, in H space with induced 0 00 , 0 01 , 0 10 , 0 11 , 1 11 with binary H2 H2 H2 we represent the integer expansion n 1 m m = j = 0 m j 2 j , m j = 0 or 1, j m = mn 1 mn 2 23 = 010111 m1m0 as the ket For example, 0 index = 0 0 index = 1 0 index = 2 0 1 0 0 index = 3 5 = 101 = = 1 0 1 0 index = 4 1 index = 5 0 index = 6 0 index = 7 The Qubit Village Qubitville Kets Each in Massive Parallelism 1 , 2 , n Example. For j = 1, 2, , n , let j = H1 , H2 , n , Hn n Then 1 2 n = 0 + 1 2 j =1 0 +1 2 The Qubits in Qubit Village collectively live in H1 H2 Hn = H j=1 1 = ( 0 + 1 )( 0 + 1 ) 2 n n (0 +1) j The populace of Qubit Village is P o p u la ce = 1 2 n H j=1 n 1 = ( 00 0 + 00 1 + + 11 1 +) 2 j Other names for the populace of Qubit Village Populace = 1 2 n = 1 2 n 1 = a 2 a=0 Therefore, the n-qubit register contains all n-bit binary numbers simultaneously ! n 2n 1 5 But ! ! ! 1 2 sh oo h W ! Observer Activities in Quantum Village All activities in Quantum Village are Unitary transformations At time At time U n Pr ob =1 /2 n t=0 0 1 t=1 H T U where a unitary transformation is one such that H a U U = I = UU T Another Activity in Quantum Village Measurement Measurement Connecting Quantum Village To the Classical World Measurement Group of Friendly Physicists Another Activity in Quantum Village Measurement Observables ??? What does our observer actually observe ? Observables = Hermitian Operators H H where Group of OA Angry Physicists O A = OA T 6 Observables (Cont.) What does our observer actually observe ? ??? Observables (Cont.) What does our observer observe ? The state of an n-Qubit register can be written in the eigenket basis as ??? Let i be the eigenkets of OA, and let a i denote the corresponding eigenvalues , i.e., = i i i 2 OA i = ai i Caveat: We only consider observables whose Caveat: eigenkets form an orthonormal basis of So with probability pi = i , the observer observes the eigenvalue ai , and H i sh oo h W ! Example: Pauli Spin Matrices Consider the following observables, called the Pauli Spin matrices: 0 1 0 i 1 0 Measurement Example Consider a 2-D quantum system in state 2 = a 0 + b 1 , where a 2 + b 2 = 1 What happens if we measure First express 1 = , 2 = i 0 , 3 = 0 1 1 0 0 i i 0 *T T which can readily be checked to be Hermitian. Hermitian. E.g., 2 = 0 i 0 i = = i 0 = 2 i 0 w.r.t. observable 1 ? w.r.t. terms in of the eigenket basis of 1 The respective eigenvalues and eigenkets of these matrices are listed in the table below Thus, if a + b 0 + 1 a b 0 1 = + 2 2 2 2 Eigenvalue 1 ( 0 + 1 )/ 2 (0 1 )/ 2 2 ( 0 + i 1 )/ 2 (0 i 1 )/ 2 is observed w.r.t. , either w.r.t. 1 2 +1 3 0 1 Possibility0 Prob = a + b / 2 1 a 0 = + 1 is meas. ( 0 + 1 )/ 2 Eigenvalue or Possibility1 Prob = a b / 2 2 a1 = 1 is meas. ( 0 1 )/ 2 Eigenvalue Important Feature of Quantum Mechanics It is important to mention that: The No-Cloning Theorem NoDieks, Wootters, Zurek Dieks, Wootters, We cannot completely control the outcome of quantum measurement In Copying Machine Out 7 The No Cloning Theorem Definition. Let be a Hilbert space. Then Definition. a quantum replicator consists of an auxiliary Hilbert space H , a fixed state A # H A (called the initial state of the replicator), and a unitary transformation replicator), H The No Cloning Theorem Cloning is: # ( a 0 +b 1 ) blank @ ( a 0 + b 1 )( a 0 + b 1 ) U : HA H H HA H H such that, for some fixed state blank H , for (called the replicator state after replication of a ) depends on a . U # a blank = a a a all states a H , where a H A Cloning is NOT: NOT: # ( a 0 + b 1 ) blank @ ( a 00 + b 11 ) The No Cloning Theorem Key Idea Cloning is inherently non-linear non Quantum mechanics is inherently linear Ergo, quantum replicators do not exist Ergo, Introduction to Quantum Entanglement A Illustration of the Weirdness of Quantum Mechanics Entangled Qubits Observing Entangled Qubits Observe Only the Blue Qubit 0 0 Not Entangled Separate Unitary Transf 0 1 1 0 2 =1 /2 Pr ob U o ob P Pr 0 1 1 0 2 Entangled Not Separate ! / /2 =1 Whoosh ! 0 1 1 0 No Longer Entangled Separate Identity 8 EPR Pair EPR Pair 0 1 1 0 2 0 1 1 0 2 Einstein Podolsky Einstein Rosen Podolsky Something is Missing from Quantum Mechanics. There Must Exist Hidden Variables Hidden Variable Theory Bah ! Humbug ! vs Bah ! Humbug ! Bell Inequalities Aspect Experiment Rosen Quantum Mechanics Score So Far HVT Score = 0 QM Score = 1 Why did Einstein Podolsky Rosen Object So Vehemently ? Forces of Nature Are Local Interactions Hello ! Spacelike Distance Can t Hear Can You !! ?? All the forces of nature (i.e., gravitational, electromagnetic, weak, & strong forces) are local interactions. Spacelike Distance Mediated by another entity, e.g., gravitons, photons, etc. Propagate no faster than the speed of light c Strength drops off with distance ( x, y, z, t ) P1 Dist ( P1 , P2 ) > c T t ( X ,Y , Z , T ) P2 No signal can travel between spacelike regions of space Ergo, spacelike regions of space are physically independent, i.e., one cannot influence the other. independent, 9 Blue Qubit Meaurement of EPR Pair Red Qubit Alpha Centauri No Local Interaction ! ( 01 10 ) / Spacelike Distance 2 No force of any kind Acts instantaneously - Faster than light - Not mediated by anything Meas. Blue Qubit Instantly, Both Qubits Are Determined ! Strength does not drop off with distance - Full strength at any distance Yet, still consistent with General Relativity ! =1 /2 b ob P Pr Pr ob 2 /2 = =1 0 1 1 0 Properties of Qubits Useful for Quantum Computation Quantum Entanglement Appears to Pinpoint the Weirdness of Quantum Mechanics Properties of Quantum Properties of States Computer Data Qubits can exist in a superposition of states Qubits can be entangled Quantum States Actions onComputer Instructions Qubits collapse upon measurement collapse Qubits are transformed by unitary transformations An Application of Quantum Entanglement OxfordTeleportationDictionary Unabridged ? Teleportation: Transfering an object between Teleportation: two locations by a process of: Dissociation to obtain info Quantum Teleportation Information Transmission Reconstruction from info - Scanned to extract suff. Info. to suff. recreate original Net Effects: Effects: Destruction of original object Creation of an exact replica at the intended destination. - Exact replica is re-assembled at destination reout of locally available material 10 Asked Scotty about Teleportation Asked Scotty about Teleportation Aye, Aye, Captain ! Beam me up, Scotty ! I m just a wee bit busy. 11 More Dirac Notation Hilbert Space of morphisms from H to More Dirac Notation Let H * = Hom ( H , ) H* We call the elements of denote them as Bra s, and Bra label 12 More Dirac Notation There is a dual correspondence between t Ke Bra s as Row Vectors over Bra H * and H There exists a bilinear map defined by H H ( 1 )( 2 ) * Br a Let H be a 2-D Hilbert space with 2orthonormal basis 0 , 1 and let be the corresponding dual Hilbert space with corresponding dual basis H * = Hom ( H , 0,1 ) which we more simpy denote by Then with respect to this basis, we have 1 | 2 Bra-c-Ket Bra Bra- Ket 0 = ( 1,0 ) and 1 = ( 0,1) 0 a + 1 b = ( a, b ) Bra s & Ket s as Adjoints of One Another Bra Ket The dual correspondence If H H * is given by 1 = a 0 + b 1 2 = c 0 + d 1 then the bracket product becomes a b = a 0 + b 1 0 a + 1 b = ( a, b ) 1 | 2 = ( 0 a + 1 b )( c 0 + d 1 c = ( a , b )i = ac + bd d ) and is called the adjoint 1 2 If As a Matrix Outerproduct 1 = a 0 + b 1 2 = c 0 + d 1 Let basis H be an N-D Hilbert space with orthonormal N0 , 1 , , N 1 then 1 2 H is the linear transformation If we use the convention that matrix indices begin at 0, then the matrix of the linear transformation mk is an NxN matrix consisting of all zeroes with the exception of entry (m,k) which is 1 m,k) For example if N=4, then N=4, Entry (2,3) 1 2 H 1 2 | which, when written in matrix notation, becomes the matrix outerproduct 1 2 = i ( c , d ) = b bc bd a ac ad 0 0 2 3 = 0 0 0 0 0 0 0 0 0 0 1 0 0 0 13 Two Ways to Represent Quantum States Density Operators & Mixed Ensembles Kets & Density Operators Two Ways to Represent Quantum States Example. We have seen pure ensembles, i.e., Example. ensembles, pure states, such as Ket Prob Two Ways to Represent Quantum States Example. Consider the following state for Example. which we have incomplete knowledge, called a mixed ensemble: ensemble: Ket Prob where 1 1 p1 2 p2 k pk All unit Length & not nec. nec. Problem. Certain types of quantum states Problem. are difficult to represent in terms of kets p1 + p2 + + pk = 1 Two Ways to Represent Quantum States Ket Prob Two Ways to Represent Quantum States If for example, 1 p1 2 p2 k pk Mixed Ensemble =a 0 +b1 where Johnny von Neumann suggested that we use the following operator to represent a state: = p1 1 1 + p2 2 2 + + pk k k is called a density operator. It is a Hermitian operator. positive definite operator of trace 1. For the pure ensemble Ket a + b =1 2 2 then = (a 0 + b 1 )( 0 a + 1 b) ab 2 b 1 , Prob = 1i a2 a = (a b) = ba b 14 Two Ways to Represent Quantum States On the other hand, Quantum Mechanics from the Two Perspectives = 4 p1 3/8 3i /8 3 0 i 1 0 + i 1 1 + 1 1 = 2 2 4 3i /8 5/8 Kets Density Ops 1 1 1 p2 i 2 2 2 2 = 1 =H t i = [H, ] t Schroed. Schroed. Eq. Eq. Unitary Evolution Observation is the mixed ensemble Ket = 0 i 1 0 U 0 0 U 0U ( )/ A = | A| A =trace( A ) Prob 3 4 1 4 Density Operators We now have a more powerful way of representing quantum states. Density operators are absolutely crucial when discussing and dealing with quantum noise and quantum decoherence. decoherence. The End Quantum Computation: A Grand Mathematical Mathematical Challenge for the Twenty-First Century Century and the Millennium, Samuel J. Lomonaco, Jr. (editor), AMS PSAPM/58, (2002). Quantum Computation and Information, Samuel J. Lomonaco, Jr. and Howard E. Brandt (editors), AMS CONM/305, (2002). 15
Find millions of documents here - Study Guides, Homework Solutions, Papers, Exam Answer Keys and more. Course Hero has millions of course related materials that will enable you to learn better, faster and get an A in all your courses.
Below is a small sample set of documents:

UMBC >> CSEE >> 2003 (Fall, 2008)
Quantum Computing Dept. of Comp. Sci. & Electrical Engineering Sci. University of Maryland Baltimore County Baltimore, MD 21250 Email: Lomonaco@UMBC.EDU WebPage: http:/www.csee.umbc.edu/~lomonaco WebPage: http:/www.csee.umbc.edu/~lomonaco Samuel J. ...
UMBC >> CSEE >> 2003 (Fall, 2008)
Quantum Computing Dept. of Comp. Sci. & Electrical Engineering Sci. University of Maryland Baltimore County Baltimore, MD 21250 Email: Lomonaco@UMBC.EDU WebPage: http:/www.csee.umbc.edu/~lomonaco WebPage: http:/www.csee.umbc.edu/~lomonaco Samuel J. ...
UMBC >> CSEE >> 2003 (Fall, 2008)
Quantum Computing Dept. of Comp. Sci. & Electrical Engineering Sci. University of Maryland Baltimore County Baltimore, MD 21250 Email: Lomonaco@UMBC.EDU WebPage: http:/www.csee.umbc.edu/~lomonaco WebPage: http:/www.csee.umbc.edu/~lomonaco Samuel J. ...
UMBC >> CSEE >> 2006 (Fall, 2008)
Quantum Computing ? Quantum Computing Dept. of Comp. Sci. & Electrical Engineering Sci. University of Maryland Baltimore County Baltimore, MD 21250 Email: Lomonaco@UMBC.EDU WebPage: http:/www.csee.umbc.edu/~lomonaco WebPage: http:/www.csee.umbc.edu/...
UMBC >> CSEE >> 2006 (Fall, 2008)
Quantum Computing ? Overview Four Talks A Rosetta Stone for Quantum Computation Quantum Algorithms & Beyond Distributive Quantum Computing Topological quantum Computing and the A Quantum Computing Knot Theoretic Mystery - Can be found on my we...
UMBC >> CSEE >> 2006 (Fall, 2008)
Overview Four Talks A Rosetta Stone for Quantum Computation Quantum Algorithms & Beyond Distributed Quantum Computing Topological quantum Computing and the A Quantum Computing Knot Theoretic Mystery I.S.I., Torino, Italy Torino, Jones Polynomi...
UMBC >> CSEE >> 2006 (Fall, 2008)
Overview Four Talks atica Inform i Per Can A Rosetta Stone for Quantum Computation Quantum Algorithms & Beyond Distributive Quantum Computing Topological quantum Computing and the A Quantum Computing Knot Theoretic Mystery - Can be found on my...
UMBC >> CSEE >> 2008 (Fall, 2008)
Quantum Knots ? Quantum Knots & Mosaics University of Maryland Baltimore County (UMBC) Email: Lomonaco@UMBC.edu WebPage: www.csee.umbc.edu/~lomonaco WebPage: Samuel Lomonaco L-O-O-P This talk was motivated by a number of papers This talk is based...
UMBC >> CS >> 653 (Spring, 2001)
CMSC 442/653: Introduction to Coding Theory Tentative Syllabus Instructor: Professor Samuel J. Lomonaco Office: ITE 222. Email: Lomonaco@umbc.edu Optional Text: Error-Correcting Codes by W. Wesley Peterson and E.J. Weldon, Jr. MIT Press (1996) ISBN 0...
UMBC >> CS >> 653 (Spring, 2001)
CMSC 442/653 Spring 2009 Instructor: Dr. Lomonaco Homework 1 Listening Assignment: Listen to Beethovens 5-th symphony. Reading Assignment: http:/www.cs.umbc.edu/~lomonaco/s06/652/slides/Equilateral-Triangle.pdf Optional Reading assignment: Peterso...
UMBC >> CSEE >> 643 (Spring, 2004)
Quantum Measurement with Kets Observable MacroWorld O In Physical Reality Philosopher Turf BlackBox Quantum World j Out Eigenvalue Prob= Pj Pj Q. Sys. State j = Pj Q. Sys. State where O = j j P j Spectral Decomposition Quantum...
UMBC >> CS >> 643 (Spring, 2004)
> with(linalg): with(group): Warning, the protected names norm and trace have been redefined and unprotected > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > > kr:=proc(A,B) # This procedure co...
UMBC >> CS >> 203 (Fall, 2005)
CMSC 203: Discrete Structures Tentative Syllabus Instructor: Professor Samuel J. Lomonaco Office: ITE 222. Email: Lomonaco@umbc.edu Required Text: \"Discrete Mathematics with Applications,\" by Susanna S. Epp PWS Publishing Company 20 Park Plaza, Bosto...
UMBC >> CS >> 203 (Fall, 2005)
Fall 2007 textbook Subject: Fall 2007 textbook From: \"UMBC Bookstore Textbook Department\" <textbook@umbc.edu> Date: Thu, 9 Aug 2007 14:52:08 -0400 (EDT) To: lomonaco@umbc.edu Professor Lomonaco, I am writing to inform you that the textbook you selec...
UMBC >> CS >> 203 (Fall, 2005)
CMSC 203 Discrete Structures Tentative Syllabus Spring 2007 Instructor: Professor Samuel J. Lomonaco Office: ITE 222. Email: Lomonaco@umbc.edu Required Text: \"Discrete Mathematics with Applications,\" by Susanna S. Epp PWS Publishing Company 20 Park P...
UMBC >> CS >> 203 (Fall, 2005)
CMSC 203 Discrete Structures Tentative Syllabus Fall 2005 Instructor: Professor Samuel J. Lomonaco Office: ITE 222. Email: Lomonaco@umbc.edu Required Text: Kenneth H. Rosen, Discrete Mathematics and its Applications, Fifth Edition, Mc-Graw Hill, ISBN...
UMBC >> CSEE >> 441 (Fall, 2003)
...
UMBC >> CS >> 641 (Fall, 2000)
u u t s r n | s y ~ y s ~ | x w v u t o s r q p o n ~ } | v v s y x v u t o s r { { n z s y x w v u t o s r q p o n m l k d j j i h g f e d ...
UMBC >> CS >> 653 (Spring, 2001)
THE MACWILLIAMS AND PLESS IDENTITIES: A SUMMARY PROFESSOR SAMUEL J. LOMONACO Abstract. We give a brief summary of the MacWilliams and Pless Identies 1. Summary Given the weight distribution of a linear code V , the MacWilliams and Pless identities p...
UMBC >> CS >> 653 (Spring, 2001)
...
UMBC >> CS >> 653 (Spring, 2001)
...
UMBC >> CS >> 653 (Spring, 2001)
AN EXAMPLE OF THE BCH CODE DECODING ALGORITHM LECTURE NOTES BY DR. SAMUEL J. LOMONACO Abstract. We give a simple example of the BCH code decoding algorithm. Let GF 24 = GF (2) [x] / (p(x), where p(x) is the primitive polynomial p(x) = x4 + x + 1, a...
UMBC >> CS >> 441 (Spring, 1995)
CMSC 441 Section 0201: Design and Analysis of Algorithms Tentative Syllabus Spring 2008 Instructor: Professor Samuel Lomonaco Contact Information: Office: ITE 222 Office Hours: M/W 5:15 PM - 6:15 PM. Email: Lomonaco (AT) UMBC (DOT) EDU WebPage: http:...
UMBC >> CS >> 653 (Spring, 2001)
? Group = Symmetry Samuel J. Lomonaco, Jr. Dept. of Comp. Sci. & Electrical Engineering University of Maryland Baltimore County Baltimore, MD 21250 Email: Lomonaco@UMBC.EDU WebPage: http:/www.csee.umbc.edu/~lomonaco Defense Advanced Research Projec...
UMBC >> CS >> 653 (Spring, 2001)
10 ...
UMBC >> CS >> 652 (Fall, 1994)
Tentative Syllabus CMSC 652 Cryptography and Data Security Spring Semester 2006 Instructor: Dr. Lomonaco 1. Classical cryptography 2. Abstract algebra: Groups, rings, fields 3. Linear feedback shift registers 4. Shannon theory, i.e., information theo...
UMBC >> CS >> 655 (Spring, 2000)
FPVF 9<8 Qxphulfdo Frpsxwdwlrq Vsulqj Vhphvwhu 5333 V|oodexv Wkh v|oodexv frqvlvwv ri wkh iroorzlqj pdwhuldo iurp wkh frxuvh wh{w/ Dwnlq0 +vhfrqg hgl0 vrq/ Nhqgdoo H/ Dq wlrq,/ Mrkq Zloh| +4<;<,1 Lqwurgxfwlrq wr Qxphulfdo Dqdo|vlv/ Fkdswhu 4 Fkds...
UMBC >> CS >> 655 (Spring, 2000)
FPVF 988 Surmhfw Wkh Vn|glylqj Frpsxwhu Kdfnhu*v Glohppd Lqvwuxfwru= Gu1 Orprqdfr Dsulo 4;/ 5333 [/ zkr kdv mxvw frpsohwhg FPVF 988/ ghflghg wkdw rqh jrrg zd| wr fhoheudwh wkh rffdvlrq zrxog eh wr wu| rxw vn|glylqj1 D iulhqg \\ judflrxvo| ordqv [ wkh...
UMBC >> CS >> 655 (Spring, 2000)
FPVF 988 Surmhfw Wkh Vn|glylqj Frpsxwhu Kdfnhu*v Glohppd Lqvwuxfwru= Gu1 Orprqdfr Dsulo 4;/ 5333 [/ zkr kdv mxvw frpsohwhg FPVF 988/ ghflghg wkdw rqh jrrg zd| wr fhoheudwh wkh rffdvlrq zrxog eh wr wu| rxw vn|glylqj1 D iulhqg \\ judflrxvo| ordqv [ wkh...
UMBC >> CS >> 691 (Spring, 2000)
Krphzrun 4 FPVF 9<4U Txdqwxp Frpsxwdwlrq Gxh= Prqgd|/ Iheuxdu| 54/ 5333 4 Ohw Sureohp 41 T eh d txdqwxp v|vwhp zlwk vwdwh jlyhq e| wkh nhw= Zkdw lv wkh uhvxow ri phdvxulqj s ml @ +m33l . l m34l m44l, @ 6 T ! 3 3 4 l \" . 3 l R @ - 3 l 3 4 . +4 ...
UMBC >> CS >> 691 (Spring, 2000)
Dqvzhuv wr Krphzrun 4 FPVF 9<4U Txdqwxp Frpsxwdwlrq 4 Ohw Sureohp 41 T eh d txdqwxp v|vwhp zlwk vwdwh jlyhq e| wkh nhw= Zkdw lv wkh uhvxow ri phdvxulqj s ml @ +m33l . l m34l m44l, @ 6 T ! 3 3 4 l \" . 3 l R @ - 3 l 3 4 . +4 3, l 4 3 3 zlwk uhv...
UMBC >> CS >> 691 (Spring, 2000)
Krphzrun 5 FPVF 9<4U Txdqwxp Frpsxwdwlrq 4 Sureohp 41 Jlyhq wkdw 41 Dolfh dqg Ere duh vhsdudwhg e| d juhdw glvwdqfh 51 Dolfh krogv dw khu orfdwlrq d txelw odehohg e| D 61 Ere krogv dw klv orfdwlrq d txelw odehohg e| E 71 Xqnqrzq wr Dolfh dqg Ere/ wk...
UMBC >> CS >> 691 (Spring, 2000)
Dqvzhuv wr Krphzrun 5 FPVF 9<4U Txdqwxp Frpsxwdwlrq 4 Sureohp 41 Jlyhq wkdw 41 Dolfh dqg Ere duh vhsdudwhg e| d juhdw glvwdqfh 51 Dolfh krogv dw khu orfdwlrq d txelw odehohg e| D 61 Ere krogv dw klv orfdwlrq d txelw odehohg e| E 71 Xqnqrzq wr Dolfh ...
UMBC >> CS >> 691 (Spring, 2000)
Homework 3 CMSC 691R Quantum Computation 1 Problem 1. Read [1]. Then in your own words write up a complete proof of the no-deleting theorem proven within the paper. Feel free to add your own comments and insights about what you have learned. Refe...
UMBC >> CS >> 691 (Spring, 2000)
Krphzrun 7 FPVF 9<4U Txdqwxp Frpsxwdwlrq Gu1 Orprqdfr Dsulo 4;/ 5333 4 Hqwdqwdjohphqw vzdsslqj sureohpv Ohw A\" A! @ 4 s 5 A +4, \" me\" ! l . \" e e e! = e\" > e! 5 i3> 4j @GC A# A\" A! @ 4 s 5 A +4, # mA# e\" e! l...
UMBC >> CS >> 691 (Spring, 2000)
Krphzrun 7 FPVF 9<4U Txdqwxp Frpsxwdwlrq Gu1 Orprqdfr Dsulo 4;/ 5333 4 Hqwdqwdjohphqw vzdsslqj sureohpv Ohw A\" A! @ 4 s 5 A +4, \" me\" ! l . \" e e e! = e\" > e! 5 i3> 4j @GC A# A\" A! @ 4 s 5 A +4, # mA# e\" e! l...
UMBC >> CS >> 691 (Spring, 2000)
FPVF 9<4T H[HUFLVHV ZLWK EUDV DQVG NHWV GU1 ORP RQDFR Ohw K eh d Kloehuw vsdfh zlwk rwkrqrupdo edvlv dqg ohw N eh d Kloehuw vsdfh zlwk rwkrqrupdo edvlv imdl > mel > mflj K dv d froxpq yhfwru1 N dv d froxpq yhfwru im!l>m\"l>m#l>m$lj / +4, Uhsuhvhqw...
UMBC >> CS >> 691 (Spring, 2000)
FPVF 9<4T TXDQWXP WHOHSRUWDWLRQ H[HUFLVHV GU1 ORP RQDFR +4, Lqglfdwh lq ghwdlo krz Dolfh fdq xvh wkh vwdqgdu whohsruwdwlrq surwrfro wr whohsruw d txelw lq wkh vwdwh ml @ +7 . 6l, m3l . +7 6l, m4l 58 wr Ere1 Vkrz doo lqwhuphgldwh vwdwhv/ dqg dovr ...
UMBC >> CS >> 691 (Spring, 2000)
...
UMBC >> CS >> 691 (Spring, 2000)
...
UMBC >> CS >> 691 (Spring, 2000)
H{huflvh 6 FPVF 9<4T Txdqwxp Frpsxwdwlrq Gu1 Orprqdfr 4 Sureohp 41 Wkhq lq |rxu rzq zrugv zulwh xs d frpsohwh surri ri wkh qr0ghohwlqj Ihho iuhh wr dgg |rxu rzq frpphqwv dqg Uhdg ^4`1 wkhruhp suryhq zlwklq wkh sdshu1 lqvljkwv derxw zkdw |rx kdyh...
UMBC >> CS >> 691 (Spring, 2000)
H{huflvh 7 FPVF 9<4T Txdqwxp Frpsxwdwlrq Gu1 Orprqdfr 4 Hqwdqwdjohphqw vzdsslqj sureohpv Ohw @GC A\" A! @ 4 s 5 A +4, \" me\" ! l . \" e e\" e! e e! = e\" > e ! 5 i3>4j A# A\" A! @ 4 s 5 A +4, # mA# l . e# e\" e! = e# >...
UMBC >> CS >> 203 (Fall, 2005)
Lets get started with. Logic! Fall 2002 CMSC 203 - Discrete Structures 1 Logic Crucial for mathematical reasoning Used for designing electronic circuitry Logic is a system based on propositions. A proposition is a statement that is either tr...
UMBC >> CS >> 203 (Fall, 2005)
Lets proceed to Mathematical Reasoning Fall 2002 CMSC 203 - Discrete Structures 1 Mathematical Reasoning We need mathematical reasoning to determine whether a mathematical argument is correct or incorrect and construct mathematical arguments. ...
UMBC >> CS >> 203 (Fall, 2005)
PROOF BY CONTRADICTION proof by contradiction Let r be a proposition. A proof of r by contradiction consists of proving that not(r) implies a contradiction, thus concluding that not(r) is false, which implies that r is true. proof by contradiction ...
UMBC >> CS >> 203 (Fall, 2005)
and now for something completely different Set Theory Actually, you will see that logic and set theory are very closely related. Fall 2002 CMSC 203 - Discrete Structures 1 Set Theory Set: Collection of objects (elements) aA aA a is an element o...
UMBC >> CS >> 203 (Fall, 2005)
and the following mathematical appetizer is about Functions Fall 2002 CMSC 203 - Discrete Structures 1 Functions A function f from a set A to a set B is an assignment of exactly one element of B to each element of A. We write f(a) = b if b is the ...
UMBC >> CS >> 203 (Fall, 2005)
and now for Sequences Fall 2002 CMSC 203 - Discrete Structures 1 Sequences Sequences represent ordered lists of elements. A sequence is defined as a function from a subset of N to a set S. We use the notation an to denote the image of the integer ...
UMBC >> CS >> 203 (Fall, 2005)
Enough Mathematical Appetizers! Let us look at something more interesting: Algorithms Fall 2002 CMSC 203 - Discrete Structures 1 Algorithms What is an algorithm? An algorithm is a finite set of precise instructions for performing a computation or f...
UMBC >> CS >> 203 (Fall, 2005)
Let us get into Number Theory Fall 2002 CMSC 203 - Discrete Structures 1 Introduction to Number Theory Number theory is about integers and their properties. We will start with the basic principles of divisibility, greatest common divisors, le...
UMBC >> CS >> 203 (Fall, 2005)
Properties of the gcd Theorem: For any two integers a,b there exist integers x,y such that xa + yb = gcd(a,b). A proof will not be given at this point. However, x,y can be found by applying the Euclidean algorithm to a and b, and then, working from t...
UMBC >> CS >> 203 (Fall, 2005)
Follow me for a walk through. Mathematical Induction Fall 2002 CMSC 203 - Discrete Structures 1 Induction The principle of mathematical induction is a useful tool for proving that a certain predicate is true for all natural numbers. It cannot be...
UMBC >> CS >> 203 (Fall, 2005)
THE WELL ORDERING PROPERTY Definition: Let B be a set of integers. An integer m is called a least element of B if m is an element of B, and for every x in B, mx. Example: 3 is a least element of the set {4,3,5,11}. Example: Let A be the set of all po...
UMBC >> CS >> 203 (Fall, 2005)
One, two, three, were Counting Fall 2002 CMSC 203 - Discrete Structures 1 Basic Counting Principles Counting problems are of the following kind: How many different 8-letter passwords are there? How many possible ways are there to pick 11 soccer pla...
UMBC >> CS >> 203 (Fall, 2005)
Combinations with repetitions allowed Red, green and blue cubes are given. There are at least five cubes of each of the above colors. In how many ways can a selection of five cubes be made, such that selecting zero or more cubes of the same color is...
UMBC >> CS >> 203 (Fall, 2005)
How many rows , each one consisting of 3 As 1 B, and 4 Cs are there? (Here are some such rows: BACCCAAC ABCACACC CCCCAAAB Etc.) Answer: (3+1+4)! / (3!1!4!). Counting Permutations When Indistinguishable Objects May Exist In general: k distinct types...
UMBC >> CS >> 203 (Fall, 2005)
Now its Time for Recurrence Relations Fall 2002 CMSC 203 - Discrete Structures 1 Recurrence Relations A recurrence relation for the sequence {an} is an equation that expresses an is terms of one or more of the previous terms of the sequence, nam...
UMBC >> CS >> 203 (Fall, 2005)
You Never Escape Your Relations Fall 2002 CMSC 203 - Discrete Structures 1 Relations If we want to describe a relationship between elements of two sets A and B, we can use ordered pairs with their first element taken from A and their second element...
UMBC >> CS >> 203 (Fall, 2005)
Now its time to look at Discrete Probability CMSC 203 Discrete Structures 1 Discrete Probability Everything you have learned about counting constitutes the basis for computing the probability of events to happen. In the following, we will use th...
UMBC >> CS >> 203 (Fall, 2005)
Let us switch to a new topic: Graphs CMSC 203 - Discrete Structures 1 Introduction to Graphs Definition: A simple graph G = (V, E) consists of V, a nonempty set of vertices, and E, a set of unordered pairs of distinct elements of V called edges. Fo...
UMBC >> CS >> 203 (Fall, 2005)
Yes, No, Maybe. Boolean Algebra Fall 2002 CMSC 203 - Discrete Structures 1 Boolean Algebra Boolean algebra provides the operations and the rules for working with the set {0, 1}. These are the rules that underlie electronic circuits, and the methods...
UMBC >> CS >> 203 (Fall, 2005)
CMSC 203 Section 0301 Fall 2007 Homework 1 Reading Assignment: Listen to Beethovens 5-th symphony Read Chapter 5 of Epp Homework: Exercise Set 5.1, #8, page 267 Exercise Set 5.1, #11, page 267 Exercise Set 5.1, #19bc, page 268 Exercise Set 5.1,...
UMBC >> CS >> 203 (Fall, 2005)
CMSC 203 Section 0301 Fall 2007 Homework 2 Reading Assignment: Listen to an aria of Luciano Pavarotti Read Chapter 1 of Epp For those who would like to read ahead, read Chapter 2 of Epp Homework: Exercise Set 1.1, #8bce, page 15 Exercise Set 1.1...
UMBC >> CS >> 203 (Fall, 2005)
CMSC 203 Section 0301 Fall 2007 Homework 3 Reading Assignment: Listen to Vivaldis Le Quattro Stagioni (The Four Seasons) Read Chapter 2 of Epp For those who would like to read ahead, read Chapter 3 of Epp Homework: Exercise Set 1.3, #9, page 41 ...
UMBC >> CS >> 203 (Fall, 2005)
CMSC 203 Section 0301 Fall 2007 Homework 4 Reading Assignment: Listen to Igor Stravinskys Firebird Read Chapter 3 of Epp For those who would like to read ahead, read Chapter 4 of Epp Homework: Exercise Set 3.1, #27, page 140 Exercise Set 3.1, #4...
UMBC >> CS >> 203 (Fall, 2005)
CMSC 203 Homework 5 Reading Assignment: Listen to Gilbert & Sullivans Pirates of Penzance (or see the movie.) Read Chapter 4 of Epp Homework: Exercise Set 3.6, #9, page 178 Exercise Set 3.6, #18, page 179 Exercise Set 4.1, #25, page 214 Exercis...
UMBC >> CS >> 203 (Fall, 2005)
CMSC 203 Fall Semester 2007 Homework 6 Reading Assignment: To commemorate Halloween, listen to Danse Macabre by Camille Saint-Saens Read Chapter 4 of Epp Homework: Exercise Set 4.3, #5, page 233 Exercise Set 4.3, #9, page 233 Exercise Set 4.3, #...
UMBC >> CS >> 203 (Fall, 2005)
CMSC 203 SECTION 0301 FALL 2007 ANSWER TO HOMEWORK 6, NUMBER 28, PAGE 234 INSTRUCTOR: DR. LOMONACO 1. Two ways to answer Homework 6, Exercise 4.3, Number 28, Page 234 Statement of the problem: Prove that for all integers n 1, 1+3 1+3+5 1 + 3 + +...
UMBC >> CS >> 203 (Fall, 2005)
CMSC 203 Fall Semester 2007 Homework 7 Reading Assignment: Listen to Eine Kleine Nachmusik by Mozart Read Chapter 10 of Epp Homework: Exercise Set 10.1, #2, page 582 Exercise Set 10.1, #7, page 582 Exercise Set 10.1, #8cd, page 582 Exercise Set...
UMBC >> CS >> 203 (Fall, 2005)
CMSC 203 Fall Semester 2007 Homework 8 Reading Assignment: In celebration of the last homework assignment, listen to Tchaikovskys 1812 Overture. Read Chapter 7 of Epp, pages 389-419 and pages 431-442. Read Chapter 10 of Epp, pages 571-623. Homewor...
What are you waiting for?