اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدLocal quantum protocols for separable measurements with many parties
183
0
0.0
(
0
)
تأليف
Scott M. Cohen
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
In a recent paper cite{mySEPvsLOCC}, we showed how to construct a quantum protocol for implementing a bipartite, separable quantum measurement using only local operations on subsystems and classical communication between parties (LOCC) within any fixed number of rounds of communication, whenever such a protocol exists. Here, we generalize that construction to one that applies for any number of parties. One important observation is that the construction automatically determines the ordering of the parties measurements, overcoming a significant apparent difficulty in designing protocols for more than two parties. We also present various other results about LOCC, including showing that if, in any given measurement operator of the separable measurement under consideration, the local parts for two different parties are rank-1 operators that are not repeated in any other measurement operator of the measurement, then this separable measurement cannot be exactly implemented by LOCC in any finite number of rounds.
قيم البحث
اقرأ أيضاً
We provide a method of designing protocols for implementing multipartite quantum measurements when the parties are restricted to local operations and classical communication (LOCC). For each finite integer number of rounds, $r$, the method succeeds i
n every case for which an $r$-round protocol exists for the measurement under consideration, and failure of the method has the immediate implication that the measurement under consideration cannot be implemented by LOCC no matter how many rounds of communication are allowed, including when the number of rounds is allowed to be infinite. It turns out that this method shows---often with relative ease---the impossibility by LOCC for a number of examples, including cases where this was not previously known, as well as the example that first demonstrated what has famously become known as nonlocality without entanglement.
For any pair of quantum states (the hypotheses), the task of binary quantum hypotheses testing is to derive the tradeoff relation between the probability $p_{01}$ of rejecting the null hypothesis and $p_{10}$ of accepting the alternative hypothesis.
The case when both hypotheses are explicitly given was solved in the pioneering work by Helstrom. Here, instead, for any given null hypothesis as a pure state, we consider the worst-case alternative hypothesis that maximizes $p_{10}$ under a constraint on the distinguishability of such hypotheses. Additionally, we restrict the optimization to separable measurements, in order to describe tests that are performed locally. The case $p_{01}=0$ has been recently studied under the name of quantum state verification. We show that the problem can be cast as a semi-definite program (SDP). Then we study in detail the two-qubit case. A comprehensive study in parameter space is done by solving the SDP numerically. We also obtain analytical solutions in the case of commuting hypotheses, and in the case where the two hypotheses can be orthogonal (in the latter case, we prove that the restriction to separable measurements generically prevents perfect distinguishability). In regards to quantum state verification, our work shows the existence of more efficient strategies for noisy measurement scenarios.
We develop a unified approach to classical, quantum and post-quantum steering. The framework is based on uncharacterised (black-box) parties performing quantum measurements on their share of a (possibly unphysical) quantum state, and its starting poi
nt is the characterisation of general no-signalling assemblages via non-positive local hidden-state models. By developing a connection to entanglement witnesses, this formalism allows for new definitions of families of assemblages, in particular via (i) non-decomposable positive maps and (ii) unextendible product bases. The former proves to be useful for constructing post-quantum assemblages with the built-in feature of yielding only quantum correlations in Bell experiments, while the latter always gives certifiably post-quantum assemblages. Finally, our framework is equipped with an inherent quantifier of post-quantum steering, which we call the negativity of post-quantum steering. We postulate that post-quantum steering should not increase under one-way quantum operations from the steered parties to the steering parties, and we show that, in this sense, the negativity of post-quantum steering is a convex post-quantum-steering monotone.
Counterdiabatic (CD) driving presents a way of generating adiabatic dynamics at arbitrary pace, where excitations due to non-adiabaticity are exactly compensated by adding an auxiliary driving term to the Hamiltonian. While this CD term is theoretica
lly known and given by the adiabatic gauge potential, obtaining and implementing this potential in many-body systems is a formidable task, requiring knowledge of the spectral properties of the instantaneous Hamiltonians and control of highly nonlocal multibody interactions. We show how an approximate gauge potential can be systematically built up as a series of nested commutators, remaining well-defined in the thermodynamic limit. Furthermore, the resulting CD driving protocols can be realized up to arbitrary order without leaving the available control space using tools from periodically-driven (Floquet) systems. This is illustrated on few- and many-body quantum systems, where the resulting Floquet protocols significantly suppress dissipation and provide a drastic increase in fidelity.
We give a conceptually simple necessary condition such that a separable quantum operation can be implemented by local operations on subsystems and classical communication between parties (LOCC), a condition which follows from a novel approach to unde
rstanding LOCC. This necessary condition holds for any number of parties and any finite number of rounds of communication and as such, also provides a completely general sufficient condition that a given separable operation cannot be exactly implemented by LOCC. Furthermore, it demonstrates an extremely strong difference between separable operations and LOCC, in that there exist examples of the former for which the condition is extensively violated. More precisely, the violation by separable operations of our necessary condition for LOCC grows without limit as the number of parties increases.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
