Cristian S. Calude, Michael J. Dinneen, Karl Svozil  Home/Search
Context Related
| cs.auckland.ac.nz/CDMTCS/...130cris.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.auckland.ac.nz/...secondcgi.pl (more) Homepages: C.Calude |
Rate this article:      (best)Comment on this article |
Abstract: In this rather speculative note three problems pertaining to the power and limits of quantum computing are posed and partially answered: a) when are quantum speedups possible?, b) is fixed-point computing a better model for quantum computing?, c) can quantum computing trespass the Turing barrier? 1 When are quantum speedups possible? This section discusses the possibility that speedups in quantum computing can be achieved only for problems which have a few or even unique solutions [12]. For... (Update)
Context of citations to this paper: More
...deviation of the scattered data from the input data. 1 Introduction Recently various proposals to break Turing Barrier (see [13, 43, 8, 10]) have been discussed in a series of papers [18, 12, 25] The common denominator of all approaches is the essential use of some physical...
Cited by: More
Bio-Steps Beyond Turing - Calude, Paun (2004) (Correct)
Incompleteness, Complexity, Randomness and Beyond - Calude (2002) (Correct)
Coins, Quantum Measurements, and Turing's Barrier - Calude, Pavlov (2002) (Correct)
Similar documents (at the sentence level):
51.9%: Reflections on Quantum Computing - Quantum Computing.. - Calude, Dinneen, Svozil (2001) (Correct)
Active bibliography (related documents): More All
0.9: Counterfactual Effect, the Halting Problem, and the Busy.. - Calude, Dinneen, Svozil (1999) (Correct)
0.3: Chaitin Omega Numbers and Strong Reducibilities - Calude, Nies (1997) (Correct)
0.3: Understanding Mathematical Discourse - Zinn (1999) (Correct)
Similar documents based on text: More All
1.0: What Is the Value of Taxicab(6)? - Calude, Calude, Dinneen (2003) (Correct)
0.9: A Fast Natural Algorithm for Searching - Arulanandham, Calude, Dinneen (2003) (Correct)
0.5: Computational Complementarity and Sofic Shifts - Calude, Lipponen (1997) (Correct)
Related documents from co-citation: More All
4: Computing the uncomputable (context) - Casti - 2082
4: Non-Turing computations via Malament-Hogarth space-times - Etesi, Nemeti - 2002
4: Quantum algorithm for the Hilbert's tenth problem (context) - Kieu - 2001
BibTeX entry: (Update)
C.S. Calude,M.J. Dinneen,K. Svozil. Reflections on quantum computing,Complexit# ,6,1 (2000), 35-37. http://citeseer.ist.psu.edu/calude00reflections.html More
@techreport{ calude00reflections,
author = "C. S. Calude and M. J. Dinneen and K. Svozil",
title = "Reflections on Quantum Computing",
year = "2000",
url = "citeseer.ist.psu.edu/calude00reflections.html" }
Citations (may not include all citations):274 A catalog of complexity classes (context) - Johnson - 1990 ACM DBLP
210 A fast quantum mechanical algorithm for database search - Grover - 1996 ACM DBLP
128 Springer-Verlag (context) - Chaitin - 1999
127 with an application to the Entscheidungsproblem (context) - Turing, numbers - 1936
65 Speakable and Unspeakable in Quantum Mechanics (context) - Bell - 1987
57 Algorithms for quantum computation: discrete log and factori.. - Shor - 1994
31 Information and Randomness--An Algorithmic Perspective (context) - Calude - 1994
20 Social processes and proofs of theorems and programs (context) - De Millo, Lipton et al. - 1979 ACM DBLP
19 Quantum Computing (context) - Gruska - 1999 ACM DBLP
16 On non-computable functions (context) - Rado - 1962
15 Theories of Computational Complexity (context) - Calude - 1988
10 Unconventional Models of Computation (context) - Calude, Casti et al. - 1998 ACM
7 Impossibility--The Limits of Science and the Science of Limi.. (context) - Barrow - 1998
6 Computability by probabilistic machines (context) - De Leeuw, Moore et al. - 1956
4 Springer-Verlag (context) - Nahin - 1999
3 Program-size complexity computes the halting problem (context) - Chaitin, Arslanov et al. - 1995 DBLP
3 Fidelity in mathematical discourse: Is one and one really tw.. (context) - Davis - 1972
2 Private communication to K (context) - Gottlob - 1998
1 Counterfactual computation (context) - Mitchison, Josza
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl): More
On a problem of L. Priese - Tomescu (1996) (Correct)
Computably Presentable Models of Theories with Few Models - Khoussainov, Nies, Shore (1996) (Correct)
Computably Categorical Structures and Expansions by.. - Cholak, Goncharov.. (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC