Teleportation of continuous-variable polarization states

This paper discusses methods for the optical teleportation of continuous-variable polarization states. We show that using two pairs of entangled beams, generated using four squeezed beams, perfect teleportation of optical polarization states can be performed. Restricting ourselves to three squeezed beams, we demonstrate that polarization state teleportation can still exceed the classical limit. The three-squeezer schemes involve either the use of quantum nondemolition measurement or biased entanglement generated from a single squeezed beam. We analyze the efficacies of these schemes in terms of fidelity, signal transfer coefficients, and quantum correlations.

Selecting optimal instantiations of data models - Theory and validation of an ex ante approach

The schema of an information system can significantly impact the ability of end users to efficiently and effectively retrieve the information they need. Obtaining quickly the appropriate data increases the likelihood that an organization will make good decisions and respond adeptly to challenges. This research presents and validates a methodology for evaluating, ex ante, the relative desirability of alternative instantiations of a model of data. In contrast to prior research, each instantiation is based on a different formal theory. This research theorizes that the instantiation that yields the lowest weighted average query complexity for a representative sample of information requests is the most desirable instantiation for end-user queries. The theory was validated by an experiment that compared end-user performance using an instantiation of a data structure based on the relational model of data with performance using the corresponding instantiation of the data structure based on the object-relational model of data. Complexity was measured using three different Halstead metrics: program length, difficulty, and effort. For a representative sample of queries, the average complexity using each instantiation was calculated. As theorized, end users querying the instantiation with the lower average complexity made fewer semantic errors, i.e., were more effective at composing queries. (c) 2005 Elsevier B.V. All rights reserved.