Methods and applications of error-free computation
Methods and applications of error-free computation
Introductory theory of computer science
Introductory theory of computer science
Temporal logic of programs
Error-free polynomial matrix computations
Error-free polynomial matrix computations
Fractals for the classroom. Part 1.: Introduction to fractals and chaos
Fractals for the classroom. Part 1.: Introduction to fractals and chaos
The deductive foundations of computer programming: a one-volume version of “the logical basis for computer programming”
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
A new kind of science
Quantum computation and quantum information
Quantum computation and quantum information
The Complexity of Real Recursive Functions
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
General-Purpose Parallel Simulator for Quantum Computing
UMC '02 Proceedings of the Third International Conference on Unconventional Models of Computation
Classical and Quantum Computation
Classical and Quantum Computation
| Hi-index | 0.00 |
This paper studies the problems involved in the speed-up of the classical computational algorithms using the quantum computational paradigm. In particular, we relate the primitive recursive function approach used in computability theory with the harmonic oscillator basis used in quantum physics. Also, we raise some basic issues concerning quantum computational paradigm: these include failures in programmability and scalability, limitation on the size of the decoherence - free space available and lack of methods for proving quantum programs correct. In computer science, time is discrete and has a well-founded structure. But in physics, time is a real number, continuous and is infinitely divisible; also time can have a fractal dimension. As a result, the time complexity measures for conventional and quantum computation are incomparable. Proving properties of programs and termination rest heavily on the well-founded properties, and the transfinite induction principle. Hence transfinite induction is not applicable to reason about quantum programs.