Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userDistinguishability of Gaussian States in Quantum Cryptography using Post-Selection
174
0
0.0
(
0
)
Added by
Christian Weedbrook
Publication date
2009
fields
Physics
and research's language is
English
Ask ChatGPT about the research
No Arabic abstract
We consider the distinguishability of Gaussian states from the view point of continuous-variable quantum cryptography using post-selection. Specifically, we use the probability of error to distinguish between two pure coherent (squeezed) states and two particular mixed symmetric coherent (squeezed) states where each mixed state is an incoherent mixture of two pure coherent (squeezed) states with equal and opposite displacements in the conjugate quadrature. We show that the two mixed symmetric Gaussian states (where the various components have the same real part) never give an eavesdropper more information than the two pure Gaussian states. Furthermore, when considering the distinguishability of squeezed states, we show that varying the amount of squeezing leads to a squeezing and anti-squeezing of the net information rates.
rate research
Read More
We propose a general method for studying properties of quantum channels acting on an n-partite system, whose action is invariant under permutations of the subsystems. Our main result is that, in order to prove that a certain property holds for any arbitrary input, it is sufficient to consider the special case where the input is a particular de Finetti-type state, i.e., a state which consists of n identical and independent copies of an (unknown) state on a single subsystem. A similar statement holds for more general channels which are covariant with respect to the action of an arbitrary finite or locally compact group. Our technique can be applied to the analysis of information-theoretic problems. For example, in quantum cryptography, we get a simple proof for the fact that security of a discrete-variable quantum key distribution protocol against collective attacks implies security of the protocol against the most general attacks. The resulting security bounds are tighter than previously known bounds obtained by proofs relying on the exponential de Finetti theorem [Renner, Nature Physics 3,645(2007)].
We present a setup for quantum cryptography based on photon pairs in energy-time Bell states and show its feasability in a laboratory experiment. Our scheme combines the advantages of using photon pairs instead of faint laser pulses and the possibility to preserve energy-time entanglement over long distances. Moreover, using 4-dimensional energy-time states, no fast random change of bases is required in our setup : Nature itself decides whether to measure in the energy or in the time base.
In this paper, we mainly study the local distinguishable multipartite quantum states by local operations and classical communication (LOCC) in $m_1otimes m_2otimesldotsotimes m_n$ , where the quantum system $m_1$ belongs to Alice, $m_2$ belongs to Bob, ldots and $m_n$ belongs to Susan. We first present the pure tripartite distinguishable orthogonal quantum states by LOCC in $m_1otimes m_2otimes m_3$. With the conclusion in $m_1otimes m_2otimes m_3$, we prove distinguishability or indistinguishability of some quantum states. At last, we give the $n$-party distinguishable quantum states in $m_1otimes m_2otimescdotsotimes m_n$. Our study further reveals quantum nonlocality in multipartite high-dimensional.
In this article, we show a sufficient and necessary condition for locally distinguishable bipartite states via one-way local operations and classical communication (LOCC). With this condition, we present some minimal structures of one-way LOCC indistinguishable quantum state sets. As long as an indistinguishable subset exists in a state set, the set is not distinguishable. We also list several distinguishable sets as instances.
A quantum ensemble ${(p_x, rho_x)}$ is a set of quantum states each occurring randomly with a given probability. Quantum ensembles are necessary to describe situations with incomplete a priori information, such as the output of a stochastic quantum channel (generalized measurement), and play a central role in quantum communication. In this paper, we propose measures of distance and fidelity between two quantum ensembles. We consider two approaches: the first one is based on the ability to mimic one ensemble given the other one as a resource and is closely related to the Monge-Kantorovich optimal transportation problem, while the second one uses the idea of extended-Hilbert-space (EHS) representations which introduce auxiliary pointer (or flag) states. Both types of measures enjoy a number of desirable properties. The Kantorovich measures, albeit monotonic under deterministic quantum operations, are not monotonic under generalized measurements. In contrast, the EHS measures are. We present operational interpretations for both types of measures. We also show that the EHS fidelity between ensembles provides a novel interpretation of the fidelity between mixed states--the latter is equal to the maximum of the fidelity between all pure-state ensembles whose averages are equal to the mixed states being compared. We finally use the new measures to define distance and fidelity for stochastic quantum channels and positive operator-valued measures (POVMs). These quantities may be useful in the context of tomography of stochastic quantum channels and quantum detectors.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
