Informação e Computação para a Inteligência Artificial!

Size: px
Start display at page:

Download "Informação e Computação para a Inteligência Artificial!"

Transcription

1 Informação e Computação para a Inteligência Artificial! Andreas Wichert!! MEIC Tagus! (Página da cadeira: Fenix)!! Objectivo Geral! n Apresentaremos uma visão compreensiva da ciência da informação como uma parte fundamental das áreas da inteligência artificial e da computação n Exemplos na teoria da computação, que levarão às ideias de Qubits e à possível maneira de simular um computador quantum, serão fornecidos n A simulação de software com a utilização do Mathematica será realizada para o suporte à explicação das ideias por trás dos computadores quantum 1

2 n Organization! n Program! n Introduction! Corpo docente! n Andreas Wichert - Teóricas / Práticas! n andreas.wichert@ist.utl.pt!!! n andreas.wichert@inesc-id.pt! 2

3 Organização das aulas! n Teóricas:! n Matéria (slides baseados no livro e artigos e...)! n Práticas/Laboratório (weekly!):! n Exercícios! n Software Experiments! Avaliação! n Problemas praticas (Exercícios) (40%)! n +! n Exame orais (60%)! 3

4 Horário de dúvidas! n 2ª feira: 14H-17H (gabinete 2N5.7)! Bibliografia! n Quantum Computing, Mika Hirvensalo, Springer-Verlag, 2004! n Quantum Computing, A Gentle Introduction, Eleanor Rieffel and Wolfgang Polak, MIT Press, 2011,! n Quantum Computation and Quantum Information, Michael A. Nielsen and Isaac L.Chuang, Cambridge, 2009! 4

5 Bibliografia! n Quantum Computing Explained, David McMahon, 2008, Wiley Inter-Science n Howard L. Resnikoff. The Illusion of Reality. Springer-Verlag, 1987! n Colin P. Williams and Scott H. Clearwater. Explorations in Quantum Computing, Springer- Verlag 1997! Journals! n n n n L. Tarrataca and A. Wichert: Tree Search and Quantum Computation, Quantum Information Processing, 10 (4): , 2011 doi: /s z! L. Tarrataca and A. Wichert: Can Quantum Entanglement Detection Schemes Improve Search? Quantum Information Processing, in press doi: /s ! L. Tarrataca and A. Wichert: A Quantum Production Model, Quantum Information Processing, in press doi: / s ! L. Tarrataca and A. Wichert: Problem solving and quantum computation, Cognitive Computation, in press doi: / s ! 5

6 Program!! n Information theory is highly related to mathematical probability theory and thermodynamics! Reversible computation! n Bennett (1973) showed that irreversible overwriting of one bit causes energy dissipation! 6

7 Algorithms! n The Entscheidungsproblem is presented! n The Church-Turing thesis states that any algorithmic process can be simulated on a Turing machine.! Probability theory! n Probability theory is built around Kolmogorov's axioms! 7

8 Introduction to quantum Physics! n The mathematical framework of quantum theory is based on linear algebra in Hilbert space! n A 2-state quantum system is described by a two-dimensional Hilbert space. Such a 2-state quantum system corresponds to a qubit. A register is composed of several qubits and is defined by the tensor product.! Computation with Qubits! n A unitary operator on a qubit is called a unary quantum gate! n A reversible circuit can be represented by a unitary permutation matrix or by quantum Boolean gates! n The Deutsch algorithm is more powerful than any other classical algorithm! 8

9 Periodicy! n The discrete Fourier transform (DFT) can be seen as a linear transform represented by a unitary matrix F. This unitary matrix F also defines the quantum Fourier transform (QFT).! Search! n There is a lower bound for a quantum search on a quantum computer using a quantum oracle. The possible speedup is quadratic; NP-complete problems remain NP-complete! 9

10 Quantum Problem-Solving! n Using Grover's algorithm, we search through all possible paths and verify, for each path, whether it leads to the goal state! n We present the iterative quantum tree search, which is the basis of the quantum production system! Quantum cognition! n Quantum cognition uses mathematical quantum theory to model cognitive phenomena. It is assumed that the computation itself is performed on a classical computer and not on a quantum computer. The brain is considered a classical computer in a quantum world.! 10

11 n Questions that appear to be quite simple, such as: what are random numbers and how can we generate them, cannot be answered by traditional computer science! n Classical physics leads to the paradox of free will free will in a deterministic world! n The question concerning randomness is highly metaphysical. In classical physics, randomness does not exist! 11

12 What is Information? n Information first began to assume an independent and quantifiable identity in the research of physics and psychologists in the second half of the nineteenth century... n It grew in importance with the development of electrical-based communication systems 12

13 n Emerged as a unifying and coherent scientific concept along with the invention and development of computers n The subject matter of a science of information is abstract, for it concerns not the substance and the forces of the physical world (?) Representation n Symbolic tokens are necessarily represented by physical phenomena n thoughts are represented by the electrical and biochemical states of the neural network n There is an intermixing of the physical sciences with the proper subject matter of information science... n Information can be presented in a variety of forms which differ inessential from one another Natural language Symbols Acoustic speech Pictures 13

14 n Information is what remains after one abstracts from the material aspect of the physical reality... n How to do it? 14

15 n Scientific study of information cannot be separated from systems which are capable of bearing information n Information database and a user n Meaning - Information n Information has an independent reality, meaning does not n Meaning involves the interpretation of the information in relation to some context n Information exists n It does not need to be perceived to exist n Information = Pattern n What is a pattern? n Find measure of it... 15

