Searcharxiv⌕ Search

arXiv subjects

Daniel A. Lidar

Publications and source records attributed to Daniel A. Lidar.

179 records · Page 10Linked to original sources
arXiv2000

Analysis of Generalized Grover's Quantum Search Algorithms Using Recursion Equations

The recursion equation analysis of Grover's quantum search algorithm presented by Biham et al. [PRA 60, 2742 (1999)] is generalized. It is applied to the large class of Grover's type algorithms in which the Hadamard transform is replaced by any other unitary transformation and the phase inversion is replaced by a rotation by an arbitrary angle. The time evolution of the amplitudes of the marked and unmarked states, for any initial complex amplitude distribution is expressed using first order linear difference equations. These equations are solved exactly. The solution provides the number of iterations T after which the probability of finding a marked state upon measurement is the highest, as well as the value of this probability, P_max. Both T and P_max are found to depend on the averages and variances of the initial amplitude distributions of the marked and unmarked states, but not on higher moments.

quant-ph↗
arXiv2000

Decoherence-Free Subspaces for Multiple-Qubit Errors: (I) Characterization

Coherence in an open quantum system is degraded through its interaction with a bath. This decoherence can be avoided by restricting the dynamics of the system to special decoherence-free subspaces. These subspaces are usually constructed under the assumption of spatially symmetric system-bath coupling. Here we show that decoherence-free subspaces may appear without spatial symmetry. Instead, we consider a model of system-bath interactions in which to first order only multiple-qubit coupling to the bath is present, with single-qubit system-bath coupling absent. We derive necessary and sufficient conditions for the appearance of decoherence-free states in this model, and give a number of examples. In a sequel paper we show how to perform universal and fault tolerant quantum computation on the decoherence-free subspaces considered in this paper.

quant-ph↗
arXiv2000

Decoherence-Free Subspaces for Multiple-Qubit Errors: (II) Universal, Fault-Tolerant Quantum Computation

Decoherence-free subspaces (DFSs) shield quantum information from errors induced by the interaction with an uncontrollable environment. Here we study a model of correlated errors forming an Abelian subgroup (stabilizer) of the Pauli group (the group of tensor products of Pauli matrices). Unlike previous studies of DFSs, this type of errors does not involve any spatial symmetry assumptions on the system-environment interaction. We solve the problem of universal, fault-tolerant quantum computation on the associated class of DFSs.

quant-ph↗
arXiv2000

Universal Fault-Tolerant Computation on Decoherence-Free Subspaces

A general scheme to perform universal quantum computation within decoherence-free subspaces (DFSs) of a system's Hilbert space is presented. This scheme leads to the first fault-tolerant realization of universal quantum computation on DFSs with the properties that (i) only one- and two-qubit interactions are required, and (ii) the system remains within the DFS throughout the entire implementation of a quantum gate. We show explicitly how to perform universal computation on clusters of the four-qubit DFS encoding one logical qubit each under "collective decoherence" (qubit-permutation-invariant system-bath coupling). Our results have immediate relevance to a number of solid-state quantum computer implementations, in particular those in which quantum logic is implemented through exchange interactions, such as the recently proposed spin-spin coupled GaAs quantum dot arrays and the Si:$^{31}$P nuclear spin arrays.

quant-ph↗
arXiv2000

Theory of Decoherence-Free Fault-Tolerant Universal Quantum Computation

Universal quantum computation on decoherence-free subspaces and subsystems (DFSs) is examined with particular emphasis on using only physically relevant interactions. A necessary and sufficient condition for the existence of decoherence-free (noiseless) subsystems in the Markovian regime is derived here for the first time. A stabilizer formalism for DFSs is then developed which allows for the explicit understanding of these in their dual role as quantum error correcting codes. Conditions for the existence of Hamiltonians whose induced evolution always preserves a DFS are derived within this stabilizer formalism. Two possible collective decoherence mechanisms arising from permutation symmetries of the system-bath coupling are examined within this framework. It is shown that in both cases universal quantum computation which always preserves the DFS (*natural fault-tolerant computation*) can be performed using only two-body interactions. This is in marked contrast to standard error correcting codes, where all known constructions using one or two-body interactions must leave the codespace during the on-time of the fault-tolerant gates. A further consequence of our universality construction is that a single exchange Hamiltonian can be used to perform universal quantum computation on an encoded space whose asymptotic coding efficiency is unity. The exchange Hamiltonian, which is naturally present in many quantum systems, is thus *asymptotically universal*.

