Integrability, entropy and quantum computation

Krishnamurthy, E. V. (1999) Integrability, entropy and quantum computation International Journal of Modern Physics C, 10 (7). pp. 1205-1228. ISSN 0129-1831

Full text not available from this repository.

Official URL: http://www.worldscinet.com/ijmpc/10/1007/S01291831...

Related URL: http://dx.doi.org/10.1142/S012918319900098X

Abstract

The important requirements are stated for the success of quantum computation. These requirements involve coherent preserving Hamiltonians as well as exact integrability of the corresponding Feynman path integrals. Also we explain the role of metric entropy in dynamical evolutionary system and outline some of the open problems in the design of quantum computational systems. Finally, we observe that unless we understand quantum nondemolition measurements, quantum integrability, quantum chaos and the direction of time arrow, the quantum control and computational paradigms will remain elusive and the design of systems based on quantum dynamical evolution may not be feasible.

Item Type:Article
Source:Copyright of this article belongs to World Scientific Publishing Co Pte Ltd.
Keywords:Algorithmic Complexity; Coherent State Evolution; Dissipation; Exact Solvability; Feynman Path Integrals; Integrability
ID Code:28209
Deposited On:15 Dec 2010 12:24
Last Modified:04 Jun 2011 06:50

Repository Staff Only: item control page