1,702 research outputs found
A General Framework for Recursive Decompositions of Unitary Quantum Evolutions
Decompositions of the unitary group U(n) are useful tools in quantum
information theory as they allow one to decompose unitary evolutions into local
evolutions and evolutions causing entanglement. Several recursive
decompositions have been proposed in the literature to express unitary
operators as products of simple operators with properties relevant in
entanglement dynamics. In this paper, using the concept of grading of a Lie
algebra, we cast these decompositions in a unifying scheme and show how new
recursive decompositions can be obtained. In particular, we propose a new
recursive decomposition of the unitary operator on qubits, and we give a
numerical example.Comment: 17 pages. To appear in J. Phys. A: Math. Theor. This article replaces
our earlier preprint "A Recursive Decomposition of Unitary Operators on N
Qubits." The current version provides a general method to generate recursive
decompositions of unitary evolutions. Several decompositions obtained before
are shown to be as a special case of this general procedur
Enumeration of labelled 4-regular planar graphs
We present the first combinatorial scheme for counting labelled 4-regular
planar graphs through a complete recursive decomposition. More precisely, we
show that the exponential generating function of labelled 4-regular planar
graphs can be computed effectively as the solution of a system of equations,
from which the coefficients can be extracted. As a byproduct, we also enumerate
labelled 3-connected 4-regular planar graphs, and simple 4-regular rooted maps
Recursive strategy for decomposing Betti tables of complete intersections
We introduce a recursive decomposition algorithm for the Betti diagram of a
complete intersection using the diagram of a complete intersection defined by a
subset of the original generators. This alternative algorithm is the main tool
that we use to investigate stability and compatibility of the Boij-Soederberg
decompositions of related diagrams; indeed, when the biggest generating degree
is sufficiently large, the alternative algorithm produces the Boij-Soederberg
decomposition. We also provide a detailed analysis of the Boij-Soederberg
decomposition for Betti diagrams of codimension four complete intersections
where the largest generating degree satisfies the size condition
Single Source - All Sinks Max Flows in Planar Digraphs
Let G = (V,E) be a planar n-vertex digraph. Consider the problem of computing
max st-flow values in G from a fixed source s to all sinks t in V\{s}. We show
how to solve this problem in near-linear O(n log^3 n) time. Previously, no
better solution was known than running a single-source single-sink max flow
algorithm n-1 times, giving a total time bound of O(n^2 log n) with the
algorithm of Borradaile and Klein.
An important implication is that all-pairs max st-flow values in G can be
computed in near-quadratic time. This is close to optimal as the output size is
Theta(n^2). We give a quadratic lower bound on the number of distinct max flow
values and an Omega(n^3) lower bound for the total size of all min cut-sets.
This distinguishes the problem from the undirected case where the number of
distinct max flow values is O(n).
Previous to our result, no algorithm which could solve the all-pairs max flow
values problem faster than the time of Theta(n^2) max-flow computations for
every planar digraph was known.
This result is accompanied with a data structure that reports min cut-sets.
For fixed s and all t, after O(n^{3/2} log^{3/2} n) preprocessing time, it can
report the set of arcs C crossing a min st-cut in time roughly proportional to
the size of C.Comment: 25 pages, 4 figures; extended abstract appeared in FOCS 201
B-nodes: a new scalable high level abstraction model
This paper proposes a new modeling technique called B-Nodes. B-Nodes represent a new, high-level abstraction that allows technical detail to be controlled using top-down recursive decomposition. This abstraction. is independent of architectural detail and can therefore accommodate rapid changes in technology. The use of recursive decomposition allows B-Nodes to be used not only for entire e-commerce system but also sub-modules within this system. The use of fundamental units allows the performance of heterogeneous technologies to be compared and other units to be derived. Results to date indicate no comparable model exists. Should further work validate this technique the authors recommend its use as a standard technique in information systems analysis and desig
Truly Online Paging with Locality of Reference
The competitive analysis fails to model locality of reference in the online
paging problem. To deal with it, Borodin et. al. introduced the access graph
model, which attempts to capture the locality of reference. However, the access
graph model has a number of troubling aspects. The access graph has to be known
in advance to the paging algorithm and the memory required to represent the
access graph itself may be very large.
In this paper we present truly online strongly competitive paging algorithms
in the access graph model that do not have any prior information on the access
sequence. We present both deterministic and randomized algorithms. The
algorithms need only O(k log n) bits of memory, where k is the number of page
slots available and n is the size of the virtual address space. I.e.,
asymptotically no more memory than needed to store the virtual address
translation table.
We also observe that our algorithms adapt themselves to temporal changes in
the locality of reference. We model temporal changes in the locality of
reference by extending the access graph model to the so called extended access
graph model, in which many vertices of the graph can correspond to the same
virtual page. We define a measure for the rate of change in the locality of
reference in G denoted by Delta(G). We then show our algorithms remain strongly
competitive as long as Delta(G) >= (1+ epsilon)k, and no truly online algorithm
can be strongly competitive on a class of extended access graphs that includes
all graphs G with Delta(G) >= k- o(k).Comment: 37 pages. Preliminary version appeared in FOCS '9
Decremental Single-Source Reachability in Planar Digraphs
In this paper we show a new algorithm for the decremental single-source
reachability problem in directed planar graphs. It processes any sequence of
edge deletions in total time and explicitly
maintains the set of vertices reachable from a fixed source vertex. Hence, if
all edges are eventually deleted, the amortized time of processing each edge
deletion is only , which improves upon a previously
known solution. We also show an algorithm for decremental
maintenance of strongly connected components in directed planar graphs with the
same total update time. These results constitute the first almost optimal (up
to polylogarithmic factors) algorithms for both problems.
To the best of our knowledge, these are the first dynamic algorithms with
polylogarithmic update times on general directed planar graphs for non-trivial
reachability-type problems, for which only polynomial bounds are known in
general graphs
- …