The Qu-Prolog unification algorithm: Formalisation and correctness

Qu-Prolog is an extension of Prolog which performs meta-level computations over object languages, such as predicate calculi and lambda-calculi, which have object-level variables, and quantifier or binding symbols creating local scopes for those variables. As in Prolog, the instantiable (meta-level) variables of Qu-Prolog range over object-level terms, and in addition other Qu-Prolog syntax denotes the various components of the object-level syntax, including object-level variables. Further, the meta-level operation of substitution into object-level terms is directly represented by appropriate Qu-Prolog syntax. Again as in Prolog, the driving mechanism in Qu-Prolog computation is a form of unification, but this is substantially more complex than for Prolog because of Qu-Prolog's greater generality, and especially because substitution operations are evaluated during unification. In this paper, the Qu-Prolog unification algorithm is specified, formalised and proved correct. Further, the analysis of the algorithm is carried out in a frame-work which straightforwardly allows the 'completeness' of the algorithm to be proved: though fully explicit answers to unification problems are not always provided, no information is lost in the unification process.

Macroscopic test of quantum mechanics versus stochastic electrodynamics

We identify a test of quantum mechanics versus macroscopic local realism in the form of stochastic electrodynamics. The test uses the steady-state triple quadrature correlations of a parametric oscillator below threshold.

On the construction of integrable closed chains with quantum supersymmetry

We present a general prescription for the construction of integrable one-dimensional systems with closed boundary conditions and quantum supersymmetry.

Robust algorithms for solving stochastic partial differential equations

A robust semi-implicit central partial difference algorithm for the numerical solution of coupled stochastic parabolic partial differential equations (PDEs) is described. This can be used for calculating correlation functions of systems of interacting stochastic fields. Such field equations can arise in the description of Hamiltonian and open systems in the physics of nonlinear processes, and may include multiplicative noise sources. The algorithm can be used for studying the properties of nonlinear quantum or classical field theories. The general approach is outlined and applied to a specific example, namely the quantum statistical fluctuations of ultra-short optical pulses in chi((2)) parametric waveguides. This example uses a non-diagonal coherent state representation, and correctly predicts the sub-shot noise level spectral fluctuations observed in homodyne detection measurements. It is expected that the methods used wilt be applicable for higher-order correlation functions and other physical problems as well. A stochastic differencing technique for reducing sampling errors is also introduced. This involves solving nonlinear stochastic parabolic PDEs in combination with a reference process, which uses the Wigner representation in the example presented here. A computer implementation on MIMD parallel architectures is discussed. (C) 1997 Academic Press.

Quantum Lie algebras, their existence, uniqueness and q-antisymmetry

Quantum Lie algebras are generalizations of Lie algebras which have the quantum parameter h built into their structure. They have been defined concretely as certain submodules L-h(g) of the quantized enveloping algebras U-h(g). On them the quantum Lie product is given by the quantum adjoint action. Here we define for any finite-dimensional simple complex Lie algebra g an abstract quantum Lie algebra g(h) independent of any concrete realization. Its h-dependent structure constants are given in terms of inverse quantum Clebsch-Gordan coefficients. We then show that all concrete quantum Lie algebras L-h(g) are isomorphic to an abstract quantum Lie algebra g(h). In this way we prove two important properties of quantum Lie algebras: 1) all quantum Lie algebras L-h(g) associated to the same g are isomorphic, 2) the quantum Lie product of any Ch(B) is q-antisymmetric. We also describe a construction of L-h(g) which establishes their existence.

Quantum dynamics of an atomic Bose-Einstein condensate in a double-well potential

We consider the quantum dynamics of a neutral atom Bose-Einstein condensate in a double-well potential, including many-body hard-sphere interactions. Using a mean-field factorization we show that the coherent oscillations due to tunneling are suppressed when the number of atoms exceeds a critical value. An exact quantum solution, in a two-mode approximation, shows that the mean-field solution is modulated by a quantum collapse and revival sequence.

Classical and quantum signatures of competing chi((2)) nonlinearities

We report the observation of the quantum effects of competing chi((2)) nonlinearities. We also report classical signatures of competition, namely, clamping of the second-harmonic power and production of nondegenerate frequencies in the visible. Theory is presented that describes the observations as resulting from competition between various chi((2)) up-conversion and down-conversion processes. We show that competition imposes hitherto unsuspected limits to both power generation and squeezing. The observed signatures are expected to be significant effects in practical systems.

Quantum noise limits to terabaud communications

From a general model of fiber optics, we investigate the physical limits of soliton-based terabaud communication systems. In particular we consider Raman and initial quantum noise effects which are often neglected in fiber communications. Simulations of the position diffusion in dark and bright solitons show that these effects become increasingly important at short pulse durations, even over kilometer-scale distances. We also obtain an approximate analytic theory in agreement with numerical simulations, which shows that the Raman effects exceed the Gordon-Haus jitter for sub-picosecond pulses. (C) 1997 Elsevier Science B.V.

Twisted quantum affine superalgebra U-q[sl(2/2)((2))], U-q[osp(2/2)] invariant R-matrices and a new integrable electronic model

