37,841 research outputs found
Using groups for investigating rewrite systems
We describe several technical tools that prove to be efficient for
investigating the rewrite systems associated with a family of algebraic laws,
and might be useful for more general rewrite systems. These tools consist in
introducing a monoid of partial operators, listing the monoid relations
expressing the possible local confluence of the rewrite system, then
introducing the group presented by these relations, and finally replacing the
initial rewrite system with a internal process entirely sitting in the latter
group. When the approach can be completed, one typically obtains a practical
method for constructing algebras satisfying prescribed laws and for solving the
associated word problem
A Diagrammatic Axiomatisation for Qubit Entanglement
Diagrammatic techniques for reasoning about monoidal categories provide an
intuitive understanding of the symmetries and connections of interacting
computational processes. In the context of categorical quantum mechanics,
Coecke and Kissinger suggested that two 3-qubit states, GHZ and W, may be used
as the building blocks of a new graphical calculus, aimed at a diagrammatic
classification of multipartite qubit entanglement that would highlight the
communicational properties of quantum states, and their potential uses in
cryptographic schemes.
In this paper, we present a full graphical axiomatisation of the relations
between GHZ and W: the ZW calculus. This refines a version of the preexisting
ZX calculus, while keeping its most desirable characteristics: undirectedness,
a large degree of symmetry, and an algebraic underpinning. We prove that the ZW
calculus is complete for the category of free abelian groups on a power of two
generators - "qubits with integer coefficients" - and provide an explicit
normalisation procedure.Comment: 12 page
State space c-reductions for concurrent systems in rewriting logic
We present c-reductions, a state space reduction technique.
The rough idea is to exploit some equivalence relation on states (possibly capturing system regularities) that preserves behavioral properties, and explore the induced quotient system. This is done by means of a canonizer
function, which maps each state into a (non necessarily unique) canonical representative of its equivalence class. The approach exploits the expressiveness of rewriting logic and its realization in Maude to enjoy several advantages over similar approaches: exibility and simplicity in
the definition of the reductions (supporting not only traditional symmetry reductions, but also name reuse and name abstraction); reasoning support for checking and proving correctness of the reductions; and automatization
of the reduction infrastructure via Maude's meta-programming
features. The approach has been validated over a set of representative case studies, exhibiting comparable results with respect to other tools
The Quantum Transverse Field Ising Model on an Infinite Tree from Matrix Product States
We give a generalization to an infinite tree geometry of Vidal's infinite
time-evolving block decimation (iTEBD) algorithm for simulating an infinite
line of quantum spins. We numerically investigate the quantum Ising model in a
transverse field on the Bethe lattice using the Matrix Product State ansatz. We
observe a second order phase transition, with certain key differences from the
transverse field Ising model on an infinite spin chain. We also investigate a
transverse field Ising model with a specific longitudinal field. When the
transverse field is turned off, this model has a highly degenerate ground state
as opposed to the pure Ising model whose ground state is only doubly
degenerate.Comment: 28 pages, 23 figures, PDFlate
String rewriting for Double Coset Systems
In this paper we show how string rewriting methods can be applied to give a
new method of computing double cosets. Previous methods for double cosets were
enumerative and thus restricted to finite examples. Our rewriting methods do
not suffer this restriction and we present some examples of infinite double
coset systems which can now easily be solved using our approach. Even when both
enumerative and rewriting techniques are present, our rewriting methods will be
competitive because they i) do not require the preliminary calculation of
cosets; and ii) as with single coset problems, there are many examples for
which rewriting is more effective than enumeration.
Automata provide the means for identifying expressions for normal forms in
infinite situations and we show how they may be constructed in this setting.
Further, related results on logged string rewriting for monoid presentations
are exploited to show how witnesses for the computations can be provided and
how information about the subgroups and the relations between them can be
extracted. Finally, we discuss how the double coset problem is a special case
of the problem of computing induced actions of categories which demonstrates
that our rewriting methods are applicable to a much wider class of problems
than just the double coset problem.Comment: accepted for publication by the Journal of Symbolic Computatio
Group analysis and exact solutions of a class of variable coefficient nonlinear telegraph equations
A complete group classification of a class of variable coefficient
(1+1)-dimensional telegraph equations , is
given, by using a compatibility method and additional equivalence
transformations. A number of new interesting nonlinear invariant models which
have non-trivial invariance algebras are obtained. Furthermore, the possible
additional equivalence transformations between equations from the class under
consideration are investigated. Exact solutions of special forms of these
equations are also constructed via classical Lie method and generalized
conditional transformations. Local conservation laws with characteristics of
order 0 of the class under consideration are classified with respect to the
group of equivalence transformations.Comment: 23 page
- …