quant-ph↗
arXiv1999

Protecting Quantum Information Encoded in Decoherence Free States Against Exchange Errors

The exchange interaction between identical qubits in a quantum information processor gives rise to unitary two-qubit errors. It is shown here that decoherence free subspaces (DFSs) for collective decoherence undergo Pauli errors under exchange, which however do not take the decoherence free states outside of the DFS. In order to protect DFSs against these errors it is sufficient to employ a recently proposed concatenated DFS-quantum error correcting code scheme [D.A. Lidar, D. Bacon and K.B. Whaley, Phys. Rev. Lett. {\bf 82}, 4556 (1999)].

quant-ph↗
arXiv1999

Pattern Formation and a Clustering Transition in Power-Law Sequential Adsorption

A new model that describes adsorption and clustering of particles on a surface is introduced. A {\it clustering} transition is found which separates between a phase of weakly correlated particle distributions and a phase of strongly correlated distributions in which the particles form localized fractal clusters. The order parameter of the transition is identified and the fractal nature of both phases is examined. The model is relevant to a large class of clustering phenomena such as aggregation and growth on surfaces, population distribution in cities, plant and bacterial colonies as well as gravitational clustering.

cond-mat.stat-mech↗
arXiv1999

Grover's Quantum Search Algorithm for an Arbitrary Initial Amplitude Distribution

Grover's algorithm for quantum searching is generalized to deal with arbitrary initial complex amplitude distributions. First order linear difference equations are found for the time evolution of the amplitudes of the marked and unmarked states. These equations are solved exactly. New expressions are derived for the optimal time of measurement and the maximal probability of success. They are found to depend on the averages and variances of the initial amplitude distributions of the marked and unmarked states, but not on higher moments. Our results imply that Grover's algorithm is robust against modest noise in the amplitude initialization procedure.

quant-ph↗
arXiv1999

Inversion of Randomly Corrugated Surfaces Structure from Atom Scattering Data

The Sudden Approximation is applied to invert structural data on randomly corrugated surfaces from inert atom scattering intensities. Several expressions relating experimental observables to surface statistical features are derived. The results suggest that atom (and in particular He) scattering can be used profitably to study hitherto unexplored forms of complex surface disorder.

cond-mat.mtrl-sci↗
arXiv1999

How to Teleport Superpositions of Chiral Amplitudes

Chiral molecules may exist in superpositions of left- and right-handed states. We show how the amplitudes of such superpositions may be teleported to the polarization degrees of freedom of a photon and thus measured. Two experimental schemes are proposed, one leading to perfect, the other to state-dependent teleportation. Both methods yield complete information about the amplitudes.

quant-ph↗
arXiv1998

Generalized Grover Search Algorithm for Arbitrary Initial Amplitude Distribution

Grover's algorithm for quantum searching of a database is generalized to deal with arbitrary initial amplitude distributions. First order linear difference equations are found for the time evolution of the amplitudes of the r marked and N-r unmarked states. These equations are solved exactly. An expression for the optimal measurement time T \sim O(\sqrt{N/r}) is derived which is shown to depend only on the initial average amplitudes of the marked and unmarked states. A bound on the probability of measuring a marked state is derived, which depends only on the standard deviation of the initial amplitude distributions of the marked or unmarked states.

quant-ph↗
arXiv1998

Atom Scattering from Disordered Surfaces in the Sudden Approximation: Double Collisions Effects and Quantum Liquids

The Sudden Approximation (SA) for scattering of atoms from surfaces is generalized to allow for double collision events and scattering from time-dependent quantum liquid surfaces. The resulting new schemes retain the simplicity of the original SA, while requiring little extra computational effort. The results suggest that inert atom (and in particular He) scattering can be used profitably to study hitherto unexplored forms of complex surface disorder.

cond-mat.mtrl-sci↗
arXiv1998

