3,581 research outputs found
Operator renewal theory and mixing rates for dynamical systems with infinite measure
We develop a theory of operator renewal sequences in the context of infinite
ergodic theory. For large classes of dynamical systems preserving an infinite
measure, we determine the asymptotic behaviour of iterates of the
transfer operator. This was previously an intractable problem.
Examples of systems covered by our results include (i) parabolic rational
maps of the complex plane and (ii) (not necessarily Markovian) nonuniformly
expanding interval maps with indifferent fixed points.
In addition, we give a particularly simple proof of pointwise dual ergodicity
(asymptotic behaviour of ) for the class of systems under
consideration.
In certain situations, including Pomeau-Manneville intermittency maps, we
obtain higher order expansions for and rates of mixing. Also, we obtain
error estimates in the associated Dynkin-Lamperti arcsine laws.Comment: Preprint, August 2010. Revised August 2011. After publication, a
minor error was pointed out by Kautzsch et al, arXiv:1404.5857. The updated
version includes minor corrections in Sections 10 and 11, and corresponding
modifications of certain statements in Section 1. All main results are
unaffected. In particular, Sections 2-9 are unchanged from the published
versio
Unbounded-error One-way Classical and Quantum Communication Complexity
This paper studies the gap between quantum one-way communication complexity
and its classical counterpart , under the {\em unbounded-error}
setting, i.e., it is enough that the success probability is strictly greater
than 1/2. It is proved that for {\em any} (total or partial) Boolean function
, , i.e., the former is always exactly one half
as large as the latter. The result has an application to obtaining (again an
exact) bound for the existence of -QRAC which is the -qubit random
access coding that can recover any one of original bits with success
probability . We can prove that -QRAC exists if and only if
. Previously, only the construction of QRAC using one qubit,
the existence of -RAC, and the non-existence of
-QRAC were known.Comment: 9 pages. To appear in Proc. ICALP 200
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
On Hausdorff dimension of the set of closed orbits for a cylindrical transformation
We deal with Besicovitch's problem of existence of discrete orbits for
transitive cylindrical transformations
where is an
irrational rotation on the circle \T and \varphi:\T\to\R is continuous,
i.e.\ we try to estimate how big can be the set
D(\alpha,\varphi):=\{x\in\T:|\varphi^{(n)}(x)|\to+\infty\text{as}|n|\to+\infty\}.
We show that for almost every there exists such that the
Hausdorff dimension of is at least . We also provide a
Diophantine condition on that guarantees the existence of
such that the dimension of is positive. Finally, for some
multidimensional rotations on \T^d, , we construct smooth
so that the Hausdorff dimension of is positive.Comment: 32 pages, 1 figur
Geometries for universal quantum computation with matchgates
Matchgates are a group of two-qubit gates associated with free fermions. They
are classically simulatable if restricted to act between nearest neighbors on a
one-dimensional chain, but become universal for quantum computation with
longer-range interactions. We describe various alternative geometries with
nearest-neighbor interactions that result in universal quantum computation with
matchgates only, including subtle departures from the chain. Our results pave
the way for new quantum computer architectures that rely solely on the simple
interactions associated with matchgates.Comment: 6 pages, 4 figures. Updated version includes an appendix extending
one of the result
Infinite ergodic theory and Non-extensive entropies
We bring into account a series of result in the infinite ergodic theory that
we believe that they are relevant to the theory of non-extensive entropie
On conformal measures and harmonic functions for group extensions
We prove a Perron-Frobenius-Ruelle theorem for group extensions of
topological Markov chains based on a construction of -finite conformal
measures and give applications to the construction of harmonic functions.Comment: To appear in Proceedings of "New Trends in Onedimensional Dynamics,
celebrating the 70th birthday of Welington de Melo
Approximate locality for quantum systems on graphs
In this Letter we make progress on a longstanding open problem of Aaronson
and Ambainis [Theory of Computing 1, 47 (2005)]: we show that if A is the
adjacency matrix of a sufficiently sparse low-dimensional graph then the
unitary operator e^{itA} can be approximated by a unitary operator U(t) whose
sparsity pattern is exactly that of a low-dimensional graph which gets more
dense as |t| increases. Secondly, we show that if U is a sparse unitary
operator with a gap \Delta in its spectrum, then there exists an approximate
logarithm H of U which is also sparse. The sparsity pattern of H gets more
dense as 1/\Delta increases. These two results can be interpreted as a way to
convert between local continuous-time and local discrete-time processes. As an
example we show that the discrete-time coined quantum walk can be realised as
an approximately local continuous-time quantum walk. Finally, we use our
construction to provide a definition for a fractional quantum fourier
transform.Comment: 5 pages, 2 figures, corrected typ
The Computational Power of Minkowski Spacetime
The Lorentzian length of a timelike curve connecting both endpoints of a
classical computation is a function of the path taken through Minkowski
spacetime. The associated runtime difference is due to time-dilation: the
phenomenon whereby an observer finds that another's physically identical ideal
clock has ticked at a different rate than their own clock. Using ideas
appearing in the framework of computational complexity theory, time-dilation is
quantified as an algorithmic resource by relating relativistic energy to an
th order polynomial time reduction at the completion of an observer's
journey. These results enable a comparison between the optimal quadratic
\emph{Grover speedup} from quantum computing and an speedup using
classical computers and relativistic effects. The goal is not to propose a
practical model of computation, but to probe the ultimate limits physics places
on computation.Comment: 6 pages, LaTeX, feedback welcom
- …