Classical computation with quantum systems

As semiconductor electronic devices scale to the nanometer range and quantum structures (molecules, fullerenes, quantum dots, nanotubes) are investigated for use in information processing and storage, it, becomes useful to explore the limits imposed by quantum mechanics on classical computing. To formulate the problem of a quantum mechanical description of classical computing, electronic device and logic gates are described as quantum sub-systems with inputs treated as boundary conditions, outputs expressed.is operator expectation values, and transfer characteristics and logic operations expressed through the sub-system Hamiltonian. with constraints appropriate to the boundary conditions. This approach, naturally, leads to a description of the subsystem.,, in terms of density matrices. Application of the maximum entropy principle subject to the boundary conditions (inputs) allows for the determination of the density matrix (logic operation), and for calculation of expectation values of operators over a finite region (outputs). The method allows for in analysis of the static properties of quantum sub-systems.

Nature of quantum measurement for quantities not represented by Hermitian operators

In the case of a simple quantum system, we investigate the possibility of defining meaningful probabilities for a quantity that cannot be represented by a Hermitian operator. We find that the consistent-histories approach, recently applied to the case of quantum traversal time [N. Yamada, Phys. Rev. Lett. 83, 3350 (1999)], does not provide a suitable criterion and we dispute Yamada's claim of finding a simple solution to the tunneling-time problem. Rather, we define the probabilities for certain types of generally nonorthogonal decomposition of the system's quantum state. These relate to the interaction between the system and its environment, can be observed in a generalized von Neumann measurement, and are consistent with a particular class of positive-operator-valued measures.