Download presentation

Presentation is loading. Please wait.

1
Quantum Automata Formalism

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

3
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).

4
A new formalism for classical (deterministic) automata

5
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

7
A formalism for classical non-deterministic automata

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

9
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

10
A FORMALISM FOR CLASSICAL PROBABILISTIC AUTOMATA

11
PROBABILISTIC AUTOMATA

12
Languages accepted by probabilistic automata

13
A FORMALISM FOR QUANTUMAUTOMATA

14
Now unitary matrices Quantum Finite Automata = QFA

15
Unitary matrix ket bra Probability that an automaton accepts a string

16
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

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

18
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

19
unitary matrix Quantum Automaton described by a unitary matrix

20
CLASSICAL TURING MACHINES

21
Classical Turing Machines

22
polynomial Model of calculation of a standard Turing Machine

23
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

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

26
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

27
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

28
Bounded-error probabilistic polynomial

30
QUANTUM TURING MACHINES TURING MACHINES

31
A sum of two complex numbers can be a zero

32
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.

33
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.

36
Sources:

37
Used in 2011.

Similar presentations

© 2021 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google