Sure success partial search

Partial search has been proposed recently for finding the target block containing a target element with fewer queries than the full Grover search algorithm which can locate the target precisely. Since such partial searches will likely be used as subroutines for larger algorithms their success rate is important. We propose a partial search algorithm which achieves success with unit probability

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

Pattern recognition on a quantum computer

By means of a simple example it is demonstrated that the task of finding and identifying certain patterns in an otherwise (macroscopically) unstructured picture (data set) can be accomplished efficiently by a quantum computer. Employing the powerful tool of the quantum Fourier transform the proposed quantum algorithm exhibits an exponential speed-up in comparison with its classical counterpart. The digital representation also results in a significantly higher accuracy than the method of optical filtering. PACS: 03.67.Lx, 03.67.-a, 42.30.Sy, 89.70.+c.Comment: 6 pages RevTeX, 1 figure, several correction

Entangling capacity of global phases and implications for Deutsch-Jozsa algorithm

We investigate the creation of entanglement by the application of phases whose value depends on the state of a collection of qubits. First we give the necessary and sufficient conditions for a given set of phases to result in the creation of entanglement in a state comprising of an arbitrary number of qubits. Then we analyze the creation of entanglement between any two qubits in three qubit pure and mixed states. We use our result to prove that entanglement is necessary for Deutsch-Jozsa algorithm to have an exponential advantage over its classical counterpart.Comment: All 8 figures at the en

Correcting the effects of spontaneous emission on cold trapped ions

We propose two quantum error correction schemes which increase the maximum storage time for qubits in a system of cold trapped ions, using a minimal number of ancillary qubits. Both schemes consider only the errors introduced by the decoherence due to spontaneous emission from the upper levels of the ions. Continuous monitoring of the ion fluorescence is used in conjunction with selective coherent feedback to eliminate these errors immediately following spontaneous emission events, and the conditional time evolution between quantum jumps is removed by symmetrizing the quantum codewords.Comment: 19 pages; 2 figures; RevTex; The quantum codewords are extended to achieve invariance under the conditional time evolution between jump

Measurement of conditional phase shifts for quantum logic

Measurements of the birefringence of a single atom strongly coupled to a high-finesse optical resonator are reported, with nonlinear phase shifts observed for intracavity photon number much less than one. A proposal to utilize the measured conditional phase shifts for implementing quantum logic via a quantum-phase gate (QPG) is considered. Within the context of a simple model for the field transformation, the parameters of the "truth table" for the QPG are determined.Comment: 4 pages in Postscript format, including 4 figures (attached as uuencoded version of a gzip-file

Quantum Probabilistic Subroutines and Problems in Number Theory

We present a quantum version of the classical probabilistic algorithms $\grave{a}$ la Rabin. The quantum algorithm is based on the essential use of Grover's operator for the quantum search of a database and of Shor's Fourier transform for extracting the periodicity of a function, and their combined use in the counting algorithm originally introduced by Brassard et al. One of the main features of our quantum probabilistic algorithm is its full unitarity and reversibility, which would make its use possible as part of larger and more complicated networks in quantum computers. As an example of this we describe polynomial time algorithms for studying some important problems in number theory, such as the test of the primality of an integer, the so called 'prime number theorem' and Hardy and Littlewood's conjecture about the asymptotic number of representations of an even integer as a sum of two primes.Comment: 9 pages, RevTex, revised version, accepted for publication on PRA: improvement in use of memory space for quantum primality test algorithm further clarified and typos in the notation correcte

Basic concepts in quantum computation

Section headings: 1 Qubits, gates and networks 2 Quantum arithmetic and function evaluations 3 Algorithms and their complexity 4 From interferometers to computers 5 The first quantum algorithms 6 Quantum search 7 Optimal phase estimation 8 Periodicity and quantum factoring 9 Cryptography 10 Conditional quantum dynamics 11 Decoherence and recoherence 12 Concluding remarksComment: 37 pages, lectures given at les Houches Summer School on "Coherent Matter Waves", July-August 199

Effect of an inhomogeneous external magnetic field on a quantum dot quantum computer

We calculate the effect of an inhomogeneous magnetic field, which is invariably present in an experimental environment, on the exchange energy of a double quantum dot artificial molecule, projected to be used as a 2-qubit quantum gate in the proposed quantum dot quantum computer. We use two different theoretical methods to calculate the Hilbert space structure in the presence of the inhomogeneous field: the Heitler-London method which is carried out analytically and the molecular orbital method which is done computationally. Within these approximations we show that the exchange energy J changes slowly when the coupled dots are subject to a magnetic field with a wide range of inhomogeneity, suggesting swap operations can be performed in such an environment as long as quantum error correction is applied to account for the Zeeman term. We also point out the quantum interference nature of this slow variation in exchange.Comment: 12 pages, 4 figures embedded in tex

Appearance and Stability of Anomalously Fluctuating States in Shor's Factoring Algorithm

We analyze quantum computers which perform Shor's factoring algorithm, paying attention to asymptotic properties as the number L of qubits is increased. Using numerical simulations and a general theory of the stabilities of many-body quantum states, we show the following: Anomalously fluctuating states (AFSs), which have anomalously large fluctuations of additive operators, appear in various stages of the computation. For large L, they decohere at anomalously great rates by weak noises that simulate noises in real systems. Decoherence of some of the AFSs is fatal to the results of the computation, whereas decoherence of some of the other AFSs does not have strong influence on the results of the computation. When such a crucial AFS decoheres, the probability of getting the correct computational result is reduced approximately proportional to L^2. The reduction thus becomes anomalously large with increasing L, even when the coupling constant to the noise is rather small. Therefore, quantum computations should be improved in such a way that all AFSs appearing in the algorithms do not decohere at such great rates in the existing noises.Comment: 11 figures. A few discussions were added in verion 2. Version 3 is the SAME as version 2; only errors during the Web-upload were fixed. Version 4 is the publised version, in which several typos are fixed and the reference list is update