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.

Slides:



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

Applications of one-class classification
Quantum Computation and Quantum Information – Lecture 2
Quantum Computation and Quantum Information – Lecture 3
University of Queensland
Cove: A Practical Quantum Computer Programming Framework Matt Purkeypile Fall 2008.
The Shifting Paradigm of Quantum Computing Presented at the Nov 2005 Annual Dallas Mensa Gathering By Douglas Matzke, Ph.D.
Proto-physics the link between Quantum Physics and Metaphysics Presented on Thurs Nov 17, 2011 Café Metaphysics By Douglas Matzke, Ph.D.
Review of Basics and Elementary introduction to quantum postulates.
Chien Hsing James Wu David Gottesman Andrew Landahl.
Phase in Quantum Computing. Main concepts of computing illustrated with simple examples.
Grover. Part 2. Components of Grover Loop The Oracle -- O The Hadamard Transforms -- H The Zero State Phase Shift -- Z O is an Oracle H is Hadamards H.
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.
Review of Basics and Elementary introduction to quantum postulates.
The Integration Algorithm A quantum computer could integrate a function in less computational time then a classical computer... The integral of a one dimensional.
Quantum Algorithms I Andrew Chi-Chih Yao Tsinghua University & Chinese U. of Hong Kong.
Anuj Dawar.
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.
Authors Faisal Shah Khan Marek A. Perkowski Slides prepared by Faisal Shah Khan.
Quantum Mechanics from Classical Statistics. what is an atom ? quantum mechanics : isolated object quantum mechanics : isolated object quantum field theory.
Shor’s Algorithm Osama Awwad Department of Computer Science Western Michigan University July 12, 2015.
An Arbitrary Two-qubit Computation in 23 Elementary Gates or Less Stephen S. Bullock and Igor L. Markov University of Michigan Departments of Mathematics.
Transforms: Basis to Basis Normal Basis Hadamard Basis Basis functions Method to find coefficients (“Transform”) Inverse Transform.
Quantum Computing Lecture 1 Michele Mosca. l Course Outline
Introduction to Quantum logic (2) Yong-woo Choi.
Quantum Computation and Quantum Information – Lecture 2 Part 1 of CS406 – Research Directions in Computing Dr. Rajagopal Nagarajan Assistant: Nick Papanikolaou.
DJM 3/9/2010 Quantum Thoughts Presented on Tues Mar 9, 2010 Café Metaphysics By Douglas Matzke, Ph.D.
Alice and Bob’s Excellent Adventure
Probabilistic Geometry and Information Content (an Introduction to Corob Theory) ANPA Conference Cambridge, UK by Dr. Douglas J. Matzke
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
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:
PRobabilistic gAtes Making Binary Optical Quanta Contract no.: IST RAMBOQ PRobabilistic gAtes Making Binary Optical Quanta Contract no.: IST
DJM Mar 2003 Lawrence Technologies, LLC The Math Over Mind and Matter Doug Matzke and Nick Lawrence Presented at Quantum Mind.
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.
A Statistical Approach to Texture Classification Nicholas Chan Heather Dunlop Project Dec. 14, 2005.
Page 1 COMPSCI 290.2: Computer Security “Quantum Cryptography” including Quantum Communication Quantum Computing.
Fidelity of a Quantum ARQ Protocol Alexei Ashikhmin Bell Labs  Classical Automatic Repeat Request (ARQ) Protocol  Quantum Automatic Repeat Request (ARQ)
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ć.
An Introduction to Quantum Computation Sandy Irani Department of Computer Science University of California, Irvine.
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 gates SALEEL AHAMMAD SALEEL. Introduction.
Richard Cleve DC 3524 Introduction to Quantum Information Processing CS 467 / CS 667 Phys 667 / Phys 767 C&O 481 / C&O 681 Lecture.
COMPSCI 290.2: Computer Security
Quantum Circuit Visualization
Introduction to Quantum Computing Lecture 1 of 2
For computer scientists
Quantum Computing Dorca Lee.
A Ridiculously Brief Overview
Introduction to Quantum logic (2)
OSU Quantum Information Seminar
Quantum Ensemble Computing
Bayesian Deep Learning on a Quantum Computer
The Shifting Paradigm of Quantum Computing
The Shifting Paradigm of Quantum Computing
Quantum One.
Presentation transcript:

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 Technologies, LLC and

DJM Mar 18, 2004 Abstract Interest in quantum computation started growing significantly since 1994 when Peter Shor showed that quantum computers could solve some problems such as factoring, faster than classical computers. This capability is possible because quantum computers represent information state differently than classical computers. This talk will present a new set of tools and concepts that can be used explore this complex yet captivating topic. As a result of two SBIR contracts with the US Air Force, Lawrence Technologies is building a quantum computing tool set that allows plug and play exploration of quantum computation models described as circuits. This predefined quantum library was built using the Block Diagram tool marketed by Hyperception of Dallas. Besides the traditional quantum operations, we have designed this library to implement quantum ensembles. In addition to these tools, what's new is that quantum ensembles exhibit the unintuitive properties of Correlithm Objects. Correlithm Objects Theory is based on mathematical modeling of neural systems and has lead to numerous patents. I will discuss the new Quantum Correlithm Objects research, tools and results.

DJM Mar 18, 2004 Outline of Talk Quantum computation basics Need for quantum modeling tools Demo of new quantum toolset Ensembles and Correlithm Objects –Standard distance and radius –Unit N-Cube and Hilbert spaces –Quantum Ensembles QuCOs survive measurement

