5,622 research outputs found
Opto-mechanical transducers for long-distance quantum communication
We describe a new scheme to interconvert stationary and photonic qubits which
is based on indirect qubit-light interactions mediated by a mechanical
resonator. This approach does not rely on the specific optical response of the
qubit and thereby enables optical quantum interfaces for a wide range of solid
state spin and charge based systems. We discuss the implementation of quantum
state transfer protocols between distant nodes of a large scale network and
evaluate the effect of the main noise sources on the resulting state transfer
fidelities. For the specific examples of electronic spin qubits and
superconducting charge qubits we show that high fidelity quantum communication
protocols can be implemented under realistic experimental conditions.Comment: Version as accepted by PR
Effective Hamiltonian Theory and Its Applications in Quantum Information
This paper presents a useful compact formula for deriving an effective
Hamiltonian describing the time-averaged dynamics of detuned quantum systems.
The formalism also works for ensemble-averaged dynamics of stochastic systems.
To illustrate the technique we give examples involving Raman processes,
Bloch-Siegert shifts and Quantum Logic Gates.Comment: 5 pages, 3 figures, to be published in Canadian Journal of Physic
Entanglement in Anderson Nanoclusters
We investigate the two-particle spin entanglement in magnetic nanoclusters
described by the periodic Anderson model. An entanglement phase diagram is
obtained, providing a novel perspective on a central property of magnetic
nanoclusters, namely the temperature dependent competition between local Kondo
screening and nonlocal Ruderman-Kittel-Kasuya-Yoshida spin ordering. We find
that multiparticle entangled states are present for finite magnetic field as
well as in the mixed valence regime and away from half filling. Our results
emphasize the role of charge fluctuations.Comment: 5 pages, 3 figure
Contribution of feeds from range in organic broiler production
A study with organic broilers with access to a large range area with herbs was performed and the effect of three broiler genotype (JA757, T851, SU51) with different growth rates and different feeding strategies (HP vs LP) on the animals' feed intake, growth and welfare was investigated. The results so far indicate that feed intake from range and animal welfare is dependent on type of allocated feed and growth rate of the broiler genotype. Thus, gait scores and foot and plumage condition showed that the fastest growing broiler genotype had some problems when fed normal broiler feed, whereas this was not the case for the other genotypes. The fastest growing broilers also ate more pelleted broiler feed compared to the slower growing breeds, which in contrast ate more whole wheat. Broilers fed LP feed had a higher intake of feed from range indicated by the crop content
Reply to the "Comment on 'Phase diagram of an impurity in the spin-1/2 chain: two channel Kondo effect versus Curie law'"
In a comment by A.A. Zvyagin the phase diagram in our Letter [Phys. Rev.
Lett. 86, 516 (2001)] was critisized of being incomplete and a new fixed point
was suggested. We show that this point is in fact not a fixed point and that
the phase diagram is correct as presented.Comment: Reply to a comment by A.A. Zvyagin. 1 page, 1 figure. The latest
version in PDF format is available from
http://fy.chalmers.se/~eggert/papers/reply.pd
Dual Geometric Worm Algorithm for Two-Dimensional Discrete Classical Lattice Models
We present a dual geometrical worm algorithm for two-dimensional Ising
models. The existence of such dual algorithms was first pointed out by
Prokof'ev and Svistunov \cite{ProkofevClassical}. The algorithm is defined on
the dual lattice and is formulated in terms of bond-variables and can therefore
be generalized to other two-dimensional models that can be formulated in terms
of bond-variables. We also discuss two related algorithms formulated on the
direct lattice, applicable in any dimension. These latter algorithms turn out
to be less efficient but of considerable intrinsic interest. We show how such
algorithms quite generally can be "directed" by minimizing the probability for
the worms to erase themselves. Explicit proofs of detailed balance are given
for all the algorithms. In terms of computational efficiency the dual
geometrical worm algorithm is comparable to well known cluster algorithms such
as the Swendsen-Wang and Wolff algorithms, however, it is quite different in
structure and allows for a very simple and efficient implementation. The dual
algorithm also allows for a very elegant way of calculating the domain wall
free energy.Comment: 12 pages, 6 figures, Revtex
- …