1,307 research outputs found
Practical characterization of quantum devices without tomography
Quantum tomography is the main method used to assess the quality of quantum
information processing devices, but its complexity presents a major obstacle
for the characterization of even moderately large systems. The number of
experimental settings required to extract complete information about a device
grows exponentially with its size, and so does the running time for processing
the data generated by these experiments. Part of the problem is that tomography
generates much more information than is usually sought. Taking a more targeted
approach, we develop schemes that enable (i) estimating the fidelity of an
experiment to a theoretical ideal description, (ii) learning which description
within a reduced subset best matches the experimental data. Both these
approaches yield a significant reduction in resources compared to tomography.
In particular, we demonstrate that fidelity can be estimated from a number of
simple experimental settings that is independent of the system size, removing
an important roadblock for the experimental study of larger quantum information
processing units.Comment: (v1) 11 pages, 1 table, 4 figures. (v2) See also the closely related
work: arXiv:1104.4695 (v3) method extended to continuous variable systems
(v4) updated to published versio
Pengaruh Program Nasional Pemberdayaan Masyarakat Mandiri Perdesaan terhadap Sosial Ekonomi Rumah Tangga pada Kelompok Simpan Pinjam Perempuan di Desa Ononamolo II Lot Kecamatan Gunungsitoli Barat Kota Gunungsitoli
Poverty is a phenomenal problem. Therefore, poverty is a topic that is very important and crucial to be completed. The phenomenon of poverty, which is most often found in rural areas, has been undertaken by the government to be resolved by establishing programs such as the National Program for Community Empowerment in Rural Areas or Program Nasional Pemberdayaan Masyarakat Mandiri Perdesaan (PNPM-MP), as a solution. This study research has the objective to determine the effect of this program on socio-economic conditions of the household in the group of women on savings and loan in Ononamolo II Lot Village, sub-district of West Gunungsitoli, Gunungsitoli. This research study considered in a descriptive study by using descriptive statistical analysis. The population in this research study were 40 women who participated in the activities savings and loan for women in Ononamolo II Lot Village, with the presentation of the data using a single table system. Methods of data collection are questionnaires, interviews, real observations, and literature study. The results showed that the influence of PNPM-MP for the socio-economic of the household in the group of women on savings and loan in Ononamolo II Lot Village, sub-district of West Gunungsitoli, Gunungsitoli, is less influential. This is caused by the lack of education that have an impact on the lack of management of the loans, the lack of participation of members of the group, and the lack of oversight by the management
Large Coercivity in Nanostructured Rare-earth-free MnxGa Films
The magnetic hysteresis of MnxGa films exhibit remarkably large coercive
fields as high as 2.5 T when fabricated with nanoscale particles of a suitable
size and orientation. This coercivity is an order of magnitude larger than in
well-ordered epitaxial film counterparts and bulk materials. The enhanced
coercivity is attributed to the combination of large magnetocrystalline
anisotropy and ~ 50 nm size nanoparticles. The large coercivity is also
replicated in the electrical properties through the anomalous Hall effect. The
magnitude of the coercivity approaches that found in rare-earth magnets, making
them attractive for rare-earth-free magnet applications
Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing
We consider the Stackelberg shortest-path pricing problem, which is defined as follows. Given a graph G with fixed-cost and pricable edges and two distinct vertices s and t, we may assign prices to the pricable edges. Based on the predefined fixed costs and our prices, a customer purchases a cheapest s-t-path in G and we receive payment equal to the sum of prices of pricable edges belonging to the path. Our goal is to find prices maximizing the payment received from the customer. While Stackelberg shortest-path pricing was known to be APX-hard before, we provide the first explicit approximation threshold and prove hardness of approximation within 2−o(1). We also argue that the nicely structured type of instance resulting from our reduction captures most of the challenges we face in dealing with the problem in general and, in particular, we show that the gap between the revenue of an optimal pricing and the only known general upper bound can still be logarithmically large
Colorful Strips
Given a planar point set and an integer , we wish to color the points with
colors so that any axis-aligned strip containing enough points contains all
colors. The goal is to bound the necessary size of such a strip, as a function
of . We show that if the strip size is at least , such a coloring
can always be found. We prove that the size of the strip is also bounded in any
fixed number of dimensions. In contrast to the planar case, we show that
deciding whether a 3D point set can be 2-colored so that any strip containing
at least three points contains both colors is NP-complete.
We also consider the problem of coloring a given set of axis-aligned strips,
so that any sufficiently covered point in the plane is covered by colors.
We show that in dimensions the required coverage is at most .
Lower bounds are given for the two problems. This complements recent
impossibility results on decomposition of strip coverings with arbitrary
orientations. Finally, we study a variant where strips are replaced by wedges
Decoherence suppression via environment preparation
To protect a quantum system from decoherence due to interaction with its
environment, we investigate the existence of initial states of the environment
allowing for decoherence-free evolution of the system. For models in which a
two-state system interacts with a dynamical environment, we prove that such
states exist if and only if the interaction and self-evolution Hamiltonians
share an eigenstate. If decoherence by state preparation is not possible, we
show that initial states minimizing decoherence result from a delicate
compromise between the environment and interaction dynamics.Comment: 4 pages, 2 figure
Coherent acoustic vibration of metal nanoshells
Using time-resolved pump-probe spectroscopy we have performed the first
investigation of the vibrational modes of gold nanoshells. The fundamental
isotropic mode launched by a femtosecond pump pulse manifests itself in a
pronounced time-domain modulation of the differential transmission probed at
the frequency of nanoshell surface plasmon resonance. The modulation amplitude
is significantly stronger and the period is longer than in a gold nanoparticle
of the same overall size, in agreement with theoretical calculations. This
distinct acoustical signature of nanoshells provides a new and efficient method
for identifying these versatile nanostructures and for studying their
mechanical and structural properties.Comment: 5 pages, 3 figure
LP-based Covering Games with Low Price of Anarchy
We present a new class of vertex cover and set cover games. The price of
anarchy bounds match the best known constant factor approximation guarantees
for the centralized optimization problems for linear and also for submodular
costs -- in contrast to all previously studied covering games, where the price
of anarchy cannot be bounded by a constant (e.g. [6, 7, 11, 5, 2]). In
particular, we describe a vertex cover game with a price of anarchy of 2. The
rules of the games capture the structure of the linear programming relaxations
of the underlying optimization problems, and our bounds are established by
analyzing these relaxations. Furthermore, for linear costs we exhibit linear
time best response dynamics that converge to these almost optimal Nash
equilibria. These dynamics mimic the classical greedy approximation algorithm
of Bar-Yehuda and Even [3]
Unsplittable coverings in the plane
A system of sets forms an {\em -fold covering} of a set if every point
of belongs to at least of its members. A -fold covering is called a
{\em covering}. The problem of splitting multiple coverings into several
coverings was motivated by classical density estimates for {\em sphere
packings} as well as by the {\em planar sensor cover problem}. It has been the
prevailing conjecture for 35 years (settled in many special cases) that for
every plane convex body , there exists a constant such that every
-fold covering of the plane with translates of splits into
coverings. In the present paper, it is proved that this conjecture is false for
the unit disk. The proof can be generalized to construct, for every , an
unsplittable -fold covering of the plane with translates of any open convex
body which has a smooth boundary with everywhere {\em positive curvature}.
Somewhat surprisingly, {\em unbounded} open convex sets do not misbehave,
they satisfy the conjecture: every -fold covering of any region of the plane
by translates of such a set splits into two coverings. To establish this
result, we prove a general coloring theorem for hypergraphs of a special type:
{\em shift-chains}. We also show that there is a constant such that, for
any positive integer , every -fold covering of a region with unit disks
splits into two coverings, provided that every point is covered by {\em at
most} sets
- …