<?xml version="1.0" encoding="UTF-8"?>
<XML><RECORDS>
<RECORD>
	<REFERENCE_TYPE>0</REFERENCE_TYPE>
	<AUTHORS>
		<AUTHOR>Zbigniew Pucha{\l}a</AUTHOR>
		<AUTHOR>Jaros{\l}aw Adam Miszczak</AUTHOR>
		<AUTHOR>Piotr Gawron</AUTHOR>
		<AUTHOR>Bart{\l}omiej Gardas</AUTHOR>
	</AUTHORS>
	<YEAR>2010</YEAR>
	<TITLE> Experimentally feasible measures of distance between quantum operations </TITLE>
	<SECONDARY_TITLE>Quantum Information Processing</SECONDARY_TITLE>
	<URL>http://www.springerlink.com/content/hl0642v53379167k/</URL>
</RECORD>
<RECORD>
	<REFERENCE_TYPE>0</REFERENCE_TYPE>
	<AUTHORS>
		<AUTHOR>Miszczak J. A.</AUTHOR>
		<AUTHOR>Pucha{\l}a Z.</AUTHOR>
		<AUTHOR>Horodecki P.</AUTHOR>
		<AUTHOR>Uhlmann A.</AUTHOR>
		<AUTHOR>{\.Z}yczkowski K.</AUTHOR>
	</AUTHORS>
	<YEAR>2009</YEAR>
	<TITLE>Sub– and super–fidelity as bounds for quantum fidelity</TITLE>
	<SECONDARY_TITLE>Quantum Information & Computation</SECONDARY_TITLE>
	<PUBLISHER>Rinton Press</PUBLISHER>
	<VOLUME>9</VOLUME>
	<PAGES>0103-0130</PAGES>
	<DATE>01/2009</DATE>
	<KEYWORDS>
		<KEYWORD>quantum fidelity</KEYWORD>
		<KEYWORD>quantum states</KEYWORD>
		<KEYWORD>Bures distance</KEYWORD>
		<KEYWORD>distances in state space</KEYWORD>
	</KEYWORDS>
	<ABSTRACT>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.</ABSTRACT>
	<URL>http://arxiv.org/abs/0805.2037</URL>
</RECORD>
<RECORD>
	<REFERENCE_TYPE>0</REFERENCE_TYPE>
	<AUTHORS>
		<AUTHOR>Pucha{\l}a Z.</AUTHOR>
		<AUTHOR>Miszczak, J. A.</AUTHOR>
	</AUTHORS>
	<YEAR>2009</YEAR>
	<TITLE>Bound on trace distance based on superfidelity</TITLE>
	<SECONDARY_TITLE>Physical Review A</SECONDARY_TITLE>
	<VOLUME>79</VOLUME>
	<PAGES>024302</PAGES>
	<ABSTRACT>We provide a bound for the trace distance between two quantum states. The lower bound is based on the superfidelity, which provides the upper bound on quantum fidelity. One of the advantages of the presented bound is that it can be estimated using a simple measurement procedure. We also compare this bound with the one provided in terms of fidelity. </ABSTRACT>
	<URL>http://arxiv.org/abs/0811.2323</URL>
</RECORD>
<RECORD>
	<REFERENCE_TYPE>0</REFERENCE_TYPE>
	<AUTHORS>
		<AUTHOR>Pucha{\l}a, Z.</AUTHOR>
		<AUTHOR>Rolski, T.</AUTHOR>
	</AUTHORS>
	<YEAR>2008</YEAR>
	<TITLE>The exact asymptotic of the collision time tail distribution for   independent Brownian particles with different drifts</TITLE>
	<SECONDARY_TITLE>Probability Theory and Related Fields</SECONDARY_TITLE>
	<VOLUME>3-4</VOLUME>
	<PAGES>595-617</PAGES>
	<DATE>11/2008</DATE>
	<KEYWORDS>
		<KEYWORD>Collision time</KEYWORD>
		<KEYWORD>Brownian motion</KEYWORD>
		<KEYWORD>Probability Theory</KEYWORD>
		<KEYWORD>Stochastic Processes</KEYWORD>
	</KEYWORDS>
	<URL>http://www.springerlink.com/content/x43570761868m431/</URL>
