Query complexity for searching multiple marked states from an unsorted database

An important and usual problem is to search all states we want from a database with a large number of states. In such, recall is vital. Grover's original quantum search algorithm has been generalized to the case of multiple solutions, but no one has calculated the query complexity in this case. We will use a generalized algorithm with higher precision to solve such a search problem that we should find all marked states and show that the practical query complexity increases with the number of marked states. In the end we will introduce an algorithm for the problem on a ``duality computer'' and show its advantage over other algorithms.Comment: 4 pages,4 figures,twocolum

No-relationship between impossibility of faster-than-light quantum communication and distinction of ensembles with the same density matrix

It has been claimed in the literature that impossibility of faster-than-light quantum communication has an origin of indistinguishability of ensembles with the same density matrix. We show that the two concepts are not related. We argue that: 1) even with an ideal single-atom-precision measurement, it is generally impossible to produce two ensembles with exactly the same density matrix; or 2) to produce ensembles with the same density matrix, classical communication is necessary. Hence the impossibility of faster-than-light communication does not imply the indistinguishability of ensembles with the same density matrix.Comment: 4 pages and 3 figure

The Quantum Interference Computer: an experimental proposal

An experiment is proposed to test the interference aspect of the Quantum Interference Computer approachComment: 6 pages, 1 figur

Prime Factorization in the Duality Computer

We give algorithms to factorize large integers in the duality computer. We provide three duality algorithms for factorization based on a naive factorization method, the Shor algorithm in quantum computing, and the Fermat's method in classical computing. All these algorithms are polynomial in the input size.Comment: 4 page

A family of sure-success quantum algorithms for solving a generalized Grover search problem

This work considers a generalization of Grover's search problem, viz., to find any one element in a set of acceptable choices which constitute a fraction f of the total number of choices in an unsorted data base. An infinite family of sure-success quantum algorithms are introduced here to solve this problem, each member for a different range of f. The nth member of this family involves n queries of the data base, and so the lowest few members of this family should be very convenient algorithms within their ranges of validity. The even member {A}_{2n} of the family covers ever larger range of f for larger n, which is expected to become the full range 0 infinity.Comment: 8 pages, including 4 figures in 4 page

Studies of the electric dipole transitions of deformed rare-earth nuclei

Spectrum and electric dipole transition rates and relative intensities in $^{152-154}$Sm, $^{156-160}$Gd, $^{160-162}$Dy are studied in the framework of the interacting boson model with s,p,d,f bosons. It is found that E1 transition data among the low-lying levels are in good agreement with the SU(3) dynamical symmetry of the spdf interacting boson model proposed by Engel and Iachello to describe collective rotation with octupole vibration. These results show that these nuclei have SU(3) dynamic symmetry to a good approximation. Also in this work many algebraic expressions for electric dipole transitions in the SU(3) limit of the spdf-IBM have been obtained. These formulae together with the formulae given previously exhaust nearly all the E1 transitions for low-lying negative parity states. They are useful in analyzing experimental data.Comment: 26 pages, 1 figur

A Comment on "The Far Future of Exoplanet Direct Characterization" - the Case for Interstellar Space Probes

Following on from ideas presented in a recent paper by Schneider et al. (2010) on "The Far Future of Exoplanet Direct Characterization", I argue that they have exaggerated the technical obstacles to performing such 'direct characterization' by means of fast (order 0.1c) interstellar space probes. A brief summary of rapid interstellar spaceflight concepts that may be found in the literature is presented. I argue that the presence of interstellar dust grains, while certainly something which will need to be allowed for in interstellar vehicle design, is unlikely to be the kind of 'show stopper' suggested by Schneider et al. Astrobiology as a discipline would be a major beneficiary of developing an interstellar spaceflight capability, albeit in the longer term, and I argue that astrobiologists should keep an open mind to the possibilities.Comment: Accepted for publication in Astrobiolog

General-Purpose Parallel Simulator for Quantum Computing

With current technologies, it seems to be very difficult to implement quantum computers with many qubits. It is therefore of importance to simulate quantum algorithms and circuits on the existing computers. However, for a large-size problem, the simulation often requires more computational power than is available from sequential processing. Therefore, the simulation methods using parallel processing are required. We have developed a general-purpose simulator for quantum computing on the parallel computer (Sun, Enterprise4500). It can deal with up-to 30 qubits. We have performed Shor's factorization and Grover's database search by using the simulator, and we analyzed robustness of the corresponding quantum circuits in the presence of decoherence and operational errors. The corresponding results, statistics and analyses are presented.Comment: 15 pages, 15 figure

Lateral projection as a possible explanation of the nontrivial boundary dependence of the Casimir force

We find the lateral projection of the Casimir force for a configuration of a sphere above a corrugated plate. This force tends to change the sphere position in the direction of a nearest corrugation maximum. The probability distribution describing different positions of a sphere above a corrugated plate is suggested which is fitted well with experimental data demonstrating the nontrivial boundary dependence of the Casimir force.Comment: 5 pages, 1 figur

Collective Properties of Low-lying Octupole Excitations in 82208Pb126^{208}_{82}Pb_{126}, 2060Ca40^{60}_{20}Ca_{40} and 828O20^{28}_{8}O_{20}

The octupole strengths of $\beta$-stable nucleus $^{208}_{82}Pb_{126}$, a neutron skin nucleus $^{60}_{20}Ca_{40}$ and a neutron drip line nucleus $^{28}_{8}O_{20}$ are studied by using the self-consistent Hartree-Fock calculation plus the random phase approximation (RPA) with Skyrme interaction. The collective properties of low-lying excitations are analyzed by using particle-vibration coupling. The results show that the lowest isoscalar states above threshold in $^{60}_{20}Ca_{40}$ and $^{28}_{8}O_{20}$ are the superpositions of collective excitations and unperturbed transitions from bound state to nonresonance states. For these three nuclei, both the low-lying isoscalar states and giant isoscalar resonance carry isovector strength. The ratio B(IV)/B(IS) is checked. It is found that, for $^{208}_{82}Pb_{126}$, the ratios are equal to $(\frac{N-Z}{A})^2$ in good accuracy, while for $^{60}_{20}Ca_{40}$ and $^{28}_{8}O_{20}$, the ratios are much larger than $(\frac{N-Z}{A})^2$. This results from the excess neutrons with small binding energies in $^{60}_{20}Ca_{40}$ and $^{28}_{8}O_{20}$.Comment: 14 pages, 10 figure