On coverings of products of uninitialized sequential quantum machines

DOI10.1007/S10773-019-04031-9MaRDI QIDQ2323760zbMATH OpenOpenAlexWikidataFDO

Authors Feidan Huang

Publication date 3 September 2019

Published in International Journal of Theoretical Physics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10773-019-04031-9

zbMATH Keywords

coveringprobability coveringproductuninitialized quantum sequential machineuninitialized sequential quantum machine

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• scientific article; zbMATH DE number 7028346
• Characterization of sequential quantum machines
• On covering of products of fuzzy finite state machines
• Determination of equivalence between quantum sequential machines
• A note on quantum sequential machines

Cites work

• A decomposition theorem for probabilistic transition systems
• A note on quantum sequential machines
• Algebraic properties of uninitialized sequential quantum machines
• Automata theory based on quantum logic. I
• Automata theory based on quantum logic. II.
• Automata theory based on quantum logic: reversibilities and pushdown automata
• Automata theory based on quantum logic: Some characterizations
• Characterization of sequential quantum machines
• Characterizations of quantum automata
• Determination of equivalence between quantum sequential machines
• Determining the equivalence for one-way quantum finite automata
• Generalizations of the distributed Deutsch-Jozsa promise problem
• Hierarchy and equivalence of multi-letter quantum finite automata
• scientific article; zbMATH DE number 194139 (Why is no real title available?)
• scientific article; zbMATH DE number 3371972 (Why is no real title available?)
• Multi-letter quantum finite automata: decidability of the equivalence and minimization of states
• On covering of products of fuzzy finite state machines
• On the state complexity of semi-quantum finite automata
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Power of the interactive proof systems with verifiers modeled by semi-quantum two-way finite automata
• Products of fuzzy finite state machines
• Promise problems solved by quantum and classical finite automata
• Quantum automata and quantum grammars
• Quantum computers.
• Quantum finite automata with control language
• Quantum pushdown automata
• Quantum theory, the Church–Turing principle and the universal quantum computer
• State succinctness of two-way finite automata with quantum and classical states
• The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
• Two-tape finite automata with quantum and classical states
• Two-way finite automata with quantum and classical states.

Cited in

(4)

• Characterization of sequential quantum machines
• Quantum covers in quantum measure theory
• scientific article; zbMATH DE number 7028346 (Why is no real title available?)
• Algebraic properties of uninitialized sequential quantum machines

This page was built for publication: On coverings of products of uninitialized sequential quantum machines

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2323760)