16 The Library of Babel n The universe (which others call the Library) is composed of an indefinite and perhaps infinite number of hexagonal galleries, with vast air shafts between, surrounded by very low railings n Jorge Luis Borges ( ) n The books contain every possible ordering of just a few basic characters (letters, spaces and punctuation marks)! n Though the majority of the books in this universe are pure gibberish, the library also must contain, somewhere, every coherent book ever written, or that might ever be written, and every possible permutation or slightly erroneous version of every one of those books! 16

17 n The library must contain all useful information, including predictions of the future, biographies of any person, and translations of every book in all languages! n Despite - indeed, because of -this glut of information, all books are totally useless to the reader! n Borges speculates on the existence of the "Crimson Hexagon", containing a book that contains the log of all the other books; the librarian who reads it is akin to God! 17

18 n The Library contains books! n Just one "authentic" volume, together with all those variants containing only a handful of misprints, would occupy so much space that they would fill the known universe! Constraints! n In a language! n Some letters are more frequent then others! n Some combination of letters are less probable! 18

19 History - Physics and Information n Thermodynamics is a branch of physics that studies the effects of changes in temperature, pressure, and volume on physical systems at the macroscopic scale by analyzing the collective motion of their particles using statistics! n Suggestions thermodynamically descriptions are not descriptions of physical properties and relationship themselves, but of some other still more fundamental property coeval with all regimes of physical inquiry n Thermodynamically relations might remain valid for all physical theories which can describe an aspect of nature 19

20 n Thermodynamically quantities link physical entities to their organization, to their informational properties, and that the informational structure n Probability enter into thermodynamically considerations and opened as road for abstractions and generalization Selective Omission of Information n n Sensory data is corrupted and modified by sensing organism in ways which greatly reduce its quantity and substantially modify its original form Retaining essential information 20

21 What is an A?! n What makes something similar to something else (specifically what makes, for example, an uppercase letter 'A' recognisable as such)! n Metamagical Themas, Douglas Hoffstader, Basic Books, 1985! 21

22 Computation n The information which went into the computer is different from what came out n The most influential model of computation is the Turing Machine n The Idea of the Turing Machine grew out of on attempt to answer a question proposed by the German mathematician Hilbert in the 1900 in the International Congress of Mathematics held in Paris concerning that he be lived to be the 23 most challenging mathematical problems of the day 22

23 n The possibility that quantum mechanical effects might offer some thing genuinely new was first hinted by Richard Feynman of Caltech 1982 when he showed that no classical TM could cimulate certain quantum phenomena without incurring an exponential slowdown, but that a unversal quantum simulator could do so n Quantum TM has the potential for encoding many inputs to a problem simultaneously on the same tape and performing a calculation on all inputs in the time it took to do just one of the calculations classically... 23

24 n Quantum computers could compute certain outputs, such as true random numbers, that are not computable by any deterministic TM n There is no function that generates true random numbers n Quantum parallelsism n All the outputs are computed in the time taken to evaluate just one output classically n Unfortunately, you cannot obtain all of these outputs explicity because a measurment in the final supeposed state would only yield one output! n In principle a QTM could be used to create a proof that relied upon quantum mechanical inference among all the computations going on in superposition n Upon interrogating the QTM for an answer you might be told yes your assumption is true but there would be no way to exibit all computation steps that had gone in order to arrive at the conclusion... 24

25 n Organization! n Program! n Introduction! 25

Informação e Computação para a Inteligência Artificial

Informação e Computação para a Inteligência Artificial Informação e Computação para a Inteligência Artificial Andreas Wichert MEIC Tagus (Página da cadeira: Fenix) Objectivo Geral Apresentaremos uma visão compreensiva da ciência da informação como uma parte

More information

Aprendizagem Simbólica e Sub-Simbólica!

Aprendizagem Simbólica e Sub-Simbólica! Aprendizagem Simbólica e Sub-Simbólica! Andreas Wichert!! DEIC! (Página da cadeira: Fenix)!! Objectivo Geral! n Ao contrário de muitas abordagens estatísticas de aprendizagem através de máquinas, que lidam

More information

Chapter 1. Introduction

Chapter 1. Introduction Chapter 1 Introduction Symbolical artificial intelligence is a field of computer science that is highly related to quantum computation. At first glance, this statement appears to be a contradiction. However,

More information

ARTiFiCiAL intelligence

ARTiFiCiAL intelligence PRiNCiPLES OF QUANTUM ARTiFiCiAL intelligence This page intentionally left blank PRiNCiPLES OF QUANTUM ARTiFiCiAL intelligence Andreas Wichert Instituto Superior Técnico - Universidade de Lisboa, Portugal

More information

Quantum Computing 101. ( Everything you wanted to know about quantum computers but were afraid to ask. )

Quantum Computing 101. ( Everything you wanted to know about quantum computers but were afraid to ask. ) Quantum Computing 101 ( Everything you wanted to know about quantum computers but were afraid to ask. ) Copyright Chris Lomont, 2004 2 67 1 = 193707721 761838257287 Took American Mathematician Frank Nelson

More information

Introduction to Quantum Computing

Introduction to Quantum Computing Introduction to Quantum Computing Toni Bluher Math Research Group, NSA 2018 Women and Mathematics Program Disclaimer: The opinions expressed are those of the writer and not necessarily those of NSA/CSS,

More information

An Architectural Framework For Quantum Algorithms Processing Unit (QAPU)

An Architectural Framework For Quantum Algorithms Processing Unit (QAPU) An Architectural Framework For Quantum s Processing Unit (QAPU) Mohammad Reza Soltan Aghaei, Zuriati Ahmad Zukarnain, Ali Mamat, and ishamuddin Zainuddin Abstract- The focus of this study is developing

