Quantum computers.
From MaRDI portal
Recommendations
Cited in
(27)- Weakly regular quantum grammars and asynchronous quantum automata
- A note on quantum sequential machines
- Characterization of sequential quantum machines
- A probabilistic model of computing with words
- Characterizations of quantum automata
- Equivalence checking of quantum finite-state machines
- Theory of quanputers
- On coverings of products of uninitialized sequential quantum machines
- Automata theory based on quantum logic: recognizability and accessibility
- Automata theory based on quantum logic: reversibilities and pushdown automata
- Determination of equivalence between quantum sequential machines
- Determining the equivalence for one-way quantum finite automata
- What is quantum computation.
- scientific article; zbMATH DE number 1687022 (Why is no real title available?)
- Micro-RNAs: viral genome and robustness of gene expression in the host
- A theory of computation based on unsharp quantum logic: finite state automata and pushdown automata
- The clock of a quantum computer
- Tight Binding Hamiltonians and Quantum Turing Machines
- Algebraic properties of uninitialized sequential quantum machines
- scientific article; zbMATH DE number 1848278 (Why is no real title available?)
- Quantum Turing automata
- On the power of two-way multihead quantum finite automata
- Quantum Computing Explained
- Quantum Computing Devices
- Coupling contraction, excitation, ventricular and coronary blood flow across scale and physics in the heart
- Automata theory based on quantum logic: Some characterizations
- Quaternionic quantum automata
This page was built for publication: Quantum computers.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5928540)
