Robustness of quantum gates in the presence of noise

We define several quantitative measures of the robustness of a quantum gate against noise. Exact analytic expressions for the robustness against depolarizing noise are obtained for all bipartite unitary quantum gates, and it is found that the controlled-NOT gate is the most robust two-qubit quantum gate, in the sense that it is the quantum gate which can tolerate the most depolarizing noise and still generate entanglement. Our results enable us to place several analytic upper bounds on the value of the threshold for quantum computation, with the best bound in the most pessimistic error model being p(th)less than or equal to0.5.

The return to schooling: Estimates from a sample of young Australian twins

This study uses a sample of young Australian twins to examine whether the findings reported in [Ashenfelter, Orley and Krueger, Alan, (1994). 'Estimates of the Economic Return to Schooling from a New Sample of Twins', American Economic Review, Vol. 84, No. 5, pp.1157-73] and [Miller, P.W., Mulvey, C and Martin, N., (1994). 'What Do Twins Studies Tell Us About the Economic Returns to Education?: A Comparison of Australian and US Findings', Western Australian Labour Market Research Centre Discussion Paper 94/4] are robust to choice of sample and dependent variable. The economic return to schooling in Australia is between 5 and 7 percent when account is taken of genetic and family effects using either fixed-effects models or the selection effects model of Ashenfelter and Krueger. Given the similarity of the findings in this and in related studies, it would appear that the models applied by [Ashenfelter, Orley and Krueger, Alan, (1994). 'Estimates of the Economic Return to Schooling from a New Sample of Twins', American Economic Review, Vol. 84, No. 5, pp. 1157-73] are robust. Moreover, viewing the OLS and IV estimators as lower and upper bounds in the manner of [Black, Dan A., Berger, Mark C., and Scott, Frank C., (2000). 'Bounding Parameter Estimates with Nonclassical Measurement Error', Journal of the American Statistical Association, Vol. 95, No.451, pp.739-748], it is shown that the bounds on the return to schooling in Australia are much tighter than in [Ashenfelter, Orley and Krueger, Alan, (1994). 'Estimates of the Economic Return to Schooling from a New Sample of Twins', American Economic Review, Vol. 84, No. 5, pp. 1157-73], and the return is bounded at a much lower level than in the US. (c) 2005 Elsevier B.V. All rights reserved.

Quantum atom optics with fermions from molecular dissociation

We study a fermionic atom optics counterpart of parametric down-conversion with photons. This can be realized through dissociation of a Bose-Einstein condensate of molecular dimers consisting of fermionic atoms. We present a theoretical model describing the quantum dynamics of dissociation and find analytic solutions for mode occupancies and atomic pair correlations, valid in the short time limit. The solutions are used to identify upper bounds for the correlation functions, which are applicable to any fermionic system and correspond to ideal particle number-difference squeezing.

Surface k-NN query processing

A k-NN query finds the k nearest-neighbors of a given point from a point database. When it is sufficient to measure object distance using the Euclidian distance, the key to efficient k-NN query processing is to fetch and check the distances of a minimum number of points from the database. For many applications, such as vehicle movement along road networks or rover and animal movement along terrain surfaces, the distance is only meaningful when it is along a valid movement path. For this type of k-NN queries, the focus of efficient query processing is to minimize the cost of computing distances using the environment data (such as the road network data and the terrain data), which can be several orders of magnitude larger than that of the point data. Efficient processing of k-NN queries based on the Euclidian distance or the road network distance has been investigated extensively in the past. In this paper, we investigate the problem of surface k-NN query processing, where the distance is calculated from the shortest path along a terrain surface. This problem is very challenging, as the terrain data can be very large and the computational cost of finding shortest paths is very high. We propose an efficient solution based on multiresolution terrain models. Our approach eliminates the need of costly process of finding shortest paths by ranking objects using estimated lower and upper bounds of distance on multiresolution terrain models.