Policy Initiatives by the Government of India to Accelerate the Growth of Installed Nuclear Power Capacity in the Coming Years

AbstractWhen examined from the point of view of the size of its population and economy, India is not well endowed with energy resources. Studies done by the Department of Atomic Energy indicate that even after exploiting full potential of every available source of energy including nuclear energy, India needs to continue to import energy resources. In this backdrop, an initiative was launched by Government of India to open up international civil nuclear commerce so as to enable India to access natural uranium from international market and to set up nuclear reactors in technical cooperation with other countries. The paper provides details of what has been done so far, ongoing steps and likely growth scenario for nuclear installed capacity in the country

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

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

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

Randomized Benchmarking of Quantum Gates

A key requirement for scalable quantum computing is that elementary quantum gates can be implemented with sufficiently low error. One method for determining the error behavior of a gate implementation is to perform process tomography. However, standard process tomography is limited by errors in state preparation, measurement and one-qubit gates. It suffers from inefficient scaling with number of qubits and does not detect adverse error-compounding when gates are composed in long sequences. An additional problem is due to the fact that desirable error probabilities for scalable quantum computing are of the order of 0.0001 or lower. Experimentally proving such low errors is challenging. We describe a randomized benchmarking method that yields estimates of the computationally relevant errors without relying on accurate state preparation and measurement. Since it involves long sequences of randomly chosen gates, it also verifies that error behavior is stable when used in long computations. We implemented randomized benchmarking on trapped atomic ion qubits, establishing a one-qubit error probability per randomized pi/2 pulse of 0.00482(17) in a particular experiment. We expect this error probability to be readily improved with straightforward technical modifications.Comment: 13 page

Five Dimensional Minimal Supergravities and Four Dimensional Complex Geometries

We discuss the relation between solutions admitting Killing spinors of minimal supergravities in five dimensions and four dimensional complex geometries. In the ungauged case (vanishing cosmological constant \Lambda=0) the solutions are determined in terms of a hyper-Kahler base space; in the gauged case (\Lambda<0) the complex geometry is Kahler; in the de Sitter case (\Lambda>0) the complex geometry is hyper-Kahler with torsion (HKT). In the latter case some details of the derivation are given. The method for constructing explicit solutions is discussed in each case.Comment: 8 pages. Contribution to the Proceedings of the Spanish Relativity Meeting 2008 in Salamanca, Spai

Quantum Portfolios

Quantum computation holds promise for the solution of many intractable problems. However, since many quantum algorithms are stochastic in nature they can only find the solution of hard problems probabilistically. Thus the efficiency of the algorithms has to be characterized both by the expected time to completion {\it and} the associated variance. In order to minimize both the running time and its uncertainty, we show that portfolios of quantum algorithms analogous to those of finance can outperform single algorithms when applied to the NP-complete problems such as 3-SAT.Comment: revision includes additional data and corrects minor typo

Quantum phase retrieval of a Rydberg wave packet using a half-cycle pulse

A terahertz half-cycle pulse was used to retrieve information stored as quantum phase in an $N$-state Rydberg atom data register. The register was prepared as a wave packet with one state phase-reversed from the others (the "marked bit"). A half-cycle pulse then drove a significant portion of the electron probability into the flipped state via multimode interference.Comment: accepted by PR

Pressure-Induced Superconductivity in Sc to 74 GPa

Using a diamond anvil cell with nearly hydrostatic helium pressure medium we have significantly extended the superconducting phase diagram Tc(P) of Sc, the lightest of all transition metals. We find that superconductivity is induced in Sc under pressure, Tc increasing monotonically to 8.2 K at 74.2 GPa. The Tc(P) dependences of the trivalent d-electron metals Sc, Y, La, and Lu are compared and discussed within a simple s-d charge transfer framework.Comment: to be published in Phys. Rev. B (Brief Reports