Scaling Range and Cutoffs in Empirical Fractals

Fractal structures appear in a vast range of physical systems. A literature survey including all experimental papers on fractals which appeared in the six Physical Review journals (A-E and Letters) during the 1990's shows that experimental reports of fractal behavior are typically based on a scaling range $Δ$ which spans only 0.5 - 2 decades. This range is limited by upper and lower cutoffs either because further data is not accessible or due to crossover bends. Focusing on spatial fractals, a classification is proposed into (a) aggregation; (b) porous media; (c) surfaces and fronts; (d) fracture and (e) critical phenomena. Most of these systems, [except for class (e)] involve processes far from thermal equilibrium. The fact that for self similar fractals [in contrast to the self affine fractals of class (c)] there are hardly any exceptions to the finding of $Δ\le 2$ decades, raises the possibility that the cutoffs are due to intrinsic properties of the measured systems rather than the specific experimental conditions and apparatus. To examine the origin of the limited range we focus on a class of aggregation systems. In these systems a molecular beam is deposited on a surface, giving rise to nucleation and growth of diffusion-limited-aggregation-like clusters. Scaling arguments are used to show that the required duration of the deposition experiment increases exponentially with $Δ$. Furthermore, using realistic parameters for surfaces such as Al(111) it is shown that these considerations limit the range of fractal behavior to less than two decades in agreement with the experimental findings. It is conjectured that related kinetic mechanisms that limit the scaling range are common in other nonequilibrium processes which generate spatial fractals.

cond-mat↗
arXiv1997

Simulating Ising Spin Glasses on a Quantum Computer

A linear-time algorithm is presented for the construction of the Gibbs distribution of configurations in the Ising model, on a quantum computer. The algorithm is designed so that each run provides one configuration with a quantum probability equal to the corresponding thermodynamic weight. The partition function is thus approximated efficiently. The algorithm neither suffers from critical slowing down, nor gets stuck in local minima. The algorithm can be A linear-time algorithm is presented for the construction of the Gibbs distribution of configurations in the Ising model, on a quantum computer. The algorithm is designed so that each run provides one configuration with a quantum probability equal to the corresponding thermodynamic weight. The partition function is thus approximated efficiently. The algorithm neither suffers from critical slowing down, nor gets stuck in local minima. The algorithm can be applied in any dimension, to a class of spin-glass Ising models with a finite portion of frustrated plaquettes, diluted Ising models, and models with a magnetic field. applied in any dimension, to a class of spin-glass Ising models with a finite portion of frustrated plaquettes, diluted Ising models, and models with a magnetic field.

quant-ph↗
arXiv1997

Limited Range Fractality of Randomly Adsorbed Rods

Multiple resolution analysis of two dimensional structures composed of randomly adsorbed penetrable rods, for densities below the percolation threshold, has been carried out using box-counting functions. It is found that at relevant resolutions, for box-sizes, $r$, between cutoffs given by the average rod length $<\ell>$ and the average inter-rod distance $r_1$, these systems exhibit apparent fractal behavior. It is shown that unlike the case of randomly distributed isotropic objects, the upper cutoff $r_1$ is not only a function of the coverage but also depends on the excluded volume, averaged over the orientational distribution. Moreover, the apparent fractal dimension also depends on the orientational distributions of the rods and decreases as it becomes more anisotropic. For box sizes smaller than $<\ell>$ the box counting function is determined by the internal structure of the rods, whether simple or itself fractal. Two examples are considered - one of regular rods of one dimensional structure and rods which are trimmed into a Cantor set structure which are fractals themselves. The models examined are relevant to adsorption of linear molecules and fibers, liquid crystals, stress induced fractures and edge imperfections in metal catalysts. We thus obtain a distinction between two ranges of length scales: $r < <\ell>$ where the internal structure of the adsorbed objects is probed, and $<\ell> < r < r_1$ where their distribution is probed, both of which may exhibit fractal behavior. This distinction is relevant to the large class of systems which exhibit aggregation of a finite density of fractal-like clusters, which includes surface growth in molecular beam epitaxy and diffusion-limited-cluster-cluster-aggregation models.

cond-mat↗