29,223 research outputs found
Apollo docking test device design study final report
Docking simulation system for confirming Apollo probe design and drogue docking mechanisms under simulated space condition
Stochastic Heisenberg limit: Optimal estimation of a fluctuating phase
The ultimate limits to estimating a fluctuating phase imposed on an optical
beam can be found using the recently derived continuous quantum Cramer-Rao
bound. For Gaussian stationary statistics, and a phase spectrum scaling
asymptotically as 1/omega^p with p>1, the minimum mean-square error in any
(single-time) phase estimate scales as N^{-2(p-1)/(p+1)}, where N is the photon
flux. This gives the usual Heisenberg limit for a constant phase (as the limit
p--> infinity) and provides a stochastic Heisenberg limit for fluctuating
phases. For p=2 (Brownian motion), this limit can be attained by phase
tracking.Comment: 5+4 pages, to appear in Physical Review Letter
On the size of approximately convex sets in normed spaces
Let X be a normed space. A subset A of X is approximately convex if
for all and where is
the distance of to . Let \Co(A) be the convex hull and \diam(A) the
diameter of . We prove that every -dimensional normed space contains
approximately convex sets with \mathcal{H}(A,\Co(A))\ge \log_2n-1 and
\diam(A) \le C\sqrt n(\ln n)^2, where denotes the Hausdorff
distance. These estimates are reasonably sharp. For every , we construct
worst possible approximately convex sets in such that
\mathcal{H}(A,\Co(A))=\diam(A)=D. Several results pertaining to the
Hyers-Ulam stability theorem are also proved.Comment: 32 pages. See also http://www.math.sc.edu/~howard
Extremal Approximately Convex Functions and Estimating the Size of Convex Hulls
A real valued function defined on a convex is anemconvex function iff
it satisfies A thorough study of
approximately convex functions is made. The principal results are a sharp
universal upper bound for lower semi-continuous approximately convex functions
that vanish on the vertices of a simplex and an explicit description of the
unique largest bounded approximately convex function~ vanishing on the
vertices of a simplex.
A set in a normed space is an approximately convex set iff for all
the distance of the midpoint to is . The bounds
on approximately convex functions are used to show that in with the
Euclidean norm, for any approximately convex set , any point of the
convex hull of is at a distance of at most
from . Examples are given to show
this is the sharp bound. Bounds for general norms on are also given.Comment: 39 pages. See also http://www.math.sc.edu/~howard
Concepts of quantum non-Markovianity: a hierarchy
Markovian approximation is a widely-employed idea in descriptions of the
dynamics of open quantum systems (OQSs). Although it is usually claimed to be a
concept inspired by classical Markovianity, the term quantum Markovianity is
used inconsistently and often unrigorously in the literature. In this report we
compare the descriptions of classical stochastic processes and quantum
stochastic processes (as arising in OQSs), and show that there are inherent
differences that lead to the non-trivial problem of characterizing quantum
non-Markovianity. Rather than proposing a single definition of quantum
Markovianity, we study a host of Markov-related concepts in the quantum regime.
Some of these concepts have long been used in quantum theory, such as quantum
white noise, factorization approximation, divisibility, Lindblad master
equation, etc.. Others are first proposed in this report, including those we
call past-future independence, no (quantum) information backflow, and
composability. All of these concepts are defined under a unified framework,
which allows us to rigorously build hierarchy relations among them. With
various examples, we argue that the current most often used definitions of
quantum Markovianity in the literature do not fully capture the memoryless
property of OQSs. In fact, quantum non-Markovianity is highly
context-dependent. The results in this report, summarized as a hierarchy
figure, bring clarity to the nature of quantum non-Markovianity.Comment: Clarifications and references added; discussion of the related
classical hierarchy significantly improved. To appear in Physics Report
The quantum Bell-Ziv-Zakai bounds and Heisenberg limits for waveform estimation
We propose quantum versions of the Bell-Ziv-Zakai lower bounds on the error
in multiparameter estimation. As an application we consider measurement of a
time-varying optical phase signal with stationary Gaussian prior statistics and
a power law spectrum , with . With no other
assumptions, we show that the mean-square error has a lower bound scaling as
, where is the time-averaged mean photon
flux. Moreover, we show that this accuracy is achievable by sampling and
interpolation, for any . This bound is thus a rigorous generalization of
the Heisenberg limit, for measurement of a single unknown optical phase, to a
stochastically varying optical phase.Comment: 18 pages, 6 figures, comments welcom
Optimal Heisenberg-style bounds for the average performance of arbitrary phase estimates
The ultimate bound to the accuracy of phase estimates is often assumed to be
given by the Heisenberg limit. Recent work seemed to indicate that this bound
can be violated, yielding measurements with much higher accuracy than was
previously expected. The Heisenberg limit can be restored as a rigorous bound
to the accuracy provided one considers the accuracy averaged over the possible
values of the unknown phase, as we have recently shown [Phys. Rev. A 85,
041802(R) (2012)]. Here we present an expanded proof of this result together
with a number of additional results, including the proof of a previously
conjectured stronger bound in the asymptotic limit. Other measures of the
accuracy are examined, as well as other restrictions on the generator of the
phase shifts. We provide expanded numerical results for the minimum error and
asymptotic expansions. The significance of the results claiming violation of
the Heisenberg limit is assessed, followed by a detailed discussion of the
limitations of the Cramer-Rao bound.Comment: 22 pages, 4 figure
- …