اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSeparation and approximate separation of multipartite quantum gates
63
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The number of qubits of current quantum computers is one of the most dominating restrictions for applications. So it is naturally conceived to use two or more small capacity quantum computers to form a larger capacity quantum computing system by quantum parallel programming. To design the parallel program for quantum computers, the primary obstacle is to decompose quantum gates in the whole circuit to the tensor product of local gates. In the paper, we first devote to analyzing theoretically separability conditions of multipartite quantum gates on finite or infinite dimensional systems. Furthermore, we perform the separation experiments for $n$-qubit quantum gates on the IBMs quantum computers by the software Q$|SIrangle$. Not surprisedly, it is showed that there exist few separable ones among multipartite quantum gates. Therefore, we pay our attention to the approximate separation problems of multipartite gates, i.e., how a multipartite gate can be closed to separable ones.
قيم البحث
اقرأ أيضاً
The graphical structure of Probabilistic Graphical Models (PGMs) encodes the conditional independence (CI) relations that hold in the modeled distribution. Graph algorithms, such as d-separation, use this structure to infer additional conditional ind
ependencies, and to query whether a specific CI holds in the distribution. The premise of all current systems-of-inference for deriving CIs in PGMs, is that the set of CIs used for the construction of the PGM hold exactly. In practice, algorithms for extracting the structure of PGMs from data, discover approximate CIs that do not hold exactly in the distribution. In this paper, we ask how the error in this set propagates to the inferred CIs read off the graphical structure. More precisely, what guarantee can we provide on the inferred CI when the set of CIs that entailed it hold only approximately? It has recently been shown that in the general case, no such guarantee can be provided. We prove that such a guarantee exists for the set of CIs inferred in directed graphical models, making the d-separation algorithm a sound and complete system for inferring approximate CIs. We also prove an approximation guarantee for independence relations derived from marginal CIs.
An open question in quantum optics is how to manipulate and control complex quantum states in an experimentally feasible way. Here we present concepts for transformations of high-dimensional multi-photonic quantum systems. The proposals rely on two n
ew ideas: (I) a novel high-dimensional quantum non-demolition measurement, (II) the encoding and decoding of the entire quantum transformation in an ancillary state for sharing the necessary quantum information between the involved parties. Many solutions can readily be performed in laboratories around the world, and identify important pathways for experimental research in the near future. The concept has been found using the computer algorithm Melvin for designing computer-inspired quantum experiments. This demonstrates that computer algorithms can inspire new ideas in science, which is a widely unexplored potential.
We study the entangling properties of multipartite unitary gates with respect to the measure of entanglement called one-tangle. Putting special emphasis on the case of three parties, we derive an analytical expression for the entangling power of an $
n$-partite gate as an explicit function of the gate, linking the entangling power of gates acting on $n$-partite Hilbert space of dimension $d_1 ldots d_n$ to the entanglement of pure states in the Hilbert space of dimension $(d_1 ldots d_n)^2$. Furthermore, we evaluate its mean value averaged over the unitary and orthogonal groups, analyze the maximal entangling power and relate it to the absolutely maximally entangled (AME) states of a system with $2n$ parties. Finally, we provide a detailed analysis of the entangling properties of three-qubit unitary and orthogonal gates.
We introduce the notion of separation of conditions meaning that a description of statistical data obtained from experiments, performed under a set of different conditions, allows for a decomposition such that each partial description depends on mutu
ally exclusive subsets of these conditions. Descriptions that allow a separation of conditions are shown to entail the basic mathematical framework of quantum theory. The Stern-Gerlach and the Einstein-Podolsky-Rosen-Bohm experiment with three, respectively nine possible outcomes are used to illustrate how the separation of conditions can be used to construct their quantum theoretical descriptions. It is shown that the mathematical structure of separated descriptions implies that, under certain restrictions, the time evolution of the data can be described by the von Neumann/Schrodinger equation.
We give the first exponential separation between quantum and classical multi-party communication complexity in the (non-interactive) one-way and simultaneous message passing settings. For every k, we demonstrate a relational communication problem b
etween k parties that can be solved exactly by a quantum simultaneous message passing protocol of cost O(log n) and requires protocols of cost n^{c/k^2}, where c>0 is a constant, in the classical non-interactive one-way message passing model with shared randomness and bounded error. Thus our separation of corresponding communication classes is superpolynomial as long as k=o(sqrt{log n / loglog n}) and exponential for k=O(1).
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
