Related papers: Space-bounded computation: quantum is better than …

This paper has been withdrawn by the author due to a crucial error.

This article is an attempt to generalize the classical theory of reversible computing, principally developed by Bennet [IBM J. Res. Develop., 17(1973)] and by Fredkin and Toffoli [Internat. J. Theoret. Phys., 21(1982)], to the quantum case.…

In spite of its popularity, it has not been possible to vindicate the conventional wisdom that classical mechanics is a limiting case of quantum mechanics. The purpose of the present paper is to offer an alternative formulation of classical…

This paper has been withdrawn for the reasons mentioned in the Comments.

This paper has been withdrawn by the author due to a critical error in the proof of Theorem A pointed out by Burkhard Wilking.

This paper has been withdrawn by the authors, because of a crucial gap in the proof of the main theorem.

Quantum computing improves substantially on known classical algorithms for various important problems, but the nature of the relationship between quantum and classical computing is not yet fully understood. This relationship can be…

This paper has been withdraw by the auhor due to a mistake in classification of the algebra

This paper has been withdrawn Abstract: This paper has been withdrawn by the author due to the publication.

Withdrawn; replaced by longer, more detailed paper quant-ph/0010065.

This paper has been withdrawn.

This paper has been withdrawn by the author due to inconsistency of the considered working hypothesis. The consistent treatment is presented in the last publications of the author.

This paper has been withdrawn by the author due to some mistakes

This paper has been withdrawn by the author. Proofs of two propositions need more details.

This paper was withdrawn by the author.

The paper is being withdrawn. A new submission will follow.

This paper has been withdrawn due to a crucial error in the proof of the main theorem

This paper has been withdrawn since the material in these notes has been updated, and extended, in hep-th/0409031 and hep-th/0409033, and in work to follow.

We show that a separation between the class of all problems that can efficiently be solved on a quantum computer and those solvable using probabilistic classical algorithms in polynomial time implies the generalized contextuality of quantum…

This paper has been withdrawn by the author.