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.
- Analysis of quantum particle automata for solving the density classification problem (Q2347660) (← links)
- A different Deutsch-Jozsa (Q2355586) (← links)
- Feasible quantum error detection with linear optics (Q2383273) (← links)
- The convex sum of product states for a separable state (Q2383324) (← links)
- Sure success partial search (Q2384167) (← links)
- Ion trap quantum computing with Ca\(^{+}\) ions (Q2386401) (← links)
- Polynomial time quantum computation with advice (Q2390250) (← links)
- Deterministic implementations of single-photon multi-qubit Deutsch-Jozsa algorithms with linear optics (Q2398351) (← links)
- Kochen-Specker theorem as a precondition for quantum computing (Q2400205) (← links)
- Quantum image processing? (Q2411571) (← links)
- Quantum Fourier transform in computational basis (Q2412616) (← links)
- Quantum perceptron over a field and neural network architecture selection in a quantum computer (Q2418125) (← links)
- A macroscopic device for quantum computation (Q2426173) (← links)
- Many worlds, the cluster-state quantum computer, and the problem of the preferred basis (Q2436209) (← links)
- A new sure-success generalization of Grover iteration and its application to weight decision problem of Boolean functions (Q2436429) (← links)
- The rational approximations of the unitary groups (Q2443904) (← links)
- A universal quantum circuit scheme for finding complex eigenvalues (Q2454202) (← links)
- Multi-dimensional color image storage and retrieval for a normal arbitrary quantum superposition state (Q2454250) (← links)
- Automata theory based on quantum logic: reversibilities and pushdown automata (Q2455592) (← links)
- Entropy and quantum Kolmogorov complexity: a quantum Brudno's theorem (Q2458453) (← links)
- Groverian entanglement measure and evolution of entanglement in search algorithm for \(n (=3, 5)\)-qubit systems with real coefficients (Q2460284) (← links)
- Physical constraints on hypercomputation (Q2482458) (← links)
- Some formal tools for analyzing quantum automata. (Q2490805) (← links)
- The case for hypercomputation (Q2497872) (← links)
- The Church-Turing thesis: Still valid after all these years? (Q2497878) (← links)
- Computational power of infinite quantum parallelism (Q2498972) (← links)
- On the mathematics of quantum computers (Q2500800) (← links)
- Zeno machines and hypercomputation (Q2503270) (← links)
- Determination of equivalence between quantum sequential machines (Q2503273) (← links)
- Finite state and finite stop quantum languages (Q2506022) (← links)
- A quantum algorithm for Viterbi decoding of classical convolutional codes (Q2516136) (← links)
- Universality and programmability of quantum computers (Q2518381) (← links)
- A theory of computation based on quantum logic. I (Q2575078) (← links)
- A common algebraic description for probabilistic and quantum computations (Q2575744) (← links)
- The physical Church thesis as an explanation of the Galileo thesis (Q2629933) (← links)
- Quantum computation and cryptography: An overview (Q2655488) (← links)
- Remarks on black hole complexity puzzle (Q2657768) (← links)
- Quantum-inspired satin bowerbird algorithm with Bloch spherical search for constrained structural optimization (Q2666736) (← links)
- Certified quantum computation in Isabelle/HOL (Q2666954) (← links)
- Sample complexity of hidden subgroup problem (Q2672576) (← links)
- Quantum image encryption algorithm based on Arnold scrambling and wavelet transforms (Q2677146) (← links)
- A comment on: ``Quantum image processing?'' (Q2677217) (← links)
- A general protocol for distributed quantum gates (Q2679034) (← links)
- Quantum image restoration based on Hudson-Parthasarathy Schrödinger equation (Q2681036) (← links)
- Alternative scheme of universal optical programmable multi-qubit gates for polarization qubits (Q2681543) (← links)
- On the continuity of quantum correlation quantifiers (Q2681550) (← links)
- Image encryption using quantum 3-D Baker map and generalized gray code coupled with fractional Chen's chaotic system (Q2681558) (← links)
- A low failure rate quantum algorithm for searching maximum or minimum (Q2681628) (← links)
- Universal computation with quantum fields (Q2681706) (← links)
- Non-locality and entanglement in multi-qubit systems from a unified framework (Q2684199) (← links)
