Matching form with content

Successful computer-supported distance education requires that its enabling technologies are accessible and usable anywhere. They should work seamlessly inside and outside the information superhighway, wherever the target learners are located, without obtruding on the learning activity. It has long been recognised that the usability of interactive computer systems is inversely related to the visibility of the implementing technologies. Reducing the visibility of technology is especially challenging in the area of online language learning systems, which require high levels of interactivity and communication along multiple dimensions such as speaking, listening, reading and writing. In this article, the authors review the concept of invisibility as it applies to the design of interactive technologies and appliances. They describe a specialised appliance matched to the requirements for distance second language learning, and report on a successful multi-phase evaluation process, including initial field testing at a Thai open university.

Matching form with content

Successful computer-supported distance education requires that its enabling technologies are accessible and usable anywhere. They should work seamlessly inside and outside the information superhighway, wherever the target learners are located, without obtruding on the learning activity. It has long been recognised that the usability of interactive computer systems is inversely related to the visibility of the implementing technologies. Reducing the visibility of technology is especially challenging in the area of online language learning systems, which require high levels of interactivity and communication along multiple dimensions such as speaking, listening, reading and writing. In this article, the authors review the concept of invisibility as it applies to the design of interactive technologies and appliances. They describe a specialised appliance matched to the requirements for distance second language learning, and report on a successful multi-phase evaluation process, including initial field testing at a Thai open university.

Quantum reflection: The invisible quantum barrier

We construct an invisible quantum barrier which represents the phenomenon of quantum reflection using available data on atom-wall and Bose-Einstein-condensate-wall reflection. We use the Abel equation to invert the data. The resulting invisible quantum barrier is double valued in both axes. We study this invisible barrier in the case of atom and Bose-Einstein condensate (BEC) reflection from a solid silicon surface. A time-dependent, one-spatial-dimension Gross-Pitaevskii equation is solved for the BEC case. We found that the BEC behaves very similarly to the single atom except for size effects, which manifest themselves in a maximum in the reflectivity at small distances from the wall. The effect of the atom-atom interaction on the BEC reflection and correspondingly on the invisible barrier is found to be appreciable at low velocities and comparable to the finite-size effect. The trapping of an ultracold atom or BEC between two walls is discussed.

Measurement and state preparation via ion trap quantum computing

We investigate in detail the effects of a QND vibrational number measurement made on single ions in a recently proposed measurement scheme for the vibrational state of a register of ions in a linear rf trap [C. D'HELON and G. J. MILBURN, Phys Rev. A 54, 5141 (1996)]. The performance of a measurement shows some interesting patterns which are closely related to searching.

Expokit: A software package for computing matrix exponentials

Expokit provides a set of routines aimed at computing matrix exponentials. More precisely, it computes either a small matrix exponential in full, the action of a large sparse matrix exponential on an operand vector, or the solution of a system of linear ODEs with constant inhomogeneity. The backbone of the sparse routines consists of matrix-free Krylov subspace projection methods (Arnoldi and Lanczos processes), and that is why the toolkit is capable of coping with sparse matrices of large dimension. The software handles real and complex matrices and provides specific routines for symmetric and Hermitian matrices. The computation of matrix exponentials is a numerical issue of critical importance in the area of Markov chains and furthermore, the computed solution is subject to probabilistic constraints. In addition to addressing general matrix exponentials, a distinct attention is assigned to the computation of transient states of Markov chains.

Utilizing encoding in scalable linear optics quantum computing

We present a scheme which offers a significant reduction in the resources required to implement linear optics quantum computing. The scheme is a variation of the proposal of Knill, Laflamme and Milburn, and makes use of an incremental approach to the error encoding to boost probability of success.

Unitary R-matrices for topological quantum computing

The main problem with current approaches to quantum computing is the difficulty of establishing and maintaining entanglement. A Topological Quantum Computer (TQC) aims to overcome this by using different physical processes that are topological in nature and which are less susceptible to disturbance by the environment. In a (2+1)-dimensional system, pseudoparticles called anyons have statistics that fall somewhere between bosons and fermions. The exchange of two anyons, an effect called braiding from knot theory, can occur in two different ways. The quantum states corresponding to the two elementary braids constitute a two-state system allowing the definition of a computational basis. Quantum gates can be built up from patterns of braids and for quantum computing it is essential that the operator describing the braiding-the R-matrix-be described by a unitary operator. The physics of anyonic systems is governed by quantum groups, in particular the quasi-triangular Hopf algebras obtained from finite groups by the application of the Drinfeld quantum double construction. Their representation theory has been described in detail by Gould and Tsohantjis, and in this review article we relate the work of Gould to TQC schemes, particularly that of Kauffman.