Pages that link to "Item:Q4212472"

The following pages link to Quantum theory, the Church–Turing principle and the universal quantum computer (Q4212472):

Displaying 16 items.

• Do multipartite correlations speed up adiabatic quantum computation or quantum annealing? (Q331871) (← links)
• Automata theory based on quantum logic: Some characterizations (Q598192) (← links)
• On the complexity of minimizing probabilistic and quantum automata (Q690502) (← links)
• X-machines and the halting problem: Building a super-turing machine (Q919823) (← links)
• Some algebraic properties of measure-once two-way quantum finite automata (Q1007122) (← links)
• What is computation? (Q1293030) (← links)
• Characterizing the super-Turing computing power and efficiency of classical fuzzy Turing machines (Q1434368) (← links)
• A probabilistic model of computing with words (Q1776375) (← links)
• Quantum realization of the nearest neighbor value interpolation method for INEQR (Q1993789) (← links)
• X states of the same spectrum and entanglement as all two-qubit states (Q1994745) (← links)
• A new sure-success generalization of Grover iteration and its application to weight decision problem of Boolean functions (Q2436429) (← links)
• Automata theory based on quantum logic: reversibilities and pushdown automata (Q2455592) (← links)
• The Church-Turing thesis: Still valid after all these years? (Q2497878) (← links)
• Determination of equivalence between quantum sequential machines (Q2503273) (← links)
• Machines, Logic and Quantum Physics (Q4527933) (← links)
• A model-theoretic interpretation of environment-induced superselection (Q4905116) (← links)