3,496 research outputs found
Efficient quantum key distribution scheme with nonmaximally entangled states
We propose an efficient quantum key distribution scheme based on
entanglement. The sender chooses pairs of photons in one of the two equivalent
nonmaximally entangled states randomly, and sends a sequence of photons from
each pair to the receiver. They choose from the various bases independently but
with substantially different probabilities, thus reducing the fraction of
discarded data, and a significant gain in efficiency is achieved. We then show
that such a refined data analysis guarantees the security of our scheme against
a biased eavesdropping strategy.Comment: 5 Pages, No Figur
Perturbative QCD analysis of decays
We study the first observed charmless modes, the
decays, in perturbative QCD formalism. The obtained branching ratios
are larger than
from QCD factorization. The comparison of the predicted magnitudes and phases
of the different helicity amplitudes, and branching ratios with experimental
data can test the power counting rules, the evaluation of annihilation
contributions, and the mechanism of dynamical penguin enhancement in
perturbative QCD, respectively.Comment: 14 pages, 2 tables, brief disscussion on hard sacle added, version to
appear in PR
factorization of exclusive processes
We prove factorization theorem in perturbative QCD (PQCD) for exclusive
processes by considering and . The relevant form factors are expressed as the convolution of hard
amplitudes with two-parton meson wave functions in the impact parameter
space, being conjugate to the parton transverse momenta . The point is
that on-shell valence partons carry longitudinal momenta initially, and acquire
through collinear gluon exchanges. The -dependent two-parton wave
functions with an appropriate path for the Wilson links are gauge-invariant.
The hard amplitudes, defined as the difference between the parton-level
diagrams of on-shell external particles and their collinear approximation, are
also gauge-invariant. We compare the predictions for two-body nonleptonic
meson decays derived from factorization (the PQCD approach) and from
collinear factorization (the QCD factorization approach).Comment: 11 pages, REVTEX, 5 figure
Nonfactorizable contributions to decays
While the factorization assumption works well for many two-body nonleptonic
meson decay modes, the recent measurement of with
, and shows large deviation from this assumption. We
analyze the decays in the perturbative QCD approach based on
factorization theorem, in which both factorizable and nonfactorizable
contributions can be calculated in the same framework. Our predictions for the
Bauer-Stech-Wirbel parameters, and and and , are
consistent with the observed and branching ratios,
respectively. It is found that the large magnitude and the large
relative phase between and come from color-suppressed
nonfactorizable amplitudes. Our predictions for the , branching ratios can be confronted with
future experimental data.Comment: 25 pages with Latex, axodraw.sty, 6 figures and 5 tables, Version
published in PRD, Added new section 5 and reference
Local channels preserving maximal entanglement or Schmidt number
Maximal entanglement and Schmidt number play an important role in various
quantum information tasks. In this paper, it is shown that a local channel
preserves maximal entanglement state(MES) or preserves pure states with Schmidt
number ( is a fixed integer) if and only if it is a local unitary
operation.Comment: 10 page
Reducing the communication complexity with quantum entanglement
We propose a probabilistic two-party communication complexity scenario with a
prior nonmaximally entangled state, which results in less communication than
that is required with only classical random correlations. A simple all-optical
implementation of this protocol is presented and demonstrates our conclusion.Comment: 4 Pages, 2 Figure
Applicability of perturbative QCD to decays
We develop perturbative QCD factorization theorem for the semileptonic heavy
baryon decay , whose form factors are
expressed as the convolutions of hard quark decay amplitudes with universal
and baryon wave functions. Large logarithmic
corrections are organized to all orders by the Sudakov resummation, which
renders perturbative expansions more reliable. It is observed that perturbative
QCD is applicable to decays for velocity transfer
greater than 1.2. Under requirement of heavy quark symmetry, we predict the
branching ratio , and determine
the and baryon wave functions.Comment: 12 pages in Latex file, 3 figures in postscript files, some results
are changed, but the conclusion is the sam
Shape-induced anisotropy in antidot arrays from self-assembled templates
Using self-assembly of polystyrene spheres, well-ordered templates have been prepared on glass and silicon substrates. Strong guiding of self-assembly is obtained on photolithographically structured silicon substrates. Magnetic antidot arrays with three-dimensional architecture have been prepared by electrodeposition in the pores of these templates. The shape anisotropy demonstrates a crucial impact on magnetization reversal processes
Final state interaction and decays in perturbative QCD
We predict branching ratios and CP asymmetries of the decays using
perturbative QCD factorization theorem, in which tree, penguin, and
annihilation contributions, including both factorizable and nonfactorizable
ones, are expressed as convolutions of hard six-quark amplitudes with universal
meson wave functions. The unitarity angle and the and
meson wave functions extracted from experimental data of the and
decays are employed. Since the decays are sensitive to
final-state-interaction effects, the comparision of our predictions with future
data can test the neglect of these effects in the above formalism. The CP
asymmetry in the modes and the
branching ratios depend on annihilation and nonfactorizable amplitudes. The
data can also verify the evaluation of these contributions.Comment: 13 pages in latex file, 7 figures in ps file
Hamiltonicity of 3-arc graphs
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple of
vertices such that both and are paths of length two. The
3-arc graph of a graph is defined to have vertices the arcs of such
that two arcs are adjacent if and only if is a 3-arc of
. In this paper we prove that any connected 3-arc graph is Hamiltonian, and
all iterative 3-arc graphs of any connected graph of minimum degree at least
three are Hamiltonian. As a consequence we obtain that if a vertex-transitive
graph is isomorphic to the 3-arc graph of a connected arc-transitive graph of
degree at least three, then it is Hamiltonian. This confirms the well known
conjecture, that all vertex-transitive graphs with finitely many exceptions are
Hamiltonian, for a large family of vertex-transitive graphs. We also prove that
if a graph with at least four vertices is Hamilton-connected, then so are its
iterative 3-arc graphs.Comment: in press Graphs and Combinatorics, 201
- âŠ