2,318 research outputs found
Trapped Modes in Linear Quantum Stochastic Networks with Delays
Networks of open quantum systems with feedback have become an active area of
research for applications such as quantum control, quantum communication and
coherent information processing. A canonical formalism for the interconnection
of open quantum systems using quantum stochastic differential equations (QSDEs)
has been developed by Gough, James and co-workers and has been used to develop
practical modeling approaches for complex quantum optical, microwave and
optomechanical circuits/networks. In this paper we fill a significant gap in
existing methodology by showing how trapped modes resulting from feedback via
coupled channels with finite propagation delays can be identified
systematically in a given passive linear network. Our method is based on the
Blaschke-Potapov multiplicative factorization theorem for inner matrix-valued
functions, which has been applied in the past to analog electronic networks.
Our results provide a basis for extending the Quantum Hardware Description
Language (QHDL) framework for automated quantum network model construction
(Tezak \textit{et al.} in Philos. Trans. R. Soc. A, Math. Phys. Eng. Sci.
370(1979):5270-5290, to efficiently treat scenarios in which each
interconnection of components has an associated signal propagation time delay
Multi-Embedding of Metric Spaces
Metric embedding has become a common technique in the design of algorithms.
Its applicability is often dependent on how high the embedding's distortion is.
For example, embedding finite metric space into trees may require linear
distortion as a function of its size. Using probabilistic metric embeddings,
the bound on the distortion reduces to logarithmic in the size.
We make a step in the direction of bypassing the lower bound on the
distortion in terms of the size of the metric. We define "multi-embeddings" of
metric spaces in which a point is mapped onto a set of points, while keeping
the target metric of polynomial size and preserving the distortion of paths.
The distortion obtained with such multi-embeddings into ultrametrics is at most
O(log Delta loglog Delta) where Delta is the aspect ratio of the metric. In
particular, for expander graphs, we are able to obtain constant distortion
embeddings into trees in contrast with the Omega(log n) lower bound for all
previous notions of embeddings.
We demonstrate the algorithmic application of the new embeddings for two
optimization problems: group Steiner tree and metrical task systems
Coinductive subtyping for abstract compilation of object-oriented languages into Horn formulas
In recent work we have shown how it is possible to define very precise type
systems for object-oriented languages by abstractly compiling a program into a
Horn formula f. Then type inference amounts to resolving a certain goal w.r.t.
the coinductive (that is, the greatest) Herbrand model of f.
Type systems defined in this way are idealized, since in the most interesting
instantiations both the terms of the coinductive Herbrand universe and goal
derivations cannot be finitely represented. However, sound and quite expressive
approximations can be implemented by considering only regular terms and
derivations. In doing so, it is essential to introduce a proper subtyping
relation formalizing the notion of approximation between types.
In this paper we study a subtyping relation on coinductive terms built on
union and object type constructors. We define an interpretation of types as set
of values induced by a quite intuitive relation of membership of values to
types, and prove that the definition of subtyping is sound w.r.t. subset
inclusion between type interpretations. The proof of soundness has allowed us
to simplify the notion of contractive derivation and to discover that the
previously given definition of subtyping did not cover all possible
representations of the empty type
The nuclear dimension of C*-algebras
We introduce the nuclear dimension of a C*-algebra; this is a noncommutative
version of topological covering dimension based on a modification of the
earlier concept of decomposition rank. Our notion behaves well with respect to
inductive limits, tensor products, hereditary subalgebras (hence ideals),
quotients, and even extensions. It can be computed for many examples; in
particular, it is finite for all UCT Kirchberg algebras. In fact, all classes
of nuclear C*-algebras which have so far been successfully classified consist
of examples with finite nuclear dimension, and it turns out that finite nuclear
dimension implies many properties relevant for the classification program.
Surprisingly, the concept is also linked to coarse geometry, since for a
discrete metric space of bounded geometry the nuclear dimension of the
associated uniform Roe algebra is dominated by the asymptotic dimension of the
underlying space.Comment: 33 page
- …