1,421 research outputs found
Unconditionally secure key distillation from multi-photons
In this paper, we prove that the unconditionally secure key can be
surprisingly extracted from {\it multi}-photon emission part in the photon
polarization-based QKD. One example is shown by explicitly proving that one can
indeed generate an unconditionally secure key from Alice's two-photon emission
part in ``Quantum cryptography protocols robust against photon number splitting
attacks for weak laser pulses implementations'' proposed by V. Scarani {\it et
al.,} in Phys. Rev. Lett. {\bf 92}, 057901 (2004), which is called SARG04. This
protocol uses the same four states as in BB84 and differs only in the classical
post-processing protocol. It is, thus, interesting to see how the classical
post-processing of quantum key distribution might qualitatively change its
security. We also show that one can generate an unconditionally secure key from
the single to the four-photon part in a generalized SARG04 that uses six
states. Finally, we also compare the bit error rate threshold of these
protocols with the one in BB84 and the original six-state protocol assuming a
depolarizing channel.Comment: The title has changed again. We considerably improved our
presentation, and furthermore we proposed & analyzed a security of a modified
SARG04 protocol, which uses six state
On the performance of two protocols: SARG04 and BB84
We compare the performance of BB84 and SARG04, the later of which was
proposed by V. Scarani et al., in Phys. Rev. Lett. 92, 057901 (2004).
Specifically, in this paper, we investigate SARG04 with two-way classical
communications and SARG04 with decoy states. In the first part of the paper, we
show that SARG04 with two-way communications can tolerate a higher bit error
rate (19.4% for a one-photon source and 6.56% for a two-photon source) than
SARG04 with one-way communications (10.95% for a one-photon source and 2.71%
for a two-photon source). Also, the upper bounds on the bit error rate for
SARG04 with two-way communications are computed in a closed form by considering
an individual attack based on a general measurement. In the second part of the
paper, we propose employing the idea of decoy states in SARG04 to obtain
unconditional security even when realistic devices are used. We compare the
performance of SARG04 with decoy states and BB84 with decoy states. We find
that the optimal mean-photon number for SARG04 is higher than that of BB84 when
the bit error rate is small. Also, we observe that SARG04 does not achieve a
longer secure distance and a higher key generation rate than BB84, assuming a
typical experimental parameter set.Comment: 48 pages, 10 figures, 1 column, changed Figs. 7 and
Modular detergents tailor the purification and structural analysis of membrane proteins including G-protein coupled receptors
Detergents enable the purification of membrane proteins and are indispensable reagents instructural biology. Even though a large variety of detergents have been developed in the lastcentury, the challenge remains to identify guidelines that allowfine-tuning of detergents forindividual applications in membrane protein research. Addressing this challenge, here weintroduce the family of oligoglycerol detergents (OGDs). Native mass spectrometry (MS)reveals that the modular OGD architecture offers the ability to control protein purificationand to preserve interactions with native membrane lipids during purification. In addition to abroad range of bacterial membrane proteins, OGDs also enable the purification and analysisof a functional G-protein coupled receptor (GPCR). Moreover, given the modular design ofthese detergents, we anticipatefine-tuning of their properties for specific applications instructural biology. Seen from a broader perspective, this represents a significant advance forthe investigation of membrane proteins and their interactions with lipids
Testing for Features in the Primordial Power Spectrum
Well-known causality arguments show that events occurring during or at the
end of inflation, associated with reheating or preheating, could contribute a
blue component to the spectrum of primordial curvature perturbations, with the
dependence k^3. We explore the possibility that they could be observably large
in CMB, LSS, and Lyman-alpha data. We find that a k^3 component with a cutoff
at some maximum k can modestly improve the fits (Delta chi^2=2.0, 5.4) of the
low multipoles (l ~ 10 - 50) or the second peak (l ~ 540) of the CMB angular
spectrum when the three-year WMAP data are used. Moreover, the results from
WMAP are consistent with the CBI, ACBAR, 2dFGRS, and SDSS data when they are
included in the analysis. Including the SDSS galaxy clustering power spectrum,
we find weak positive evidence for the k^3 component at the level of Delta chi'
= 2.4, with the caveat that the nonlinear evolution of the power spectrum may
not be properly treated in the presence of the k^3 distortion. To investigate
the high-k regime, we use the Lyman-alpha forest data (LUQAS, Croft et al., and
SDSS Lyman-alpha); here we find evidence at the level Delta chi^2' = 3.8.
Considering that there are two additional free parameters in the model, the
above results do not give a strong evidence for features; however, they show
that surprisingly large bumps are not ruled out. We give constraints on the
ratio between the k^3 component and the nearly scale-invariant component, r_3 <
1.5, over the range of wave numbers 0.0023/Mpc < k < 8.2/Mpc. We also discuss
theoretical models which could lead to the k^3 effect, including ordinary
hybrid inflation and double D-term inflation models. We show that the
well-motivated k^3 component is also a good representative of the generic
spikelike feature in the primordial perturbation power spectrum.Comment: 23 pages, 6 figures; added new section on theoretical motivation for
k^3 term, and discussion of double D-term hybrid inflation models; title
changed, added a new section discussing the generic spikelike features,
published in IJMP
A simple proof of the unconditional security of quantum key distribution
Quantum key distribution is the most well-known application of quantum
cryptography. Previous proposed proofs of security of quantum key distribution
contain various technical subtleties. Here, a conceptually simpler proof of
security of quantum key distribution is presented. The new insight is the
invariance of the error rate of a teleportation channel: We show that the error
rate of a teleportation channel is independent of the signals being
transmitted. This is because the non-trivial error patterns are permuted under
teleportation. This new insight is combined with the recently proposed quantum
to classical reduction theorem. Our result shows that assuming that Alice and
Bob have fault-tolerant quantum computers, quantum key distribution can be made
unconditionally secure over arbitrarily long distances even against the most
general type of eavesdropping attacks and in the presence of all types of
noises.Comment: 13 pages, extended abstract. Comments will be appreciate
- …