اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSecret Broadcasting of W-type state
62
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In this work we describe a protocol by which one can secretly broadcast W-type state among three distant partners. This work is interesting in the sense that we introduce a new kind of local cloning operation to generate two W- type states between these partners from a W-type state initially shared by them.
قيم البحث
اقرأ أيضاً
In this work we investigate the problem of secretly broadcasting five qubit entangled state between three different partners We implement the protocol described in ref [16] on three particle W-state shared by three distant partners Alice,Bob and Char
lie. The problem is interesting in the sense it is the first attempt to broadcast five qubit entangled state between three parties.
We introduce entanglement measures to describe entanglement in a three-particle system and apply it to studying broadcasting of entanglement in three-particle GHZ state. We show that entanglement of three-qubit GHZ state can be partially broadcasted
with the help of local or non-local copying processes. It is found that non-local cloning is much more efficient than local cloning for the broadcasting of entanglement.
In this paper we study the protocol implementation and property analysis for several practical quantum secret sharing (QSS) schemes with continuous variable graph state (CVGS). For each QSS scheme, an implementation protocol is designed according to
its secret and communication channel types. The estimation error is derived explicitly, which facilitates the unbiased estimation and error variance minimization. It turns out that only under infinite squeezing can the secret be perfectly reconstructed. Furthermore, we derive the condition for QSS threshold protocol on a weighted CVGS. Under certain conditions, the perfect reconstruction of the secret for two non-cooperative groups is exclusive, i.e. if one group gets the secret perfectly, the other group cannot get any information about the secret.
In Private Broadcasting, a single plaintext is broadcast to multiple recipients in an encrypted form, such that each recipient can decrypt locally. When the message is classical, a straightforward solution is to encrypt the plaintext with a single ke
y shared among all parties, and to send to each recipient a copy of the ciphertext. Surprisingly, the analogous method is insufficient in the case where the message is quantum (i.e. in Quantum Private Broadcasting (QPB)). In this work, we give three solutions to $t$-recipient Quantum Private Broadcasting ($t$-QPB) and compare them in terms of key lengths. The first method is the independent encryption with the quantum one-time pad, which requires a key linear in the number of recipients, $t$. We show that the key length can be decreased to be logarithmic in $t$ by using unitary $t$-designs. Our main contribution is to show that this can be improved to a key length that is logarithmic in the dimension of the symmetric subspace, using a new concept that we define of symmetric unitary $t$-designs, that may be of independent interest.
We single out a class of states possessing only threetangle but distributed all over four qubits. This is a three-site analogue of states from the $W$-class, which only possess globally distributed pairwise entanglement as measured by the concurrence
. We perform an analysis for four qubits, showing that such a state indeed exists. To this end we analyze specific states of four qubits that are not convexly balanced as for $SL$ invariant families of entanglement, but only affinely balanced. For these states all possible $SL$-invariants vanish, hence they are part of the $SL$ null-cone. Instead, they will possess at least a certain unitary invariant. As an interesting byproduct it is demonstrated that the exact convex roof is reached in the rank-two case of a homogeneous polynomial $SL$-invariant measure of entanglement of degree $2m$, if there is a state which corresponds to a maximally $m$-fold degenerate solution in the zero-polytope that can be combined with the convexified minimal characteristic curve to give a decomposition of $rho$. If more than one such state does exist in the zero polytope, a minimization must be performed. A better lower bound than the lowest convexified characteristic curve is obtained if no decomposition of $rho$ is obtained in this way.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
