Finite automata models of quantized systems - PowerPoint PPT Presentation

About This Presentation
Title:

Finite automata models of quantized systems

Description:

Institut f r Theoretische Physik, Technische Universit t Wien ... Suggestions to trespass the Turing barrier ... Value definiteness in qm? ... – PowerPoint PPT presentation

Number of Views:42
Avg rating:3.0/5.0
Slides: 13
Provided by: kal71
Category:

less

Transcript and Presenter's Notes

Title: Finite automata models of quantized systems


1
Finite automata models of quantized systems
  • conceptual status and outlook
  • Karl Svozil
  • Institut für Theoretische Physik, Technische
    Universität Wien
  • Wiedner Hauptstrasse 8-10/136, A-1040 Vienna,
    AUSTRIA
  • http//tph.tuwien.ac.at/svozil/publ/2002-kyoto.pd
    f

2
Information is physical
  • Continuum theory and deterministic chaos
  • Possible speedups in quantum computing
  • Suggestions to trespass the Turing barrier

3
Edward F. Moore (1956 ) formalization of
complementarity
  • Quantum complementarity is the feature of certain
    microphysical systems not to allow the
    determination of all of its properties with
    arbitrary precision at once.
  • Example Mealy automaton

4
Logic of 4-state automata
5
Recent developments
  • Characterizazion of types of Complementarity
  • Simulation, universality and complementarity
  • Automaton partition logic
  • (C. S. Calude, E. Calude, B. Khoussainov,M.Schall
    er, M. Lipponen, K.S.)

6
Generalized urn models (Wright, 1978)
7
Logical equivalence of automata and generalized
urn models
8
Reversible automata
  • Combined transition and output functions are
    bijective, evolution is a permutation

9
Value definiteness in qm?
  • Nonexistence of two-valued measures (truth
    values) in quantized systems of Hilbert space
    dimension gt2

10
Counterfactual Automata
11
Base n-information in qm
  • a n-state particle carries exactly one nit of
    information
  • k n-state particles carry exactly k nits of
    information
  • Realizable by automata
  • 1, 2, 3, 1, 4, 5, 2, 6, 7, 3, 8, 9, 4,
    6, 8, 5, 7, 9,1, 2, 3, 1, 4, 5, 2, 6,
    7, 3, 8, 9, 4, 6, 9, 5, 7,
    8,1,2,3,1,4,7,2,5,8,3,6,9,4,5,6,7,8
    ,9, 1, 6, 9, 1, 7, 8, 2, 4, 9, 2, 5,
    7, 3, 4, 8, 3, 5, 6, 1, 6, 9, 1, 7, 8,
    2, 4, 9, 2, 5, 8, 3, 4, 7, 3, 5, 6.
  • (Zeilinger 1999, K.S. 2002)

12
Applicability
  • Automata sometimes behave differently than qm
    e.g., 1,2,3,4,1,2,4,3,1,4,2,
    3.
  • intrinsic physical properties'' of virtual
    realities in general, and computer games in
    particular the intrinsic look and feel'' of
    computer animated worlds.
Write a Comment
User Comments (0)
About PowerShow.com