1 / 37

Quantum Automata Formalism

Quantum Automata Formalism. These are general questions related to complexity of quantum algorithms, combinational and sequential. Models of quantum sequential circuits. Quantum automata Quantum state machines Quantum Turing Machines Quantum Robots of Benioff

elda
Télécharger la présentation

Quantum Automata Formalism

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Quantum Automata Formalism

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

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

  4. A new formalism for classical (deterministic) automata

  5. Observe that this matrix is not permutative and not unitary Input state 2 Input state 1 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

  6. A formalism for classical non-deterministic automata

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

  8. 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 There are two paths from state 1 to state 2, which have labels sequence bb

  9. A FORMALISM FOR CLASSICAL PROBABILISTIC AUTOMATA

  10. PROBABILISTIC AUTOMATA

  11. Languages accepted by probabilistic automata

  12. A FORMALISM FOR QUANTUM AUTOMATA

  13. Quantum Finite Automata = QFA Now unitary matrices

  14. Probability that an automaton accepts a string bra Unitary matrix ket

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

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

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

  18. Quantum Automaton described by a unitary matrix

  19. CLASSICAL TURING MACHINES

  20. Classical Turing Machines

  21. Model of calculation of a standard Turing Machine polynomial

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

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

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

  25. Bounded-error probabilistic polynomial • Informally, a problem is in BPP if there is an algorithm for it that has the following properties: • It is allowed to flip coins and make random decisions • It is guaranteed to run in polynomial time • 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

  26. Bounded-error probabilistic polynomial

  27. QUANTUM TURING MACHINES

  28. A sum of two complex numbers can be a zero

  29. BQP • In computational complexity theoryBQP (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. • It is the quantum analogue of the complexity class BPP. • 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. • On any given run of the algorithm, it has a probability of at most 1/3 that it will give the wrong answer.

  30. BQP (cont) • Similarly to other "bounded error" probabilistic classes the choice of 1/3 in the definition is arbitrary. • 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. • 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.

  31. Sources:

  32. Used in 2011.

More Related