Observation of tunable exchange bias in Sr2_2YbRuO6_6

The double perovskite compound, Sr$_{2}$YbRuO$_{6}$, displays reversal in the orientation of magnetic moments along with negative magnetization due to an underlying magnetic compensation phenomenon. The exchange bias (EB) field below the compensation temperature could be the usual negative or the positive depending on the initial cooling field. This EB attribute has the potential of getting tuned in a preselected manner, as the positive EB field is seen to crossover from positive to negative value above $T_{\mathrm{comp}}$.Comment: 4 Pages, 4 Figure

Nested quantum search and NP-complete problems

A quantum algorithm is known that solves an unstructured search problem in a number of iterations of order $\sqrt{d}$, where $d$ is the dimension of the search space, whereas any classical algorithm necessarily scales as $O(d)$. It is shown here that an improved quantum search algorithm can be devised that exploits the structure of a tree search problem by nesting this standard search algorithm. The number of iterations required to find the solution of an average instance of a constraint satisfaction problem scales as $\sqrt{d^\alpha}$, with a constant $\alpha<1$ depending on the nesting depth and the problem considered. When applying a single nesting level to a problem with constraints of size 2 such as the graph coloring problem, this constant $\alpha$ is estimated to be around 0.62 for average instances of maximum difficulty. This corresponds to a square-root speedup over a classical nested search algorithm, of which our presented algorithm is the quantum counterpart.Comment: 18 pages RevTeX, 3 Postscript figure

The quantum correlation between the selection of the problem and that of the solution sheds light on the mechanism of the quantum speed up

In classical problem solving, there is of course correlation between the selection of the problem on the part of Bob (the problem setter) and that of the solution on the part of Alice (the problem solver). In quantum problem solving, this correlation becomes quantum. This means that Alice contributes to selecting 50% of the information that specifies the problem. As the solution is a function of the problem, this gives to Alice advanced knowledge of 50% of the information that specifies the solution. Both the quadratic and exponential speed ups are explained by the fact that quantum algorithms start from this advanced knowledge.Comment: Earlier version submitted to QIP 2011. Further clarified section 1, "Outline of the argument", submitted to Phys Rev A, 16 page

Noise in Grover's Quantum Search Algorithm

Grover's quantum algorithm improves any classical search algorithm. We show how random Gaussian noise at each step of the algorithm can be modelled easily because of the exact recursion formulas available for computing the quantum amplitude in Grover's algorithm. We study the algorithm's intrinsic robustness when no quantum correction codes are used, and evaluate how much noise the algorithm can bear with, in terms of the size of the phone book and a desired probability of finding the correct result. The algorithm loses efficiency when noise is added, but does not slow down. We also study the maximal noise under which the iterated quantum algorithm is just as slow as the classical algorithm. In all cases, the width of the allowed noise scales with the size of the phone book as N^-2/3.Comment: 17 pages, 2 eps figures. Revised version. To be published in PRA, December 199

Grover's Quantum Search Algorithm for an Arbitrary Initial Mixed State

The Grover quantum search algorithm is generalized to deal with an arbitrary mixed initial state. The probability to measure a marked state as a function of time is calculated, and found to depend strongly on the specific initial state. The form of the function, though, remains as it is in the case of initial pure state. We study the role of the von Neumann entropy of the initial state, and show that the entropy cannot be a measure for the usefulness of the algorithm. We give few examples and show that for some extremely mixed initial states carrying high entropy, the generalized Grover algorithm is considerably faster than any classical algorithm.Comment: 4 pages. See http://www.cs.technion.ac.il/~danken/MSc-thesis.pdf for extended discussio

Quantum Algorithm for the Collision Problem

In this note, we give a quantum algorithm that finds collisions in arbitrary r-to-one functions after only O((N/r)^(1/3)) expected evaluations of the function. Assuming the function is given by a black box, this is more efficient than the best possible classical algorithm, even allowing probabilism. We also give a similar algorithm for finding claws in pairs of functions. Furthermore, we exhibit a space-time tradeoff for our technique. Our approach uses Grover's quantum searching algorithm in a novel way.Comment: 8 pages, LaTeX2

Economics analysis of tomato cultivation under poly house and open field conditions in Haryana, India

In the present paper an attempt has been made to study the comparative economics of tomato cultivation under poly house and open field conditions in Karnal district, Haryana. Production and marketing constraints under poly house cultivation have also been identified. The primary data for the agriculture year 2013-14 were collected by personal interviews of the selected farmers with the help of a specially designed schedule. Simple statistical tool like Averages and percentages were used to compare, contrast and interpret the results properly. The overall findings of the study reveal that the cost of cultivation of tomato under poly houses was higher by Rs. 206816.90/acre as com-pared to open field conditions. At the same time, the net returns under poly houses were higher by Rs. 51097.54/acre. Farmers realized 53.71 % higher yield of tomato under poly house as compared to open field conditions. The gross return, returns over variable cost and net return were also higher by 106.94 %, 160.70 % and 48.70 %, respectively in case of poly house as compared to open field conditions. The results of the study also revealed that the tomato cultivation under poly houses has significantly contributed to the yield

Implementation of quantum search algorithm using classical Fourier optics

We report on an experiment on Grover's quantum search algorithm showing that {\em classical waves} can search a $N$-item database as efficiently as quantum mechanics can. The transverse beam profile of a short laser pulse is processed iteratively as the pulse bounces back and forth between two mirrors. We directly observe the sought item being found in $\sim\sqrt{N}$ iterations, in the form of a growing intensity peak on this profile. Although the lack of quantum entanglement limits the {\em size} of our database, our results show that entanglement is neither necessary for the algorithm itself, nor for its efficiency.Comment: 4 pages, 3 figures; minor revisions plus extra referenc

New Samarium and Neodymium based admixed ferromagnets with near zero net magnetization and tunable exchange bias field

Rare earth based intermetallics, SmScGe and NdScGe, are shown to exhibit near zero net magnetization with substitutions of 6 to 9 atomic percent of Nd and 25 atomic percent of Gd, respectively. The notion of magnetic compensation in them is also elucidated by the crossover of zero magnetization axis at low magnetic fields (less than 103 Oe) and field-induced reversal in the orientation of the magnetic moments of the dissimilar rare earth ions at higher magnetic fields. These magnetically ordered materials with no net magnetization and appreciable conduction electron polarization display an attribute of an exchange bias field, which can be tuned. The attractively high magnetic ordering temperatures of about 270 K, underscore the importance of these materials for potential applications in spintronics.Comment: 6 page text + 5 figure

Mimicking Time Evolution within a Quantum Ground State: Ground-State Quantum Computation, Cloning, and Teleportation

Ground-state quantum computers mimic quantum mechanical time evolution within the amplitudes of a time-independent quantum state. We explore the principles that constrain this mimicking. A no-cloning argument is found to impose strong restrictions. It is shown, however, that there is flexibility that can be exploited using quantum teleportation methods to improve ground-state quantum computer design.Comment: 10 pages, 7 figure