2,520 research outputs found

    Quantum computation with phase drift errors

    Get PDF
    We present results of numerical simulations of the evolution of an ion trap quantum computer made out of 18 ions which are subject to a sequence of nearly 15000 laser pulses in order to find the prime factors of N=15. We analyze the effect of random and systematic phase drift errors arising from inaccuracies in the laser pulses which induce over (under) rotation of the quantum state. Simple analytic estimates of the tolerance for the quality of driving pulses are presented. We examine the use of watchdog stabilization to partially correct phase drift errors concluding that, in the regime investigated, it is rather inefficient.Comment: 5 pages, RevTex, 2 figure

    Quantum Computing of Classical Chaos: Smile of the Arnold-Schrodinger Cat

    Get PDF
    We show on the example of the Arnold cat map that classical chaotic systems can be simulated with exponential efficiency on a quantum computer. Although classical computer errors grow exponentially with time, the quantum algorithm with moderate imperfections is able to simulate accurately the unstable chaotic classical dynamics for long times. The algorithm can be easily implemented on systems of a few qubits.Comment: revtex, 4 pages, 4 figure

    Quantum computation with linear optics

    Full text link
    We present a constructive method to translate small quantum circuits into their optical analogues, using linear components of present-day quantum optics technology only. These optical circuits perform precisely the computation that the quantum circuits are designed for, and can thus be used to test the performance of quantum algorithms. The method relies on the representation of several quantum bits by a single photon, and on the implementation of universal quantum gates using simple optical components (beam splitters, phase shifters, etc.). The optical implementation of Brassard et al.'s teleportation circuit, a non-trivial 3-bit quantum computation, is presented as an illustration.Comment: LaTeX with llncs.cls, 11 pages with 5 postscript figures, Proc. of 1st NASA Workshop on Quantum Computation and Quantum Communication (QCQC 98

    Particle creation in a colliding plane wave spacetime: wave packet quantization

    Full text link
    We use wave packet mode quantization to compute the creation of massless scalar quantum particles in a colliding plane wave spacetime. The background spacetime represents the collision of two gravitational shock waves followed by trailing gravitational radiation which focus into a Killing-Cauchy horizon. The use of wave packet modes simplifies the problem of mode propagation through the different spacetime regions which was previously studied with the use of monocromatic modes. It is found that the number of particles created in a given wave packet mode has a thermal spectrum with a temperature which is inversely proportional to the focusing time of the plane waves and which depends on the mode trajectory.Comment: 23, latex, figures available by fa

    Quantum computing of quantum chaos and imperfection effects

    Full text link
    We study numerically the imperfection effects in the quantum computing of the kicked rotator model in the regime of quantum chaos. It is shown that there are two types of physical characteristics: for one of them the quantum computation errors grow exponentially with the number of qubits in the computer while for the other the growth is polynomial. Certain similarity between classical and quantum computing errors is also discussed.Comment: revtex, 4 pages, 4 figure

    Left-Right Symmetry and Supersymmetric Unification

    Get PDF
    The existence of an SU(3) X SU(2)_L X SU(2)_R X U(1) gauge symmetry with g_L = g_R at the TeV energy scale is shown to be consistent with supersymmetric SO(10) grand unification at around 1O^{16} GeV if certain new particles are assumed. The additional imposition of a discrete Z_2 symmetry leads to a generalized definition of R parity as well as highly suppressed Majorana neutrino masses. Another model based on SO(10) X SO(10) is also discussed.Comment: 11 pages, 2 figures not included, UCRHEP-T124, Apr 199

    Quantum computers in phase space

    Full text link
    We represent both the states and the evolution of a quantum computer in phase space using the discrete Wigner function. We study properties of the phase space representation of quantum algorithms: apart from analyzing important examples, such as the Fourier Transform and Grover's search, we examine the conditions for the existence of a direct correspondence between quantum and classical evolutions in phase space. Finally, we describe how to directly measure the Wigner function in a given phase space point by means of a tomographic method that, itself, can be interpreted as a simple quantum algorithm.Comment: 16 pages, 7 figures, to appear in Phys Rev

    The Representation of Natural Numbers in Quantum Mechanics

    Full text link
    This paper represents one approach to making explicit some of the assumptions and conditions implied in the widespread representation of numbers by composite quantum systems. Any nonempty set and associated operations is a set of natural numbers or a model of arithmetic if the set and operations satisfy the axioms of number theory or arithmetic. This work is limited to k-ary representations of length L and to the axioms for arithmetic modulo k^{L}. A model of the axioms is described based on states in and operators on an abstract L fold tensor product Hilbert space H^{arith}. Unitary maps of this space onto a physical parameter based product space H^{phy} are then described. Each of these maps makes states in H^{phy}, and the induced operators, a model of the axioms. Consequences of the existence of many of these maps are discussed along with the dependence of Grover's and Shor's Algorithms on these maps. The importance of the main physical requirement, that the basic arithmetic operations are efficiently implementable, is discussed. This conditions states that there exist physically realizable Hamiltonians that can implement the basic arithmetic operations and that the space-time and thermodynamic resources required are polynomial in L.Comment: Much rewrite, including response to comments. To Appear in Phys. Rev.

    Quantum repeaters based on entanglement purification

    Full text link
    We study the use of entanglement purification for quantum communication over long distances. For distances much longer than the coherence length of a corresponding noisy quantum channel, the fidelity of transmission is usually so low that standard purification methods are not applicable. It is however possible to divide the channel into shorter segments that are purified separately and then connected by the method of entanglement swapping. This method can be much more efficient than schemes based on quantum error correction, as it makes explicit use of two-way classical communication. An important question is how the noise, introduced by imperfect local operations (that constitute the protocols of purification and the entanglement swapping), accumulates in such a compound channel, and how it can be kept below a certain noise level. To treat this problem, we first study the applicability and the efficiency of entanglement purification protocols in the situation of imperfect local operations. We then present a scheme that allows entanglement purification over arbitrary long channels and tolerates errors on the per-cent level. It requires a polynomial overhead in time, and an overhead in local resources that grows only logarithmically with the length of the channel.Comment: 19 pages, 16 figure

    Quantum computing and information extraction for a dynamical quantum system

    Full text link
    We discuss the simulation of a complex dynamical system, the so-called quantum sawtooth map model, on a quantum computer. We show that a quantum computer can be used to efficiently extract relevant physical information for this model. It is possible to simulate the dynamical localization of classical chaos and extract the localization length of the system with quadratic speed up with respect to any known classical computation. We can also compute with algebraic speed up the diffusion coefficient and the diffusion exponent both in the regimes of Brownian and anomalous diffusion. Finally, we show that it is possible to extract the fidelity of the quantum motion, which measures the stability of the system under perturbations, with exponential speed up.Comment: 11 pages, 5 figures, submitted to Quantum Information Processing, Special Issue devoted to the Physics of Quantum Computin
    • …
    corecore