A Simple Algorithm for Local Conversion of Pure States

We describe an algorithm for converting one bipartite quantum state into another using only local operations and classical communication, which is much simpler than the original algorithm given by Nielsen [Phys. Rev. Lett. 83, 436 (1999)]. Our algorithm uses only a single measurement by one of the parties, followed by local unitary operations which are permutations in the local Schmidt bases.Comment: 5 pages, LaTeX, reference adde

A Bigraph Relational Model

In this paper, we present a model based on relations for bigraphical reactive systems [Milner09]. Its defining characteristics are that validity and reaction relations are captured as traces in a multi-set rewriting system. The relational model is derived from Milner's graphical definition and directly amenable to implementation.Comment: In Proceedings LFMTP 2011, arXiv:1110.668

A de Finetti Representation Theorem for Quantum Process Tomography

In quantum process tomography, it is possible to express the experimenter's prior information as a sequence of quantum operations, i.e., trace-preserving completely positive maps. In analogy to de Finetti's concept of exchangeability for probability distributions, we give a definition of exchangeability for sequences of quantum operations. We then state and prove a representation theorem for such exchangeable sequences. The theorem leads to a simple characterization of admissible priors for quantum process tomography and solves to a Bayesian's satisfaction the problem of an unknown quantum operation.Comment: 10 page

Linear Logic Programming for Narrative Generation

Abstract. In this paper, we explore the use of Linear Logic programming for story generation. We use the language Celf to represent narrative knowledge, and its own querying mechanism to generate story instances, through a number of proof terms. Each proof term obtained is used, through a resource-flow analysis, to build a directed graph where nodes are narrative actions and edges represent inferred causality relationships. Such graphs represent narrative plots structured by narrative causality. Building on previous work evidencing the suitability of Linear Logic as a conceptual model of action and change for narratives, we explore the conditions under which these representations can be operationalized through Linear Logic Programming techniques. This approach is a candidate technique for narrative generation which unifies declarative representations and generation via query and deduction mechanisms

Optimal quantum teleportation with an arbitrary pure state

We derive the maximum fidelity attainable for teleportation using a shared pair of d-level systems in an arbitrary pure state. This derivation provides a complete set of necessary and sufficient conditions for optimal teleportation protocols. We also discuss the information on the teleported particle which is revealed in course of the protocol using a non-maximally entangled state.Comment: 10 pages, REVTe