The Shifting Paradigm of Quantum Computing Presented at the Nov 2005 Annual Dallas Mensa Gathering By Douglas Matzke, Ph.D.

Slides:



Advertisements
Similar presentations
Department of Computer Science & Engineering University of Washington
Advertisements

Quantum Computation and Quantum Information – Lecture 2
Quantum Computation and Quantum Information – Lecture 3
Puzzle Twin primes are two prime numbers whose difference is two.
Quantum Computing MAS 725 Hartmut Klauck NTU
Quantum Computing MAS 725 Hartmut Klauck NTU
Quantum Phase Estimation using Multivalued Logic.
Quantum Speedups DoRon Motter August 14, Introduction Two main approaches are known which produce fast Quantum Algorithms The first, and main approach.
Chien Hsing James Wu David Gottesman Andrew Landahl.
Quantum Computing Ambarish Roy Presentation Flow.
Quantum Computation and Error Correction Ali Soleimani.
An Algebraic Foundation for Quantum Programming Languages Andrew Petersen & Mark Oskin Department of Computer Science The University of Washington.
Quantum Entanglement David Badger Danah Albaum. Some thoughts on entanglement... “Spooky action at a distance.” -Albert Einstein “It is a problem that.
CSEP 590tv: Quantum Computing
Quantum Computing Joseph Stelmach.
Anuj Dawar.
Memory Hierarchies for Quantum Data Dean Copsey, Mark Oskin, Frederic T. Chong, Isaac Chaung and Khaled Abdel-Ghaffar Presented by Greg Gerou.
1 Recap (I) n -qubit quantum state: 2 n -dimensional unit vector Unitary op: 2 n  2 n linear operation U such that U † U = I (where U † denotes the conjugate.
An Arbitrary Two-qubit Computation in 23 Elementary Gates or Less Stephen S. Bullock and Igor L. Markov University of Michigan Departments of Mathematics.
New Approach to Quantum Calculation of Spectral Coefficients Marek Perkowski Department of Electrical Engineering, 2005.
Quantum Computation and Quantum Information – Lecture 2 Part 1 of CS406 – Research Directions in Computing Dr. Rajagopal Nagarajan Assistant: Nick Papanikolaou.
Quantum Algorithms Preliminaria Artur Ekert. Computation INPUT OUTPUT Physics Inside (and outside) THIS IS WHAT OUR LECTURES WILL.
ROM-based computations: quantum versus classical B.C. Travaglione, M.A.Nielsen, H.M. Wiseman, and A. Ambainis.
Quantum Information Processing
Autonomous Quantum Error Correction Joachim Cohen QUANTIC.
Quantum Computing MAS 725 Hartmut Klauck NTU
Alice and Bob’s Excellent Adventure
October 1 & 3, Introduction to Quantum Computing Lecture 2 of 2 Richard Cleve David R. Cheriton School of Computer Science Institute for Quantum.
1 Business Issues Regarding Future Computers Douglas J. Matzke, Ph.D. CTO of Syngence, LLC Dallas Nanotechnology Focus Group Nov 7,
ANPA 2002: Quantum Geometric Algebra 8/15/2002 DJM Quantum Geometric Algebra ANPA Conference Cambridge, UK by Dr. Douglas J. Matzke Aug.
October 1 & 3, Introduction to Quantum Computing Lecture 1 of 2 Introduction to Quantum Computing Lecture 1 of 2
An Introduction to Quantum Phenomena and their Effect on Computing Peter Shoemaker MSCS Candidate March 7 th, 2003.
Solving mutual exclusion by using entangled Qbits Mohammad Rastegari proff: Dr.Rahmani.
1 hardware of quantum computer 1. quantum registers 2. quantum gates.
You Did Not Just Read This or did you?. Quantum Computing Dave Bacon Department of Computer Science & Engineering University of Washington Lecture 3:
QUANTUM COMPUTING What is it ? Jean V. Bellissard Georgia Institute of Technology & Institut Universitaire de France.
Quantum mechanical phenomena. The study between quanta and elementary particles. Quanta – an indivisible entity of a quantity that has the same value.
DJM Mar 2003 Lawrence Technologies, LLC The Math Over Mind and Matter Doug Matzke and Nick Lawrence Presented at Quantum Mind.
Introduction to Quantum Computing
Quantum Computing Michael Larson. The Quantum Computer Quantum computers, like all computers, are machines that perform calculations upon data. Quantum.
1 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681 Richard Cleve DC 653 Lecture.
Quantum Computing & Algorithms
Multipartite Entanglement and its Role in Quantum Algorithms Special Seminar: Ph.D. Lecture by Yishai Shimoni.
Page 1 COMPSCI 290.2: Computer Security “Quantum Cryptography” including Quantum Communication Quantum Computing.
As if computers weren’t fast enough already…
IPQI-2010-Anu Venugopalan 1 qubits, quantum registers and gates Anu Venugopalan Guru Gobind Singh Indraprastha Univeristy Delhi _______________________________________________.
Quantum Computers The basics. Introduction 2/47 Dušan Gajević.
Quantum Computing Charles Bloomquist CS147 Fall 2009.
An Introduction to Quantum Computation Sandy Irani Department of Computer Science University of California, Irvine.
Quantum Computation Stephen Jordan. Church-Turing Thesis ● Weak Form: Anything we would regard as “computable” can be computed by a Turing machine. ●
DJM Mar 18, 2004 What’s New in Quantum Computation Dallas IEEE Computer Society Presentation Thursday March 18, 2004 By Douglas J. Matzke, PhD Lawrence.
1 Is Quantum Computing a Solution for Semiconductor Scaling? Douglas J. Matzke, Ph.D. CTO of Syngence, LLC Dallas IEEE Computer Society.
1 An Introduction to Quantum Computing Sabeen Faridi Ph 70 October 23, 2007.
Beginner’s Guide to Quantum Computing Graduate Seminar Presentation Oct. 5, 2007.
Quantum Computing Keith Kelley CS 6800, Theory of Computation.
Attendance Syllabus Textbook (hardcopy or electronics) Groups s First-time meeting.
Quantum gates SALEEL AHAMMAD SALEEL. Introduction.
COMPSCI 290.2: Computer Security
Introduction to Quantum Computing Lecture 1 of 2
For computer scientists
A Ridiculously Brief Overview
Introduction to Quantum logic (2)
OSU Quantum Information Seminar
Quantum Computation and Information Chap 1 Intro and Overview: p 28-58
Quantum Ensemble Computing
Quantum Computing Prabhas Chongstitvatana Faculty of Engineering
The Shifting Paradigm of Quantum Computing
The Shifting Paradigm of Quantum Computing
Quantum Computing Joseph Stelmach.
Presentation transcript:

The Shifting Paradigm of Quantum Computing Presented at the Nov 2005 Annual Dallas Mensa Gathering By Douglas Matzke, Ph.D.

DJM Nov 25, 2005 Abstract Quantum computing has shown to efficiently solve problems that classical computers are unable to solve. Quantum computers represent information using phase states in high dimensional spaces, which produces the two fundamental quantum properties of superposition and entanglement. This talk introduces these concepts in plain-speak and discusses how this leads to a paradigm shift of thinking "outside the classical computing box".

DJM Nov 25, 2005 Biography Doug Matzke has been researching the limits of computing for over twenty years. These interests led him to investigating the area of quantum computing and earning a Ph.D. in May In his thirty year career, he has hosted two workshops on physics and computation (PhysComp92 and (PhysComp94), he has contributed to 15 patent disclosures and over thirty papers/talks (see his papers on QuantumDoug.com). He is an enthusiastic and thought provoking speaker.

DJM Nov 25, 2005 Outline Classical Bits Distinguishability, Mutual Exclusion, co-occurrence, co-exclusion Reversibility and unitary operators Quantum Bits – Qubits Orthogonal Phase States Superposition Measurement and singular operators Noise – Pauli Spin Matrices Quantum Registers Entanglement and coherence Entangled Bits – Ebits Bell and Magic States Bell Operator Quantum Algorithms Shor’s algorithm Grover’s Algorithm Quantum Communication Quantum Cryptography Summary

DJM Nov 25, 2005 Classical Bits Alternate vector notations for multiple coins!!!

DJM Nov 25, 2005 Classical Information Distinguishability Definition: Individual items are identifiable Coins, photons, electrons etc are not distinguishable Groups of objects described using statistics Mutual Exclusion (mutex) Definition: Some state excludes another state Coin lands on heads or tails but not both Faces point in opposite directions in vector notation + -

DJM Nov 25, 2005 Coin Demonstration: Act I Setup: Person stands with both hands behind back Act I part A: Person shows hand containing a coin then hides it again Act I part B: Person again shows a coin (indistinguishable from 1 st ) Act I part C: Person asks: “How many coins do I have?” Represents one bit: either has 1 coin or has >1 coin

DJM Nov 25, 2005 Coin Demonstration (cont) Act II: Person holds out hand showing two identical coins Received one bit since ambiguity resolved! Act III: Asks: “Where did the bit of information come from?” Answer: Simultaneous presence of the 2 coins! Related to simultaneity and synchronization!

DJM Nov 25, 2005 Space and Time Ideas Co-occurrence means states exist exactly simultaneously: Spatial prim. with addition operator Co-exclusion means a change occurred due to an operator: Temporal with multiply operator * see definitions in my dissertation but originated with Manthey

DJM Nov 25, 2005 Quantum Bits – Qubits Classical bit states: Mutual Exclusive Quantum bit states: Orthogonal 180° 90° Qubits states are called spin ½ State1 State0 State1 State0

DJM Nov 25, 2005 Phases & Superposition ° State1 State0 ( C 0 State0 + C 1 State1)  Unitarity Constraint is C0C0 C1C1 For  = 45°

DJM Nov 25, 2005 Classical vs. Quantum

DJM Nov 25, 2005 Hilbert Space Notation

DJM Nov 25, 2005 Unitary Qubit Operators GateSymbolicMatrixCircuitExists Identity Not (Pauli-X) Shift (Pauli-Z) Rotate Hadamard - Superposition H θ X Z

DJM Nov 25, 2005 Matrices 101

DJM Nov 25, 2005 and Trine States T0T0 T1T1 T2T2 120° 90°

DJM Nov 25, 2005 Quantum Noise Pauli Spin Matrices LabelSymbolicMatrixDescription Identity Bit Flip Phase Flip Both Flips

DJM Nov 25, 2005 Quantum Measurement  C0C0 C1C1 Probability of state is p i = c i 2 and p 1 = 1- p 0 When then or 50/50 random! Destructive and Probabilistic!! Concepts of projection and singular operators

DJM Nov 25, 2005 Quantum Measurement

DJM Nov 25, 2005 Qubit Modeling Qubit Operators: not, Hadamard, rotate & measure gates Our library in Block Diagram tool by Hyperception

DJM Nov 25, 2005 Quantum Registers Entanglement Tensor Product  is mathematical operator Creates 2 q orthogonal dimensions from q qubits: q 0  q 1  … Unitarity constraint for entire qureg Separable states Can be created by tensor product Maintained by “coherence” and no noise. Inseparable states Can’t be directly created by tensor product Concept of Ebit (pieces act as whole) EPR and Bell/Magic states (spooky action at distance) Non-locality/a-temporal quantum phenomena proven as valid

DJM Nov 25, 2005 Qureg Dimensions  = q0  q1q0  q1 q0q0 q1q1 Special kind of linear transformations

DJM Nov 25, 2005 Unitary QuReg Operators GateSymbolicMatrixCircuit cnot = XOR Control-not cnot2 swap = cnot*cnot2*cnot x x =

DJM Nov 25, 2005 Quantum Register Modeling Qureg Operators: tensor product, CNOT, SWAP & qu-ops

DJM Nov 25, 2005 Reversible Computing ABCABC abcabc ABCABC abcabc F T 2 gates back-to-back gives unity gate: T*T = 1 and F*F = 1 3 in & 3 out

DJM Nov 25, 2005 Reversible Quantum Circuits GateSymbolicMatrixCircuit Toffoli = control-control-not Fredkin= control-swap Deutsch x x D

DJM Nov 25, 2005 Toffoli and Fredkin Gates

DJM Nov 25, 2005 Ebits – Entangled Bits EPR (Einstein, Podolsky, Rosen) operator Bell States Magic States H 1

DJM Nov 25, 2005 Step1: Two qubits Step2: Entangle  Ebit Step3: Separate Step4: Measure a qubit Other is same if Other is opposite if EPR: Non-local connection Linked coins analogy ~ ~ ~ ~

DJM Nov 25, 2005 Quantum Algorithms Speedup over classical algorithms Complexity Class: Quantum Polynomial Time Reversible logic gates just mimics classical logic Requires quantum computer with q>100 qubits Largest quantum computer to date has 7 qubits Problems with decoherence and scalability Known Quantum Algorithms Shor’s Algorithm – prime factors using QFT Grover’s Algorithm – Search that scales as sqrt(N) No other algorithms found to date after much research

DJM Nov 25, 2005 Quantum Communication Quantum Encryption Uses fact that measuring qubit destroys state Can be setup to detect intrusion Quantum Key Distribution Uses quantum encryption to distribute fresh keys Can be setup to detect intrusion Fastest growing quantum product area Many companies and products In enclosed fiber networks and also open air

DJM Nov 25, 2005 Quantum Mind? Did biology to tap into Quantum Computing? Survival value using fast search We might be extinct if not for quantum mind Research with random phase ensembles Ensemble states survive random measurements See paper “Math over Mind and Matter” Relationship to quantum and consciousness? Movie: “What the Bleep do we know anyhow? Conferences and books

DJM Nov 25, 2005 Summary and Conclusions Quantum concepts extend classical ways of thinking High dimensional spaces and simultaneity Distinguishability, mutual exclusion, co-occurrence and co-exclusion Reversible computing and unitary transforms Qubits superposition, phase states, probabilities & unitarity constraint Measurement and singular operators Entanglement, coherence and noise Ebits, EPR, Non-locality and Bell/Magic States Quantum speedup for algorithms Quantum ensembles have most properties of qubits Quantum systems are ubiquitous Quantum computing may also be ubiquitous Biology may have tapped into quantum ensemble computing Quantum computing and consciousness may be related