Refining specifications to logic programs

The refinement calculus provides a framework for the stepwise development of imperative programs from specifications. In this paper we study a refinement calculus for deriving logic programs. Dealing with logic programs rather than imperative programs has the dual advantages that, due to the expressive power of logic programs, the final program is closer to the original specification, and each refinement step can achieve more. Together these reduce the overall number of derivation steps. We present a logic programming language extended with specification constructs (including general predicates, assertions, and types and invariants) to form a wide-spectrum language. General predicates allow non-executable properties to be included in specifications. Assertions, types and invariants make assumptions about the intended inputs of a procedure explicit, and can be used during refinement to optimize the constructed logic program. We provide a semantics for the extended logic programming language and derive a set of refinement laws. Finally we apply these to an example derivation.

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.

Developing logic programs from specifications using stepwise refinement

In this paper we demonstrate a refinement calculus for logic programs, which is a framework for developing logic programs from specifications. The paper is written in a tutorial-style, using a running example to illustrate how the refinement calculus is used to develop logic programs. The paper also presents an overview of some of the advanced features of the calculus, including the introduction of higher-order procedures and the refinement of abstract data types.

Quantum and classical fidelities for Gaussian states

We examine the physical significance of fidelity as a measure of similarity for Gaussian states by drawing a comparison with its classical counterpart. We find that the relationship between these classical and quantum fidelities is not straightforward, and in general does not seem to provide insight into the physical significance of quantum fidelity. To avoid this ambiguity we propose that the efficacy of quantum information protocols be characterized by determining their transfer function and then calculating the fidelity achievable for a hypothetical pure reference input state. (c) 2007 Optical Society of America.

Simulations of thermal Bose fields in the classical limit

We demonstrate that the time-dependent projected Gross-Pitaevskii equation (GPE) derived earlier [M. J. Davis, R. J. Ballagh, and K. Burnett, J. Phys. B 34, 4487 (2001)] can represent the highly occupied modes of a homogeneous, partially-condensed Bose gas. Contrary to the often held belief that the GPE is valid only at zero temperature, we find that this equation will evolve randomized initial wave functions to a state describing thermal equilibrium. In the case of small interaction strengths or low temperatures, our numerical results can be compared to the predictions of Bogoliubov theory and its perturbative extensions. This demonstrates the validity of the GPE in these limits and allows us to assign a temperature to the simulations unambiguously. However, the GPE method is nonperturbative, and we believe it can be used to describe the thermal properties of a Bose gas even when Bogoliubov theory fails. We suggest a different technique to measure the temperature of our simulations in these circumstances. Using this approach we determine the dependence of the condensate fraction and specific heat on temperature for several interaction strengths, and observe the appearance of vortex networks. Interesting behavior near the critical point is observed and discussed.

A refinement calculus for logic programs

Existing refinement calculi provide frameworks for the stepwise development of imperative programs from specifications. This paper presents a refinement calculus for deriving logic programs. The calculus contains a wide-spectrum logic programming language, including executable constructs such as sequential conjunction, disjunction, and existential quantification, as well as specification constructs such as general predicates, assumptions and universal quantification. A declarative semantics is defined for this wide-spectrum language based on executions. Executions are partial functions from states to states, where a state is represented as a set of bindings. The semantics is used to define the meaning of programs and specifications, including parameters and recursion. To complete the calculus, a notion of correctness-preserving refinement over programs in the wide-spectrum language is defined and refinement laws for developing programs are introduced. The refinement calculus is illustrated using example derivations and prototype tool support is discussed.

Nondeterministic gates for photonic single-rail quantum logic

We discuss techniques for producing, manipulating, and measuring qubits encoded optically as vacuum- and single-photon states. We show that a universal set of nondeterministic gates can be constructed using linear optics and photon counting. We investigate the efficacy of a test gate given realistic detector efficiencies.

ROM-based computation: Quantum versus classical

We introduce a model of computation based on read only memory (ROM), which allows us to compare the space-efficiency of reversible, error-free classical computation with reversible, error-free quantum computation. We show that a ROM-based quantum computer with one writable qubit is universal, whilst two writable bits are required for a universal classical ROM-based computer. We also comment on the time-efficiency advantages of quantum computation within this model.

Classical approach to interpretation of the charge-dependence of peptide mobilities obtained by capillary zone electrophoresis

Published mobility measurements obtained by capillary zone electrophoresis of human growth hormone peptides are described reasonably well by the classical theoretical relationships for electrophoretic migration. This conformity between theory and experiment has rendered possible a more critical assessment of a commonly employed empirical relationship between mobility (u), net charge (z) and molecular mass (M) of peptides in capillary electrophoresis. The assumed linear dependence between u and z/M-2/3 is shown to be an approximate description of a shallow curvilinear dependence convex to the abscissa. An improved procedure for the calculation of peptide charge (valence) is also described. (C) 2003 Elsevier B.V. All rights reserved.