Quantum Automata Formalism. These are general questions related to complexity of quantum algorithms, combinational and sequential.

Slides:



Advertisements
Similar presentations
Advice Coins Scott Aaronson. PSPACE/coin: Class of problems solvable by a PSPACE machine that can flip an advice coin (heads with probability p, tails.
Advertisements

Black Box Checking Book: Chapter 9 Model Checking Finite state description of a system B. LTL formula. Translate into an automaton P. Check whether L(B)
Part VI NP-Hardness. Lecture 23 Whats NP? Hard Problems.
University of Queensland
Time Complexity P vs NP.
8/25/2009 Sofya Raskhodnikova Intro to Theory of Computation L ECTURE 1 Theory of Computation Course information Overview of the area Finite Automata Sofya.
THE CHURCH-TURING T H E S I S “ TURING MACHINES” Pages COMPUTABILITY THEORY.
1 1 CDT314 FABER Formal Languages, Automata and Models of Computation Lecture 3 School of Innovation, Design and Engineering Mälardalen University 2012.
Classical and Quantum Automata Abuzer Yakaryılmaz Advisor: Prof. Cem Say.
Complexity 18-1 Complexity Andrei Bulatov Probabilistic Algorithms.
Advanced Topics in Algorithms and Data Structures
Complexity Theory CSE 331 Section 2 James Daly. Reminders Project 4 is out Due Friday Dynamic programming project Homework 6 is out Due next week (on.
March 11, 2015CS21 Lecture 271 CS21 Decidability and Tractability Lecture 27 March 11, 2015.
61 Nondeterminism and Nodeterministic Automata. 62 The computational machine models that we learned in the class are deterministic in the sense that the.
Randomized Computation Roni Parshani Orly Margalit Eran Mantzur Avi Mintz
CS 310 – Fall 2006 Pacific University CS310 Turing Machines Section 3.1 November 6, 2006.
Automata theory and formal languages Andrej Bogdanov The Chinese University of Hong Kong Fall 2008.
CSC 3130: Automata theory and formal languages Andrej Bogdanov The Chinese University of Hong Kong Nondeterminism.
Fall 2004COMP 3351 Time Complexity We use a multitape Turing machine We count the number of steps until a string is accepted We use the O(k) notation.
Turing Machines CS 105: Introduction to Computer Science.
CSC 361Finite Automata1. CSC 361Finite Automata2 Formal Specification of Languages Generators Grammars Context-free Regular Regular Expressions Recognizers.
Grammars, Languages and Finite-state automata Languages are described by grammars We need an algorithm that takes as input grammar sentence And gives a.
1 Non-Deterministic Finite Automata. 2 Alphabet = Nondeterministic Finite Automaton (NFA)
Section 11.4 Language Classes Based On Randomization
One Complexity Theorist’s View of Quantum Computing Lance Fortnow NEC Research Institute.
Randomized Turing Machines
Theory of Computing Lecture 15 MAS 714 Hartmut Klauck.
Approximation Algorithms Pages ADVANCED TOPICS IN COMPLEXITY THEORY.
Introduction to the Theory of Computation
1 An Introduction to Formal Languages and Automata Provided by : Babak Salimi webAdd:
1 Unit 1: Automata Theory and Formal Languages Readings 1, 2.2, 2.3.
Complexity theory and combinatorial optimization Class #2 – 17 th of March …. where we deal with decision problems, finite automata, Turing machines pink.
Computation Model and Complexity Class. 2 An algorithmic process that uses the result of a random draw to make an approximated decision has the ability.
. CLASSES RP AND ZPP By: SARIKA PAMMI. CONTENTS:  INTRODUCTION  RP  FACTS ABOUT RP  MONTE CARLO ALGORITHM  CO-RP  ZPP  FACTS ABOUT ZPP  RELATION.
PROBABILISTIC COMPUTATION By Remanth Dabbati. INDEX  Probabilistic Turing Machine  Probabilistic Complexity Classes  Probabilistic Algorithms.
1 CD5560 FABER Formal Languages, Automata and Models of Computation Lecture 3 Mälardalen University 2010.
THE CHURCH-TURING T H E S I S “ TURING MACHINES” Part 1 – Pages COMPUTABILITY THEORY.
Computer Science 101 Theory of Computing. Computer Science is... The study of algorithms, with respect to –their formal properties –their linguistic realizations.
CS1Q Computer Systems Lecture 11 Simon Gay. Lecture 11CS1Q Computer Systems - Simon Gay 2 The D FlipFlop The RS flipflop stores one bit of information.
1Computer Sciences Department. Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Reference 3Computer Sciences Department.
1 Linear Bounded Automata LBAs. 2 Linear Bounded Automata (LBAs) are the same as Turing Machines with one difference: The input string tape space is the.
1Computer Sciences Department. Book: INTRODUCTION TO THE THEORY OF COMPUTATION, SECOND EDITION, by: MICHAEL SIPSER Reference 3Computer Sciences Department.
Strings Basic data type in computational biology A string is an ordered succession of characters or symbols from a finite set called an alphabet Sequence.
Costas Busch - LSU1 Time Complexity. Costas Busch - LSU2 Consider a deterministic Turing Machine which decides a language.
1 Time Complexity We use a multitape Turing machine We count the number of steps until a string is accepted We use the O(k) notation.
1 Course Overview Why this course “formal languages and automata theory?” What do computers really do? What are the practical benefits/application of formal.
NP-complete Languages
Prof. Busch - LSU1 Time Complexity. Prof. Busch - LSU2 Consider a deterministic Turing Machine which decides a language.
Theory of Computation Automata Theory Dr. Ayman Srour.
Theory of Computation Automata Theory Dr. Ayman Srour.
Fall 2004COMP 3351 Finite Automata. Fall 2004COMP 3352 Finite Automaton Input String Output String Finite Automaton.
Nondeterminism The Chinese University of Hong Kong Fall 2011
Formal Foundations-II [Theory of Automata]
Introduction to the Theory of Computation
Part VI NP-Hardness.
Non Deterministic Automata
G. Pullaiah College of Engineering and Technology
Uncountable Classical and Quantum Complexity Classes
Chapter 9 TURING MACHINES.
Chapter 2 FINITE AUTOMATA.
Jaya Krishna, M.Tech, Assistant Professor
Non-Deterministic Finite Automata
CSE322 Definition and description of finite Automata
Non Deterministic Automata
Lecture One: Automata Theory Amjad Ali
Instructor: Aaron Roth
Sofya Raskhodnikova; Intro Theory of Computation
Automata theory and formal languages COS 3112 – AUTOMATA THEORY PRELIM PERIOD WEEK 1 AND 2.
Nondeterminism The Chinese University of Hong Kong Fall 2010
Presentation transcript:

Quantum Automata Formalism

These are general questions related to complexity of quantum algorithms, combinational and sequential

Models of quantum sequential circuits 1.Quantum automata 2.Quantum state machines 3.Quantum Turing Machines 4.Quantum Robots of Benioff 5.Quantum Cellular Automata (not quantum dot based).

A new formalism for classical (deterministic) automata

Input state 1 Input state 2 Output state 1 Output state 2 This means that external classical computer has to change the quantum circuit when a new input in the string comes Observe that this matrix is not permutative and not unitary

A formalism for classical non-deterministic automata

Nondeterminism for b Observe that this matrix is not permutative and not unitary

bb There are two paths from state 1 to state 2, which have labels sequence bb Using matrices like these we can analyze if certain transitions in graphs exist and how many of them exist. This is used in finding the languages accepted be the automata

A FORMALISM FOR CLASSICAL PROBABILISTIC AUTOMATA

PROBABILISTIC AUTOMATA

Languages accepted by probabilistic automata

A FORMALISM FOR QUANTUMAUTOMATA

Now unitary matrices Quantum Finite Automata = QFA

Unitary matrix ket bra Probability that an automaton accepts a string

Languages accepted by deterministic automata Review the following: 1. the concept of Rabin-Scott automaton and language accepted by it. 2.Review the concept of regular expression 3.Show a link between regular expression and language accepted by an automaton. 4.Language generated by an automaton. 5.Regular languages

Languages accepted by probabilistic automata Unitary matrices used here are only a subset of all matrices

Model of Quantum Automaton Quantum automaton is programmed from deterministic standard automaton. It is more similar to FPGA than normal model of computing like in a processor. Quantum Automaton CLASSICAL AUTOMATON One pulse for one elementary rotation in one qubit 1.Machine here has a program that generates pulses that program QA. 2.This is like a memory in FPGA that stores information about LUT and connections Finite memory Infinite memory

unitary matrix Quantum Automaton described by a unitary matrix

CLASSICAL TURING MACHINES

Classical Turing Machines

polynomial Model of calculation of a standard Turing Machine

Example of Turing Machine tape head Finite State Machine 1.Move left, 2.move right, 3.stop, 4.write a symbol. 5.Is the symbol in current cell Xi? The source of infiniteness is the tape This machine has a finite memory, this is standard automaton. Automaton control the head

Non-Polynomial Non-Polynomial, these are tough problems in real life

Bounded-error probabilistic polynomial (BPP) In computational complexity theory, bounded-error probabilistic polynomial time (BPP) is the class of decision problems that are:computational complexity theory decision problems 1.solvable by a probabilistic Turing machineprobabilistic Turing machine 2.in polynomial time,polynomial time 3.with an error probability of at most 1/3 for all instances.probability

Bounded-error probabilistic polynomial Informally, a problem is in BPP if there is an algorithm for it that has the following properties: 1.It is allowed to flip coins and make random decisions 2.It is guaranteed to run in polynomial time 3.On any given run of the algorithm, it has a probability of at most 1/3 of giving the wrong answer, whether the answer is YES or NO. BPP = Bounded-error Probabilistic Polynomial A complexity class

Bounded-error probabilistic polynomial

QUANTUM TURING MACHINES TURING MACHINES

A sum of two complex numbers can be a zero

BQP bounded error quantum polynomial time 1.In computational complexity theory BQP (bounded error quantum polynomial time) is the class of decision problems solvable by a quantum computer in polynomial time, with an error probability of at most 1/3 for all instances.computational complexity theorydecision problemspolynomial time 2.It is the quantum analogue of the complexity class BPP.BPP 3.In other words, there is an algorithm for a quantum computer (a quantum algorithm) that solves the decision problem with high probability and is guaranteed to run in polynomial time.algorithmquantum algorithm 4. On any given run of the algorithm, it has a probability of at most 1/3 that it will give the wrong answer.

BQP (cont) 1.Similarly to other "bounded error" probabilistic classes the choice of 1/3 in the definition is arbitrary. 2.We can run the algorithm a constant number of times and take a majority vote to achieve any desired probability of correctness less than 1, using the Chernoff bound.Chernoff bound 3.Detailed analysis shows that the complexity class is – unchanged by allowing error as high as 1/2 − n −c on the one hand, – or requiring error as small as 2 −nc on the other hand, where c is any positive constant, and n is the length of input.

Sources:

Used in 2011.