4,563 research outputs found
Product Integral Representations of Wilson Lines and Wilson Loops, and Non-Abelian Stokes Theorem
We make use of product integrals to provide an unambiguous mathematical
representation of Wilson line and Wilson loop operators. Then, drawing upon
various properties of product integrals, we discuss such properties of these
operators as approximating them with partial sums, their convergence, and their
behavior under gauge transformations. We also obtain a surface product integral
representation for the Wilson loop operator. The result can be interpreted as
the non-abelian version of Stokes theorem.Comment: 20 pages, LaTe
Deterministic and Probabilistic Binary Search in Graphs
We consider the following natural generalization of Binary Search: in a given
undirected, positively weighted graph, one vertex is a target. The algorithm's
task is to identify the target by adaptively querying vertices. In response to
querying a node , the algorithm learns either that is the target, or is
given an edge out of that lies on a shortest path from to the target.
We study this problem in a general noisy model in which each query
independently receives a correct answer with probability (a
known constant), and an (adversarial) incorrect one with probability .
Our main positive result is that when (i.e., all answers are
correct), queries are always sufficient. For general , we give an
(almost information-theoretically optimal) algorithm that uses, in expectation,
no more than queries, and identifies the target correctly with probability at
leas . Here, denotes the
entropy. The first bound is achieved by the algorithm that iteratively queries
a 1-median of the nodes not ruled out yet; the second bound by careful repeated
invocations of a multiplicative weights algorithm.
Even for , we show several hardness results for the problem of
determining whether a target can be found using queries. Our upper bound of
implies a quasipolynomial-time algorithm for undirected connected
graphs; we show that this is best-possible under the Strong Exponential Time
Hypothesis (SETH). Furthermore, for directed graphs, or for undirected graphs
with non-uniform node querying costs, the problem is PSPACE-complete. For a
semi-adaptive version, in which one may query nodes each in rounds, we
show membership in in the polynomial hierarchy, and hardness
for
The solution of a mixed boundary value problem in the theory of diffraction by a semi-infinite plane
A solution is obtained for the problem of the diffraction of a plane wave sound source by a semi-infinite half plane. One surface of the half plane has a soft (pressure release) boundary condition, and the other surface a rigid boundary condition. Two unusual features arise in this boundary value problem. The first is the edge field singularity. It is found to be more singular than that associated with either a completely rigid or a completely soft semi-infinite half plane. The second is that the normal Wiener-Hopf method (which is the standard technique to solve half plane problems) has to be modified to give the solution to the present mixed boundary value problem. The mathematical problem which is solved is an approximate model for a rigid noise barrier, one face of which is treated with an absorbing lining. It is shown that the optimum attenuation in the shadow region is obtained when the absorbing lining is on the side of the screen which makes the smallest angle to the source or the receiver from the edge
A Two-loop Test of Buscher's T-duality I
We study the two loop quantum equivalence of sigma models related by
Buscher's T-duality transformation. The computation of the two loop
perturbative free energy density is performed in the case of a certain
deformation of the SU(2) principal sigma model, and its T-dual, using
dimensional regularization and the geometric sigma model perturbation theory.
We obtain agreement between the free energy density expressions of the two
models.Comment: 28 pp, Latex, references adde
Dynamic Range Majority Data Structures
Given a set of coloured points on the real line, we study the problem of
answering range -majority (or "heavy hitter") queries on . More
specifically, for a query range , we want to return each colour that is
assigned to more than an -fraction of the points contained in . We
present a new data structure for answering range -majority queries on a
dynamic set of points, where . Our data structure uses O(n)
space, supports queries in time, and updates in amortized time. If the coordinates of the points are integers,
then the query time can be improved to . For constant values of , this improved query
time matches an existing lower bound, for any data structure with
polylogarithmic update time. We also generalize our data structure to handle
sets of points in d-dimensions, for , as well as dynamic arrays, in
which each entry is a colour.Comment: 16 pages, Preliminary version appeared in ISAAC 201
First series of minimally invasive, robot-assisted tracheobronchoplasty with mesh for severe tracheobronchomalacia
A Full Characterization of Quantum Advice
We prove the following surprising result: given any quantum state rho on n
qubits, there exists a local Hamiltonian H on poly(n) qubits (e.g., a sum of
two-qubit interactions), such that any ground state of H can be used to
simulate rho on all quantum circuits of fixed polynomial size. In terms of
complexity classes, this implies that BQP/qpoly is contained in QMA/poly, which
supersedes the previous result of Aaronson that BQP/qpoly is contained in
PP/poly. Indeed, we can exactly characterize quantum advice, as equivalent in
power to untrusted quantum advice combined with trusted classical advice.
Proving our main result requires combining a large number of previous tools --
including a result of Alon et al. on learning of real-valued concept classes, a
result of Aaronson on the learnability of quantum states, and a result of
Aharonov and Regev on "QMA+ super-verifiers" -- and also creating some new
ones. The main new tool is a so-called majority-certificates lemma, which is
closely related to boosting in machine learning, and which seems likely to find
independent applications. In its simplest version, this lemma says the
following. Given any set S of Boolean functions on n variables, any function f
in S can be expressed as the pointwise majority of m=O(n) functions f1,...,fm
in S, such that each fi is the unique function in S compatible with O(log|S|)
input/output constraints.Comment: We fixed two significant issues: 1. The definition of YQP machines
needed to be changed to preserve our results. The revised definition is more
natural and has the same intuitive interpretation. 2. We needed properties of
Local Hamiltonian reductions going beyond those proved in previous works
(whose results we'd misstated). We now prove the needed properties. See p. 6
for more on both point
Genetic strategies for dissecting complex traits in biomass willows (Salix spp.)
Willows are highly diverse catkin-bearing trees and shrubs of the genus Salix. They occur in many growth forms, from tall trees to creeping alpines, and successfully occupy a wide variety of ecological niches. Shrubby willows (sub-genus Vetrix) have many characteristics that render them suited to cultivation in much faster growth cycles than conventional forestry. They respond well to coppicing, can be propagated vegetatively as cuttings and achieve rapid growth with low fertilizer inputs. As a result, willows grown as short rotation coppice are now among the leading commercially grown biomass crops in temperate regions. However, although willows have a long history of cultivation for traditional uses, their industrial use is relatively recent and, compared with major arable crops, they are largely undomesticated. Breeding programmes initiated to improve willow as a biomass crop achieved a doubling of yields within a period of <15 years. These advances were made by selecting for stem characteristics (height and diameter) and coppicing response (shoot number and shoot vigour), as well as resistance to pests, diseases and environmental stress, with little or no knowledge of the genetic basis of these traits. Genetics and genomics, combined with extensive phenotyping, have substantially improved our understanding of the basis of biomass traits in willow for more targeted breeding via marker-assisted selection. Here, we present the strategy we have adopted in which a genetic-based approach was used to dissect complex traits into more defined components for molecular breeding and gene discovery
Fluctuations in the Site Disordered Traveling Salesman Problem
We extend a previous statistical mechanical treatment of the traveling
salesman problem by defining a discrete "site disordered'' problem in which
fluctuations about saddle points can be computed. The results clarify the basis
of our original treatment, and illuminate but do not resolve the difficulties
of taking the zero temperature limit to obtain minimal path lengths.Comment: 17 pages, 3 eps figures, revte
MIMO free-space optical communication employing subcarrier intensity modulation in atmospheric turbulence channels
In this paper, we analyse the error performance of transmitter/receiver array free-space optical (FSO) communication system employing binary phase shift keying (BPSK) subcarrier intensity modulation (SIM) in clear but turbulent atmospheric channel. Subcarrier modulation is employed to eliminate the need for adaptive threshold detector. Direct detection is employed at the receiver and each subcarrier is subsequently demodulated coherently. The effect of irradiance fading is mitigated with an array of lasers and photodetectors. The received signals are linearly combined using the optimal maximum ratio combining (MRC), the equal gain combining (EGC) and the selection combining (SelC). The bit error rate (BER) equations are derived considering additive white Gaussian noise and log normal intensity fluctuations. This work is part of the EU COST actions and EU projects
- …