DJM Mar 18, 2004 Quantum Computation Basics TopicClassicalQuantum BitsBinary valued 0/1Qubits StatesMutually exclusiveLinearly independ. OperatorsNand/Nor gatesMatrix Multiply ReversibleToffoli/Fredkin gateQubits are unitary MeasurementDeterministicProbabilistic SuperpositionnoneMixtures of EntanglementnoneEbits

DJM Mar 18, 2004 Hilbert Space Notation Qubit Qureg Ebit q0q1q0q1q2 c 0 |0> + c 1 |1> c 0 |000>+ c 1 |001>+ c 2 |010>+ c 3 |011>+ c 4 |100>+ c 5 |101>+ c 6 |110>+ c 7 |111> q0q1 c 0 |00> + c 1 |11> or c 0 |01> + c 1 |10> q0 * not q1 * phase

DJM Mar 18, 2004 Need for QuModeling Tools Actual quantum computers are unavailable Highly mathematical paradigm shift –Qubits, Hilbert Space and Bra-Ket notation –Reversibility: unitary and idempotent operators –Superposition: linearly independent states –Entanglement: no classical counterpart Facilitate learning –Learn notation, primitives and concepts –Build understanding and intuition Support application design Next slides give examples of qubits, quregs and ebits with various operators

DJM Mar 18, 2004 Quantum Toolset Demo Qubit Operators: not, Hadamard, rotate & measure gates Our library in Block Diagram tool by Hyperception

DJM Mar 18, 2004 Quantum Registers Demo Qureg Operators: tensor product, CNOT, SWAP & qu-ops

DJM Mar 18, 2004 Ebits Generator Demo

DJM Mar 18, 2004 Quantum Ensembles N qubits that are arrayed but not entangled If random phase for each qubit: –Represents a point in high dimensional space –Phase Invariant –Orthogonal –Distance between two random ensembles –Standard deviation is –Same results if each N is a quantum register

DJM Mar 18, 2004 Ensembles: Spaces and Points

DJM Mar 18, 2004 Standard Distance for QuEnsembles Standard deviation is a independent of N

DJM Mar 18, 2004 Correlithm Objects Points of a Space (Unit cube, Hilbert Space) Cartesian Distance between Points –Same for all random points/corners of space Standard Distance, Standard Radius and other metrics Related to field of probabilistic geometry –Follows a Gaussian Distribution Mean: grows as Standard deviation: independent of N Key concept/IP of Lawrence Technologies –Patents issued and several pending

DJM Mar 18, 2004 Correlithm Objects (COs) are Points Random Points 1 point in 3 dimensions2 points in N dimensions Randomly chosen points are standard distance apart.

DJM Mar 18, 2004 Cartesian Distance Histograms “Standard” Distance =Standard Deviation = for COs in Unit Cube

DJM Mar 18, 2004 Constant Standard Deviation For N=96, Standard distance = 4For N=2400, Standard distance = 20 Two plots are scaled/normalized to same relative size for Unit Cube COs

DJM Mar 18, 2004 Standard Distance Metrics Statistics for random points/corners for Unit Cube COs

DJM Mar 18, 2004 Equihedron Topology Probabilistically forms high dimensional tetrahedron C O D P M Q Exact Points C = Corner Reference M = Mid point of space O = Opposite Corner Random Points P = Random CO 1 Q = Random CO 2 D = Random Corner Unit Cube Metrics Normalized Distances

DJM Mar 18, 2004 Invariant Metrics random points random corners All random CO points are equidistant from each other and all random CO points are equidistant from center point and all random CO corners are equidistant from each other …

DJM Mar 18, 2004 Accessing Quantum COs Quantum COs are not directly visible (except thru simulation) Measure of QuCOs produces classical CO –Answer is binary CO –End state is another QuCO Multiple trials reveals underlying QuCO Measurement is noise injection CO process CO tokens survive this process!

DJM Mar 18, 2004 COs Survive Measurement Starting Qubit arrays Q i Answer Binary states A i Probabilistic Measurement of Qubits Q i Ending Qubit states E i Start real array S i Encode as random phase Qubits Q i Q 0 Q 1 Q 98 Q 99 S 0 S 1 S 98 S 99 Q 0 Q 1 Q 98 Q Q 0 Q 1 Q 98 Q Answers are 50% same from multiple trials of same S i !! Trial 1Trial 2 Repeat Multiple Trials for sets S i = X and sets S i = Y (patent pending)

DJM Mar 18, 2004 Topology of COs Survival Standard Distance << Standard Distance X Cluster Y Cluster

DJM Mar 18, 2004 Model Quantum CO process Description of next slide: Multiple trials of same CO (top left) Multiple trials of random CO (bottom left) Make measurements (mid) Compare Rand-COs to same CO distances Generate histograms (mid) Display histograms (right) 70% of expected standard distance (right)

DJM Mar 18, 2004 Quantum Measurement as COs Quantum encoded tokens are identifiable after measurement Qu Measurement can be thought of as CO process!

DJM Mar 18, 2004 “What’s New” Summary New tools help explore complex topics –Quantum computation domain –Correlithm Object domain –Quantum Correlithm Object mixtures Quantum & Correlithm theories are related –Both depend on probabilities and info. theory –Same standard distance for all Qu ensembles –Superposition appears in both domains –QuCOs survive measurement (patent pending) QuMeasurement cast as correlithm noise process

DJM Mar 18, 2004 Quantum and Correlithms Unit N-cube Topology Qureg Topology Normalized Distances C O D P M Q C O D P M Q