32,403 research outputs found
Quantum search by measurement
We propose a quantum algorithm for solving combinatorial search problems that
uses only a sequence of measurements. The algorithm is similar in spirit to
quantum computation by adiabatic evolution, in that the goal is to remain in
the ground state of a time-varying Hamiltonian. Indeed, we show that the
running times of the two algorithms are closely related. We also show how to
achieve the quadratic speedup for Grover's unstructured search problem with
only two measurements. Finally, we discuss some similarities and differences
between the adiabatic and measurement algorithms.Comment: 8 pages, 2 figure
A Stepwise Planned Approach to the Solution of Hilbert's Sixth Problem. III : Measurements and von Neumann Projection/Collapse Rule
Supmech, the universal mechanics developed in the previous two papers,
accommodates both quantum and classical mechanics as subdisciplines (a brief
outline is included for completeness); this feature facilitates, in a supmech
based treatment of quantum measurements, an unambiguous treatment of the
apparatus as a quantum system approximated well by a classical one. Taking
explicitly into consideration the fact that observations on the apparatus are
made when it has `settled down after the measurement interaction' and are
restricted to macroscopically distinguishable pointer readings, the unwanted
superpositions of (system + apparatus) states are shown to be suppressed; this
provides a genuinely physics based justification for the (traditionally
\emph{postulated}) von Neumann projection/collapse rule. The decoherence
mechanism brought into play by the stated observational constraints is free
from the objections against the traditional decoherence program.Comment: 29 pages; one section and two references added; results unchange
Heap Abstractions for Static Analysis
Heap data is potentially unbounded and seemingly arbitrary. As a consequence,
unlike stack and static memory, heap memory cannot be abstracted directly in
terms of a fixed set of source variable names appearing in the program being
analysed. This makes it an interesting topic of study and there is an abundance
of literature employing heap abstractions. Although most studies have addressed
similar concerns, their formulations and formalisms often seem dissimilar and
some times even unrelated. Thus, the insights gained in one description of heap
abstraction may not directly carry over to some other description. This survey
is a result of our quest for a unifying theme in the existing descriptions of
heap abstractions. In particular, our interest lies in the abstractions and not
in the algorithms that construct them.
In our search of a unified theme, we view a heap abstraction as consisting of
two features: a heap model to represent the heap memory and a summarization
technique for bounding the heap representation. We classify the models as
storeless, store based, and hybrid. We describe various summarization
techniques based on k-limiting, allocation sites, patterns, variables, other
generic instrumentation predicates, and higher-order logics. This approach
allows us to compare the insights of a large number of seemingly dissimilar
heap abstractions and also paves way for creating new abstractions by
mix-and-match of models and summarization techniques.Comment: 49 pages, 20 figure
Position Measurements Obeying Momentum Conservation
We present a hitherto unknown fundamental limitation to a basic measurement:
that of the position of a quantum object when the total momentum of the object
and apparatus is conserved. This result extends the famous Wigner-Araki-Yanase
(WAY) theorem, and shows that accurate position measurements are only
practically feasible if there is a large momentum uncertainty in the apparatus
An Analytical Study of a Structured Overlay in the presence of Dynamic Membership
In this paper, we present a complete analytical study of dynamic membership (aka churn) in structured peer-to-peer networks. We use a master-equation-based approach, which is used traditionally in
non-equilibrium statistical mechanics to describe steady-state or transient phenomena. We demonstrate that this methodology is in fact also well suited to describing structured overlay networks by
an application to the Chord system. For any rate of churn
and stabilization rates, and any system size, we accurately account for the functional form of: the distribution of inter-node distances, the probability of network disconnection, the fraction of failed or
incorrect successor and finger pointers and show how we can use these quantities to predict both the performance and consistency of lookups under churn.
Additionally, we also discuss how churn may actually be of different 'types' and the implications
this will have for structured overlays in general. All theoretical predictions match simulation results to a high extent.
The analysis includes details that are applicable to
a generic structured overlay deploying a ring as well
as Chord-specific details that can act as guidelines
for analyzing other systems
Hybrid Information Flow Analysis for Programs with Arrays
Information flow analysis checks whether certain pieces of (confidential)
data may affect the results of computations in unwanted ways and thus leak
information. Dynamic information flow analysis adds instrumentation code to the
target software to track flows at run time and raise alarms if a flow policy is
violated; hybrid analyses combine this with preliminary static analysis.
Using a subset of C as the target language, we extend previous work on hybrid
information flow analysis that handled pointers to scalars. Our extended
formulation handles arrays, pointers to array elements, and pointer arithmetic.
Information flow through arrays of pointers is tracked precisely while arrays
of non-pointer types are summarized efficiently.
A prototype of our approach is implemented using the Frama-C program analysis
and transformation framework. Work on a full machine-checked proof of the
correctness of our approach using Isabelle/HOL is well underway; we present the
existing parts and sketch the rest of the correctness argument.Comment: In Proceedings VPT 2016, arXiv:1607.0183
- …