Quantum automata and algebraic groups
From MaRDI portal
Publication:2456549
Recommendations
- STACS 2004
- Algebraic results on quantum automata
- scientific article; zbMATH DE number 2144695
- scientific article; zbMATH DE number 1836315
- scientific article
- Quantum algorithms for a set of group theoretic problems
- On the structure of quantum automorphism groups
- APPLICATIONS OF COMPUTER ALGEBRA IN QUANTUM GROUPS
- Computations in finite groups and quantum physics
- scientific article; zbMATH DE number 3903978
Cites work
- scientific article; zbMATH DE number 4071018 (Why is no real title available?)
- scientific article; zbMATH DE number 47220 (Why is no real title available?)
- scientific article; zbMATH DE number 3513703 (Why is no real title available?)
- scientific article; zbMATH DE number 3572058 (Why is no real title available?)
- scientific article; zbMATH DE number 1263310 (Why is no real title available?)
- scientific article; zbMATH DE number 523982 (Why is no real title available?)
- scientific article; zbMATH DE number 704831 (Why is no real title available?)
- scientific article; zbMATH DE number 1467843 (Why is no real title available?)
- scientific article; zbMATH DE number 217454 (Why is no real title available?)
- scientific article; zbMATH DE number 1846962 (Why is no real title available?)
- scientific article; zbMATH DE number 3371972 (Why is no real title available?)
- An algorithm for computing the integral closure
- An effective lower bound for the height of algebraic numbers
- Analogies and differences between quantum and stochastic automata
- Computational invariant theory
- Computing the radical of an ideal in positive characteristic
- Decidable and Undecidable Problems about Quantum Automata
- Deciding finiteness for matrix groups over function fields
- Deciding finiteness for matrix semigroups over function fields over finite fields. A note on a paper by Rockmore, Tan, and Beals
- Derivations and radicals of polynomial ideals over fields of arbitrary characteristic
- On commutative endomorphism rings
- On the combinatorial and algebraic complexity of quantifier elimination
- On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
- Probabilistic automata
- Quantum automata and quantum grammars
- The calculation of radical ideals in positive characteristic
Cited in
(27)- Computing the Lie algebra of the differential Galois group: the reducible case
- Toric varieties from cyclic matrix semigroups
- scientific article; zbMATH DE number 7559488 (Why is no real title available?)
- A fast algorithm for computing multiplicative relations between the roots of a generic polynomial
- On the decidability of the intersection problem for quantum automata and context-free languages
- An automaton-theoretic approach to the representation theory of quantum algebras
- Zariski density and computing in arithmetic groups
- scientific article; zbMATH DE number 5320410 (Why is no real title available?)
- Deciding universality of quantum gates
- Real computational universality: the word problem for a class of groups with infinite presentation
- Universality of single-qudit gates
- Undecidable problems for probabilistic automata of fixed dimension
- On the computation of the Galois group of linear difference equations
- Algebraic results on quantum automata
- Some formal tools for analyzing quantum automata.
- Computing the binomial part of a polynomial ideal
- Analyzing ultimate positivity for solvable systems
- Linear groups and computation
- Embedding algorithms and applications to differential equations
- Finding integral linear dependencies of algebraic numbers and algebraic Lie algebras
- Constructing algebraic groups from their Lie algebras.
- Semigroup intersection problems in the Heisenberg groups
- When are emptiness and containment decidable for probabilistic automata?
- On Reachability Problems for Low-Dimensional Matrix Semigroups
- Around the numeric-symbolic computation of differential Galois groups
- Undecidability on quantum finite automata
- Decidable and Undecidable Problems about Quantum Automata
This page was built for publication: Quantum automata and algebraic groups
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2456549)
