相关论文: Quantum automata, braid group and link polynomials

Knot and link polynomials are topological invariants calculated from the expectation value of loop operators in topological field theories. In 3D Chern-Simons theory, these invariants can be found from crossing and braiding matrices of…

Knot theory provides a powerful tool for the understanding of topological matters in biology, chemistry, and physics. Here knot theory is introduced to describe topological phases in the quantum spin system. Exactly solvable models with…

The spin network simulator model represents a bridge between (generalised) circuit schemes for standard quantum computation and approaches based on notions from Topological Quantum Field Theories (TQFTs). The key tool is provided by the…

In this work we construct an automaton for the commutative closure of a given regular group language. The number of states of the resulting automaton is bounded by the number of states of the original automaton, raised to the power of the…

In this paper a finite dimensional unital associative algebra is presented, and its group of algebra automorphisms is detailed. The studied algebra can physically be understood as the creation operator algebra in a formal quantum field…

We study solutions of the Knizhnik-Zamolodchikov equation for discrete representations of SU(2)_k at rational level k+2=p/q using a regular basis in which the braid matrices are well defined for all spins. We show that at spin J=(j+1)p-1…

We describe methods to construct digital quantum simulation algorithms for quantum spin systems on a regular lattice with local interactions. In addition to tools such as the Trotter-Suzuki expansion and graph coloring, we also discuss the…

Single-$\Lambda$ hypernuclei are the most straightforward extension of atomic nuclei. A thorough description of baryonic system beyond first-generation quark sector is indispensable for the maturation of nuclear $ab$ $initio$ methods. This…

We construct a simple translationally invariant, nearest-neighbor Hamiltonian on a chain of 10-dimensional qudits that makes it possible to realize universal quantum computing without any external control during the computational process.…

It is shown that the eigenproblem of any $2\times 2$ matrix Hamiltonian with discrete eigenvalues is involved with a supersymmetric quantum mechanics. The energy dependence of the superalgebra marks the disparity between the deduced…

How do cellular automata behave in the limit of a very large number of cells? Is there a continuum limit with simple properties? We attack this problem by mapping certain classes of automata to quantum field theories for which powerful…

Quantitative automata are useful representations for numerous applications, including modeling probability distributions over sequences to Markov chains and reward machines. Actively learning such automata typically occurs using explicitly…

SL_q(2) at odd roots of unity q^l =1 is studied as a quantum cover of the complex rotation group SO(3,C), in terms of the associated Hopf algebras of (quantum) polynomial functions. We work out the irreducible corepresentations, the…

The state complexity of a finite(-state) automaton intuitively measures the size of the description of the automaton. Sakoda and Sipser [STOC 1972, pp. 275--286] were concerned with nonuniform families of finite automata and they discussed…

Quantum Annealing (QA) is a computational framework where a quantum system's continuous evolution is used to find the global minimum of an objective function over an unstructured search space. It can be seen as a general metaheuristic for…

The graph isomorphism problem is theoretically interesting and also has many practical applications. The best known classical algorithms for graph isomorphism all run in time super-polynomial in the size of the graph in the worst case. An…

We develop a general theory of `quantum' diffeomorphism groups based on the universal comeasuring quantum group $M(A)$ associated to an algebra $A$ and its various quotients. Explicit formulae are introduced for this construction, as well…

In this second paper in a series, we show that the the general statistical approach to nonrelativistic quantum mechanics developed in the first paper yields a representation of quantum spin and magnetic moments based on classical…

We lift the lattice of translations in the extended affine Weyl group to a braid group action on the quantum affine algebra. This action fixes the Heisenberg subalgebra pointwise. Loop like generators are found for the algebra which satisfy…

We show that the braid-group extension of the monodromy-based topological quantum computation scheme of Das Sarma et al. can be understood in terms of the universal R matrix for the Ising model giving similar results to those obtained by…