More information

Introduction to Quantum Computing

Introduction to Quantum Computing Introduction to Quantum Computing Petros Wallden Lecture 7: Complexity & Algorithms I 13th October 016 School of Informatics, University of Edinburgh Complexity - Computational Complexity: Classification

More information

Intern. J. Fuzzy Mathematical Archive Neutrosophic Quantum Computer Florentin Smarandache Abstract. Keywords:

Intern. J. Fuzzy Mathematical Archive Neutrosophic Quantum Computer Florentin Smarandache Abstract. Keywords: Intern. J. Fuzzy Mathematical Archive Vol. 10, No. 2, 2016, 139-145 ISSN: 2320 3242 (P), 2320 3250 (online) Published on 12 May 2016 www.researchmathsci.org International Journal of Neutrosophic Quantum

More information

Introduction to Quantum Computing for Folks

Introduction to Quantum Computing for Folks Introduction to Quantum Computing for Folks Joint Advanced Student School 2009 Ing. Javier Enciso encisomo@in.tum.de Technische Universität München April 2, 2009 Table of Contents 1 Introduction 2 Quantum

More information

Fundamentals of Computer Science

Fundamentals of Computer Science Fundamentals of Computer Science Chapter 8: Turing machines Henrik Björklund Umeå University February 17, 2014 The power of automata Finite automata have only finite memory. They recognize the regular

More information

QUANTUM COMPUTER SIMULATION

QUANTUM COMPUTER SIMULATION Chapter 2 QUANTUM COMPUTER SIMULATION Chapter 1 discussed quantum computing in non-technical terms and in reference to simple, idealized physical models. In this chapter we make the underlying mathematics

More information

Quantum Information Processing with Liquid-State NMR

Quantum Information Processing with Liquid-State NMR Quantum Information Processing with Liquid-State NMR Pranjal Vachaspati, Sabrina Pasterski MIT Department of Physics (Dated: May 8, 23) We demonstrate the use of a Bruker Avance 2 NMR Spectrometer for

More information

QLang: Qubit Language

QLang: Qubit Language QLang: Qubit Language Christopher Campbell Clément Canonne Sankalpa Khadka Winnie Narang Jonathan Wong September 24, 24 Introduction In 965, Gordon Moore predicted that the number of transistors in integrated

More information

Fourier Sampling & Simon s Algorithm

Fourier Sampling & Simon s Algorithm Chapter 4 Fourier Sampling & Simon s Algorithm 4.1 Reversible Computation A quantum circuit acting on n qubits is described by an n n unitary operator U. Since U is unitary, UU = U U = I. This implies

More information

complex networks and systems i609: advanced PhD seminar I Informatics luis rocha 2019 INDIANA UNIVERSITY

complex networks and systems i609: advanced PhD seminar I Informatics luis rocha 2019 INDIANA UNIVERSITY complex networks and systems Informatics luis rocha 2019 i609: advanced PhD seminar I luis m. rocha school of informatics, computing, & engineering indiana university, bloomington, usa and instituto gulbenkian

More information

Quantum Circuits and Algorithms

Quantum Circuits and Algorithms Quantum Circuits and Algorithms Modular Arithmetic, XOR Reversible Computation revisited Quantum Gates revisited A taste of quantum algorithms: Deutsch algorithm Other algorithms, general overviews Measurements

More information

Space Complexity. then the space required by M on input x is. w i u i. F ) on. September 27, i=1

Space Complexity. then the space required by M on input x is. w i u i. F ) on. September 27, i=1 Space Complexity Consider a k-string TM M with input x. Assume non- is never written over by. a The purpose is not to artificially reduce the space needs (see below). If M halts in configuration (H, w

More information

Introduction to Quantum Algorithms Part I: Quantum Gates and Simon s Algorithm

Introduction to Quantum Algorithms Part I: Quantum Gates and Simon s Algorithm Part I: Quantum Gates and Simon s Algorithm Martin Rötteler NEC Laboratories America, Inc. 4 Independence Way, Suite 00 Princeton, NJ 08540, U.S.A. International Summer School on Quantum Information, Max-Planck-Institut

More information

Compute the Fourier transform on the first register to get x {0,1} n x 0.

Compute the Fourier transform on the first register to get x {0,1} n x 0. CS 94 Recursive Fourier Sampling, Simon s Algorithm /5/009 Spring 009 Lecture 3 1 Review Recall that we can write any classical circuit x f(x) as a reversible circuit R f. We can view R f as a unitary

More information

Great Ideas in Theoretical Computer Science. Lecture 28: A Gentle Introduction to Quantum Computation

Great Ideas in Theoretical Computer Science. Lecture 28: A Gentle Introduction to Quantum Computation 5-25 Great Ideas in Theoretical Computer Science Lecture 28: A Gentle Introduction to Quantum Computation May st, 208 Announcements Please fill out the Faculty Course Evaluations (FCEs). https://cmu.smartevals.com

More information

The Limit of Humanly Knowable Mathematical Truth

The Limit of Humanly Knowable Mathematical Truth The Limit of Humanly Knowable Mathematical Truth Gödel s Incompleteness Theorems, and Artificial Intelligence Santa Rosa Junior College December 12, 2015 Another title for this talk could be... An Argument

More information

A Thermodynamic Turing Machine: Artificial Molecular Computing Using Classical Reversible Logic Switching Networks [1]

A Thermodynamic Turing Machine: Artificial Molecular Computing Using Classical Reversible Logic Switching Networks [1] 1 arxiv:0904.3273v2 [cs.cc] 14 May 2009 A Thermodynamic Turing Machine: Artificial Molecular Computing Using Classical Reversible Logic Switching Networks [1] Abstract A Thermodynamic Turing Machine (TTM)

More information

Quantum Computing. Thorsten Altenkirch

Quantum Computing. Thorsten Altenkirch Quantum Computing Thorsten Altenkirch Is Computation universal? Alonzo Church - calculus Alan Turing Turing machines computable functions The Church-Turing thesis All computational formalisms define the

More information

Boolean State Transformation

Boolean State Transformation Quantum Computing Boolean State Transformation Quantum Computing 2 Boolean Gates Boolean gates transform the state of a Boolean system. Conventionally a Boolean gate is a map f : {,} n {,}, where n is

More information

)j > Riley Tipton Perry University of New South Wales, Australia. World Scientific CHENNAI

)j > Riley Tipton Perry University of New South Wales, Australia. World Scientific CHENNAI Riley Tipton Perry University of New South Wales, Australia )j > World Scientific NEW JERSEY LONDON. SINGAPORE BEIJING SHANSHAI HONG K0N6 TAIPEI» CHENNAI Contents Acknowledgments xi 1. Introduction 1 1.1

