Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Quantum computation and quantum information
Quantum computation and quantum information
Feynman Lectures on Computation
Feynman Lectures on Computation
Collision-based computing
Mathematics of Quantum Computation
Mathematics of Quantum Computation
Introduction to Quantum Computation Information
Introduction to Quantum Computation Information
The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions
Quantum Computation and Information: From Theory to Experiment (Topics in Applied Physics)
Quantum Computation and Information: From Theory to Experiment (Topics in Applied Physics)
Dynamical Bias in the Coin Toss
SIAM Review
Quantum Computer Science: An Introduction
Quantum Computer Science: An Introduction
Church's Thesis After 70 Years
Church's Thesis After 70 Years
| Hi-index | 0.00 |
As quantum parallelism allows the effective co-representation of classical mutually exclusive states, the diagonalization method of classical recursion theory has to be modified. Quantum diagonalization involves unitary operators whose eigenvalues are different from one.