* Your assessment is very important for improving the workof artificial intelligence, which forms the content of this project
Download PDF
Ensemble interpretation wikipedia , lookup
Wave–particle duality wikipedia , lookup
Double-slit experiment wikipedia , lookup
Renormalization wikipedia , lookup
Renormalization group wikipedia , lookup
Relativistic quantum mechanics wikipedia , lookup
Bell test experiments wikipedia , lookup
Bohr–Einstein debates wikipedia , lookup
Quantum dot cellular automaton wikipedia , lookup
Delayed choice quantum eraser wikipedia , lookup
Particle in a box wikipedia , lookup
Quantum electrodynamics wikipedia , lookup
Bra–ket notation wikipedia , lookup
Scalar field theory wikipedia , lookup
Measurement in quantum mechanics wikipedia , lookup
Basil Hiley wikipedia , lookup
Density matrix wikipedia , lookup
Path integral formulation wikipedia , lookup
Copenhagen interpretation wikipedia , lookup
Quantum decoherence wikipedia , lookup
Topological quantum field theory wikipedia , lookup
Quantum field theory wikipedia , lookup
Hydrogen atom wikipedia , lookup
Coherent states wikipedia , lookup
Probability amplitude wikipedia , lookup
Bell's theorem wikipedia , lookup
Quantum dot wikipedia , lookup
Quantum entanglement wikipedia , lookup
Many-worlds interpretation wikipedia , lookup
Orchestrated objective reduction wikipedia , lookup
Quantum fiction wikipedia , lookup
Quantum computing wikipedia , lookup
EPR paradox wikipedia , lookup
History of quantum field theory wikipedia , lookup
Interpretations of quantum mechanics wikipedia , lookup
Symmetry in quantum mechanics wikipedia , lookup
Quantum teleportation wikipedia , lookup
Quantum machine learning wikipedia , lookup
Quantum key distribution wikipedia , lookup
Quantum group wikipedia , lookup
Quantum cognition wikipedia , lookup
Hidden variable theory wikipedia , lookup
algebraic category of quantum automata∗ bci1† 2013-03-22 1:19:26 1 The Algebraic Category of Quantum Automata Definition 1.1. Let us recall that a quantum automaton is defined as a quantum algebraic topology object– the quantum triple QA = (G, H − <G , Aut(G)), where G is a (locally compact) quantum groupoid, H − <G are the unitary representations of G on rigged Hilbert spaces <G of quantum states and quantum operators on the Hilbert space H, and Aut(G) is the transformation, or automorphism groupoid of quantum transitions that represents all flip-flop quantum transitions of one cubit each between the permitted quantum states of the quantum automaton. With the data from above definition we can now define also the category of quantum automata as follows. Definition 1.2. The category of quantum automata QA is defined as an algebraic category whose objects are triples (H, ∆ : H → H, µ) (where H is either a Hilbert space or a rigged Hilbert space of quantum states and operators acting on H, and µ is a measure related to the quantum logic, LM , and (quantum) transition probabilities of this quantum system), and whose morphisms are defined between such triples by homomorphisms of Hilbert spaces, Ø : H → H, naturally compatible with the operators ∆, and by homomorphisms between the associated Haar measure systems. An alternative definition is also possible based on Quantum Algebraic Topology (QAT). Definition 1.3. A quantum algebraic topology definition of the category of quantum algebraic automata is in terms of the objects specified above in Definition 0.1 as quantum automaton triples (QA ), and quantum automata homomorphisms defined between such triples; these QA morphisms are defined by groupoid homomorphisms h : G → G ∗ and α : Aut(G) → Aut(G ∗ ), together with unitarity preserving mappings u that are defined between unitary representations of G on rigged Hilbert spaces (or Hilbert space bundles). ∗ hAlgebraicCategoryOfQuantumAutomatai created: h2013-03-2i by: hbci1i version: h40784i Privacy setting: h1i hDefinitioni h18A10i h18C10i h03D10i h03D05i † This text is available under the Creative Commons Attribution/Share-Alike License 3.0. You can reuse this document or portions thereof only if you do so under terms that are compatible with the CC-BY-SA license. 1