اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدSub-- and super--fidelity as bounds for quantum fidelity
75
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We derive several bounds on fidelity between quantum states. In particular we show that fidelity is bounded from above by a simple to compute quantity we call super--fidelity. It is analogous to another quantity called sub--fidelity. For any two states of a two--dimensional quantum system (N=2) all three quantities coincide. We demonstrate that sub-- and super--fidelity are concave functions. We also show that super--fidelity is super--multiplicative while sub--fidelity is sub--multiplicative and design feasible schemes to measure these quantities in an experiment. Super--fidelity can be used to define a distance between quantum states. With respect to this metric the set of quantum states forms a part of a $N^2-1$ dimensional hypersphere.
قيم البحث
اقرأ أيضاً
We report a new metric of quantum states. This metric is build up from super-fidelity, which has deep connection with the Uhlmann-Jozsa fidelity and plays an important role in quantifying entanglement. We find that the new metric possess some interesting properties.
It is known that advantage distillation (that is, information reconciliation using two-way communication) improves noise tolerances for quantum key distribution (QKD) setups. Two-way communication is hence also of interest in the device-independent c
ase, where noise tolerance bounds for one-way error correction are currently too low to be experimentally feasible. Existing security proofs for the device-independent repetition-code protocol (the most prominent form of advantage distillation) rely on fidelity-related security conditions, but previous bounds on the fidelity were not tight. We improve on those results by developing an algorithm that returns arbitrarily tight lower bounds on the fidelity. Our results give new insight on how strong the fidelity-related security conditions are, and could also be used to compute some lower bounds on one-way protocol keyrates. Finally, we conjecture a necessary security condition for the protocol studied in this work, that naturally complements the existing sufficient conditions.
We analyze the average fidelity (say, F) and the fidelity deviation (say, D) in noisy-channel quantum teleportation. Here, F represents how well teleportation is performed on average and D quantifies whether the teleportation is performed impartially
on the given inputs, that is, the condition of universality. Our analysis results prove that the achievable maximum average fidelity ensures zero fidelity deviation, that is, perfect universality. This structural trait of teleportation is distinct from those of other limited-fidelity probabilistic quantum operations, for instance, universal-NOT or quantum cloning. This feature is confirmed again based on a tighter relationship between F and D in the qubit case. We then consider another realistic noise model where F decreases and D increases due to imperfect control. To alleviate such deterioration, we propose a machine-learning-based algorithm. We demonstrate by means of numerical simulations that the proposed algorithm can stabilize the system. Notably, the recovery process consists solely of the maximization of F, which reduces the control time, thus leading to a faster cure cycle.
We investigate the problem of bounding the quantum process fidelity given bounds on the fidelities between target states and the action of a process on a set of pure input states. We formulate the problem as a semidefinite program and prove convexity
of the minimum process fidelity as a function of the errors on the output states. We characterize the conditions required to uniquely determine a process in the case of no errors, and derive a lower bound on its fidelity in the limit of small errors for any set of input states satisfying these conditions. We then consider sets of input states whose one-dimensional projectors form a symmetric positive operator-valued measure (POVM). We prove that for such sets the minimum fidelity is bounded by a linear function of the average output state error. The minimal non-orthogonal symmetric POVM contains $d+1$ states, where $d$ is the Hilbert space dimension. Our bounds applied to these states provide an efficient method for estimating the process fidelity without the use of full process tomography.
For two unknown quantum states $rho$ and $sigma$ in an $N$-dimensional Hilbert space, computing their fidelity $F(rho,sigma)$ is a basic problem with many important applications in quantum computing and quantum information, for example verification a
nd characterization of the outputs of a quantum computer, and design and analysis of quantum algorithms. In this Letter, we propose a quantum algorithm that solves this problem in $text{poly}(log (N), r)$ time, where $r$ is the lower rank of $rho$ and $sigma$. This algorithm exhibits an exponential improvement over the best-known algorithm (based on quantum state tomography) in $text{poly}(N, r)$ time.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
