اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOn state vs. channel quantum extension problems: exact results for UxUxU symmetry
324
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We develop a framework which unifies seemingly different extension (or joinability) problems for bipartite quantum states and channels. This includes well known extension problems such as optimal quantum cloning and quantum marginal problems as special instances. Central to our generalization is a variant of the Choi-Jamiolkowski isomorphism between bipartite states and dynamical maps which we term the homocorrelation map: while the former emphasizes the preservation of the positivity constraint, the latter is designed to preserve statistical correlations, allowing direct contact with entanglement. In particular, we define and analyze state-joining, channel-joining, and local-positive joining problems in three-party settings exhibiting collective UxUxU symmetry, obtaining exact analytical characterizations in low dimension. Suggestively, we find that bipartite quantum states are limited in the degree to which their measurement outcomes may agree, while quantum channels are limited in the degree to which their measurement outcomes may disagree. Loosely speaking, quantum mechanics enforces an upper bound on the extent of positive correlation across a bipartite system at a given time, as well as on the extent of negative correlation between the state of a same system across two instants of time. We argue that these general statistical bounds inform the quantum joinability limitations, and show that they are in fact sufficient for the three-party UxUxU-invariant setting.
قيم البحث
اقرأ أيضاً
We obtain analytically close forms of benchmark quantum dynamics of the collapse and revival (CR), reduced density matrix, Von Neumann entropy, and fidelity for the XXZ central spin problem. These quantities characterize the quantum decoherence and e
ntanglement of the system with few to many bath spins, and for a short to infinitely long time evolution. For the homogeneous central spin problem, the effective magnetic field $B$, coupling constant $A$ and longitudinal interaction $Delta$ significantly influence the time scales of the quantum dynamics of the central spin and the bath, providing a tunable resource for quantum metrology. Under the resonance condition $B=Delta=A$, the location of the $m$-th revival peak in time reaches a simple relation $t_{r} simeqfrac{pi N}{A} m$ for a large $N$. For $Delta =0$, $Nto infty$ and a small polarization in the initial spin coherent state, our analytical result for the CR recovers the known expression found in the Jaynes-Cummings model, thus building up an exact dynamical connection between the central spin problems and the light-matter interacting systems in quantum nonlinear optics. In addition, the CR dynamics is robust to a moderate inhomogeneity of the coupling amplitudes, while disappearing at strong inhomogeneity.
We present two new results about exact learning by quantum computers. First, we show how to exactly learn a $k$-Fourier-sparse $n$-bit Boolean function from $O(k^{1.5}(log k)^2)$ uniform quantum examples for that function. This improves over the boun
d of $widetilde{Theta}(kn)$ uniformly random classical examples (Haviv and Regev, CCC15). Our main tool is an improvement of Changs lemma for the special case of sparse functions. Second, we show that if a concept class $mathcal{C}$ can be exactly learned using $Q$ quantum membership queries, then it can also be learned using $Oleft(frac{Q^2}{log Q}log|mathcal{C}|right)$ classical membership queries. This improves the previous-best simulation result (Servedio and Gortler, SICOMP04) by a $log Q$-factor.
Generalized Turan problems have been a central topic of study in extremal combinatorics throughout the last few decades. One such problem is maximizing the number of cliques of size $t$ in a graph of a fixed order that does not contain any path (or c
ycle) of length at least a given number. Both of the path-free and cycle-free extremal problems were recently considered and asymptotically solved by Luo. We fully resolve these problems by characterizing all possible extremal graphs. We further extend these results by solving the edge-variant of these problems where the number of edges is fixed instead of the number of vertices. We similarly obtain exact characterization of the extremal graphs for these edge variants.
We investigate the optimal quantum state reconstruction from cloud to many spatially separated users by measure-broadcast-prepare scheme without the availability of quantum channel. The quantum state equally distributed from cloud to arbitrary number
of users is generated at each port by ensemble of known quantum states with assistance of classical information of measurement outcomes by broadcasting. The obtained quantum state for each user is optimal in the sense that the fidelity universally achieves the upper bound. We present the universal quantum state distribution by providing physical realizable measurement bases in the cloud as well as the reconstruction method for each user. The quantum state reconstruction scheme works for arbitrary many identical pure input states in general dimensional system.
We generalize the concept of a weak value of a quantum observable to cover arbitrary real positive operator measures. We show that the definition is operationally meaningful in the sense that it can be understood within the quantum theory of sequenti
al measurements. We then present a detailed analysis of the recent experiment of Lundeen et al. concerning the reconstruction of the state of a photon using weak measurements. We compare their method with the reconstruction method through informationally complete phase space measurements and show that it lacks the generality of the phase space method. In particular, a completely unknown state can never be reconstructed using the method of weak measurements.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