More information

COMPARATIVE ANALYSIS ON TURING MACHINE AND QUANTUM TURING MACHINE

COMPARATIVE ANALYSIS ON TURING MACHINE AND QUANTUM TURING MACHINE Volume 3, No. 5, May 2012 Journal of Global Research in Computer Science REVIEW ARTICLE Available Online at www.jgrcs.info COMPARATIVE ANALYSIS ON TURING MACHINE AND QUANTUM TURING MACHINE Tirtharaj Dash

More information

Quantum Computation. Michael A. Nielsen. University of Queensland

Quantum Computation. Michael A. Nielsen. University of Queensland Quantum Computation Michael A. Nielsen University of Queensland Goals: 1. To eplain the quantum circuit model of computation. 2. To eplain Deutsch s algorithm. 3. To eplain an alternate model of quantum

More information

Introduction to Quantum Information, Quantum Computation, and Its Application to Cryptography. D. J. Guan

Introduction to Quantum Information, Quantum Computation, and Its Application to Cryptography. D. J. Guan Introduction to Quantum Information, Quantum Computation, and Its Application to Cryptography D. J. Guan Abstract The development of quantum algorithms and quantum information theory, as well as the design

More information

Quantum computing! quantum gates! Fisica dell Energia!

Quantum computing! quantum gates! Fisica dell Energia! Quantum computing! quantum gates! Fisica dell Energia! What is Quantum Computing?! Calculation based on the laws of Quantum Mechanics.! Uses Quantum Mechanical Phenomena to perform operations on data.!

More information

Quantum Evolutionary Programming

Quantum Evolutionary Programming Quantum Evolutionary Programming Bart Rylander 1 Terry Soule 1 James Foster 1 Jim Alves-Foss 2 1 Initiative for Bioinformatics and Evolutionary Studies (IBEST) Department of Computer Science, University

More information

A High Level Programming Language for Quantum Computing

A High Level Programming Language for Quantum Computing QUARK QUantum Analysis and Realization Kit A High Level Programming Language for Quantum Computing Team In lexicographical order: Name UNI Role Daria Jung djj2115 Verification and Validation Jamis Johnson

More information

Reversible and Quantum computing. Fisica dell Energia - a.a. 2015/2016

Reversible and Quantum computing. Fisica dell Energia - a.a. 2015/2016 Reversible and Quantum computing Fisica dell Energia - a.a. 2015/2016 Reversible computing A process is said to be logically reversible if the transition function that maps old computational states to

More information

Limits of Computation. Antonina Kolokolova

Limits of Computation. Antonina Kolokolova Limits of Computation Antonina Kolokolova What is computation? What is information? What is learning? Are there any limits of our ability to solve problems? Theoretical Computer Science Is there a perfect

More information

Introduction to Quantum Computing

Introduction to Quantum Computing Introduction to Quantum Computing Part I Emma Strubell http://cs.umaine.edu/~ema/quantum_tutorial.pdf April 12, 2011 Overview Outline What is quantum computing? Background Caveats Fundamental differences

More information

Quantum Fourier Transforms

Quantum Fourier Transforms Quantum Fourier Transforms Burton Rosenberg November 10, 2003 Fundamental notions First, review and maybe introduce some notation. It s all about functions from G to C. A vector is consider a function

More information

Chapter 10. Quantum algorithms

Chapter 10. Quantum algorithms Chapter 10. Quantum algorithms Complex numbers: a quick review Definition: C = { a + b i : a, b R } where i = 1. Polar form of z = a + b i is z = re iθ, where r = z = a 2 + b 2 and θ = tan 1 y x Alternatively,

More information

THE RESEARCH OF QUANTUM PHASE ESTIMATION

THE RESEARCH OF QUANTUM PHASE ESTIMATION THE RESEARCH OF QUANTUM PHASE ESTIMATION ALGORITHM Zhuang Jiayu 1,Zhao Junsuo,XuFanjiang, QiaoPeng& Hu Haiying 1 Science and Technology on Integrated Information System Laboratory, Institute of Software

More information

Seminar 1. Introduction to Quantum Computing

Seminar 1. Introduction to Quantum Computing Seminar 1 Introduction to Quantum Computing Before going in I am also a beginner in this field If you are interested, you can search more using: Quantum Computing since Democritus (Scott Aaronson) Quantum

