A conditional quantum phase gate between two 3-state atoms

We propose a scheme for conditional quantum logic between two 3-state atoms that share a quantum data-bus such as a single mode optical field in cavity QED systems, or a collective vibrational state of trapped ions. Making use of quantum interference, our scheme achieves successful conditional phase evolution without any real transitions of atomic internal states or populating the quantum data-bus. In addition, it only requires common addressing of the two atoms by external laser fields.Comment: 8 fig

Heisenberg chains cannot mirror a state

Faithful exchange of quantum information can in future become a key part of many computational algorithms. Some Authors suggest to use chains of mutually coupled spins as channels for quantum communication. One can divide these proposals into the groups of assisted protocols, which require some additional action from the users, and natural ones, based on the concept of state mirroring. We show that mirror is fundamentally not the feature chains of spins-1/2 coupled by the Heisenberg interaction, but without local magnetic fields. This fact has certain consequences in terms of the natural state transfer

Another Derivation of a Sum Rule for the Two-Dimensional Two-Component Plasma

In a two-dimensional two-component plasma, the second moment of the number density correlation function has the simple value $\{12 \pi [1-(\Gamma/4)]^2\}^{-1}$, where $\Gamma$ is the dimensionless coupling constant. This result is derived directly by using diagrammatic methods.Comment: 10 pages, uses axodraw.sty, elsart.sty, elsart12.sty, subeq.sty; accepted for publication in Physica A, May 200

Efficient Scheme for Initializing a Quantum Register with an Arbitrary Superposed State

Preparation of a quantum register is an important step in quantum computation and quantum information processing. It is straightforward to build a simple quantum state such as |i_1 i_2 ... i_n\ket with $i_j$ being either 0 or 1, but is a non-trivial task to construct an {\it arbitrary} superposed quantum state. In this Paper, we present a scheme that can most generally initialize a quantum register with an arbitrary superposition of basis states. Implementation of this scheme requires $O(Nn^2)$ standard 1- and 2-bit gate operations, {\it without introducing additional quantum bits}. Application of the scheme in some special cases is discussed.Comment: 4 pages, 4 figures, accepted by Phys. Rev.

Structure of strongly coupled, multi-component plasmas

We investigate the short-range structure in strongly coupled fluidlike plasmas using the hypernetted chain approach generalized to multicomponent systems. Good agreement with numerical simulations validates this method for the parameters considered. We found a strong mutual impact on the spatial arrangement for systems with multiple ion species which is most clearly pronounced in the static structure factor. Quantum pseudopotentials were used to mimic diffraction and exchange effects in dense electron-ion systems. We demonstrate that the different kinds of pseudopotentials proposed lead to large differences in both the pair distributions and structure factors. Large discrepancies were also found in the predicted ion feature of the x-ray scattering signal, illustrating the need for comparison with full quantum calculations or experimental verification

Entangled Quantum States Generated by Shor's Factoring Algorithm

The intermediate quantum states of multiple qubits, generated during the operation of Shor's factoring algorithm are analyzed. Their entanglement is evaluated using the Groverian measure. It is found that the entanglement is generated during the pre-processing stage of the algorithm and remains nearly constant during the quantum Fourier transform stage. The entanglement is found to be correlated with the speedup achieved by the quantum algorithm compared to classical algorithms.Comment: 7 pages, 4 figures submitted to Phys. Rev.

Quantum Mechanics helps in searching for a needle in a haystack

Quantum mechanics can speed up a range of search applications over unsorted data. For example imagine a phone directory containing N names arranged in completely random order. To find someone's phone number with a probability of 50%, any classical algorithm (whether deterministic or probabilistic) will need to access the database a minimum of O(N) times. Quantum mechanical systems can be in a superposition of states and simultaneously examine multiple names. By properly adjusting the phases of various operations, successful computations reinforce each other while others interfere randomly. As a result, the desired phone number can be obtained in only O(sqrt(N)) accesses to the database.Comment: Postscript, 4 pages. This is a modified version of the STOC paper (quant-ph/9605043) and is modified to make it more comprehensible to physicists. It appeared in Phys. Rev. Letters on July 14, 1997. (This paper was originally put out on quant-ph on June 13, 1997, the present version has some minor typographical changes

Rapid solution of problems by nuclear-magnetic-resonance quantum computation

We offer an improved method for using a nuclear-magnetic-resonance quantum computer (NMRQC) to solve the Deutsch-Jozsa problem. Two known obstacles to the application of the NMRQC are exponential diminishment of density-matrix elements with the number of bits, threatening weak signal levels, and the high cost of preparing a suitable starting state. A third obstacle is a heretofore unnoticed restriction on measurement operators available for use by an NMRQC. Variations on the function classes of the Deutsch-Jozsa problem are introduced, both to extend the range of problems advantageous for quantum computation and to escape all three obstacles to use of an NMRQC. By adapting it to one such function class, the Deutsch-Jozsa problem is made solvable without exponential loss of signal. The method involves an extra work bit and a polynomially more involved Oracle; it uses the thermal-equilibrium density matrix systematically for an arbitrary number of spins, thereby avoiding both the preparation of a pseudopure state and temporal averaging.Comment: 19 page

Multi-scale analysis and modelling of collective migration in biological systems

Collective migration has become a paradigm for emergent behaviour in systems of moving and interacting individual units resulting in coherent motion. In biology, these units are cells or organisms. Collective cell migration is important in embryonic development, where it underlies tissue and organ formation, as well as pathological processes, such as cancer invasion and metastasis. In animal groups, collective movements may enhance individuals' decisions and facilitate navigation through complex environments and access to food resources. Mathematical models can extract unifying principles behind the diverse manifestations of collective migration. In biology, with a few exceptions, collective migration typically occurs at a 'mesoscopic scale' where the number of units ranges from only a few dozen to a few thousands, in contrast to the large systems treated by statistical mechanics. Recent developments in multi-scale analysis have allowed linkage of mesoscopic to micro- and macroscopic scales, and for different biological systems. The articles in this theme issue on 'Multi-scale analysis and modelling of collective migration' compile a range of mathematical modelling ideas and multi-scale methods for the analysis of collective migration. These approaches (i) uncover new unifying organization principles of collective behaviour, (ii) shed light on the transition from single to collective migration, and (iii) allow us to define similarities and differences of collective behaviour in groups of cells and organisms. As a common theme, self-organized collective migration is the result of ecological and evolutionary constraints both at the cell and organismic levels. Thereby, the rules governing physiological collective behaviours also underlie pathological processes, albeit with different upstream inputs and consequences for the group. This article is part of the theme issue 'Multi-scale analysis and modelling of collective migration in biological systems'