We describe the twisted affine superalgebra sl(2\2)((2)) and its quantized version U-q[sl(2\2)((2))]. We investigate the tensor product representation of the four-dimensional grade star representation for the fixed-point sub superalgebra U-q[osp(2\2)]. We work out the tensor product decomposition explicitly and find that the decomposition is not completely reducible. Associated with this four-dimensional grade star representation we derive two U-q[osp(2\2)] invariant R-matrices: one of them corresponds to U-q [sl(2\2)(2)] and the other to U-q [osp(2\2)((1))]. Using the R-matrix for U-q[sl(2\2)((2))], we construct a new U-q[osp(2\2)] invariant strongly correlated electronic model, which is integrable in one dimension. Interestingly this model reduces in the q = 1 limit, to the one proposed by Essler et al which has a larger sl(2\2) symmetry.

Optimal quantum measurements for phase-shift estimation in optical interferometry

Quantum information theory, applied to optical interferometry, yields a 1/n scaling of phase uncertainty Delta phi independent of the applied phase shift phi, where n is the number of photons in the interferometer. This 1/n scaling is achieved provided that the output state is subjected to an optimal phase measurement. We establish this scaling law for both passive (linear) and active (nonlinear) interferometers and identify the coefficient of proportionality. Whereas a highly nonclassical state is required to achieve optimal scaling for passive interferometry, a classical input state yields a 1/n scaling of phase uncertainty for active interferometry.

Analysis and implementation of a new constant acceleration subcycling algorithm

An algorithm for explicit integration of structural dynamics problems with multiple time steps is proposed that averages accelerations to obtain subcycle states at a nodal interface between regions integrated with different time steps. With integer time step ratios, the resulting subcycle updates at the interface sum to give the same effect as a central difference update over a major cycle. The algorithm is shown to have good accuracy, and stability properties in linear elastic analysis similar to those of constant velocity subcycling algorithms. The implementation of a generalised form of the algorithm with non-integer time step ratios is presented. (C) 1997 by John Wiley & Sons, Ltd.

Quantum chaos in the atomic gravitational cavity

We report quantum chaos phenomena in the atomic gravitational cavity. We consider the reflection of cold atoms from a temporally modulated evanescent wave. In the globally chaotic regime, for small modulation, the squared energy distribution as a function of time demonstrates dynamical localization. However, for larger modulation delocalization occurs.

The subcycled Newmark algorithm

The popular Newmark algorithm, used for implicit direct integration of structural dynamics, is extended by means of a nodal partition to permit use of different timesteps in different regions of a structural model. The algorithm developed has as a special case an explicit-explicit subcycling algorithm previously reported by Belytschko, Yen and Mullen. That algorithm has been shown, in the absence of damping or other energy dissipation, to exhibit instability over narrow timestep ranges that become narrower as the number of degrees of freedom increases, making them unlikely to be encountered in practice. The present algorithm avoids such instabilities in the case of a one to two timestep ratio (two subcycles), achieving unconditional stability in an exponential sense for a linear problem. However, with three or more subcycles, the trapezoidal rule exhibits stability that becomes conditional, falling towards that of the central difference method as the number of subcycles increases. Instabilities over narrow timestep ranges, that become narrower as the model size increases, also appear with three or more subcycles. However by moving the partition between timesteps one row of elements into the region suitable for integration with the larger timestep these the unstable timestep ranges become extremely narrow, even in simple systems with a few degrees of freedom. As well, accuracy is improved. Use of a version of the Newmark algorithm that dissipates high frequencies minimises or eliminates these narrow bands of instability. Viscous damping is also shown to remove these instabilities, at the expense of having more effect on the low frequency response.

Measuring macromolecular diffusion using heteronuclear multiple-quantum pulsed-field-gradient NMR

We have previously shown that H-1 pulsed-field-gradient (PFG) NMR spectroscopy provides a facile method for monitoring protein self-association and can be used, albeit with some caveats, to measure the apparent molecular mass of the diffusant [Dingley et al. (1995) J. Biomol. NMR, 6, 321-328]. In this paper we show that, for N-15-labelled proteins, selection of H-1-N-15 multiple-quantum (MQ) coherences in PFG diffusion experiments provides several advantages over monitoring H-1 single-quantum (SQ) magnetization. First, the use of a gradient-selected MQ filter provides a convenient means of suppressing resonances from both the solvent and unlabelled solutes. Second, H-1-N-15 zero-quantum coherence dephases more rapidly than H-1 SQ coherence under the influence of a PFG. This allows the diffusion coefficients of larger proteins to be measured more readily. Alternatively, the gradient length and/or the diffusion delay may be decreased, thereby reducing signal losses from relaxation. In order to extend the size of macromolecules to which these experiments can be applied, we have developed a new MQ PFG diffusion experiment in which the magnetization is stored as longitudinal two-spin order for most of the diffusion period, thus minimizing sensitivity losses due to transverse relaxation and J-coupling evolution.

Simulated-annealing-based genetic algorithm for modeling the optical constants of solids

We propose a simulated-annealing-based genetic algorithm for solving model parameter estimation problems. The algorithm incorporates advantages of both genetic algorithms and simulated annealing. Tests on computer-generated synthetic data that closely resemble optical constants of a metal were performed to compare the efficiency of plain genetic algorithms against the simulated-annealing-based genetic algorithms. These tests assess the ability of the algorithms to and the global minimum and the accuracy of values obtained for model parameters. Finally, the algorithm with the best performance is used to fit the model dielectric function to data for platinum and aluminum. (C) 1997 Optical Society of America.