اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدQuantum certification and benchmarking
110
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Concomitant with the rapid development of quantum technologies, challenging demands arise concerning the certification and characterization of devices. The promises of the field can only be achieved if stringent levels of precision of components can be reached and their functioning guaranteed. This review provides a brief overview of the known characterization methods of certification, benchmarking, and tomographic recovery of quantum states and processes, as well as their applications in quantum computing, simulation, and communication.
قيم البحث
اقرأ أيضاً
Device-independent certification of quantum devices is of crucial importance for the development of secure quantum information protocols. So far, the most studied scenario corresponds to a system consisting of different non-characterized devices that
observers probe with classical inputs to obtain classical outputs. The certification of relevant quantum properties follows from the observation of correlations between these events that do not have a classical counterpart. In the fully device-independent scenario no assumptions are made on the devices and therefore their non-classicality follows from Bell non-locality. There exist other scenarios, known as semidevice-independent, in which assumptions are made on the devices, such as their dimension, and non-classicality is associated to the observation of other types of correlations with no classical analogue. More recently, the use of trusted quantum inputs for certification has been introduced. The goal of this work is to study the power of this formalism and describe self-testing protocols in various settings using trusted quantum inputs. We also relate these different types of self-testing to some of the most basic quantum information protocols, such as quantum teleportation. Finally, we apply our findings to quantum networks and provide methods for estimating the quality of the whole network, as well as of parts of it.
We study efficient quantum certification algorithms for quantum state set and unitary quantum channel. We present an algorithm that uses $O(varepsilon^{-4}ln |mathcal{P}|)$ copies of an unknown state to distinguish whether the unknown state is contai
ned in or $varepsilon$-far from a finite set $mathcal{P}$ of known states with respect to the trace distance. This algorithm is more sample-efficient in some settings. Previous study showed that one can distinguish whether an unknown unitary $U$ is equal to or $varepsilon$-far from a known or unknown unitary $V$ in fixed dimension with $O(varepsilon^{-2})$ uses of the unitary, in which the Choi state is used and thus an ancilla system is needed. We give an algorithm that distinguishes the two cases with $O(varepsilon^{-1})$ uses of the unitary, using much fewer or no ancilla compared with previous results.
Recent advances in quantum computers and simulators are steadily leading us towards full-scale quantum computing devices. Due to the fact that debugging is necessary to create any computing device, quantum tomography (QT) is a critical milestone on t
his path. In practice, the choice between different QT methods faces the lack of comparison methodology. Modern research provides a wide range of QT methods, which differ in their application areas, as well as experimental and computational complexity. Testing such methods is also being made under different conditions, and various efficiency measures are being applied. Moreover, many methods have complex programming implementations; thus, comparison becomes extremely difficult. In this study, we have developed a general methodology for comparing quantum state tomography methods. The methodology is based on an estimate of the resources needed to achieve the required accuracy. We have developed a software library (in MATLAB and Python) that makes it easy to analyze any QT method implementation through a series of numerical experiments. The conditions for such a simulation are set by the number of tests corresponding to real physical experiments. As a validation of the proposed methodology and software, we analyzed and compared a set of QT methods. The analysis revealed some method-specific features and provided estimates of the relative efficiency of the methods.
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.
Chaotic quantum many-body dynamics typically lead to relaxation of local observables. In this process, known as quantum thermalization, a subregion reaches a thermal state due to quantum correlations with the remainder of the system, which acts as an
intrinsic bath. While the bath is generally assumed to be unobserved, modern quantum science experiments have the ability to track both subsystem and bath at a microscopic level. Here, by utilizing this ability, we discover that measurement results associated with small subsystems exhibit universal random statistics following chaotic quantum many-body dynamics, a phenomenon beyond the standard paradigm of quantum thermalization. We explain these observations with an ensemble of pure states, defined via correlations with the bath, that dynamically acquires a close to random distribution. Such random ensembles play an important role in quantum information science, associated with quantum supremacy tests and device verification, but typically require highly-engineered, time-dependent control for their preparation. In contrast, our approach uncovers random ensembles naturally emerging from evolution with a time-independent Hamiltonian. As an application of this emergent randomness, we develop a benchmarking protocol which estimates the many-body fidelity during generic chaotic evolution and demonstrate it using our Rydberg quantum simulator. Our work has wide ranging implications for the understanding of quantum many-body chaos and thermalization in terms of emergent randomness and at the same time paves the way for applications of this concept in a much wider context.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
