Several methods for density matrix propagation in parallel computing environments are proposed and evaluated. It is demonstrated that the large communication overhead associated with each propagation step (two-sided multiplication of the density matrix by an exponential propagator and its conjugate) may be avoided and the simulation recast in a form that requires virtually no inter-thread commu...

We recast Selinger’s CPM-construction of completely positive maps [11] as an axiomatization of maximally mixed states. This axiomatization also guarantees categories of completely positive maps to satisfy the preparation-state agreement axiom of [3], and admits a physical interpretation in terms of purification of mixed states and CPMs. Internal traces, which are crucial in quantum information ...

We present a family of symplectic splitting methods especially tailored to solve numerically the time-dependent Schrodinger equation. When discretized in time, this equation can be recast in the form of a classical Hamiltonian system with a Hamiltonian function corresponding to a generalized high-dimensional separable harmonic oscillator. The structure of the system allows us to build highly ef...

Zador's classic result for the asymptotic high-rate behavior of entropy-constrained vector quantization is recast in a Lagrangian form which better matches the Lloyd algorithm used to optimize such quantizers. The equivalence of the two formulations is shown and the result is proved for source distributions that are absolutely continuous with respect to the Lebesgue measure which satisfy an ent...

Three separate studies to evaluate occupants' views of buildings and workplaces are summarised, identifying common threads of appearance, comfort / interior environment, configuration and functionality. Configuration can be recast as facets of a workplace that encourage interaction, functionality as facets that introduce distraction or threaten the absence of various support services. Many aspe...

In this work we recast some design principles commonly used in software engineering and adapt them to the design and analysis of domain descriptions in reasoning about actions. We show how the informal requirements of cohesion and coupling can be turned into consistency tests of several different arrangements of modules. This gives us new criteria for domain description evaluation and clarifies...

In this paper we consider tree-level scattering in the minimal N = 4 topological string and show that a large class of N -point functions can be recast in terms of corresponding amplitudes in the (1, k) minimal bosonic string. This suggests a non-trivial relation between the minimal N = 4 topological strings, the (1, k) minimal bosonic strings and their corresponding ADE matrix models. This rel...

We consider a perfectly competitive ex ante economy with a continuum of agents and negligible asymmetric information. For such an economy we recast the basic classical results on the existence of Walrasian equilibrium, core equivalence, and the blocking size of coalitions. Moreover, we examine the incentive compatibility of the ex ante Pareto, core and Walrasian allocations. © 2007 Elsevier Inc...

Satisfiability (SAT) and Max-SAT problems have been the object of considerable research effort over the past few decades. They remain a very important research area today due to their computational challenge and application importance. In this paper we investigate the use of penalty functions to recast SAT problems into the modelling framework offered by the unconstrained quadratic binary progr...

Polarity Items are linguistic expressions known for being a ‘lexically controlled’ phenomenon. In this paper we show how their behavior can be implemented in a deductive system. Furthermore, we point out some possible directions to recast the deductive solution into a Tree Adjoining Grammar system. In particular, we suggest to compare the proof system developed for Multimodal Categorial Grammar...