اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدMinimum time for the evolution to a nonorthogonal quantum state and upper bound of the geometric efficiency of quantum evolutions
60
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We present a simple proof of the minimum time for the quantum evolution between two arbitrary states. This proof is performed in the absence of any geometrical arguments. Then, being in the geometric framework of quantum evolutions based upon the geometry of the projective Hilbert space, we discuss the roles played by either minimum-time or maximum-energy uncertainty concepts in defining a geometric efficiency measure of quantum evolutions between two arbitrary quantum states. Finally, we provide a quantitative justification of the validity of the efficiency inequality even when the system passes only through nonorthogonal quantum states.
قيم البحث
اقرأ أيضاً
We present an information geometric characterization of quantum driving schemes specified by su(2;C) time-dependent Hamiltonians in terms of both complexity and efficiency concepts. By employing a minimum action principle, the optimum path connecting
initial and final states on the manifold in finite-time is the geodesic path between the two states. In particular, the total entropy production that occurs during the transfer is minimized along these optimum paths. For each optimum path that emerges from the given quantum driving scheme, we evaluate the so-called information geometric complexity (IGC) and our newly proposed measure of entropic efficiency constructed in terms of the constant entropy production rates that specify the entropy minimizing paths being compared. From our analytical estimates of complexity and efficiency, we provide a relative ranking among the driving schemes being investigated. Finally, we conclude by commenting on the fact that an higher entropic speed in quantum transfer processes seems to necessarily go along with a lower entropic efficiency together with a higher information geometric complexity.
We use geometric concepts originally proposed by Anandan and Aharonov to show that the Farhi-Gutmann time optimal analog quantum search evolution between two orthogonal quantum states is characterized by unit efficiency dynamical trajectories traced
on a projective Hilbert space. In particular, we prove that these optimal dynamical trajectories are the shortest geodesic paths joining the initial and the final states of the quantum evolution. In addition, we verify they describe minimum uncertainty evolutions specified by an uncertainty inequality that is tighter than the ordinary time-energy uncertainty relation. We also study the effects of deviations from the time optimality condition from our proposed Riemannian geometric perspective. Furthermore, after pointing out some physically intuitive aspects offered by our geometric approach to quantum searching, we mention some practically relevant physical insights that could emerge from the application of our geometric analysis to more realistic time-dependent quantum search evolutions. Finally, we briefly discuss possible extensions of our work to the geometric analysis of the efficiency of thermal trajectories of relevance in quantum computing tasks.
For the optimal success probability under minimum-error discrimination between $rgeq2$ arbitrary quantum states prepared with any a priori probabilities, we find new general analytical lower and upper bounds and specify the relations between these ne
w general bounds and the general bounds known in the literature. We also present the example where the new general analytical bounds, lower and upper, on the optimal success probability are tighter than most of the general analytical bounds known in the literature. The new upper bound on the optimal success probability explicitly generalizes to $r>2$ the form of the Helstrom bound. For $r=2$, each of our new bounds, lower and upper, reduces to the Helstrom bound.
In this paper we investigate the efficiency of quantum cloning of $N$ identical mixed qubits. We employ a recently introduced measure of distinguishability of quantum states called quantum Chernoff bound. We evaluate the quantum Chernoff bound betwee
n the output clones generated by the cloning machine and the initial mixed qubit state. Our analysis is illustrated by performing numerical calculation of the quantum Chernoff bound for different scenarios that involves the number of initial qubits $N$ and the number of output imperfect copies $M$.
Conventionally, unknown quantum states are characterized using quantum-state tomography based on strong or weak measurements carried out on an ensemble of identically prepared systems. By contrast, the use of protective measurements offers the possib
ility of determining quantum states from a series of weak, long measurements performed on a single system. Because the fidelity of a protectively measured quantum state is determined by the amount of state disturbance incurred during each protective measurement, it is crucial that the initial quantum state of the system is disturbed as little as possible. Here we show how to systematically minimize the state disturbance in the course of a protective measurement, thus enabling the maximization of the fidelity of the quantum-state measurement. Our approach is based on a careful tuning of the time dependence of the measurement interaction and is shown to be dramatically more effective in reducing the state disturbance than the previously considered strategy of weakening the measurement strength and increasing the measurement time. We describe a method for designing the measurement interaction such that the state disturbance exhibits polynomial decay to arbitrary order in the inverse measurement time $1/T$. We also show how one can achieve even faster, subexponential decay, and we find that it represents the smallest possible state disturbance in a protective measurement. In this way, our results show how to optimally measure the state of a single quantum system using protective measurements.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