More information

Errata list, Nielsen & Chuang. rrata/errata.html

Errata list, Nielsen & Chuang.  rrata/errata.html Errata list, Nielsen & Chuang http://www.michaelnielsen.org/qcqi/errata/e rrata/errata.html Part II, Nielsen & Chuang Quantum circuits (Ch 4) SK Quantum algorithms (Ch 5 & 6) Göran Johansson Physical realisation

More information

Discrete Quantum Theories

Discrete Quantum Theories Discrete Quantum Theories Andrew J. Hanson 1 Gerardo Ortiz 2 Amr Sabry 1 Yu-Tsung Tai 3 (1) School of Informatics and Computing (2) Department of Physics (3) Mathematics Department Indiana University July

More information

Lecture 2: From Classical to Quantum Model of Computation

Lecture 2: From Classical to Quantum Model of Computation CS 880: Quantum Information Processing 9/7/10 Lecture : From Classical to Quantum Model of Computation Instructor: Dieter van Melkebeek Scribe: Tyson Williams Last class we introduced two models for deterministic

More information

About the relationship between formal logic and complexity classes

About the relationship between formal logic and complexity classes About the relationship between formal logic and complexity classes Working paper Comments welcome; my email: armandobcm@yahoo.com Armando B. Matos October 20, 2013 1 Introduction We analyze a particular

More information

Introduction to Quantum Computation

Introduction to Quantum Computation Introduction to Quantum Computation Ioan Burda Introduction to Quantum Computation Copyright 2005 Ioan Burda All rights reserved. Universal Publishers Boca Raton, Florida USA 2005 ISBN: 1-58112- 466-X

More information

Quantum Computation, NP-Completeness and physical reality [1] [2] [3]

Quantum Computation, NP-Completeness and physical reality [1] [2] [3] Quantum Computation, NP-Completeness and physical reality [1] [2] [3] Compiled by Saman Zarandioon samanz@rutgers.edu 1 Introduction The NP versus P question is one of the most fundamental questions in

More information

Complex numbers: a quick review. Chapter 10. Quantum algorithms. Definition: where i = 1. Polar form of z = a + b i is z = re iθ, where

Complex numbers: a quick review. Chapter 10. Quantum algorithms. Definition: where i = 1. Polar form of z = a + b i is z = re iθ, where Chapter 0 Quantum algorithms Complex numbers: a quick review / 4 / 4 Definition: C = { a + b i : a, b R } where i = Polar form of z = a + b i is z = re iθ, where r = z = a + b and θ = tan y x Alternatively,

More information

Decidability: Church-Turing Thesis

Decidability: Church-Turing Thesis Decidability: Church-Turing Thesis While there are a countably infinite number of languages that are described by TMs over some alphabet Σ, there are an uncountably infinite number that are not Are there

More information

Entanglement Reduces Complexity

Entanglement Reduces Complexity Physics 52 Quantum Physics (Townsend) April 27, 2000 Entanglement Reduces Complexity The Physical Nature of Computing and the Advent of Quantum Computation...Nature isn t classical, dammit, and if you

More information

Grover s algorithm. We want to find aa. Search in an unordered database. QC oracle (as usual) Usual trick

Grover s algorithm. We want to find aa. Search in an unordered database. QC oracle (as usual) Usual trick Grover s algorithm Search in an unordered database Example: phonebook, need to find a person from a phone number Actually, something else, like hard (e.g., NP-complete) problem 0, xx aa Black box ff xx

More information

Models. Models of Computation, Turing Machines, and the Limits of Turing Computation. Effective Calculability. Motivation for Models of Computation

Models. Models of Computation, Turing Machines, and the Limits of Turing Computation. Effective Calculability. Motivation for Models of Computation Turing Computation /0/ Models of Computation, Turing Machines, and the Limits of Turing Computation Bruce MacLennan Models A model is a tool intended to address a class of questions about some domain of

More information

Hugh Everett III s Many Worlds

Hugh Everett III s Many Worlds 236 My God, He Plays Dice! Hugh Everett III s Many Worlds Many Worlds 237 Hugh Everett III s Many Worlds Hugh Everett III was one of John Wheeler s most famous graduate students. Others included Richard

More information

ROM-BASED COMPUTATION: QUANTUM VERSUS CLASSICAL

ROM-BASED COMPUTATION: QUANTUM VERSUS CLASSICAL arxiv:quant-ph/0109016v2 2 Jul 2002 ROM-BASED COMPUTATION: QUANTUM VERSUS CLASSICAL B. C. Travaglione, M. A. Nielsen Centre for Quantum Computer Technology, University of Queensland St Lucia, Queensland,

More information

6.080/6.089 GITCS May 6-8, Lecture 22/23. α 0 + β 1. α 2 + β 2 = 1

6.080/6.089 GITCS May 6-8, Lecture 22/23. α 0 + β 1. α 2 + β 2 = 1 6.080/6.089 GITCS May 6-8, 2008 Lecturer: Scott Aaronson Lecture 22/23 Scribe: Chris Granade 1 Quantum Mechanics 1.1 Quantum states of n qubits If you have an object that can be in two perfectly distinguishable

More information

Factoring on a Quantum Computer

Factoring on a Quantum Computer Factoring on a Quantum Computer The Essence Shor s Algorithm Wolfgang Polak wp@pocs.com Thanks to: Eleanor Rieffel Fuji Xerox Palo Alto Laboratory Wolfgang Polak San Jose State University, 4-14-010 - p.

More information

