ترغب بنشر مسار تعليمي؟ اضغط هنا

Local certification of programmable quantum devices of arbitrary high dimensionality

59   0   0.0 ( 0 )
 نشر من قبل Kishor Bharti Mr.
 تاريخ النشر 2019
والبحث باللغة English




اسأل ChatGPT حول البحث

The onset of the era of fully-programmable error-corrected quantum computers will be marked by major breakthroughs in all areas of science and engineering. These devices promise to have significant technological and societal impact, notable examples being the analysis of big data through better machine learning algorithms and the design of new materials. Nevertheless, the capacity of quantum computers to faithfully implement quantum algorithms relies crucially on their ability to prepare specific high-dimensional and high-purity quantum states, together with suitable quantum measurements. Thus, the unambiguous certification of these requirements without assumptions on the inner workings of the quantum computer is critical to the development of trusted quantum processors. One of the most important approaches for benchmarking quantum devices is through the mechanism of self-testing that requires a pair of entangled non-communicating quantum devices. Nevertheless, although computation typically happens in a localized fashion, no local self-testing scheme is known to benchmark high dimensional states and measurements. Here, we show that the quantum self-testing paradigm can be employed to an individual quantum computer that is modelled as a programmable black box by introducing a noise-tolerant certification scheme. We substantiate the applicability of our scheme by providing a family of outcome statistics whose observation certifies that the computer is producing specific high-dimensional quantum states and implementing specific measurements.

قيم البحث

اقرأ أيضاً

101 - J. Stockton , M. Armen , 2002
We discuss the unique capabilities of programmable logic devices (PLDs) for experimental quantum optics and describe basic procedures of design and implementation. Examples of advanced applications include optical metrology and feedback control of qu antum dynamical systems. As a tutorial illustration of the PLD implementation process, a field programmable gate array (FPGA) controller is used to stabilize the output of a Fabry-Perot cavity.
An important problem in quantum information processing is the certification of the dimension of quantum systems without making assumptions about the devices used to prepare and measure them, that is, in a device-independent manner. A crucial question is whether such certification is experimentally feasible for high-dimensional quantum systems. Here we experimentally witness in a device-independent manner the generation of six-dimensional quantum systems encoded in the orbital angular momentum of single photons and show that the same method can be scaled, at least, up to dimension 13.
Local certification consists in assigning labels to the nodes of a network to certify that some given property is satisfied, in such a way that the labels can be checked locally. In the last few years, certification of graph classes received a consid erable attention. The goal is to certify that a graph $G$ belongs to a given graph class~$mathcal{G}$. Such certifications with labels of size $O(log n)$ (where $n$ is the size of the network) exist for trees, planar graphs and graphs embedded on surfaces. Feuilloley et al. ask if this can be extended to any class of graphs defined by a finite set of forbidden minors. In this work, we develop new decomposition tools for graph certification, and apply them to show that for every small enough minor $H$, $H$-minor-free graphs can indeed be certified with labels of size $O(log n)$. We also show matching lower bounds with a simple new proof technique.
We study the quantum query complexity of finding a certificate for a d-regular, k-level balanced NAND formula. Up to logarithmic factors, we show that the query complexity is Theta(d^{(k+1)/2}) for 0-certificates, and Theta(d^{k/2}) for 1-certificate s. In particular, this shows that the zero-error quantum query complexity of evaluating such formulas is O(d^{(k+1)/2}) (again neglecting a logarithmic factor). Our lower bound relies on the fact that the quantum adversary method obeys a direct sum theorem.
The nonlocal properties of arbitrary dimensional bipartite quantum systems are investigated. A complete set of invariants under local unitary transformations is presented. These invariants give rise to both sufficient and necessary conditions for the equivalence of quantum states under local unitary transformations: two density matrices are locally equivalent if and only if all these invariants have equal values.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا