Pages that link to "Item:Q4212472"
From MaRDI portal
The following pages link to Quantum theory, the Church–Turing principle and the universal quantum computer (Q4212472):
Displaying 50 items.
- Quantum image edge extraction based on Laplacian operator and zero-cross method (Q669857) (← links)
- Fourier 1-norm and quantum speed-up (Q670032) (← links)
- Macroscopic realizations of quantum logics (Q685160) (← links)
- On the complexity of minimizing probabilistic and quantum automata (Q690502) (← links)
- Automata theory based on complete residuated lattice-valued logic: Turing machines (Q690917) (← links)
- Fundamentals of quantum information theory (Q699526) (← links)
- Quantum game simulator, using the circuit model of quantum computation (Q711847) (← links)
- Note on a universal quantum Turing machine (Q717053) (← links)
- Quantum information processing, operational quantum logic, convexity, and the foundations of physics (Q720547) (← links)
- Exploring the implementation of steganography protocols on quantum audio signals (Q725928) (← links)
- New method of calculating a multiplication by using the generalized Bernstein-Vazirani algorithm (Q726023) (← links)
- The quantum speed up as advanced cognition of the solution (Q732306) (← links)
- The computational status of physics (Q734210) (← links)
- Exciton-mediated quantum search on a star graph (Q747788) (← links)
- Quantum information as a general paradigm (Q816145) (← links)
- Fundamental limit on angular measurements and rotations from quantum mechanics and general relativity (Q824192) (← links)
- Quantum conservative many-valued computing (Q835101) (← links)
- On the computing power of fuzzy Turing machines (Q835106) (← links)
- Implementing Deutsch-Jozsa algorithm with superconducting quantum interference devices in cavity QED (Q842679) (← links)
- The 50\% advanced information rule of the quantum algorithms (Q842682) (← links)
- Prospects of quantum-classical optimization for digital design (Q849768) (← links)
- Fiber optics protocols for quantum communication (Q851888) (← links)
- Quantum physical symbol systems (Q853791) (← links)
- Quantum cooperative search algorithm for 3-sat (Q859988) (← links)
- Three ``quantum'' algorithms to solve 3-SAT (Q872207) (← links)
- Computational complexity of the landscape. I. (Q877685) (← links)
- A broader view on the limitations of information processing and communication by nature (Q885681) (← links)
- Classification of Boolean functions by the invariants of their matrix representation (Q885716) (← links)
- Quantum computation with classical light: the Deutsch algorithm (Q888098) (← links)
- A theoretical framework for quantum image representation and data loading scheme (Q893708) (← links)
- X-machines and the halting problem: Building a super-turing machine (Q919823) (← links)
- Quantum protocols for untrusted computations (Q924542) (← links)
- Quantum pattern recognition with probability of 100\% (Q930226) (← links)
- Quantum algorithm for SAT problem andquantum mutual entropy (Q930728) (← links)
- Computation in finitary stochastic and quantum processes (Q933429) (← links)
- The mechanism of quantum computation (Q943983) (← links)
- Quantum programming languages: a tentative study (Q954406) (← links)
- Machine semantics (Q959818) (← links)
- Quantum circuit oracles for abstract machine computations (Q960862) (← links)
- Glimmers of a pre-geometric perspective (Q967226) (← links)
- A four base computational method for the implementation of a quantum computer using silicon devices: circuit and simulation (Q984132) (← links)
- Quantum computing algorithm for electromagnetic field simulation (Q989907) (← links)
- A necessary and sufficient criterion for multipartite separable states (Q998063) (← links)
- Some algebraic properties of measure-once two-way quantum finite automata (Q1007122) (← links)
- Unsolvability of the halting problem in quantum dynamics (Q1008077) (← links)
- Introductive backgrounds to modern quantum mathematics with application to nonlinear dynamical systems (Q1008220) (← links)
- Perfect computational equivalence between quantum Turing machines and finitely generated uniform quantum circuit families (Q1009352) (← links)
- Weakly regular quantum grammars and asynchronous quantum automata (Q1013764) (← links)
- An application of quantum finite automata to interactive proof systems (Q1015813) (← links)
- A relation between fidelity and quantum adiabatic evolution (Q1017301) (← links)
