اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدReexamination of the optimal Bayes cost in the binary decision problem
432
0
0.0
(
0
)
تأليف
Bernhard K. Meister
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The problem of quantum state discrimination between two wave functions of a particle in a square well potential is considered. The optimal minimum-error probability is known to be given by the Helstrom bound. A new strategy is introduced by inserting an impenetrable barrier in the middle of the square well, which is either a nodal or non-nodal point of the wave function. The energy required to insert the barrier is dependent on the initial state. This enables the experimenter to gain additional information beyond the standard probing of the state envisaged by Helstrom and to improve the distinguishability of the states. It is shown that under some conditions the Helstrom bound can be violated, i.e. the state discrimination can be realized with a smaller error probability.
قيم البحث
اقرأ أيضاً
The problem of quantum state discrimination between two wave functions on a ring is considered. The optimal minimum-error probability is known to be given by the Helstrom bound. A new strategy is introduced by inserting either adiabatically or instan
taneously an impenetrable barrier. The insertion point, independent of the shape of the initial wave function, becomes a node. The resulting modified wave functions can be, if the initial functions are judiciously chosen, distinguished with a smaller error probability, and as a consequence the Helstrom bound can be violated under idealised conditions.
The problem of quantum state discrimination between two wave functions of a particle in a square well potential is considered. The optimal minimum-error probability for the state discrimination is known to be given by the Helstrom bound. A new strate
gy is introduced here whereby the square well is compressed isoenergetically, modifying the wave-functions. The new contracted chamber is then probed using the conventional optimal strategy, and the error probability is calculated. It is shown that in some cases the Helstrom bound can be violated, i.e. the state discrimination can be realized with a smaller error probability.
State discrimination with the aim to minimize the error probability is a well studied problem. Instead, here the binary decision problem for operators with a given prior is investigated. A black box containing the unknown operator is probed by select
ed wave functions. The output is analyzed with conventional methods developed for state discrimination. An error probability bound for all binary operator choices is provided, and it is shown how probe entanglement enhances the result.
Quantum state smoothing is a technique to estimate an unknown true state of an open quantum system based on partial measurement information both prior and posterior to the time of interest. In this paper, we show that the smoothed quantum state is an
optimal state estimator; that is, it minimizes a risk (expected cost) function. Specifically, we show that the smoothed quantum state is optimal with respect to two cost functions: the trace-square deviation from and the relative entropy to the unknown true state. However, when we consider a related risk function, the linear infidelity, we find, contrary to what one might expect, that the smoothed state is not optimal. For this case, we derive the optimal state estimator, which we call the lustrated smoothed state. It is a pure state, the eigenstate of the smoothed quantum state with the largest eigenvalue.
For universal quantum computation, a major challenge to overcome for practical implementation is the large amount of resources required for fault-tolerant quantum information processing. An important aspect is implementing arbitrary unitary operators
built from logical gates within the quantum error correction code. A synthesis algorithm can be used to approximate any unitary gate up to arbitrary precision by assembling sequences of logical gates chosen from a small set of universal gates that are fault-tolerantly performable while encoded in a quantum error-correction code. However, current procedures do not yet support individual assignment of base gate costs and many do not support extended sets of universal base gates. We analysed cost-optimal sequences using an exhaustive search based on Dijkstras pathfinding algorithm for the canonical Clifford+$T$ set of base gates and compared them to when additionally including $Z$-rotations from higher orders of the Clifford hierarchy. Two approaches of assigning base gate costs were used. First, costs were reduced to $T$-counts by recursively applying a $Z$-rotation catalyst circuit. Second, costs were assigned as the average numbers of raw (i.e. physical level) magic states required to directly distil and implement the gates fault-tolerantly. We found that the average sequence cost decreases by up to $54pm 3%$ when using the $Z$-rotation catalyst circuit approach and by up to $33pm 2 %$ when using the magic state distillation approach. In addition, we investigated observed limitations of certain assignments of base gate costs by developing an analytic model to estimate the proportion of sets of $Z$-rotation gates from higher orders of the Clifford hierarchy that are found within sequences approximating random target gates.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
