SearcharxivSearch

arXiv subjects

Jon Tyson

Publications and source records attributed to Jon Tyson.

6 recordsLinked to original sources

Two-sided bounds on minimum-error quantum measurement, on the reversibility of quantum dynamics, and on the maximum overlap problem using directional iterates

In a unified framework, we obtain two-sided estimates of the following quantities of interest in quantum information theory: 1.The minimum-error distinguishability of arbitrary ensembles of mixed quantum states. 2.The approximate reversibility of quantum dynamics in terms of entanglement fidelity. (This is also referred to as "channel-adapted quantum error recovery" when the reversed channel is the composition of an encoding operation and a noise channel.) 3.The maximum overlap between a bipartite pure quantum state and a bipartite mixed state that may be achieved by applying a local quantum operation to one part of the mixed state. 4. The conditional min-entropy of bipartite quantum states. A refined version of the author's techniques [J. Math. Phys. 50, 032016] for bounding the first quantity is employed to give two-sided estimates of the remaining three quantities. Our primary tool is "small angle" initialization of an abstract generalization of the iterative schemes for computing optimal measurements and quantum error recoveries introduced by Jezek-Rehacek-Fiurasek [Phys. Rev. A 65, 060301], Jezek-Fiurasek-Hradil [Phys. Rev. A 68, 012305], and Reimpell-Werner [Phys. Rev. Lett 94, 080501].

quant-ph

Two-sided estimates of minimum-error distinguishability of mixed quantum states via generalized Holevo-Curlander bounds

We prove a concise factor-of-2 estimate for the failure rate of optimally distinguishing an arbitrary ensemble of mixed quantum states, generalizing work of Holevo [Theor. Probab. Appl. 23, 411 (1978)] and Curlander [Ph.D. Thesis, MIT, 1979]. A modification to the minimal principle of Cocha and Poor [Proceedings of the 6th International Conference on Quantum Communication, Measurement, and Computing (Rinton, Princeton, NJ, 2003)] is used to derive a suboptimal measurement which has an error rate within a factor of 2 of the optimal by construction. This measurement is quadratically weighted and has appeared as the first iterate of a sequence of measurements proposed by Jezek et al. [Phys. Rev. A 65, 060301 (2002)]. Unlike the so-called pretty good measurement, it coincides with Holevo's asymptotically optimal measurement in the case of nonequiprobable pure states. A quadratically weighted version of the measurement bound by Barnum and Knill [J. Math. Phys. 43, 2097 (2002)] is proven. Bounds on the distinguishability of syndromes in the sense of Schumacher and Westmoreland [Phys. Rev. A 56, 131 (1997)] appear as a corollary. An appendix relates our bounds to the trace-Jensen inequality.

quant-ph

Error rates of Belavkin weighted quantum measurements and a converse to Holevo's asymptotic optimality theorem

We compare several instances of pure-state Belavkin weighted square-root measurements from the standpoint of minimum-error discrimination of quantum states. The quadratically weighted measurement is proven superior to the so-called "pretty good measurement" (PGM) in a number of respects: (1) Holevo's quadratic weighting unconditionally outperforms the PGM in the case of two-state ensembles, with equality only in trivial cases. (2) A converse of a theorem of Holevo is proven, showing that a weighted measurement is asymptotically optimal only if it is quadratically weighted. Counterexamples for three states are constructed. The cube-weighted measurement of Ballester, Wehner, and Winter is also considered. Sufficient optimality conditions for various weights are compared.

quant-ph

Operator-Schmidt decomposition of the quantum Fourier transform on C^N1 tensor C^N2

Operator-Schmidt decompositions of the quantum Fourier transform on C^N1 tensor C^N2 are computed for all N1, N2 > 1. The decomposition is shown to be completely degenerate when N1 is a factor of N2 and when N1>N2. The first known special case, N1=N2=2^n, was computed by Nielsen in his study of the communication cost of computing the quantum Fourier transform of a collection of qubits equally distributed between two parties. [M. A. Nielsen, PhD Thesis, University of New Mexico (1998), Chapter 6, arXiv:quant-ph/0011036.] More generally, the special case N1=2^n1<2^n2=N2 was computed by Nielsen et. al. in their study of strength measures of quantum operations. [M.A. Nielsen et. al, (accepted for publication in Phys Rev A); arXiv:quant-ph/0208077.] Given the Schmidt decompositions presented here, it follows that in all cases the communication cost of exact computation of the quantum Fourier transform is maximal.

quant-ph

Twist Positivity for Lagrangian Symmetries

We prove twist positivity and positivity of the pair correlation function for combined spatial and internal symmetries of free bosonic Lagrangians. We work in a general setting, extending the results obtained in Twist Positivity [1].

math-ph