Optimal Perfect Distinguishability between Unitaries and Quantum Operations

Details Optimal Perfect Distinguishability between Unitaries and Quantum Operations Optimal Perfect Distinguishability between Unitaries and Quantum Operations

2010-10-12

arxiv.org/abs/1010.2298v1

Physics

Quantum Physics

11 pages, 0 figures. Comments are welcome

Scientific paper

We study optimal perfect distinguishability between a unitary and a general quantum operation. In 2-dimensional case we provide a simple sufficient and necessary condition for sequential perfect distinguishability and an analytical formula of optimal query time. We extend the sequential condition to general d-dimensional case. Meanwhile, we provide an upper bound and a lower bound for optimal sequential query time. In the process a new iterative method is given, the most notable innovation of which is its independence to auxiliary systems or entanglement. Following the idea, we further obtain an upper bound and a lower bound of (entanglement-assisted) q-maximal fidelities between a unitary and a quantum operation. Thus by the recursion in [1] an upper bound and a lower bound for optimal general perfect discrimination are achieved. Finally our lower bound result can be extended to the case of arbitrary two quantum operations.

Affiliated with

Also associated with

No associations

Rating

Optimal Perfect Distinguishability between Unitaries and Quantum Operations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal Perfect Distinguishability between Unitaries and Quantum Operations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Perfect Distinguishability between Unitaries and Quantum Operations will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-608027