Estimating graph parameters with random walks

An algorithm observes the trajectories of random walks over an unknown graph $G$, starting from the same vertex $x$, as well as the degrees along the trajectories. For all finite connected graphs, one can estimate the number of edges $m$ up to a bounded factor in $O\left(t_{\mathrm{rel}}^{3/4}\sqrt{m/d}\right)$ steps, where $t_{\mathrm{rel}}$ is the relaxation time of the lazy random walk on $G$ and $d$ is the minimum degree in $G$. Alternatively, $m$ can be estimated in $O\left(t_{\mathrm{unif}} +t_{\mathrm{rel}}^{5/6}\sqrt{n}\right)$, where $n$ is the number of vertices and $t_{\mathrm{unif}}$ is the uniform mixing time on $G$. The number of vertices $n$ can then be estimated up to a bounded factor in an additional $O\left(t_{\mathrm{unif}}\frac{m}{n}\right)$ steps. Our algorithms are based on counting the number of intersections of random walk paths $X,Y$, i.e. the number of pairs $(t,s)$ such that $X_t=Y_s$. This improves on previous estimates which only consider collisions (i.e., times $t$ with $X_t=Y_t$). We also show that the complexity of our algorithms is optimal, even when restricting to graphs with a prescribed relaxation time. Finally, we show that, given either $m$ or the mixing time of $G$, we can compute the "other parameter" with a self-stopping algorithm

Fast rate estimation of an unitary operation in SU(d)

We give an explicit procedure based on entangled input states for estimating a $SU(d)$ operation $U$ with rate of convergence $1/N^2$ when sending $N$ particles through the device. We prove that this rate is optimal. We also evaluate the constant $C$ such that the asymptotic risk is $C/N^2$. However other strategies might yield a better const ant $C$.Comment: 8 pages, 1 figure Rewritten version, accepted for publication in Phys. Rev. A. The introduction is richer, the "tool section" on group representations has been suppressed, and a section proving that the 1/N^2 rate is optimum has been adde

On the generalization of quantum state comparison

We investigate the unambiguous comparison of quantum states in a scenario that is more general than the one that was originally suggested by Barnett et al. First, we find the optimal solution for the comparison of two states taken from a set of two pure states with arbitrary a priori probabilities. We show that the optimal coherent measurement is always superior to the optimal incoherent measurement. Second, we develop a strategy for the comparison of two states from a set of N pure states, and find an optimal solution for some parameter range when N=3. In both cases we use the reduction method for the corresponding problem of mixed state discrimination, as introduced by Raynal et al., which reduces the problem to the discrimination of two pure states only for N=2. Finally, we provide a necessary and sufficient condition for unambiguous comparison of mixed states to be possible.Comment: 8 pages, 4 figures, Proposition 1 corrected, appendix adde

Quantum mechanics explained

The physical motivation for the mathematical formalism of quantum mechanics is made clear and compelling by starting from an obvious fact - essentially, the stability of matter - and inquiring into its preconditions: what does it take to make this fact possible?Comment: 29 pages, 5 figures. v2: revised in response to referee comment

Relativistic Doppler effect in quantum communication

When an electromagnetic signal propagates in vacuo, a polarization detector cannot be rigorously perpendicular to the wave vector because of diffraction effects. The vacuum behaves as a noisy channel, even if the detectors are perfect. The ``noise'' can however be reduced and nearly cancelled by a relative motion of the observer toward the source. The standard definition of a reduced density matrix fails for photon polarization, because the transversality condition behaves like a superselection rule. We can however define an effective reduced density matrix which corresponds to a restricted class of positive operator-valued measures. There are no pure photon qubits, and no exactly orthogonal qubit states.Comment: 10 pages LaTe

Minimal optimal generalized quantum measurements

Optimal and finite positive operator valued measurements on a finite number $N$ of identically prepared systems have been presented recently. With physical realization in mind we propose here optimal and minimal generalized quantum measurements for two-level systems. We explicitly construct them up to N=7 and verify that they are minimal up to N=5. We finally propose an expression which gives the size of the minimal optimal measurements for arbitrary $N$.Comment: 9 pages, Late