*WILEY- Quantum Computing. Joachim Stolze and Dieter Suter. A Short Course from Theory to Experiment. WILEY-VCH Verlag GmbH & Co.

*WILEY- Quantum Computing. Joachim Stolze and Dieter Suter. A Short Course from Theory to Experiment. WILEY-VCH Verlag GmbH & Co. Joachim Stolze and Dieter Suter Quantum Computing A Short Course from Theory to Experiment Second, Updated and Enlarged Edition *WILEY- VCH WILEY-VCH Verlag GmbH & Co. KGaA Contents Preface XIII 1 Introduction

More information

Quantum Computation and Communication

Quantum Computation and Communication Tom Lake tswsl1989@sucs.org 16/02/2012 quan tum me chan ics: The branch of mechanics that deals with the mathematical description of the motion and interaction of subatomic particles - OED quan tum me

More information

Infinity: is the universe infinite? Peter J. Cameron School of Mathematics and Statistics University of St Andrews

Infinity: is the universe infinite? Peter J. Cameron School of Mathematics and Statistics University of St Andrews Infinity: is the universe infinite? Peter J Cameron School of Mathematics and Statistics University of St Andrews The Library of Babel The influential Argentine writer Jorge Luis Borges was fascinated

More information

Universiteit Leiden Opleiding Informatica

Universiteit Leiden Opleiding Informatica Universiteit Leiden Opleiding Informatica Quantum Computing Name: Liam Zwitser Date: 4//7 st supervisor: J. M. De Graaf nd supervisor: A. H. Deutz BACHELOR THESIS Leiden Institute of Advanced Computer

More information

Lecture 1: Introduction to Quantum Computing

Lecture 1: Introduction to Quantum Computing Lecture : Introduction to Quantum Computing Rajat Mittal IIT Kanpur What is quantum computing? This course is about the theory of quantum computation, i.e., to do computation using quantum systems. These

More information

Quantum Computing Lecture 6. Quantum Search

Quantum Computing Lecture 6. Quantum Search Quantum Computing Lecture 6 Quantum Search Maris Ozols Grover s search problem One of the two most important algorithms in quantum computing is Grover s search algorithm (invented by Lov Grover in 1996)

More information

Volume 2, Issue 9, September 2014 International Journal of Advance Research in Computer Science and Management Studies

Volume 2, Issue 9, September 2014 International Journal of Advance Research in Computer Science and Management Studies Volume 2, Issue 9, September 2014 International Journal of Advance Research in Computer Science and Management Studies Research Article / Survey Paper / Case Study Available online at: www.ijarcsms.com

More information

Theory of Computation CS3102 Spring 2014 A tale of computers, math, problem solving, life, love and tragic death

Theory of Computation CS3102 Spring 2014 A tale of computers, math, problem solving, life, love and tragic death Theory of Computation CS3102 Spring 2014 A tale of computers, math, problem solving, life, love and tragic death Nathan Brunelle Department of Computer Science University of Virginia www.cs.virginia.edu/~njb2b/theory

More information

Automata Theory. Definition. Computational Complexity Theory. Computability Theory

Automata Theory. Definition. Computational Complexity Theory. Computability Theory Outline THEORY OF COMPUTATION CS363, SJTU What is Theory of Computation? History of Computation Branches and Development Xiaofeng Gao Dept. of Computer Science Shanghai Jiao Tong University 2 The Essential

More information

Quantum Computing. Vraj Parikh B.E.-G.H.Patel College of Engineering & Technology, Anand (Affiliated with GTU) Abstract HISTORY OF QUANTUM COMPUTING-

Quantum Computing. Vraj Parikh B.E.-G.H.Patel College of Engineering & Technology, Anand (Affiliated with GTU) Abstract HISTORY OF QUANTUM COMPUTING- Quantum Computing Vraj Parikh B.E.-G.H.Patel College of Engineering & Technology, Anand (Affiliated with GTU) Abstract Formerly, Turing Machines were the exemplar by which computability and efficiency

More information

Most General computer?

Most General computer? Turing Machines Most General computer? DFAs are simple model of computation. Accept only the regular languages. Is there a kind of computer that can accept any language, or compute any function? Recall

More information

Quantum parity algorithms as oracle calls, and application in Grover Database search

Quantum parity algorithms as oracle calls, and application in Grover Database search Abstract Quantum parity algorithms as oracle calls, and application in Grover Database search M. Z. Rashad Faculty of Computers and Information sciences, Mansoura University, Egypt Magdi_z2011@yahoo.com

More information

CS 126 Lecture T6: NP-Completeness

CS 126 Lecture T6: NP-Completeness CS 126 Lecture T6: NP-Completeness Outline Introduction: polynomial vs. exponential time P vs. NP: the holy grail NP-Completeness: Cook s Theorem NP-Completeness: Reduction Conclusions CS126 19-1 Randy

More information

The P versus NP Problem in Quantum Physics

The P versus NP Problem in Quantum Physics NeuroQuantology December 04 Volume Issue 4 Page 350-354 350 The P versus NP Problem in Quantum Physics Daegene Song ABSTRACT Motivated by the fact that information is encoded and processed by physical

More information

Quantum Information & Quantum Computation

Quantum Information & Quantum Computation CS9A, Spring 5: Quantum Information & Quantum Computation Wim van Dam Engineering, Room 59 vandam@cs http://www.cs.ucsb.edu/~vandam/teaching/cs9/ Administrivia Who has the book already? Office hours: Wednesday

More information

Final Exam Comments. UVa - cs302: Theory of Computation Spring < Total

