Pages that link to "Item:Q4492466"
From MaRDI portal
The following pages link to Can a Universal Quantum Computer Be Fully Quantum? (Q4492466):
Displaying 12 items.
- Quantum Kolmogorov complexity and information-disturbance theorem (Q657557) (← links)
- Machine semantics (Q959818) (← links)
- Quantum circuit oracles for abstract machine computations (Q960862) (← links)
- Unsolvability of the halting problem in quantum dynamics (Q1008077) (← links)
- Quantum random access stored-program machines (Q2084736) (← links)
- Zeno machines and hypercomputation (Q2503270) (← links)
- Can a Quantum Computer Run the von Neumann Architecture? (Q3000932) (← links)
- On Halting Process of Quantum Turing Machine (Q3368408) (← links)
- THE SECOND QUANTIZED QUANTUM TURING MACHINE AND KOLMOGOROV COMPLEXITY (Q3528819) (← links)
- IRREVERSIBILITY IN THE HALTING PROBLEM OF QUANTUM COMPUTER (Q3621459) (← links)
- Remarks on universal quantum computer (Q5954906) (← links)
- A prototype of quantum von Neumann architecture (Q6157055) (← links)