</RECORD>
<RECORD>
	<REFERENCE_TYPE>0</REFERENCE_TYPE>
	<AUTHORS>
		<AUTHOR>Markham, D.</AUTHOR>
		<AUTHOR>Miszczak, J. A.</AUTHOR>
		<AUTHOR>Pucha{\l}a, Z.</AUTHOR>
		<AUTHOR>{\.Z}yczkowski, K.</AUTHOR>
	</AUTHORS>
	<YEAR>2008</YEAR>
	<TITLE>Quantum state discrimination: a geometric approach</TITLE>
	<SECONDARY_TITLE> Physical Review A</SECONDARY_TITLE>
	<VOLUME>77</VOLUME>
	<PAGES>042111</PAGES>
	<KEYWORDS>
		<KEYWORD>Quantum Information</KEYWORD>
		<KEYWORD>Geometry of Quantum States</KEYWORD>
		<KEYWORD>Discrimination of Quantum States</KEYWORD>
	</KEYWORDS>
	<ABSTRACT>We analyze the problem of finding sets of quantum states that can be deterministically discriminated. From a geometric point of view, this problem is equivalent to that of embedding a simplex of points whose distances are maximal with respect to the Bures distance (or trace distance). We derive upper and lower bounds for the trace distance and for the fidelity between two quantum states, which imply bounds for the Bures distance between the unitary orbits of both states. We thus show that, when analyzing minimal and maximal distances between states of fixed spectra, it is sufficient to consider diagonal states only. Hence when optimal discrimination is considered, given freedom up to unitary orbits, it is sufficient to consider diagonal states. This is illustrated geometrically in terms of Weyl chambers.</ABSTRACT>
	<URL>http://link.aps.org/doi/10.1103/PhysRevA.77.042111</URL>
</RECORD>
<RECORD>
	<REFERENCE_TYPE>0</REFERENCE_TYPE>
	<AUTHORS>
		<AUTHOR>G{\l}omb, P.</AUTHOR>
		<AUTHOR>Pucha{\l}a, Z.</AUTHOR>
		<AUTHOR>Sochan, A.</AUTHOR>
	</AUTHORS>
	<YEAR>2007</YEAR>
	<TITLE>Context selection for efficient bit modeling of contourlet transform coefficients</TITLE>
	<SECONDARY_TITLE>Theoretical and Applied Informatics</SECONDARY_TITLE>
	<KEYWORDS>
		<KEYWORD>Image Processing</KEYWORD>
		<KEYWORD>Image Compression</KEYWORD>
	</KEYWORDS>
</RECORD>
<RECORD>
	<REFERENCE_TYPE>0</REFERENCE_TYPE>
	<AUTHORS>
		<AUTHOR>Pucha{\l}a, Z.</AUTHOR>
		<AUTHOR>Rolski, T.</AUTHOR>
	</AUTHORS>
	<YEAR>2005</YEAR>
	<TITLE>The exact asymptotic of the time to collision</TITLE>
	<SECONDARY_TITLE>Electronic Journal of Probability</SECONDARY_TITLE>
	<VOLUME>10</VOLUME>
	<NUMBER>Probab</NUMBER>
	<PAGES>1359-1380</PAGES>
	<DATE>11</DATE>
	<KEYWORDS>
		<KEYWORD>continuous time random walk</KEYWORD>
		<KEYWORD>Brownian motion</KEYWORD>
		<KEYWORD>Collision time</KEYWORD>
		<KEYWORD>skew Young tableaux</KEYWORD>
		<KEYWORD>tandem queue</KEYWORD>
		<KEYWORD>Probability Theory</KEYWORD>
		<KEYWORD>Stochastic Processes</KEYWORD>
	</KEYWORDS>
	<ABSTRACT>Abstract In this note we consider the time of the collision $tau$ for $n$ independent copies of Markov processes $X^1_t,. . .,X^n_t$, each starting from $x_i$,where $x_1 &lt;. . .&lt; x_n$. We show that for the continuous time random walk $P_x(tau &gt; t) = t^-n(n-1)/4(Ch(x)+o(1)),$ where $C$ is known and $h(x)$ is the Vandermonde determinant. From the proof one can see that the result also holds for $X_t$ being the Brownian motion or the Poisson process. An application to skew standard Young tableaux is given. </ABSTRACT>
	<URL>http://www.math.washington.edu/~ejpecp/viewarticle.php?id=1551&amp;layout=abstract</URL>
</RECORD>
<RECORD>
	<REFERENCE_TYPE>0</REFERENCE_TYPE>
	<AUTHORS>
		<AUTHOR>Pucha{\l}a, Z.</AUTHOR>
	</AUTHORS>
	<YEAR>2005</YEAR>
	<TITLE>Proof of Grabiner's theorem on non-colliding particles</TITLE>
	<SECONDARY_TITLE>Probability and Mathematical Statistics</SECONDARY_TITLE>
	<VOLUME>25</VOLUME>
	<PAGES>129-132</PAGES>
	<KEYWORDS>
		<KEYWORD>Brownian motion</KEYWORD>
		<KEYWORD>Collision time</KEYWORD>
		<KEYWORD>Probability Theory</KEYWORD>
		<KEYWORD>Stochastic Processes</KEYWORD>
	</KEYWORDS>
	<ABSTRACT>A detail proof of Grabiner's theorem on the exact asymptotics of the time to collision for n independent Brownian motions is given. </ABSTRACT>
	<URL>http://www.math.uni.wroc.pl/~pms/publications.php?nr=25.1</URL>
</RECORD>
</RECORDS></XML>