Final Exam Comments. UVa - cs302: Theory of Computation Spring < Total UVa - cs302: Theory of Computation Spring 2008 Final Exam Comments < 50 50 59 60 69 70 79 80 89 90 94 95-102 Total 2 6 8 22 16 16 12 Problem 1: Short Answers. (20) For each question, provide a correct,

More information

CS257 Discrete Quantum Computation

CS257 Discrete Quantum Computation CS57 Discrete Quantum Computation John E Savage April 30, 007 Lect 11 Quantum Computing c John E Savage Classical Computation State is a vector of reals; e.g. Booleans, positions, velocities, or momenta.

More information

Quantum Computing. Joachim Stolze and Dieter Suter. A Short Course from Theory to Experiment. WILEY-VCH Verlag GmbH & Co. KGaA

Quantum Computing. Joachim Stolze and Dieter Suter. A Short Course from Theory to Experiment. WILEY-VCH Verlag GmbH & Co. KGaA Joachim Stolze and Dieter Suter Quantum Computing A Short Course from Theory to Experiment Second, Updated and Enlarged Edition WILEY- VCH WILEY-VCH Verlag GmbH & Co. KGaA Preface XIII 1 Introduction and

More information

CSE 2001: Introduction to Theory of Computation Fall Suprakash Datta

CSE 2001: Introduction to Theory of Computation Fall Suprakash Datta CSE 2001: Introduction to Theory of Computation Fall 2012 Suprakash Datta datta@cse.yorku.ca Office: CSEB 3043 Phone: 416-736-2100 ext 77875 Course page: http://www.cs.yorku.ca/course/2001 11/13/2012 CSE

More information

1.0 Introduction to Quantum Systems for Information Technology 1.1 Motivation

1.0 Introduction to Quantum Systems for Information Technology 1.1 Motivation QSIT09.V01 Page 1 1.0 Introduction to Quantum Systems for Information Technology 1.1 Motivation What is quantum mechanics good for? traditional historical perspective: beginning of 20th century: classical

More information

Cultural Dissemination using a Quantum Model

Cultural Dissemination using a Quantum Model Cultural Dissemination using a Quantum Model Scott Christley schristl@nd.edu Greg Madey gmadey@nd.edu Abstract Axelrod s [Axelrod, 1997] cultural dissemination model introduces an agent-based simulation

More information

Decidable Languages - relationship with other classes.

Decidable Languages - relationship with other classes. CSE2001, Fall 2006 1 Last time we saw some examples of decidable languages (or, solvable problems). Today we will start by looking at the relationship between the decidable languages, and the regular and

More information

CSCI 2570 Introduction to Nanocomputing. Discrete Quantum Computation

CSCI 2570 Introduction to Nanocomputing. Discrete Quantum Computation CSCI 2570 Introduction to Nanocomputing Discrete Quantum Computation John E Savage November 27, 2007 Lect 22 Quantum Computing c John E Savage What is Quantum Computation It is very different kind of computation

More information

Turing Machines. Lecture 8

Turing Machines. Lecture 8 Turing Machines Lecture 8 1 Course Trajectory We will see algorithms, what can be done. But what cannot be done? 2 Computation Problem: To compute a function F that maps each input (a string) to an output

More information

Quantum Information Types

Quantum Information Types qitd181 Quantum Information Types Robert B. Griffiths Version of 6 February 2012 References: R. B. Griffiths, Types of Quantum Information, Phys. Rev. A 76 (2007) 062320; arxiv:0707.3752 Contents 1 Introduction

More information

Quantum Computing: Foundations to Frontier Fall Lecture 3

Quantum Computing: Foundations to Frontier Fall Lecture 3 Quantum Computing: Foundations to Frontier Fall 018 Lecturer: Henry Yuen Lecture 3 Scribes: Seyed Sajjad Nezhadi, Angad Kalra Nora Hahn, David Wandler 1 Overview In Lecture 3, we started off talking about

More information

Thermodynamics of computation

Thermodynamics of computation C. THERMODYNAMICS OF COMPUTATION 37 C Thermodynamics of computation This lecture is based on Charles H. Bennett s The Thermodynamics of Computation a Review, Int. J. Theo. Phys., 1982 [B82]. Unattributed

More information

226 My God, He Plays Dice! Entanglement. Chapter This chapter on the web informationphilosopher.com/problems/entanglement

226 My God, He Plays Dice! Entanglement. Chapter This chapter on the web informationphilosopher.com/problems/entanglement 226 My God, He Plays Dice! Entanglement Chapter 29 20 This chapter on the web informationphilosopher.com/problems/entanglement Entanglement 227 Entanglement Entanglement is a mysterious quantum phenomenon

More information

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 1: Quantum circuits and the abelian QFT

Quantum algorithms (CO 781, Winter 2008) Prof. Andrew Childs, University of Waterloo LECTURE 1: Quantum circuits and the abelian QFT Quantum algorithms (CO 78, Winter 008) Prof. Andrew Childs, University of Waterloo LECTURE : Quantum circuits and the abelian QFT This is a course on quantum algorithms. It is intended for graduate students

More information

Complexity. Complexity Theory Lecture 3. Decidability and Complexity. Complexity Classes

Complexity. Complexity Theory Lecture 3. Decidability and Complexity. Complexity Classes Complexity Theory 1 Complexity Theory 2 Complexity Theory Lecture 3 Complexity For any function f : IN IN, we say that a language L is in TIME(f(n)) if there is a machine M = (Q, Σ, s, δ), such that: L

More information

CSCI3390-Lecture 14: The class NP

