Abstract
Two of the basic characteristics of any computational procedure are:
-
i)
iteration of a basic operation
-
ii)
convergence to the result in a finite number of steps.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
C. H. Bennett and G. Brassard, in Proc. of the IEEE Int. Conf. on Computers, Systems, and Signal Processing, Bangalore, India (IEEE, New York, 1984), pp.175–179.
Deutsch, D., “Quantum theory, the Church-Turing principle and the universal quantum computer,” Proc. R. Soc. Lond. A 400, 97–117 (1985).
D. Deutsh and R. Jozsa, “Rapid solution of problems by quantum computation”, Proc. R. Soc. Lond. A 439 (1992) 553–558.
Halmos Paul R.: A Hilbert space problem book. Van Nostrand (1967).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1997 Springer Science+Business Media New York
About this chapter
Cite this chapter
Accardi, L. (1997). An Open System Approach to Quantum Computers. In: Hirota, O., Holevo, A.S., Caves, C.M. (eds) Quantum Communication, Computing, and Measurement. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5923-8_41
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5923-8_41
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7716-0
Online ISBN: 978-1-4615-5923-8
eBook Packages: Springer Book Archive