CSCI3390-Lecture 14: The class NP CSCI3390-Lecture 14: The class NP 1 Problems and Witnesses All of the decision problems described below have the form: Is there a solution to X? where X is the given problem instance. If the instance is

More information

cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska

cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska cse303 ELEMENTS OF THE THEORY OF COMPUTATION Professor Anita Wasilewska LECTURE 13 CHAPTER 4 TURING MACHINES 1. The definition of Turing machine 2. Computing with Turing machines 3. Extensions of Turing

More information

Quantum Computing 1. Multi-Qubit System. Goutam Biswas. Lect 2

Quantum Computing 1. Multi-Qubit System. Goutam Biswas. Lect 2 Quantum Computing 1 Multi-Qubit System Quantum Computing State Space of Bits The state space of a single bit is {0,1}. n-bit state space is {0,1} n. These are the vertices of the n-dimensional hypercube.

More information

Topological Quantum Computation. Zhenghan Wang Microsoft Station Q & UC Sana Barbara Texas, March 26, 2015

Topological Quantum Computation. Zhenghan Wang Microsoft Station Q & UC Sana Barbara Texas, March 26, 2015 Topological Quantum Computation Zhenghan Wang Microsoft Station Q & UC Sana Barbara Texas, March 26, 2015 Classical Physics Turing Model Quantum Mechanics Quantum Computing Quantum Field Theory??? String

More information

Lecture 2: Introduction to Quantum Mechanics

Lecture 2: Introduction to Quantum Mechanics CMSC 49: Introduction to Quantum Computation Fall 5, Virginia Commonwealth University Sevag Gharibian Lecture : Introduction to Quantum Mechanics...the paradox is only a conflict between reality and your

More information

A Quantum Associative Memory Based on Grover s Algorithm

A Quantum Associative Memory Based on Grover s Algorithm A Quantum Associative Memory Based on Grover s Algorithm Dan Ventura and Tony Martinez Neural Networks and Machine Learning Laboratory (http://axon.cs.byu.edu) Department of Computer Science Brigham Young

More information

Basics on quantum information

Basics on quantum information Basics on quantum information Mika Hirvensalo Department of Mathematics and Statistics University of Turku mikhirve@utu.fi Thessaloniki, May 2014 Mika Hirvensalo Basics on quantum information 1 of 49 Brief

More information

Concepts and Algorithms of Scientific and Visual Computing Advanced Computation Models. CS448J, Autumn 2015, Stanford University Dominik L.

Concepts and Algorithms of Scientific and Visual Computing Advanced Computation Models. CS448J, Autumn 2015, Stanford University Dominik L. Concepts and Algorithms of Scientific and Visual Computing Advanced Computation Models CS448J, Autumn 2015, Stanford University Dominik L. Michels Advanced Computation Models There is a variety of advanced

More information

6.896 Quantum Complexity Theory November 11, Lecture 20

6.896 Quantum Complexity Theory November 11, Lecture 20 6.896 Quantum Complexity Theory November, 2008 Lecturer: Scott Aaronson Lecture 20 Last Time In the previous lecture, we saw the result of Aaronson and Watrous that showed that in the presence of closed

More information

1 Computational problems

1 Computational problems 80240233: Computational Complexity Lecture 1 ITCS, Tsinghua Univesity, Fall 2007 9 October 2007 Instructor: Andrej Bogdanov Notes by: Andrej Bogdanov The aim of computational complexity theory is to study

More information

Semiconductors: Applications in spintronics and quantum computation. Tatiana G. Rappoport Advanced Summer School Cinvestav 2005

Semiconductors: Applications in spintronics and quantum computation. Tatiana G. Rappoport Advanced Summer School Cinvestav 2005 Semiconductors: Applications in spintronics and quantum computation Advanced Summer School 1 I. Background II. Spintronics Spin generation (magnetic semiconductors) Spin detection III. Spintronics - electron

More information

Theory of Computing Tamás Herendi

Theory of Computing Tamás Herendi Theory of Computing Tamás Herendi Theory of Computing Tamás Herendi Publication date 2014 Table of Contents 1 Preface 1 2 Formal languages 2 3 Order of growth rate 9 4 Turing machines 16 1 The definition

More information

arxiv:quant-ph/ v1 28 May 1998

arxiv:quant-ph/ v1 28 May 1998 Is There a Universal Quantum Computer? Yu Shi Cavendish Laboratory, Madingley Road, Cambridge CB3 0HE, UK (submitted on 25 May 1998) arxiv:quant-ph/9805083v1 28 May 1998 Abstract There is a fatal mistake

More information

quantum mechanics is a hugely successful theory... QSIT08.V01 Page 1

quantum mechanics is a hugely successful theory... QSIT08.V01 Page 1 1.0 Introduction to Quantum Systems for Information Technology 1.1 Motivation What is quantum mechanics good for? traditional historical perspective: beginning of 20th century: classical physics fails

More information

CSE 2001: Introduction to Theory of Computation Fall Suprakash Datta

CSE 2001: Introduction to Theory of Computation Fall Suprakash Datta CSE 2001: Introduction to Theory of Computation Fall 2013 Suprakash Datta datta@cse.yorku.ca Office: CSEB 3043 Phone: 416-736-2100 ext 77875 Course page: http://www.cse.yorku.ca/course/2001 11/7/2013 CSE

More information

An Introduction to Quantum Information and Applications

An Introduction to Quantum Information and Applications An Introduction to Quantum Information and Applications Iordanis Kerenidis CNRS LIAFA-Univ Paris-Diderot Quantum information and computation Quantum information and computation How is information encoded

More information