WorldWideScience

Sample records for ground-state quantum computer

  1. Preparing ground States of quantum many-body systems on a quantum computer.

    Science.gov (United States)

    Poulin, David; Wocjan, Pawel

    2009-04-03

    Preparing the ground state of a system of interacting classical particles is an NP-hard problem. Thus, there is in general no better algorithm to solve this problem than exhaustively going through all N configurations of the system to determine the one with lowest energy, requiring a running time proportional to N. A quantum computer, if it could be built, could solve this problem in time sqrt[N]. Here, we present a powerful extension of this result to the case of interacting quantum particles, demonstrating that a quantum computer can prepare the ground state of a quantum system as efficiently as it does for classical systems.

  2. Holonomic quantum computing in ground states of spin chains with symmetry-protected topological order

    CERN Document Server

    Renes, Joseph M; Brennen, Gavin K; Bartlett, Stephen D

    2011-01-01

    While solid-state devices offer naturally reliable hardware for modern classical computers, thus far quantum information processors resemble vacuum tube computers in being neither reliable nor scalable. Strongly correlated many body states stabilized in topologically ordered matter offer the possibility of naturally fault tolerant computing, but are both challenging to engineer and coherently control and cannot be easily adapted to different physical platforms. We propose an architecture which achieves some of the robustness properties of topological models but with a drastically simpler construction. Quantum information is stored in the degenerate ground states of spin-1 chains exhibiting symmetry-protected topological order (SPTO), while quantum gates are performed by adiabatic non-Abelian holonomies using only single-site fields and nearest-neighbor couplings. Gate operations respect the SPTO symmetry, inheriting some protection from noise and disorder from the SPTO robustness to local perturbation. A pote...

  3. Exponential vanishing of the ground-state gap of the quantum random energy model via adiabatic quantum computing

    Energy Technology Data Exchange (ETDEWEB)

    Adame, J.; Warzel, S., E-mail: warzel@ma.tum.de [Zentrum Mathematik, TU München, Boltzmannstr. 3, 85747 Garching (Germany)

    2015-11-15

    In this note, we use ideas of Farhi et al. [Int. J. Quantum. Inf. 6, 503 (2008) and Quantum Inf. Comput. 11, 840 (2011)] who link a lower bound on the run time of their quantum adiabatic search algorithm to an upper bound on the energy gap above the ground-state of the generators of this algorithm. We apply these ideas to the quantum random energy model (QREM). Our main result is a simple proof of the conjectured exponential vanishing of the energy gap of the QREM.

  4. Solving Quantum Ground-State Problems with Nuclear Magnetic Resonance

    CERN Document Server

    Li, Zhaokai; Chen, Hongwei; Lu, Dawei; Whitfield, James D; Peng, Xinhua; Aspuru-Guzik, Alán; Du, Jiangfeng

    2011-01-01

    Quantum ground-state problems are computationally hard problems; for general many-body Hamiltonians, there is no classical or quantum algorithm known to be able to solve them efficiently. Nevertheless, if a trial wavefunction approximating the ground state is available, as often happens for many problems in physics and chemistry, a quantum computer could employ this trial wavefunction to project the ground state by means of the phase estimation algorithm (PEA). We performed an experimental realization of this idea by implementing a variational-wavefunction approach to solve the ground-state problem of the Heisenberg spin model with an NMR quantum simulator. Our iterative phase estimation procedure yields a high accuracy for the eigenenergies (to the 10^-5 decimal digit). The ground-state fidelity was distilled to be more than 80%, and the singlet-to-triplet switching near the critical field is reliably captured. This result shows that quantum simulators can better leverage classical trial wavefunctions than c...

  5. Ground-state properties of the retinal molecule: from quantum mechanical to classical mechanical computations of retinal proteins

    Energy Technology Data Exchange (ETDEWEB)

    Suhai, Sandor [German Cancer Research Center, Heidelberg

    2011-01-01

    Retinal proteins are excellent systems for understanding essential physiological processes such as signal transduction and ion pumping. Although the conjugated polyene system of the retinal chromophore is best described with quantum mechanics, simulations of the long-timescale dynamics of a retinal protein in its physiological, flexible, lipid-membrane environment can only be performed at the classical mechanical level. Torsional energy barriers are a critical ingredient of the classical force-field parameters. Here we review briefly current retinal force fields and discuss new quantum mechanical computations to assess how the retinal Schiff base model and the approach used to derive the force-field parameters may influence the torsional potentials.

  6. New ground state for quantum gravity

    CERN Document Server

    Magueijo, Joao

    2012-01-01

    In this paper we conjecture the existence of a new "ground" state in quantum gravity, supplying a wave function for the inflationary Universe. We present its explicit perturbative expression in the connection representation, exhibiting the associated inner product. The state is chiral, dependent on the Immirzi parameter, and is the vacuum of a second quantized theory of graviton particles. We identify the physical and unphysical Hilbert sub-spaces. We then contrast this state with the perturbed Kodama state and explain why the latter can never describe gravitons in a de Sitter background. Instead, it describes self-dual excitations, which are composites of the positive frequencies of the right-handed graviton and the negative frequencies of the left-handed graviton. These excitations are shown to be unphysical under the inner product we have identified. Our rejection of the Kodama state has a moral tale to it: the semi-classical limit of quantum gravity can be the wrong path for making contact with reality (w...

  7. Asymptotics of Ground State Degeneracies in Quiver Quantum Mechanics

    CERN Document Server

    Cordova, Clay

    2015-01-01

    We study the growth of the ground state degeneracy in the Kronecker model of quiver quantum mechanics. This is the simplest quiver with two gauge groups and bifundamental matter fields, and appears universally in the context of BPS state counting in four-dimensional N=2 systems. For large ranks, the ground state degeneracy is exponential with slope a modular function that we are able to compute at integral values of its argument. We also observe that the exponential of the slope is an algebraic number and determine its associated algebraic equation explicitly in several examples. The speed of growth of the degeneracies, together with various physical features of the bound states, suggests a dual string interpretation.

  8. Advantages of Unfair Quantum Ground-State Sampling.

    Science.gov (United States)

    Zhang, Brian Hu; Wagenbreth, Gene; Martin-Mayor, Victor; Hen, Itay

    2017-04-21

    The debate around the potential superiority of quantum annealers over their classical counterparts has been ongoing since the inception of the field. Recent technological breakthroughs, which have led to the manufacture of experimental prototypes of quantum annealing optimizers with sizes approaching the practical regime, have reignited this discussion. However, the demonstration of quantum annealing speedups remains to this day an elusive albeit coveted goal. We examine the power of quantum annealers to provide a different type of quantum enhancement of practical relevance, namely, their ability to serve as useful samplers from the ground-state manifolds of combinatorial optimization problems. We study, both numerically by simulating stoquastic and non-stoquastic quantum annealing processes, and experimentally, using a prototypical quantum annealing processor, the ability of quantum annealers to sample the ground-states of spin glasses differently than thermal samplers. We demonstrate that (i) quantum annealers sample the ground-state manifolds of spin glasses very differently than thermal optimizers (ii) the nature of the quantum fluctuations driving the annealing process has a decisive effect on the final distribution, and (iii) the experimental quantum annealer samples ground-state manifolds significantly differently than thermal and ideal quantum annealers. We illustrate how quantum annealers may serve as powerful tools when complementing standard sampling algorithms.

  9. Theory of ground state factorization in quantum cooperative systems.

    Science.gov (United States)

    Giampaolo, Salvatore M; Adesso, Gerardo; Illuminati, Fabrizio

    2008-05-16

    We introduce a general analytic approach to the study of factorization points and factorized ground states in quantum cooperative systems. The method allows us to determine rigorously the existence, location, and exact form of separable ground states in a large variety of, generally nonexactly solvable, spin models belonging to different universality classes. The theory applies to translationally invariant systems, irrespective of spatial dimensionality, and for spin-spin interactions of arbitrary range.

  10. Ground States and Excited States in a Tunable Graphene Quantum Dot

    Institute of Scientific and Technical Information of China (English)

    WANG Lin-Jun; CAO Gang; TU Tao; LI Hai-Ou; ZHOU Cheng; HAO Xiao-Jie; GUO Guang-Can; GUO Guo-Ping

    2011-01-01

    We prepare an etched gate tunable quantum dot in single-layer graphene and present transport measurement in this system. We extract the information of the ground states and excited states of the graphene quantum dot, as denoted by the presence of characteristic Coulomb blockade diamond diagrams. The results demonstrate that the quantum dot in single-layer graphene bodes well in future quantum transport study and quantum computing applications.%@@ We prepare an etched gate tunable quantum dot in single-layer graphene and present transport measurement in this system.We extract the information of the ground states and excited states of the graphene quantum dot, as denoted by the presence of characteristic Coulomb blockade diamond diagrams.The results demonstrate that the quantum dot in single-layer graphene bodes well in future quantum transport study and quantum computing applications.

  11. Probing quantum frustrated systems via factorization of the ground state.

    Science.gov (United States)

    Giampaolo, Salvatore M; Adesso, Gerardo; Illuminati, Fabrizio

    2010-05-21

    The existence of definite orders in frustrated quantum systems is related rigorously to the occurrence of fully factorized ground states below a threshold value of the frustration. Ground-state separability thus provides a natural measure of frustration: strongly frustrated systems are those that cannot accommodate for classical-like solutions. The exact form of the factorized ground states and the critical frustration are determined for various classes of nonexactly solvable spin models with different spatial ranges of the interactions. For weak frustration, the existence of disentangling transitions determines the range of applicability of mean-field descriptions in biological and physical problems such as stochastic gene expression and the stability of long-period modulated structures.

  12. Upper Bounds on the Degeneracy of the Ground State in Quantum Field Models

    Directory of Open Access Journals (Sweden)

    Asao Arai

    2016-01-01

    Full Text Available Axiomatic abstract formulations are presented to derive upper bounds on the degeneracy of the ground state in quantum field models including massless ones. In particular, given is a sufficient condition under which the degeneracy of the ground state of the perturbed Hamiltonian is less than or equal to the degeneracy of the ground state of the unperturbed one. Applications of the abstract theory to models in quantum field theory are outlined.

  13. Ground State of a Two-Electron Quantum Dot with a Gaussian Confining Potential

    Institute of Scientific and Technical Information of China (English)

    XIE Wen-Fang

    2006-01-01

    We investigate the ground-state properties of a two-dimensional two-electron quantum dot with a Gaussian confining potential under the influence of perpendicular homogeneous magnetic field. Calculations are carried out by using the method of numerical diagonalization of Hamiltonian matrix within the effective-mass approximation. A ground-state behaviour (singlet→triplet state transitions) as a function of the strength of a magnetic field has been found. It is found that the dot radius R of the Gaussian potential is important for the ground-state transition and the feature of ground-state for the Gaussian potential quantum dot (QD), and the parabolic potential QDs are similar when R is larger. The larger the quantum dot radius, the smaller the magnetic field for the singlet-triplet transition of the ground-state of two interacting electrons in the Gaussian quantum dot.

  14. Ground State Geometries of Polyacetylene Chains from Many-Particle Quantum Mechanics.

    Science.gov (United States)

    Barborini, Matteo; Guidoni, Leonardo

    2015-09-08

    Due to the crucial role played by electron correlation, the accurate determination of ground state geometries of π-conjugated molecules is still a challenge for many quantum chemistry methods. Because of the high parallelism of the algorithms and their explicit treatment of electron correlation effects, Quantum Monte Carlo calculations can offer an accurate and reliable description of the electronic states and of the geometries of such systems, competing with traditional quantum chemistry approaches. Here, we report the structural properties of polyacetylene chains H-(C₂H₂)(N)-H up to N = 12 acetylene units, by means of Variational Monte Carlo (VMC) calculations based on the multi-determinant Jastrow Antisymmetrized Geminal Power (JAGP) wave function. This compact ansatz can provide for such systems an accurate description of the dynamical electronic correlation as recently detailed for the 1,3-butadiene molecule [J. Chem. Theory Comput. 2015 11 (2), 508-517]. The calculated Bond Length Alternation (BLA), namely the difference between the single and double carbon bonds, extrapolates, for N → ∞, to a value of 0.0910(7) Å, compatible with the experimental data. An accurate analysis was able to distinguish between the influence of the multi-determinantal AGP expansion and of the Jastrow factor on the geometrical properties of the fragments. Our size-extensive and self-interaction-free results provide new and accurate ab initio references for the structures of the ground state of polyenes.

  15. Ground state of excitons in quantum-dot quantum-well nanoparticles:stochastic variational method

    Institute of Scientific and Technical Information of China (English)

    Zhang Heng; Shi Jun-Jie

    2004-01-01

    Within the framework of effective mass approximation, the ground state of excitons confined in spherical core-shell quantum-dot quantum-well (QDQW) nanoparticles is solved by using the stochastic variational method, in which the finite band offset and the heavy (light) hole exciton states are considered. The calculated lse-lsh transition energies for the chosen CdS/HgS/CdS QDQW samples are in good agreement with the experimental measurements. Moreover,some previous theoretical results are improved.

  16. Universal crossover from ground-state to excited-state quantum criticality

    Science.gov (United States)

    Kang, Byungmin; Potter, Andrew C.; Vasseur, Romain

    2017-01-01

    We study the nonequilibrium properties of a nonergodic random quantum chain in which highly excited eigenstates exhibit critical properties usually associated with quantum critical ground states. The ground state and excited states of this system belong to different universality classes, characterized by infinite-randomness quantum critical behavior. Using strong-disorder renormalization group techniques, we show that the crossover between the zero and finite energy density regimes is universal. We analytically derive a flow equation describing the unitary dynamics of this isolated system at finite energy density from which we obtain universal scaling functions along the crossover.

  17. Towards photonic quantum simulation of ground states of frustrated Heisenberg spin systems.

    Science.gov (United States)

    Ma, Xiao-song; Dakić, Borivoje; Kropatschek, Sebastian; Naylor, William; Chan, Yang-hao; Gong, Zhe-xuan; Duan, Lu-ming; Zeilinger, Anton; Walther, Philip

    2014-01-07

    Photonic quantum simulators are promising candidates for providing insight into other small- to medium-sized quantum systems. Recent experiments have shown that photonic quantum systems have the advantage to exploit quantum interference for the quantum simulation of the ground state of Heisenberg spin systems. Here we experimentally characterize this quantum interference at a tuneable beam splitter and further investigate the measurement-induced interactions of a simulated four-spin system by comparing the entanglement dynamics using pairwise concurrence. We also study theoretically a four-site square lattice with next-nearest neighbor interactions and a six-site checkerboard lattice, which might be in reach of current technology.

  18. Ground State Transitions in Vertically Coupled Four-Layer Single Electron Quantum Dots

    Institute of Scientific and Technical Information of China (English)

    WANGAn-Mei; XIEWen-Fang

    2005-01-01

    We study a four-electron system in a vertically coupled four-layer quantum dot under a magnetic field by the exact diagonalization of the Hamiltonian matr/x. We find that discontinuous ground-state energy transitions are induced by an external magnetic field. We find that dot-dot distance and electron-electron interaction strongly affect the low-lying states of the coupled quantum dots. The inter-dot correlation leads to some sequences of possible disappearances of ground state transitions, which are present for uncoupled dots.

  19. Ground State Transitions in Vertically Coupled Four-Layer Single Electron Quantum Dots

    Institute of Scientific and Technical Information of China (English)

    WANG An-Mei; XIE Wen-Fang

    2005-01-01

    We study a four-electron system in a vertically coupled four-layer quantum dot under a magnetic field by the exact diagonalization of the Hamiltonian matrix. We find that discontinuous ground-state energy transitions are induced by an external magnetic field. We find that dot-dot distance and electron-electron interaction strongly affect the low-lying states of the coupled quantum dots. The inter-dot correlation leads to some sequences of possible disappearances of ground state transitions, which are present for uncoupled dots.

  20. Exponentially Biased Ground-State Sampling of Quantum Annealing Machines with Transverse-Field Driving Hamiltonians

    Science.gov (United States)

    Mandrà, Salvatore; Zhu, Zheng; Katzgraber, Helmut G.

    2017-02-01

    We study the performance of the D-Wave 2X quantum annealing machine on systems with well-controlled ground-state degeneracy. While obtaining the ground state of a spin-glass benchmark instance represents a difficult task, the gold standard for any optimization algorithm or machine is to sample all solutions that minimize the Hamiltonian with more or less equal probability. Our results show that while naive transverse-field quantum annealing on the D-Wave 2X device can find the ground-state energy of the problems, it is not well suited in identifying all degenerate ground-state configurations associated with a particular instance. Even worse, some states are exponentially suppressed, in agreement with previous studies on toy model problems [New J. Phys. 11, 073021 (2009), 10.1088/1367-2630/11/7/073021]. These results suggest that more complex driving Hamiltonians are needed in future quantum annealing machines to ensure a fair sampling of the ground-state manifold.

  1. A Deterministic Projector Configuration Interaction Approach for the Ground State of Quantum Many-Body Systems.

    Science.gov (United States)

    Zhang, Tianyuan; Evangelista, Francesco A

    2016-09-13

    In this work we propose a novel approach to solve the Schrödinger equation which combines projection onto the ground state with a path-filtering truncation scheme. The resulting projector configuration interaction (PCI) approach realizes a deterministic version of the full configuration interaction quantum Monte Carlo (FCIQMC) method [Booth, G. H.; Thom, A. J. W.; Alavi, A. J. Chem. Phys. 2009, 131, 054106]. To improve upon the linearized imaginary-time propagator, we develop an optimal projector scheme based on an exponential Chebyshev expansion in the limit of an infinite imaginary time step. After writing the exact projector as a path integral in determinant space, we introduce a path filtering procedure that truncates the size of the determinantal basis and approximates the Hamiltonian. The path filtering procedure is controlled by one real threshold that determines the accuracy of the PCI energy and is not biased toward any determinant. Therefore, the PCI approach can equally well describe static and dynamic electron correlation effects. This point is illustrated in benchmark computations on N2 at both equilibrium and stretched geometries. In both cases, the PCI achieves chemical accuracy with wave functions that contain less than 0.5% determinants of full CI space. We also report computations on the ground state of C2 with up to quaduple-ζ basis sets and wave functions as large as 200 million determinants, which allow a direct comparison of the PCI, FCIQMC, and density matrix renormalization group (DMRG) methods. The size of the PCI wave function grows modestly with the number of unoccupied orbitals, and its accuracy may be tuned to match that of FCIQMC and DMRG.

  2. Estimating the ground-state probability of a quantum simulation with product-state measurements

    Directory of Open Access Journals (Sweden)

    Bryce eYoshimura

    2015-10-01

    Full Text Available .One of the goals in quantum simulation is to adiabatically generate the ground state of a complicated Hamiltonian by starting with the ground state of a simple Hamiltonian and slowly evolving the system to the complicated one. If the evolution is adiabatic and the initial and final ground states are connected due to having the same symmetry, then the simulation will be successful. But in most experiments, adiabatic simulation is not possible because it would take too long, and the system has some level of diabatic excitation. In this work, we quantify the extent of the diabatic excitation even if we do not know {it a priori} what the complicated ground state is. Since many quantum simulator platforms, like trapped ions, can measure the probabilities to be in a product state, we describe techniques that can employ these simple measurements to estimate the probability of being in the ground state of the system after the diabatic evolution. These techniques do not require one to know any properties about the Hamiltonian itself, nor to calculate its eigenstate properties. All the information is derived by analyzing the product-state measurements as functions of time.

  3. Classical and quantum filaments in the ground state of trapped dipolar Bose gases

    Science.gov (United States)

    Cinti, Fabio; Boninsegni, Massimo

    2017-07-01

    We study, by quantum Monte Carlo simulations, the ground state of a harmonically confined dipolar Bose gas with aligned dipole moments and with the inclusion of a repulsive two-body potential of varying range. Two different limits can clearly be identified, namely, a classical one in which the attractive part of the dipolar interaction dominates and the system forms an ordered array of parallel filaments and a quantum-mechanical one, wherein filaments are destabilized by zero-point motion, and eventually the ground state becomes a uniform cloud. The physical character of the system smoothly evolves from classical to quantum mechanical as the range of the repulsive two-body potential increases. An intermediate regime is observed in which ordered filaments are still present, albeit forming different structures from the ones predicted classically; quantum-mechanical exchanges of indistinguishable particles across different filaments allow phase coherence to be established, underlying a global superfluid response.

  4. Quantum computing

    OpenAIRE

    Li, Shu-Shen; Long, Gui-lu; Bai, Feng-Shan; Feng, Song-Lin; Zheng, Hou-Zhi

    2001-01-01

    Quantum computing is a quickly growing research field. This article introduces the basic concepts of quantum computing, recent developments in quantum searching, and decoherence in a possible quantum dot realization.

  5. Influence of free carriers on exciton ground states in quantum wells

    Energy Technology Data Exchange (ETDEWEB)

    Klochikhin, A.A. [Ioffe Physical Technical Institute, 194021 St. Petersburg (Russian Federation); Nuclear Physics Institute, 350000 St. Petersburg (Russian Federation); Kochereshko, V.P., E-mail: vladimir.kochereshko@mail.ioffe.ru [Ioffe Physical Technical Institute, 194021 St. Petersburg (Russian Federation); Spin Optics Laboratory, St. Petersburg State University, 198904 St. Petersburg (Russian Federation); Tatarenko, S. [CEA-CNRS Group “Nanophysique et Semiconducteurs”, Institut Néel, CNRS and Universite Joseph Fourier, 25 Avenue des Martyrs, 38042 Grenoble (France)

    2014-10-15

    The influence of free carriers on the ground state of the exciton at zero magnetic field in a quasi-two-dimensional quantum well that contains a gas of free electrons is considered in the framework of the random phase approximation. The effects of the exciton–charge-density interaction and the inelastic scattering processes due to the electron–electron exchange interaction are taken into account. The effect of phase-space filling is considered using an approximate approach. The results of the calculation are compared with the experimental data. - Highlights: • We discussed the effect of free carriers on the exciton ground state in quantum wells. • The processes of exciton–electron scattering become the most important for excitons in doped QWs. • The direct Coulomb scattering can be neglected. • The most important becomes the exchange inelastic exciton–electron scattering.

  6. VARIATIONAL CALCULATION ON GROUND-STATE ENERGY OF BOUND POLARONS IN PARABOLIC QUANTUM WIRES

    Institute of Scientific and Technical Information of China (English)

    WANG ZHUANG-BING; WU FU-LI; CHEN QING-HU; JIAO ZHENG-KUAN

    2001-01-01

    Within the framework of Feynman path-integral variational theory, we calculate the ground-state energy of a polaron in parabolic quantum wires in the presence of a Coulomb potential. It is shown that the polaronic correction to the ground-state energy is more sensitive to the electron-phonon coupling constant than the Coulomb binding parameter,and it increases monotonically with decreasing effective wire radius. Moreover, compared to the results obtained by Feynman Haken variational path-integral theory, we obtain better results within the Feynman path-integral variational approach (FV approach). Applying our calculation to several polar semiconductor quantum wires, we find that the polaronic correction can be considerably large.

  7. Perturbative analysis of the ground-state wavefunctions of the quantum anharmonic oscillators

    Energy Technology Data Exchange (ETDEWEB)

    Xie Qiongtao [Department of Physics and Key Laboratory of Low-Dimensional Quantum Structure and Quantum Control of Ministry of Education, Hunan Normal University, Changsha 410081 (China)], E-mail: xieqiongtao@yahoo.cn

    2009-10-23

    We investigate the perturbative expansions of the ground-state wavefunctions of the quantum anharmonic oscillators. With an appropriate change of spatial scale, the weak-coupling Schroedinger equation is transformed to an equivalent strong-coupling one. The Friedberg-Lee-Zhao method is applied to obtain the improved perturbative expansions. These perturbative expansions give a correction to the WKB results for large spatial distances, and reproduce the conventional weak-coupling results for small spatial distances.

  8. Perturbative analysis of the ground-state wavefunctions of the quantum anharmonic oscillators

    Science.gov (United States)

    Xie, Qiong-Tao

    2009-10-01

    We investigate the perturbative expansions of the ground-state wavefunctions of the quantum anharmonic oscillators. With an appropriate change of spatial scale, the weak-coupling Schrödinger equation is transformed to an equivalent strong-coupling one. The Friedberg-Lee-Zhao method is applied to obtain the improved perturbative expansions. These perturbative expansions give a correction to the WKB results for large spatial distances, and reproduce the conventional weak-coupling results for small spatial distances.

  9. The ground state tunneling splitting and the zero point energy of malonaldehyde: a quantum Monte Carlo determination.

    Science.gov (United States)

    Viel, Alexandra; Coutinho-Neto, Maurício D; Manthe, Uwe

    2007-01-14

    Quantum dynamics calculations of the ground state tunneling splitting and of the zero point energy of malonaldehyde on the full dimensional potential energy surface proposed by Yagi et al. [J. Chem. Phys. 1154, 10647 (2001)] are reported. The exact diffusion Monte Carlo and the projection operator imaginary time spectral evolution methods are used to compute accurate benchmark results for this 21-dimensional ab initio potential energy surface. A tunneling splitting of 25.7+/-0.3 cm-1 is obtained, and the vibrational ground state energy is found to be 15 122+/-4 cm-1. Isotopic substitution of the tunneling hydrogen modifies the tunneling splitting down to 3.21+/-0.09 cm-1 and the vibrational ground state energy to 14 385+/-2 cm-1. The computed tunneling splittings are slightly higher than the experimental values as expected from the potential energy surface which slightly underestimates the barrier height, and they are slightly lower than the results from the instanton theory obtained using the same potential energy surface.

  10. Quantum Cohesion Oscillation of Electron Ground State in Low Temperature Laser Plasma

    Science.gov (United States)

    Zhao, Qingxun; Zhang, Ping; Dong, Lifang; Zhang, Kaixi

    1996-01-01

    The development of radically new technological and economically efficient methods for obtaining chemical products and for producing new materials with specific properties requires the study of physical and chemical processes proceeding at temperature of 10(exp 3) to 10(exp 4) K, temperature range of low temperature plasma. In our paper, by means of Wigner matrix of quantum statistical theory, a formula is derived for the energy of quantum coherent oscillation of electron ground state in laser plasma at low temperature. The collective behavior would be important in ion and ion-molecule reactions.

  11. Ground State Transitions of Four-Electron Quantum Dots in Zero Magnetic Field

    Institute of Scientific and Technical Information of China (English)

    KANG Shuai; XIE Wen-Fang; LIU Yi-Ming; SHI Ting-Yun

    2008-01-01

    In this paper, we study four electrons confined in a parabolic quantum dot in the absence of magnetic field, by the exact diagonalization method. The ground-state electronic structures and orbital and spin angular momenta transitions as a function of the confined strength are investigated. We find that the confinement may cause accidental degeneracies between levels with different low-lying states and the inversion of the energy values. The present results are useful to understand the optical properties and internal electron-electron correlations of quantum dot materials.

  12. Quantum Computing

    CERN Document Server

    Steane, A M

    1998-01-01

    The subject of quantum computing brings together ideas from classical information theory, computer science, and quantum physics. This review aims to summarise not just quantum computing, but the whole subject of quantum information theory. It turns out that information theory and quantum mechanics fit together very well. In order to explain their relationship, the review begins with an introduction to classical information theory and computer science, including Shannon's theorem, error correcting codes, Turing machines and computational complexity. The principles of quantum mechanics are then outlined, and the EPR experiment described. The EPR-Bell correlations, and quantum entanglement in general, form the essential new ingredient which distinguishes quantum from classical information theory, and, arguably, quantum from classical physics. Basic quantum information ideas are described, including key distribution, teleportation, data compression, quantum error correction, the universal quantum computer and qua...

  13. Ground-State Behavior of the Quantum Compass Model in an External Field

    Institute of Scientific and Technical Information of China (English)

    SUN Ke-Wei; CHEN Qing-Hu

    2011-01-01

    @@ Ground-state(GS)properties of the two-dimensional(2D)quantum compass model in an external field on a square 5×5 lattice are investigated by using the exact diagonalization(ED)method.We obtain the GS energy and evaluate quantities such as its correlation functions,nearest-neighbor entanglement and local order parameter.As the external field is presented,the first-order quantum phase point is absent and the system exhibits the behaviors of the second-order phase transition.%Ground-state (GS) properties of the two-dimensional (2D) quantum compass model in an external Geld on a square 5x5 lattice are investigated by using the exact diagonalization (ED) method. We obtain the GS energy and evaluate quantities such as its correlation functions, nearest-neighbor entanglement and local order parameter. As the external Geld is presented, the first-order quantum phase point is absent and the system exhibits the behaviors of the second-order phase transition.

  14. Quantum spin liquid ground states of the Heisenberg-Kitaev model on the triangular lattice

    Science.gov (United States)

    Kos, Pavel; Punk, Matthias

    2017-01-01

    We study quantum disordered ground states of the two-dimensional Heisenberg-Kitaev model on the triangular lattice using a Schwinger boson approach. Our aim is to identify and characterize potential gapped quantum spin liquid phases that are stabilized by anisotropic Kitaev interactions. For antiferromagnetic Heisenberg and Kitaev couplings and sufficiently small spin S , we find three different symmetric Z2 spin liquid phases, separated by two continuous quantum phase transitions. Interestingly, the gap of elementary excitations remains finite throughout the transitions. The first spin liquid phase corresponds to the well-known zero-flux state in the Heisenberg limit, which is stable with respect to small Kitaev couplings and develops 120∘ order in the semiclassical limit at large S . In the opposite Kitaev limit, we find a different spin liquid ground state, which is a quantum disordered version of a magnetically ordered state with antiferromagnetic chains, in accordance with results in the classical limit. Finally, at intermediate couplings, we find a spin liquid state with unusual spin correlations. Upon spinon condensation, this state develops Bragg peaks at incommensurate momenta in close analogy to the magnetically ordered Z2 vortex crystal phase, which has been analyzed in recent theoretical works.

  15. Generalized isotropic Lipkin-Meshkov-Glick models: ground state entanglement and quantum entropies

    Science.gov (United States)

    Carrasco, José A.; Finkel, Federico; González-López, Artemio; Rodríguez, Miguel A.; Tempesta, Piergiulio

    2016-03-01

    We introduce a new class of generalized isotropic Lipkin-Meshkov-Glick models with \\text{su}(m+1) spin and long-range non-constant interactions, whose non-degenerate ground state is a Dicke state of \\text{su}(m+1) type. We evaluate in closed form the reduced density matrix of a block of L spins when the whole system is in its ground state, and study the corresponding von Neumann and Rényi entanglement entropies in the thermodynamic limit. We show that both of these entropies scale as alog L when L tends to infinity, where the coefficient a is equal to (m  -  k)/2 in the ground state phase with k vanishing \\text{su}(m+1) magnon densities. In particular, our results show that none of these generalized Lipkin-Meshkov-Glick models are critical, since when L\\to ∞ their Rényi entropy R q becomes independent of the parameter q. We have also computed the Tsallis entanglement entropy of the ground state of these generalized \\text{su}(m+1) Lipkin-Meshkov-Glick models, finding that it can be made extensive by an appropriate choice of its parameter only when m-k≥slant 3 . Finally, in the \\text{su}(3) case we construct in detail the phase diagram of the ground state in parameter space, showing that it is determined in a simple way by the weights of the fundamental representation of \\text{su}(3) . This is also true in the \\text{su}(m+1) case; for instance, we prove that the region for which all the magnon densities are non-vanishing is an (m  +  1)-simplex in {{{R}}m} whose vertices are the weights of the fundamental representation of \\text{su}(m+1) .

  16. Observation of a kilogram-scale oscillator near its quantum ground state

    Science.gov (United States)

    Abbott, B.; Abbott, R.; Adhikari, R.; Ajith, P.; Allen, B.; Allen, G.; Amin, R.; Anderson, S. B.; Anderson, W. G.; Arain, M. A.; Araya, M.; Armandula, H.; Armor, P.; Aso, Y.; Aston, S.; Aufmuth, P.; Aulbert, C.; Babak, S.; Ballmer, S.; Bantilan, H.; Barish, B. C.; Barker, C.; Barker, D.; Barr, B.; Barriga, P.; Barton, M. A.; Bastarrika, M.; Bayer, K.; Betzwieser, J.; Beyersdorf, P. T.; Bilenko, I. A.; Billingsley, G.; Biswas, R.; Black, E.; Blackburn, K.; Blackburn, L.; Blair, D.; Bland, B.; Bodiya, T. P.; Bogue, L.; Bork, R.; Boschi, V.; Bose, S.; Brady, P. R.; Braginsky, V. B.; Brau, J. E.; Brinkmann, M.; Brooks, A.; Brown, D. A.; Brunet, G.; Bullington, A.; Buonanno, A.; Burmeister, O.; Byer, R. L.; Cadonati, L.; Cagnoli, G.; Camp, J. B.; Cannizzo, J.; Cannon, K.; Cao, J.; Cardenas, L.; Casebolt, T.; Castaldi, G.; Cepeda, C.; Chalkley, E.; Charlton, P.; Chatterji, S.; Chelkowski, S.; Chen, Y.; Christensen, N.; Clark, D.; Clark, J.; Cokelaer, T.; Conte, R.; Cook, D.; Corbitt, T.; Coyne, D.; Creighton, J. D. E.; Cumming, A.; Cunningham, L.; Cutler, R. M.; Dalrymple, J.; Danilishin, S.; Danzmann, K.; Davies, G.; DeBra, D.; Degallaix, J.; Degree, M.; Dergachev, V.; Desai, S.; DeSalvo, R.; Dhurandhar, S.; Díaz, M.; Dickson, J.; Dietz, A.; Donovan, F.; Dooley, K. L.; Doomes, E. E.; Drever, R. W. P.; Duke, I.; Dumas, J.-C.; Dupuis, R. J.; Dwyer, J. G.; Echols, C.; Effler, A.; Ehrens, P.; Espinoza, E.; Etzel, T.; Evans, T.; Fairhurst, S.; Fan, Y.; Fazi, D.; Fehrmann, H.; Fejer, M. M.; Finn, L. S.; Flasch, K.; Fotopoulos, N.; Freise, A.; Frey, R.; Fricke, T.; Fritschel, P.; Frolov, V. V.; Fyffe, M.; Garofoli, J.; Gholami, I.; Giaime, J. A.; Giampanis, S.; Giardina, K. D.; Goda, K.; Goetz, E.; Goggin, L.; González, G.; Gossler, S.; Gouaty, R.; Grant, A.; Gras, S.; Gray, C.; Gray, M.; Greenhalgh, R. J. S.; Gretarsson, A. M.; Grimaldi, F.; Grosso, R.; Grote, H.; Grunewald, S.; Guenther, M.; Gustafson, E. K.; Gustafson, R.; Hage, B.; Hallam, J. M.; Hammer, D.; Hanna, C.; Hanson, J.; Harms, J.; Harry, G.; Harstad, E.; Hayama, K.; Hayler, T.; Heefner, J.; Heng, I. S.; Hennessy, M.; Heptonstall, A.; Hewitson, M.; Hild, S.; Hirose, E.; Hoak, D.; Hosken, D.; Hough, J.; Huttner, S. H.; Ingram, D.; Ito, M.; Ivanov, A.; Johnson, B.; Johnson, W. W.; Jones, D. I.; Jones, G.; Jones, R.; Ju, L.; Kalmus, P.; Kalogera, V.; Kamat, S.; Kanner, J.; Kasprzyk, D.; Katsavounidis, E.; Kawabe, K.; Kawamura, S.; Kawazoe, F.; Kells, W.; Keppel, D. G.; Khalili, F. Ya; Khan, R.; Khazanov, E.; Kim, C.; King, P.; Kissel, J. S.; Klimenko, S.; Kokeyama, K.; Kondrashov, V.; Kopparapu, R. K.; Kozak, D.; Kozhevatov, I.; Krishnan, B.; Kwee, P.; Lam, P. K.; Landry, M.; Lang, M. M.; Lantz, B.; Lazzarini, A.; Lei, M.; Leindecker, N.; Leonhardt, V.; Leonor, I.; Libbrecht, K.; Lin, H.; Lindquist, P.; Lockerbie, N. A.; Lodhia, D.; Lormand, M.; Lu, P.; Lubinski, M.; Lucianetti, A.; Lück, H.; Machenschalk, B.; MacInnis, M.; Mageswaran, M.; Mailand, K.; Mandic, V.; Márka, S.; Márka, Z.; Markosyan, A.; Markowitz, J.; Maros, E.; Martin, I.; Martin, R. M.; Marx, J. N.; Mason, K.; Matichard, F.; Matone, L.; Matzner, R.; Mavalvala, N.; McCarthy, R.; McClelland, D. E.; McGuire, S. C.; McHugh, M.; McIntyre, G.; McIvor, G.; McKechan, D.; McKenzie, K.; Meier, T.; Melissinos, A.; Mendell, G.; Mercer, R. A.; Meshkov, S.; Messenger, C. J.; Meyers, D.; Miao, H.; Miller, J.; Minelli, J.; Mitra, S.; Mitrofanov, V. P.; Mitselmakher, G.; Mittleman, R.; Miyakawa, O.; Moe, B.; Mohanty, S.; Moreno, G.; Mossavi, K.; Mow-Lowry, C.; Mueller, G.; Mukherjee, S.; Mukhopadhyay, H.; Müller-Ebhardt, H.; Munch, J.; Murray, P.; Myers, E.; Myers, J.; Nash, T.; Nelson, J.; Newton, G.; Nishizawa, A.; Numata, K.; O'Dell, J.; Ogin, G.; O'Reilly, B.; O'Shaughnessy, R.; Ottaway, D. J.; Ottens, R. S.; Overmier, H.; Owen, B. J.; Pan, Y.; Pankow, C.; Papa, M. A.; Parameshwaraiah, V.; Patel, P.; Pedraza, M.; Penn, S.; Perreca, A.; Petrie, T.; Pinto, I. M.; Pitkin, M.; Pletsch, H. J.; Plissi, M. V.; Postiglione, F.; Principe, M.; Prix, R.; Quetschke, V.; Raab, F.; Rabeling, D. S.; Radkins, H.; Rainer, N.; Rakhmanov, M.; Ramsunder, M.; Rehbein, H.; Reid, S.; Reitze, D. H.; Riesen, R.; Riles, K.; Rivera, B.; Robertson, N. A.; Robinson, C.; Robinson, E. L.; Roddy, S.; Rodriguez, A.; Rogan, A. M.; Rollins, J.; Romano, J. D.; Romie, J.; Route, R.; Rowan, S.; Rüdiger, A.; Ruet, L.; Russell, P.; Ryan, K.; Sakata, S.; Samidi, M.; Sancho de la Jordana, L.; Sandberg, V.; Sannibale, V.; Saraf, S.; Sarin, P.; Sathyaprakash, B. S.; Sato, S.; Saulson, P. R.; Savage, R.; Savov, P.; Schediwy, S. W.; Schilling, R.; Schnabel, R.; Schofield, R.; Schutz, B. F.; Schwinberg, P.; Scott, S. M.; Searle, A. C.; Sears, B.; Seifert, F.; Sellers, D.; Sengupta, A. S.; Shawhan, P.; Shoemaker, D. H.; Sibley, A.; Siemens, X.; Sigg, D.; Sinha, S.

    2009-07-01

    We introduce a novel cooling technique capable of approaching the quantum ground state of a kilogram-scale system—an interferometric gravitational wave detector. The detectors of the Laser Interferometer Gravitational-wave Observatory (LIGO) operate within a factor of 10 of the standard quantum limit (SQL), providing a displacement sensitivity of 10-18 m in a 100 Hz band centered on 150 Hz. With a new feedback strategy, we dynamically shift the resonant frequency of a 2.7 kg pendulum mode to lie within this optimal band, where its effective temperature falls as low as 1.4 μK, and its occupation number reaches about 200 quanta. This work shows how the exquisite sensitivity necessary to detect gravitational waves can be made available to probe the validity of quantum mechanics on an enormous mass scale.

  17. Ground-state isolation and discrete flows in a rationally extended quantum harmonic oscillator

    CERN Document Server

    Cariñena, José F

    2016-01-01

    Ladder operators for the simplest version of a rationally extended quantum harmonic oscillator (REQHO) are constructed by applying a Darboux transformation to the quantum harmonic oscillator system. It is shown that the physical spectrum of the REQHO carries a direct sum of a trivial and an infinite-dimensional irreducible representation of the polynomially deformed bosonized osp(1|2) superalgebra. In correspondence with this the ground state of the system is isolated from other physical states but can be reached by ladder operators via non-physical energy eigenstates, which belong to either an infinite chain of similar eigenstates or to the chains with generalized Jordan states. We show that the discrete chains of the states generated by ladder operators and associated with physical energy levels include six basic generalized Jordan states, in comparison with the two basic Jordan states entering in analogous discrete chains for the quantum harmonic oscillator.

  18. Ground state energy of excitons in quantum dot treated variationally via Hylleraas-like wavefunction

    Institute of Scientific and Technical Information of China (English)

    S.(S)akiro(g)lu; (U). Do(g)an; A. Yildlz; K. Akgüng(o)r; H. Epik; Y. Ergün; H. San; (I).S(o)kmen

    2009-01-01

    In this work,the effects of quantum confinement on the ground state energy of a correlated electron-hole pair in a spherical and in a disc-like quantum dot have been investigated as a function of quantum dot size.Under parabolic confinement potential and within effective mass approximation Ritz's variational method is applied to Hylleraas-like trial wavefunction.An efficient method for reducing the main effort of the calculation of terms like rkeh exp(-λreh)is introduced.The main contribution of the present work is the introduction of integral transforms which provide the calculation of expectation value of energy and the related matrix elements to be done analytically over single-particle coordinates instead of Hylleraas coordinates.

  19. Structure of Ground state Wave Functions for the Fractional Quantum Hall Effect: A Variational Approach

    Science.gov (United States)

    Mukherjee, Sutirtha; Mandal, Sudhansu

    The internal structure and topology of the ground states for fractional quantum Hall effect (FQHE) are determined by the relative angular momenta between all the possible pairs of electrons. Laughlin wave function is the only known microscopic wave function for which these relative angular momenta are homogeneous (same) for any pair of electrons and depend solely on the filling factor. Without invoking any microscopic theory, considering only the relationship between number of flux quanta and particles in spherical geometry, and allowing the possibility of inhomogeneous (different) relative angular momenta between any two electrons, we develop a general method for determining a closed-form ground state wave function for any incompressible FQHE state. Our procedure provides variationally obtained very accurate wave functions, yet having simpler structure compared to any other known complex microscopic wave functions for the FQHE states. This method, thus, has potential in predicting a very accurate ground state wave function for the puzzling states such as the state at filling fraction 5/2. We acknowledge support from Department of Science and Technology, India.

  20. Ab initio optimization principle for the ground states of translationally invariant strongly correlated quantum lattice models

    Science.gov (United States)

    Ran, Shi-Ju

    2016-05-01

    In this work, a simple and fundamental numeric scheme dubbed as ab initio optimization principle (AOP) is proposed for the ground states of translational invariant strongly correlated quantum lattice models. The idea is to transform a nondeterministic-polynomial-hard ground-state simulation with infinite degrees of freedom into a single optimization problem of a local function with finite number of physical and ancillary degrees of freedom. This work contributes mainly in the following aspects: (1) AOP provides a simple and efficient scheme to simulate the ground state by solving a local optimization problem. Its solution contains two kinds of boundary states, one of which play the role of the entanglement bath that mimics the interactions between a supercell and the infinite environment, and the other gives the ground state in a tensor network (TN) form. (2) In the sense of TN, a novel decomposition named as tensor ring decomposition (TRD) is proposed to implement AOP. Instead of following the contraction-truncation scheme used by many existing TN-based algorithms, TRD solves the contraction of a uniform TN in an opposite way by encoding the contraction in a set of self-consistent equations that automatically reconstruct the whole TN, making the simulation simple and unified; (3) AOP inherits and develops the ideas of different well-established methods, including the density matrix renormalization group (DMRG), infinite time-evolving block decimation (iTEBD), network contractor dynamics, density matrix embedding theory, etc., providing a unified perspective that is previously missing in this fields. (4) AOP as well as TRD give novel implications to existing TN-based algorithms: A modified iTEBD is suggested and the two-dimensional (2D) AOP is argued to be an intrinsic 2D extension of DMRG that is based on infinite projected entangled pair state. This paper is focused on one-dimensional quantum models to present AOP. The benchmark is given on a transverse Ising

  1. Geometrical criteria versus quantum chemical criteria for assessment of intramolecular hydrogen bond (IMHB) interaction: A computational comparison into the effect of chlorine substitution on IMHB of salicylic acid in its lowest energy ground state conformer

    Energy Technology Data Exchange (ETDEWEB)

    Paul, Bijan Kumar [Department of Chemistry, University of Calcutta, 92 A.P.C. Road, Calcutta 700009 (India); Guchhait, Nikhil, E-mail: nikhil.guchhait@rediffmail.com [Department of Chemistry, University of Calcutta, 92 A.P.C. Road, Calcutta 700009 (India)

    2013-02-01

    Highlights: ► Intramolecular hydrogen bonding (IMHB) in salicylic acid and its chloro derivatives. ► A complex effect of +R and −I effect of chlorine substituents on IMHB energy. ► Interplay between IMHB energy and aromaticity. ► Directional nature of IMHB from quantum chemical assessment. ► Quantum chemical treatment vs. geometrical criteria to assess weak interaction. - Abstract: Density functional theory based computational study has been performed to characterize intramolecular hydrogen bonding (IMHB) interaction in a series of salicylic acid derivatives varying in chlorine substitution on the benzene ring. The molecular systems studied are salicylic acid, 5-chlorosalicylic acid, 3,5-dichlorosalicylic acid and 3,5,6-tricholorosalicylic acid. Major emphasis is rendered on the analysis of IMHB interaction by calculation of electron density ρ(r) and Laplacian ∇{sup 2}ρ(r) at the bond critical point using atoms-in-molecule theory. Topological features, energy densities based on ρ(r) through perturbing the intramolecular H-bond distances suggest that at equilibrium geometry the IMHB interaction develops certain characteristics typical of covalent interaction. The interplay between aromaticity and resonance-assisted hydrogen bonding (RAHB) is discussed using both geometrical and magnetic criteria as the descriptors of aromaticity. The optimized geometry features, molecular electrostatic potential map analysis are also found to produce a consensus view in relation with the formation of RAHB in these systems.

  2. Breakdown of the Bardeen-Cooper-Schrieffer ground state at a quantum phase transtion.

    Energy Technology Data Exchange (ETDEWEB)

    Jaramillo, R.; Feng, Y.; Lang, J. C.; Islam, Z.; Srajer, G.; Littlewood, P. B.; Mc Whan, D. B.; Rosenbaum, T. F.; Univ. of Chicago; Univ. of Cambridge; Massachusetts Innst. of Tech.

    2009-05-21

    Advances in solid-state and atomic physics are exposing the hidden relationships between conventional and exotic states of quantum matter. Prominent examples include the discovery of exotic superconductivity proximate to conventional spin and charge order, and the crossover from long-range phase order to preformed pairs achieved in gases of cold fermions and inferred for copper oxide superconductors. The unifying theme is that incompatible ground states can be connected by quantum phase transitions. Quantum fluctuations about the transition are manifestations of the competition between qualitatively distinct organizing principles, such as a long-wavelength density wave and a short-coherence-length condensate. They may even give rise to 'protected' phases, like fluctuation-mediated superconductivity that survives only in the vicinity of an antiferromagnetic quantum critical point. However, few model systems that demonstrate continuous quantum phase transitions have been identified, and the complex nature of many systems of interest hinders efforts to more fully understand correlations and fluctuations near a zero-temperature instability. Here we report the suppression of magnetism by hydrostatic pressure in elemental chromium, a simple cubic metal that demonstrates a subtle form of itinerant antiferromagnetism formally equivalent to the Bardeen-Cooper-Schrieffer (BCS) state in conventional superconductors. By directly measuring the associated charge order in a diamond anvil cell at low temperatures, we find a phase transition at pressures of 10 GPa driven by fluctuations that destroy the BCS-like state but preserve the strong magnetic interaction between itinerant electrons and holes. Chromium is unique among stoichiometric magnetic metals studied so far in that the quantum phase transition is continuous, allowing experimental access to the quantum singularity and a direct probe of the competition between conventional and exotic order in a theoretically

  3. Degenerate ground states and multiple bifurcations in a two-dimensional q-state quantum Potts model.

    Science.gov (United States)

    Dai, Yan-Wei; Cho, Sam Young; Batchelor, Murray T; Zhou, Huan-Qiang

    2014-06-01

    We numerically investigate the two-dimensional q-state quantum Potts model on the infinite square lattice by using the infinite projected entangled-pair state (iPEPS) algorithm. We show that the quantum fidelity, defined as an overlap measurement between an arbitrary reference state and the iPEPS ground state of the system, can detect q-fold degenerate ground states for the Z_{q} broken-symmetry phase. Accordingly, a multiple bifurcation of the quantum ground-state fidelity is shown to occur as the transverse magnetic field varies from the symmetry phase to the broken-symmetry phase, which means that a multiple-bifurcation point corresponds to a critical point. A (dis)continuous behavior of quantum fidelity at phase transition points characterizes a (dis)continuous phase transition. Similar to the characteristic behavior of the quantum fidelity, the magnetizations, as order parameters, obtained from the degenerate ground states exhibit multiple bifurcation at critical points. Each order parameter is also explicitly demonstrated to transform under the Z_{q} subgroup of the symmetry group of the Hamiltonian. We find that the q-state quantum Potts model on the square lattice undergoes a discontinuous (first-order) phase transition for q=3 and q=4 and a continuous phase transition for q=2 (the two-dimensional quantum transverse Ising model).

  4. T ransition of the True Ground State in a Coupled Three-Layer Quantum Dot

    Institute of Scientific and Technical Information of China (English)

    张战军; 李白文; 饶建国; 鲍诚光

    2002-01-01

    Low lying states of a vertically coupled three-layer quantum-dot system are studied. Each layer contains oneelectron, and the tunnelling of electrons between layers is neglected. Effects of the interlayer separation d and theexternal magnetic field B are evaluated by numerical calculations. In the strong coupling case (i.e. d is small),as in a single dot, transitions of the angular momentum L of the true ground states occur when B increases,whereas in the weak coupling case the transition does not occur and L remains zero. Furthermore, it is foundthat the variation of d may also induce the L transition. As a result, a phase diagram of L of the true groundstate is given in the d - B plane.

  5. A deterministic projector configuration interaction approach for the ground state of quantum many-body systems

    CERN Document Server

    Zhang, Tianyuan

    2016-01-01

    In this work we propose a novel approach to solve the Schr\\"{o}dinger equation which combines projection onto the ground state with a path-filtering truncation scheme. The resulting projector configuration interaction (PCI) approach realizes a deterministic version of the full configuration interaction quantum Monte Carlo (FCIQMC) method [Booth, G. H.; Thom, A. J. W.; Alavi, A. J. Chem. Phys. 2009, 131, 054106]. To improve upon the linearized imaginary-time propagator, we develop an optimal projector scheme based on an exponential Chebyshev expansion in the limit of an infinite imaginary time step. After writing the exact projector as a path integral in determinant space, we introduce a path filtering procedure that truncates the size of the determinantal basis and approximates the Hamiltonian. The path filtering procedure is controlled by one real threshold that determines the accuracy of the PCI energy and is not biased towards any determinant. Therefore, the PCI approach can equally well describe static an...

  6. Exponentially-Biased Ground-State Sampling of Quantum Annealing Machines with Transverse-Field Driving Hamiltonians

    CERN Document Server

    Mandrà, Salvatore; Katzgraber, Helmut G

    2016-01-01

    We study the performance of the D-Wave 2X quantum annealing machine on systems with well-controlled ground-state degeneracy. While obtaining the ground-state of a spin-glass benchmark instance represents a difficult task, the gold standard for any optimization algorithm or machine is to sample all solutions that minimize the Hamiltonian with more or less equal probability. Our results show that while naive transverse-field quantum annealing on the D-Wave 2X device can find the ground-state energy of the problems, it is not well suited in identifying all degenerate ground-state configurations associated to a particular instance. Even worse, some states are exponentially suppressed, in agreement with previous studies on toy model problems [New J. Phys. 11, 073021 (2009)]. These results suggest that more complex driving Hamiltonians, which introduce transitions between all states with equal weights, are needed in future quantum annealing machines to ensure a fair sampling of the ground-state manifold.

  7. Quantum Computers

    Science.gov (United States)

    2010-03-04

    efficient or less costly than their classical counterparts. A large-scale quantum computer is certainly an extremely ambi- tious goal, appearing to us...outperform the largest classical supercomputers in solving some specific problems important for data encryption. In the long term, another application...which the quantum computer depends, causing the quantum mechanically destructive process known as decoherence . Decoherence comes in several forms

  8. Ab initio quantum Monte Carlo calculations of ground-state properties of manganese's oxides

    Science.gov (United States)

    Sharma, Vinit; Krogel, Jaron T.; Kent, P. R. C.; Reboredo, Fernando A.

    One of the critical scientific challenges of contemporary research is to obtain an accurate theoretical description of the electronic properties of strongly correlated systems such as transition metal oxides and rare-earth compounds, since state-of-art ab-initio methods based on approximate density functionals are not always sufficiently accurate. Quantum Monte Carlo (QMC) methods, which use statistical sampling to evaluate many-body wave functions, have the potential to answer this challenge. Owing to the few fundamental approximations made and the direct treatment of electron correlation, QMC methods are among the most accurate electronic structure methods available to date. We assess the accuracy of the diffusion Monte Carlo method in the case of rocksalt manganese oxide (MnO). We study the electronic properties of this strongly-correlated oxide, which has been identified as a suitable candidate for many applications ranging from catalysts to electronic devices. ``This work was supported by the U.S. Department of Energy, Office of Science, Basic Energy Sciences, Materials Sciences and Engineering Division.'' Ab initio quantum Monte Carlo calculations of ground-state properties of manganese's oxides.

  9. EFFECT OF DIELECTRIC CONSTANT ON THE EXCITON GROUND STATE ENERGY OF CdSe QUANTUM DOTS

    Institute of Scientific and Technical Information of China (English)

    HUI PING

    2000-01-01

    The B-spline technique is used in the calculation of the exciton ground state energy based on the effective mass approximation (EMA) model.The exciton is confined in CdSe microspherical crystallites with a finite-height potential wall (dots).In this approach,(a) the wave function is allowed to penetrate to the outside of the dots; (b) the dielectric constants of the quantum dot and the surrounding material are considered to be different; and (c) the dielectric constant of the dots are size-dependent.The exciton energies as functions of radii of the dots in the range 0.5-3.5nm are calculated and compared with experimental and previous theoretical data.The results show that: (1) The exciton energy is convergent as the radius of the dot becomes very small.(2) A good agreement with the experimental data better than other theoretical results is achieved.(3) The penetration (or leaking) of the wave function and the difference of the dielectric constants in different regions are necessary for correcting the Coulomb interaction energy and reproducing experimental data.(4) The EMA model with B-spline technique can describe the status of excition confined in quantum dot very well.

  10. Real-Code Genetic Algorithm for Ground State Energies of Hydrogenic Donors in GaAs-(Ga,Al)As Quantum Dots

    Institute of Scientific and Technical Information of China (English)

    YAN Hai-Qing; TANG Chen; LIU Ming; ZHANG Hao

    2005-01-01

    We present a global optimization method, called the real-code genetic algorithm (RGA), to the ground state energies. The proposed method does not require partial derivatives with respect to each variational parameter or solving an eigenequation, so the present method overcomes the major difficulties of the variational method. RGAs also do not require coding and encoding procedures, so the computation time and complexity are reduced. The ground state energies of hydrogenic donors in GaAs-(Ga,Al)As quantum dots have been calculated for a range of the radius of the quantum dot radii of practical interest. They are compared with those obtained by the variational method. The results obtained demonstrate the proposed method is simple, accurate, and easy implement.

  11. Retrieving the ground state of spin glasses using thermal noise: Performance of quantum annealing at finite temperatures

    Science.gov (United States)

    Nishimura, Kohji; Nishimori, Hidetoshi; Ochoa, Andrew J.; Katzgraber, Helmut G.

    2016-09-01

    We study the problem to infer the ground state of a spin-glass Hamiltonian using data from another Hamiltonian with interactions disturbed by noise from the original Hamiltonian, motivated by the ground-state inference in quantum annealing on a noisy device. It is shown that the average Hamming distance between the inferred spin configuration and the true ground state is minimized when the temperature of the noisy system is kept at a finite value, and not at zero temperature. We present a spin-glass generalization of a well-established result that the ground state of a purely ferromagnetic Hamiltonian is best inferred at a finite temperature in the sense of smallest Hamming distance when the original ferromagnetic interactions are disturbed by noise. We use the numerical transfer-matrix method to establish the existence of an optimal finite temperature in one- and two-dimensional systems. Our numerical results are supported by mean-field calculations, which give an explicit expression of the optimal temperature to infer the spin-glass ground state as a function of variances of the distributions of the original interactions and the noise. The mean-field prediction is in qualitative agreement with numerical data. Implications on postprocessing of quantum annealing on a noisy device are discussed.

  12. A quantum Monte Carlo study of the ground state chromium dimer

    CERN Document Server

    Hongo, Kenta

    2011-01-01

    We report variational and diffusion quantum Monte Carlo (VMC and DMC) studies of the binding curve of the ground-state chromium dimer. We employed various single determinant (SD) or multi-determinant (MD) wavefunctions multiplied by a Jastrow fuctor as a trial/guiding wavefunction. The molecular orbitals (MOs) in the SD were calculated using restricted or unrestricted Hartree-Fock or density functional theory (DFT) calculations where five commonly-used local (SVWN5), semi-local (PW91PW91 and BLYP), and hybrid (B1LYP and B3LYP) functionals were examined. The MD expansions were obtained from the complete-active space SCF, generalized valence bond, and unrestricted configuration interaction methods. We also adopted the UB3LYP-MOs to construct the MD expansion (UB3LYP-MD) and optimized their coefficients at the VMC level. In addition to the wavefunction dependence, we investigated the time-step bias in the DMC calculation and the effects of pseudopotentials and backflow transformation for the UB3LYP-SD case. Some...

  13. Classical probability density distributions with uncertainty relations for ground states of simple non-relativistic quantum-mechanical systems

    Science.gov (United States)

    Radożycki, Tomasz

    2016-11-01

    The probability density distributions for the ground states of certain model systems in quantum mechanics and for their classical counterparts are considered. It is shown, that classical distributions are remarkably improved by incorporating into them the Heisenberg uncertainty relation between position and momentum. Even the crude form of this incorporation makes the agreement between classical and quantum distributions unexpectedly good, except for the small area, where classical momenta are large. It is demonstrated that the slight improvement of this form, makes the classical distribution very similar to the quantum one in the whole space. The obtained results are much better than those from the WKB method. The paper is devoted to ground states, but the method applies to excited states too.

  14. Quench dynamics and ground state fidelity of the one-dimensional extended quantum compass model in a transverse field

    Science.gov (United States)

    Jafari, R.

    2016-05-01

    We study the ground state fidelity, fidelity susceptibility, and quench dynamics of the extended quantum compass model in a transverse field. This model reveals a rich phase diagram which includes several critical surfaces depending on exchange couplings. We present a characterization of quantum phase transitions in terms of the ground state fidelity between two ground states obtained for two different values of external parameters. We also derive scaling relations describing the singular behavior of the fidelity susceptibility in the quantum critical surfaces. Moreover, we study the time evolution of the system after a critical quantum quench using the Loschmidt echo (LE). We find that the revival times of LE are given by {T}{rev}=N/2{v}{max}, where N is the size of the system and v max is the maximum of the lower bound group velocity of quasi-particles. Although the fidelity susceptibility shows the same exponent in all critical surfaces, the structure of the revivals after critical quantum quenches displays two different regimes reflecting different equilibration dynamics.

  15. Quantum computers.

    Science.gov (United States)

    Ladd, T D; Jelezko, F; Laflamme, R; Nakamura, Y; Monroe, C; O'Brien, J L

    2010-03-04

    Over the past several decades, quantum information science has emerged to seek answers to the question: can we gain some advantage by storing, transmitting and processing information encoded in systems that exhibit unique quantum properties? Today it is understood that the answer is yes, and many research groups around the world are working towards the highly ambitious technological goal of building a quantum computer, which would dramatically improve computational power for particular tasks. A number of physical systems, spanning much of modern physics, are being developed for quantum computation. However, it remains unclear which technology, if any, will ultimately prove successful. Here we describe the latest developments for each of the leading approaches and explain the major challenges for the future.

  16. Geometrical criteria versus quantum chemical criteria for assessment of intramolecular hydrogen bond (IMHB) interaction: A computational comparison into the effect of chlorine substitution on IMHB of salicylic acid in its lowest energy ground state conformer

    Science.gov (United States)

    Paul, Bijan Kumar; Guchhait, Nikhil

    2013-02-01

    Density functional theory based computational study has been performed to characterize intramolecular hydrogen bonding (IMHB) interaction in a series of salicylic acid derivatives varying in chlorine substitution on the benzene ring. The molecular systems studied are salicylic acid, 5-chlorosalicylic acid, 3,5-dichlorosalicylic acid and 3,5,6-tricholorosalicylic acid. Major emphasis is rendered on the analysis of IMHB interaction by calculation of electron density ρ(r) and Laplacian ∇2ρ(r) at the bond critical point using atoms-in-molecule theory. Topological features, energy densities based on ρ(r) through perturbing the intramolecular H-bond distances suggest that at equilibrium geometry the IMHB interaction develops certain characteristics typical of covalent interaction. The interplay between aromaticity and resonance-assisted hydrogen bonding (RAHB) is discussed using both geometrical and magnetic criteria as the descriptors of aromaticity. The optimized geometry features, molecular electrostatic potential map analysis are also found to produce a consensus view in relation with the formation of RAHB in these systems.

  17. Unravelling the quantum-entanglement effect of noble gas coordination on the spin ground state of CUO

    CERN Document Server

    Tecmer, Pawel; Legeza, Ors; Reiher, Markus

    2013-01-01

    The accurate description of the complexation of the CUO molecule by Ne and Ar noble gas matrices represents a challenging task for present-day quantum chemistry. Especially, the accurate prediction of the spin ground state of different CUO--noble-gas complexes remains elusive. In this work, the interaction of the CUO unit with the surrounding noble gas matrices is investigated in terms of complexation energies and dissected into its molecular orbital quantum entanglement patterns. Our analysis elucidates the anticipated singlet--triplet ground-state reversal of the CUO molecule diluted in different noble gas matrices and demonstrates that the strongest uranium-noble gas interaction is found for CUOAr4 in its triplet configuration.

  18. Quantum annealing search of Ising spin glass ground state(s) with tunable transverse and longitudinal fields

    Science.gov (United States)

    Rajak, A.; Chakrabarti, B. K.

    2014-09-01

    Here we first discuss briefly the quantum annealing technique. We then study the quantum annealing of Sherrington-Kirkpatrick spin glass model with the tuning of both transverse and longitudinal fields. Both the fields are time-dependent and vanish adiabatically at the same time, starting from high values. We solve, for rather small systems, the time-dependent Schrodinger equation of the total Hamiltonian by employing a numerical technique. At the end of annealing we obtain the final state having high overlap with the exact ground state(s) of classical spin glass system (obtained independently).

  19. Simulated Quantum Computation of Molecular Energies

    CERN Document Server

    Aspuru-Guzik, A; Love, P J; Head-Gordon, M; Aspuru-Guzik, Al\\'an; Dutoi, Anthony D.; Love, Peter J.; Head-Gordon, Martin

    2005-01-01

    The calculation time for the energy of atoms and molecules scales exponentially with system size on a classical computer but polynomially using quantum algorithms. We demonstrate that such algorithms can be applied to problems of chemical interest using modest numbers of quantum bits. Calculations of the water and lithium hydride molecular ground-state energies have been carried out on a quantum computer simulator using a recursive phase-estimation algorithm. The recursive algorithm reduces the number of quantum bits required for the readout register from about 20 to 4. Mappings of the molecular wave function to the quantum bits are described. An adiabatic method for the preparation of a good approximate ground-state wave function is described and demonstrated for a stretched hydrogen molecule. The number of quantum bits required scales linearly with the number of basis functions, and the number of gates required grows polynomially with the number of quantum bits.

  20. Numerical methods for computing the ground state of spin-1 Bose-Einstein condensates in a uniform magnetic field.

    Science.gov (United States)

    Lim, Fong Yin; Bao, Weizhu

    2008-12-01

    We propose efficient and accurate numerical methods for computing the ground-state solution of spin-1 Bose-Einstein condensates subjected to a uniform magnetic field. The key idea in designing the numerical method is based on the normalized gradient flow with the introduction of a third normalization condition, together with two physical constraints on the conservation of total mass and conservation of total magnetization. Different treatments of the Zeeman energy terms are found to yield different numerical accuracies and stabilities. Numerical comparison between different numerical schemes is made, and the best scheme is identified. The numerical scheme is then applied to compute the condensate ground state in a harmonic plus optical lattice potential, and the effect of the periodic potential, in particular to the relative population of each hyperfine component, is investigated through comparison to the condensate ground state in a pure harmonic trap.

  1. Effect of Rasbha spin-orbit interaction on the ground state energy of a hydrogenic D{sup 0} complex in a Gaussian quantum dot

    Energy Technology Data Exchange (ETDEWEB)

    Boda, Aalu, E-mail: aaluphd@gmail.com; Kumar, D. Sanjeev; Chatterjee, Ashok [School of Physics, University of Hyderabad, Hyderabad-500046, Telangana (India); Mukhopadhyay, Soma [Department of Physics, DVR College of Engineering and Technology, Sangareddy Mandal, Hyderabad 502285 (India)

    2015-06-24

    The ground state energy of a hydrogenic D{sup 0} complex trapped in a three-dimensional GaAs quantum dot with Gaussian confinement is calculated variationally incorporating the effect of Rashba spin-orbit interaction. The results are obtained as a function of the quantum dot size and the Rashba spin-orbit interaction. The results show that the Rashba interaction reduces the ground state energy of the system.

  2. A new quantum gas apparatus for ultracold mixtures of K and Cs and KCs ground-state molecules

    Science.gov (United States)

    Gröbner, M.; Weinmann, P.; Meinert, F.; Lauber, K.; Kirilov, E.; Nägerl, H.-C.

    2016-10-01

    We present a new quantum gas apparatus for ultracold mixtures of K and Cs atoms and ultracold samples of KCs ground-state molecules. We demonstrate the apparatus' capabilities by producing Bose-Einstein condensates of ? and ? in a manner that will eventually allow sequential condensation within one experimental cycle, precise sample overlap and magnetic association of atoms into KCs molecules. The condensates are created independently without relying on sympathetic cooling. Our approach is universal and applicable to other species combinations when the two species show dramatically different behavior in terms of loss mechanisms and post laser cooling temperatures, i.e. species combinations that make parallel generation of quantum degenerate samples challenging. We give an outlook over the next experiments involving e.g. sample mixing, molecule formation and transport into a science chamber for high-resolution spatial imaging of novel quantum-many body phases based on K-Cs.

  3. Frustrated Magnetism of Dipolar Molecules on a Square Optical Lattice: Prediction of a Quantum Paramagnetic Ground State

    Science.gov (United States)

    Zou, Haiyuan; Zhao, Erhai; Liu, W. Vincent

    2017-08-01

    Motivated by the experimental realization of quantum spin models of polar molecule KRb in optical lattices, we analyze the spin 1 /2 dipolar Heisenberg model with competing anisotropic, long-range exchange interactions. We show that, by tilting the orientation of dipoles using an external electric field, the dipolar spin system on square lattice comes close to a maximally frustrated region similar, but not identical, to that of the J1-J2 model. This provides a simple yet powerful route to potentially realize a quantum spin liquid without the need for a triangular or kagome lattice. The ground state phase diagrams obtained from Schwinger-boson and spin-wave theories consistently show a spin disordered region between the Néel, stripe, and spiral phase. The existence of a finite quantum paramagnetic region is further confirmed by an unbiased variational ansatz based on tensor network states and a tensor renormalization group.

  4. Ground State Spin Logic

    CERN Document Server

    Whitfield, J D; Biamonte, J D

    2012-01-01

    Designing and optimizing cost functions and energy landscapes is a problem encountered in many fields of science and engineering. These landscapes and cost functions can be embedded and annealed in experimentally controllable spin Hamiltonians. Using an approach based on group theory and symmetries, we examine the embedding of Boolean logic gates into the ground state subspace of such spin systems. We describe parameterized families of diagonal Hamiltonians and symmetry operations which preserve the ground state subspace encoding the truth tables of Boolean formulas. The ground state embeddings of adder circuits are used to illustrate how gates are combined and simplified using symmetry. Our work is relevant for experimental demonstrations of ground state embeddings found in both classical optimization as well as adiabatic quantum optimization.

  5. Quantum Computer Using Coupled Quantum Dot Molecules

    CERN Document Server

    Wu, N J; Natori, A; Yasunaga, H; Wu*, Nan-Jian

    1999-01-01

    We propose a method for implementation of a quantum computer using artificial molecules. The artificial molecule consists of two coupled quantum dots stacked along z direction and one single electron. One-qubit and two-qubit gates are constructed by one molecule and two coupled molecules, respectively.The ground state and the first excited state of the molecule are used to encode the |0> and |1> states of a qubit. The qubit is manipulated by a resonant electromagnetic wave that is applied directly to the qubit through a microstrip line. The coupling between two qubits in a quantum controlled NOT gate is switched on (off) by floating (grounding) the metal film electrodes. We study the operations of the gates by using a box-shaped quantum dot model and numerically solving a time-dependent Schridinger equation, and demonstrate that the quantum gates can perform the quantum computation. The operating speed of the gates is about one operation per 4ps. The reading operation of the output of the quantum computer can...

  6. Thermodynamic framework for the ground state of a simple quantum system

    Science.gov (United States)

    Souza, Andre M. C.; Nobre, Fernando D.

    2017-01-01

    The ground state of a two-level system (associated with probabilities p and 1 -p , respectively) defined by a general Hamiltonian H ̂=Ĥ0+λ V ̂ is studied. The simple case characterized by λ =0 , whose Hamiltonian Ĥ0 is represented by a diagonal matrix, is well established and solvable within Boltzmann-Gibbs statistical mechanics; in particular, it follows the third law of thermodynamics, presenting zero entropy (SBG=0 ) at zero temperature (T =0 ). Herein it is shown that the introduction of a perturbation λ V ̂ (λ >0 ) in the Hamiltonian may lead to a nontrivial ground state, characterized by an entropy S [p ] (with S [p ] ≠SBG[p ] ), if the Hermitian operator V ̂ is represented by a 2 ×2 matrix, defined by nonzero off-diagonal elements V12=V21=-z , where z is a real positive number. Hence, this new term in the Hamiltonian, presenting V12≠0 , may produce physically significant changes in the ground state, and especially, it allows for the introduction of an effective temperature θ (θ ∝λ z ), which is shown to be a parameter conjugated to the entropy S . Based on this, one introduces an infinitesimal heatlike quantity, δ Q =θ d S , leading to a consistent thermodynamic framework, and by proposing an infinitesimal form for the first law, a Carnot cycle and thermodynamic potentials are obtained. All results found are very similar to those of usual thermodynamics, through the identification T ↔θ , and particularly the form for the efficiency of the proposed Carnot Cycle. Moreover, S also follows a behavior typical of a third law, i.e., S →0 , when θ →0 .

  7. Ground-state properties of two-dimensional quantum fluid helium and hydrogen mixtures

    CERN Document Server

    Um, C I; Oh, H G

    1998-01-01

    Using a variational Jastrow wavefunction extended to include a three-body correlation function and a hypernetted chain scheme with the contributions of elementary diagrams, we analyze the ground-state energies and the structural properties of two-dimensional H- sup 4 He and H sub 2 - sup 4 He mixtures. The mixtures are in equilibrium at a lower density compared to a pure sup 4 He system because of the large zero-point energies of the hydrogen atom and molecule. We evaluate the lowering of the ground-state energies as a function of the impurity concentration and total density of mixtures. Comparing the result with boson sup 3 He- sup 4 He mixtures, we show that the shifts of energy mainly come from the difference of the zero-point energies of the impurities rather than from the interatomic potentials.We also analyze the enthalpies to study the miscibility and conclude that boson-boson mixtures are completely phase separated in their equilibria.

  8. Disordered ground states in a quantum frustrated spin chain with side chains

    Science.gov (United States)

    Takano, Ken'Ichi; Hida, Kazuo

    2008-04-01

    We study a frustrated mixed spin chain with side chains, where the spin species and the exchange interactions are spatially varied. A nonlinear σ model method is formulated for this model, and a phase diagram with two disordered spin-gap phases is obtained for typical cases. Among them, we examine the case with a main chain, which consists of an alternating array of spin-1 and spin- (1)/(2) sites, and side chains, each of which consists of a single spin- (1)/(2) site, in great detail. Based on numerical, perturbational, and variational approaches, we propose a singlet cluster solid picture for each phase, where the ground state is expressed as a tensor product of local singlet states.

  9. Quantum Computing for Quantum Chemistry

    Science.gov (United States)

    2010-09-01

    This three-year project consisted on the development and application of quantum computer algorithms for chemical applications. In particular, we developed algorithms for chemical reaction dynamics, electronic structure and protein folding. The first quantum computing for

  10. A full-dimensional quantum dynamical study of the vibrational ground state of $H_3O_2^-$ and its isotopomers

    CERN Document Server

    Yang, Yonggang

    2008-01-01

    We investigated the effect of deuteration on the vibrational ground state of the hydrated hydroxide anion using a nine-dimensional quantum dynamical model for the case of J=0. The propagation of the nuclear wave function has been performed with the multi-configuration time-dependent Hartree method which yielded zero-point energies for the normal and fully deuterated species in quantitative agreement with previous diffusion Monte Carlo calculations. According to the zero-point energy the isotopomers having the hydrogen atom in the bridging position are more stable by about 1 kJ/mol as compared to the deuterium case. This holds irrespective of the deuteration state of the two OH groups. We also report the secondary geometric H/D isotope effect on the O--O distance which amounts to an elongation of about 0.005 A for the symmetric isotopomers and 0.009 A in the asymmetric case. Finally, we explore the isotopomer sensitivity of the ground state tunneling splitting due to the torsional motion of the two OH groups.

  11. Quantum Computer Games: Quantum Minesweeper

    Science.gov (United States)

    Gordon, Michal; Gordon, Goren

    2010-01-01

    The computer game of quantum minesweeper is introduced as a quantum extension of the well-known classical minesweeper. Its main objective is to teach the unique concepts of quantum mechanics in a fun way. Quantum minesweeper demonstrates the effects of superposition, entanglement and their non-local characteristics. While in the classical…

  12. Quantum Computer Games: Quantum Minesweeper

    Science.gov (United States)

    Gordon, Michal; Gordon, Goren

    2010-01-01

    The computer game of quantum minesweeper is introduced as a quantum extension of the well-known classical minesweeper. Its main objective is to teach the unique concepts of quantum mechanics in a fun way. Quantum minesweeper demonstrates the effects of superposition, entanglement and their non-local characteristics. While in the classical…

  13. Unification of ground-state aromaticity criteria - structure, electron delocalization, and energy - in light of the quantum chemical topology.

    Science.gov (United States)

    Badri, Zahra; Foroutan-Nejad, Cina

    2016-04-28

    In the present account we investigate a theoretical link between the bond length, electron sharing, and bond energy within the context of quantum chemical topology theories. The aromatic stabilization energy, ASE, was estimated from this theoretical link without using isodesmic reactions for the first time. The ASE values obtained from our method show a meaningful correlation with the number of electrons contributing to the aromaticity. This theoretical link demonstrates that structural, electronic, and energetic criteria of aromaticity - ground-state aromaticity - belong to the same class and guarantees that they assess the same property as aromaticity. Theory suggests that interatomic exchange-correlation potential, obtained from the theory of Interacting Quantum Atoms (IQA), is linearly connected to the delocalization index of Quantum Theory of Atoms in Molecules (QTAIM) and the bond length through a first order approximation. Our study shows that the relationship between energy, structure and electron sharing marginally deviates from the ideal linear form expected from the first order approximation. The observed deviation from linearity was attributed to a different contribution of exchange-correlation to the bond energy for the σ- and π-frameworks. Finally, we proposed two-dimensional energy-structure-based aromaticity indices in analogy to the electron sharing indices of aromaticity.

  14. Auditory Power-Law Activation Avalanches Exhibit a Fundamental Computational Ground State

    Science.gov (United States)

    Stoop, Ruedi; Gomez, Florian

    2016-07-01

    The cochlea provides a biological information-processing paradigm that we are only beginning to understand in its full complexity. Our work reveals an interacting network of strongly nonlinear dynamical nodes, on which even a simple sound input triggers subnetworks of activated elements that follow power-law size statistics ("avalanches"). From dynamical systems theory, power-law size distributions relate to a fundamental ground state of biological information processing. Learning destroys these power laws. These results strongly modify the models of mammalian sound processing and provide a novel methodological perspective for understanding how the brain processes information.

  15. Duality Computing in Quantum Computers

    Institute of Scientific and Technical Information of China (English)

    LONG Gui-Lu; LIU Yang

    2008-01-01

    In this letter, we propose a duality computing mode, which resembles particle-wave duality property when a quantum system such as a quantum computer passes through a double-slit. In this mode, computing operations are not necessarily unitary. The duality mode provides a natural link between classical computing and quantum computing. In addition, the duality mode provides a new tool for quantum algorithm design.

  16. Quantum robots and quantum computers

    Energy Technology Data Exchange (ETDEWEB)

    Benioff, P.

    1998-07-01

    Validation of a presumably universal theory, such as quantum mechanics, requires a quantum mechanical description of systems that carry out theoretical calculations and systems that carry out experiments. The description of quantum computers is under active development. No description of systems to carry out experiments has been given. A small step in this direction is taken here by giving a description of quantum robots as mobile systems with on board quantum computers that interact with different environments. Some properties of these systems are discussed. A specific model based on the literature descriptions of quantum Turing machines is presented.

  17. Quantum Computing for Computer Architects

    CERN Document Server

    Metodi, Tzvetan

    2011-01-01

    Quantum computers can (in theory) solve certain problems far faster than a classical computer running any known classical algorithm. While existing technologies for building quantum computers are in their infancy, it is not too early to consider their scalability and reliability in the context of the design of large-scale quantum computers. To architect such systems, one must understand what it takes to design and model a balanced, fault-tolerant quantum computer architecture. The goal of this lecture is to provide architectural abstractions for the design of a quantum computer and to explore

  18. Gapless quantum excitations from an icelike splayed ferromagnetic ground state in stoichiometric Yb2Ti2O7

    Science.gov (United States)

    Gaudet, J.; Ross, K. A.; Kermarrec, E.; Butch, N. P.; Ehlers, G.; Dabkowska, H. A.; Gaulin, B. D.

    2016-02-01

    The ground state of the quantum spin ice candidate magnet Yb2Ti2O7 is known to be sensitive to weak disorder at the ˜1 % level which occurs in single crystals grown from the melt. Powders produced by solid state synthesis tend to be stoichiometric and display large and sharp heat capacity anomalies at relatively high temperatures, TC˜0.26 K. We have carried out neutron elastic and inelastic measurements on well characterized and equilibrated stoichiometric powder samples of Yb2Ti2O7 which show resolution-limited Bragg peaks to appear at low temperatures, but whose onset correlates with temperatures much higher than TC. The corresponding magnetic structure is best described as an icelike splayed ferromagnet. The spin dynamics in Yb2Ti2O7 are shown to be gapless on an energy scale <0.09 meV at all temperatures and organized into a continuum of scattering with vestiges of highly overdamped ferromagnetic spin waves present. These excitations differ greatly from conventional spin waves predicted for Yb2Ti2O7 's mean field ordered state, but appear robust to weak disorder as they are largely consistent with those displayed by nonstoichiometric crushed single crystals and single crystals, as well as by powder samples of Yb2Ti2O7 's sister quantum magnet Yb2Sn2O7 .

  19. Ground-state fidelity of the spin-1 Heisenberg chain with single ion anisotropy: quantum renormalization group and exact diagonalization approaches.

    Science.gov (United States)

    Langari, A; Pollmann, F; Siahatgar, M

    2013-10-09

    We study the phase diagram of the anisotropic spin-1 Heisenberg chain with single ion anisotropy (D) using a ground-state fidelity approach. The ground-state fidelity and its corresponding susceptibility are calculated within the quantum renormalization group scheme where we obtained the renormalization of fidelity preventing calculation of the ground state. Using this approach, the phase boundaries between the antiferromagnetic Néel, Haldane and large-D phases are obtained for the whole phase diagram, which justifies the application of quantum renormalization group to trace the symmetry-protected topological phases. In addition, we present numerical exact diagonalization (Lanczos) results in which we employ a recently introduced non-local order parameter to locate the transition from Haldane to large-D phase accurately.

  20. Kondo effects in a triangular triple quantum dot II: ground-state properties for deformed configurations

    Science.gov (United States)

    Oguri, Akira; Amaha, Shinichi; Nisikawa, Yunori; Hewson, A. C.; Tarucha, Seigo; Numata, Takahide

    2010-03-01

    We study transport through a triangular triple quantum dot (TTQD) connected to two noninteracting leads, using the numerical renormalization group. The system has been theoretically revealed to show a variety of Kondo effects depending on the electron filling of the triangle [1]. For instance, the SU(4) Kondo effect takes place at three-electron filling, and a two-stage Kondo screening of a high-spin S=1 Nagaoka state takes place at four-electron filling. Because of the enhanced freedom in the configurations, however, the large parameter space of the TTQD still has not been fully explored, especially for large deformations. We report the effects of the inhomogeneity in the inter-dot couplings and the level positions in a wide region of the filling. [1] T. Numata, Y. Nisikawa, A. Oguri, and A. C. Hewson: PRB 80, 155330 (2009).

  1. Pulsed excitation dynamics of an optomechanical crystal resonator near its quantum ground-state of motion

    CERN Document Server

    Meenehan, Sean M; MacCabe, Gregory S; Marsili, Francesco; Shaw, Matthew D; Painter, Oskar

    2015-01-01

    Using pulsed optical excitation and read-out along with single phonon counting techniques, we measure the transient back-action, heating, and damping dynamics of a nanoscale silicon optomechanical crystal cavity mounted in a dilution refrigerator at a base temperature of 11mK. In addition to observing a slow (~740ns) turn-on time for the optical-absorption-induced hot phonon bath, we measure for the 5.6GHz `breathing' acoustic mode of the cavity an initial phonon occupancy as low as 0.021 +- 0.007 (mode temperature = 70mK) and an intrinsic mechanical decay rate of 328 +- 14 Hz (mechanical Q-factor = 1.7x10^7). These measurements demonstrate the feasibility of using short pulsed measurements for a variety of quantum optomechanical applications despite the presence of steady-state optical heating.

  2. Study of Quantum Computing

    Directory of Open Access Journals (Sweden)

    Prashant Anil Patil

    2012-04-01

    Full Text Available This paper gives the detailed information about Quantum computer, and difference between quantum computer and traditional computers, the basis of Quantum computers which are slightly similar but still different from traditional computer. Many research groups are working towards the highly technological goal of building a quantum computer, which would dramatically improve computational power for particular tasks. Quantum computer is very much use full for computation purpose in field of Science and Research. Large amount of data and information will be computed, processing, storing, retrieving, transmitting and displaying information in less time with that much of accuracy which is not provided by traditional computers.

  3. The ground state properties of In(Ga)As/GaAs low strain quantum dots

    Energy Technology Data Exchange (ETDEWEB)

    Pieczarka, Maciej, E-mail: maciej.pieczarka@pwr.edu.pl; Sęk, Grzegorz

    2016-08-15

    We present theoretical studies on the confined states in low-strain In(Ga)As quantum dots (QDs). The 8-band k·p model together with the continuum elasticity theory and piezoelectric fields were employed to calculate the potential and confined electron and hole eigenstates. We focused on low-indium-content QDs with distinct in-plane asymmetry, which are naturally formed in the low strain regime of the Stranski-Krastanow growth mode. It has been found that the naturally thick wetting layer together with piezoelectric potential affect the total confinement potential to such extent that the hole eigenstates can get the spatial in-plane orientation orthogonal to the main axis of the dot elongation. This can influence both, qualitatively and quantitatively, many of the electronic and optical properties, as e.g. the polarization selection rules for the optical transition or the transitions oscillator strength. Eventually, importance of the degree of the shape asymmetry or the dots’ size, and differences between the low-strain (low-In-content) QDs and pure InAs dots formed in high strain conditions are discussed.

  4. Approximability of optimization problems through adiabatic quantum computation

    CERN Document Server

    Cruz-Santos, William

    2014-01-01

    The adiabatic quantum computation (AQC) is based on the adiabatic theorem to approximate solutions of the Schrödinger equation. The design of an AQC algorithm involves the construction of a Hamiltonian that describes the behavior of the quantum system. This Hamiltonian is expressed as a linear interpolation of an initial Hamiltonian whose ground state is easy to compute, and a final Hamiltonian whose ground state corresponds to the solution of a given combinatorial optimization problem. The adiabatic theorem asserts that if the time evolution of a quantum system described by a Hamiltonian is l

  5. Duality quantum computing

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    In this article,we make a review on the development of a newly proposed quantum computer,duality computer,or the duality quantum computer and the duality mode of quantum computers.The duality computer is based on the particle-wave duality principle of quantum mechanics.Compared to an ordinary quantum computer,the duality quantum computer is a quantum computer on the move and passing through a multi-slit.It offers more computing operations than is possible with an ordinary quantum computer.The most two distinct operations are:the quantum division operation and the quantum combiner operation.The division operation divides the wave function of a quantum computer into many attenuated,and identical parts.The combiner operation combines the wave functions in different parts into a single part.The duality mode is a way in which a quantum computer with some extra qubit resource simulates a duality computer.The main structure of duality quantum computer and duality mode,the duality mode,their mathematical description and algorithm designs are reviewed.

  6. Optical Quantum Computing

    National Research Council Canada - National Science Library

    Jeremy L. O'Brien

    2007-01-01

    In 2001, all-optical quantum computing became feasible with the discovery that scalable quantum computing is possible using only single-photon sources, linear optical elements, and single-photon detectors...

  7. Quantum computing and probability.

    Science.gov (United States)

    Ferry, David K

    2009-11-25

    Over the past two decades, quantum computing has become a popular and promising approach to trying to solve computationally difficult problems. Missing in many descriptions of quantum computing is just how probability enters into the process. Here, we discuss some simple examples of how uncertainty and probability enter, and how this and the ideas of quantum computing challenge our interpretations of quantum mechanics. It is found that this uncertainty can lead to intrinsic decoherence, and this raises challenges for error correction.

  8. Introduction to Quantum Computation

    Science.gov (United States)

    Ekert, A.

    A computation is a physical process. It may be performed by a piece of electronics or on an abacus, or in your brain, but it is a process that takes place in nature and as such it is subject to the laws of physics. Quantum computers are machines that rely on characteristically quantum phenomena, such as quantum interference and quantum entanglement in order to perform computation. In this series of lectures I want to elaborate on the computational power of such machines.

  9. Quantum analogue computing.

    Science.gov (United States)

    Kendon, Vivien M; Nemoto, Kae; Munro, William J

    2010-08-13

    We briefly review what a quantum computer is, what it promises to do for us and why it is so hard to build one. Among the first applications anticipated to bear fruit is the quantum simulation of quantum systems. While most quantum computation is an extension of classical digital computation, quantum simulation differs fundamentally in how the data are encoded in the quantum computer. To perform a quantum simulation, the Hilbert space of the system to be simulated is mapped directly onto the Hilbert space of the (logical) qubits in the quantum computer. This type of direct correspondence is how data are encoded in a classical analogue computer. There is no binary encoding, and increasing precision becomes exponentially costly: an extra bit of precision doubles the size of the computer. This has important consequences for both the precision and error-correction requirements of quantum simulation, and significant open questions remain about its practicality. It also means that the quantum version of analogue computers, continuous-variable quantum computers, becomes an equally efficient architecture for quantum simulation. Lessons from past use of classical analogue computers can help us to build better quantum simulators in future.

  10. Introduction to quantum computers

    CERN Document Server

    Berman, Gennady P; Mainieri, Ronnie; Tsifrinovich, Vladimir I

    1998-01-01

    Quantum computing promises to solve problems which are intractable on digital computers. Highly parallel quantum algorithms can decrease the computational time for some problems by many orders of magnitude. This important book explains how quantum computers can do these amazing things. Several algorithms are illustrated: the discrete Fourier transform, Shor’s algorithm for prime factorization; algorithms for quantum logic gates; physical implementations of quantum logic gates in ion traps and in spin chains; the simplest schemes for quantum error correction; correction of errors caused by im

  11. Ground-state cooling of a nanomechanical resonator via single-polariton optomechanics in a coupled quantum-dot-cavity system

    Science.gov (United States)

    Zhou, Ben-yuan; Li, Gao-xiang

    2016-09-01

    We propose a rapid ground-state optomechanical cooling scheme in a hybrid system, where a two-level quantum dot (QD) is placed in a single-mode cavity and a nanomechanical resonator (NMR) is also coupled to the cavity via radiation pressure. The cavity is driven by a weak laser field while the QD is driven by another weak laser field. Due to the quantum destructive interference arisen from different transition channels induced by simultaneously driving the QD-cavity system in terms of the two different lasers, two-photon absorption for the cavity field can be effectively eliminated by performing an optimal quantum interference condition. Furthermore, it is demonstrated that the QD-cavity system can be unbalancedly prepared in two single-polariton states with different eigenenergies. If the frequency of the NMR is tuned to be resonant with transition between two single-polariton states, it is found that a fast ground-state cooling for the NMR can also be achieved, even when the QD-cavity system is originally in the moderate-coupling regime. Thus the present ground-state cooling scheme for the NMR may be realized with currently available experimental technology.

  12. Simulation of quantum computers

    NARCIS (Netherlands)

    De Raedt, H; Michielsen, K; Hams, AH; Miyashita, S; Saito, K; Landau, DP; Lewis, SP; Schuttler, HB

    2001-01-01

    We describe a simulation approach to study the functioning of Quantum Computer hardware. The latter is modeled by a collection of interacting spin-1/2 objects. The time evolution of this spin system maps one-to-one to a quantum program carried out by the Quantum Computer. Our simulation software con

  13. Quantum Knitting Computer

    OpenAIRE

    Fujii, Toshiyuki; Matsuo, Shigemasa; Hatakenaka, Noriyuki

    2009-01-01

    We propose a fluxon-controlled quantum computer incorporated with three-qubit quantum error correction using special gate operations, i.e., joint-phase and SWAP gate operations, inherent in capacitively coupled superconducting flux qubits. The proposed quantum computer acts exactly like a knitting machine at home.

  14. Reliable Quantum Computers

    CERN Document Server

    Preskill, J

    1997-01-01

    The new field of quantum error correction has developed spectacularly since its origin less than two years ago. Encoded quantum information can be protected from errors that arise due to uncontrolled interactions with the environment. Recovery from errors can work effectively even if occasional mistakes occur during the recovery procedure. Furthermore, encoded quantum information can be processed without serious propagation of errors. Hence, an arbitrarily long quantum computation can be performed reliably, provided that the average probability of error per quantum gate is less than a certain critical value, the accuracy threshold. A quantum computer storing about 10^6 qubits, with a probability of error per quantum gate of order 10^{-6}, would be a formidable factoring engine. Even a smaller, less accurate quantum computer would be able to perform many useful tasks. (This paper is based on a talk presented at the ITP Conference on Quantum Coherence and Decoherence, 15-18 December 1996.)

  15. Holographic computations of the Quantum Information Metric

    CERN Document Server

    Trivella, Andrea

    2016-01-01

    In this note we show how the Quantum Information Metric can be computed holographically using a perturbative approach. In particular when the deformation of the conformal field theory state is induced by a scalar operator the corresponding bulk configuration reduces to a scalar field perturbatively probing the unperturbed background. We study two concrete examples: a CFT ground state deformed by a primary operator and thermofield double state in $d=2$ deformed by a marginal operator. Finally, we generalize the bulk construction to the case of a multi dimensional parameter space and show that the Quantum Information Metric coincides with the metric of the non-linear sigma model for the corresponding scalar fields.

  16. Quantum computing classical physics.

    Science.gov (United States)

    Meyer, David A

    2002-03-15

    In the past decade, quantum algorithms have been found which outperform the best classical solutions known for certain classical problems as well as the best classical methods known for simulation of certain quantum systems. This suggests that they may also speed up the simulation of some classical systems. I describe one class of discrete quantum algorithms which do so--quantum lattice-gas automata--and show how to implement them efficiently on standard quantum computers.

  17. Quantum Computation and Quantum Spin Dynamics

    NARCIS (Netherlands)

    Raedt, Hans De; Michielsen, Kristel; Hams, Anthony; Miyashita, Seiji; Saito, Keiji

    2001-01-01

    We analyze the stability of quantum computations on physically realizable quantum computers by simulating quantum spin models representing quantum computer hardware. Examples of logically identical implementations of the controlled-NOT operation are used to demonstrate that the results of a quantum

  18. Quantum Computation and Quantum Spin Dynamics

    NARCIS (Netherlands)

    Raedt, Hans De; Michielsen, Kristel; Hams, Anthony; Miyashita, Seiji; Saito, Keiji

    2001-01-01

    We analyze the stability of quantum computations on physically realizable quantum computers by simulating quantum spin models representing quantum computer hardware. Examples of logically identical implementations of the controlled-NOT operation are used to demonstrate that the results of a quantum

  19. Probabilistic Cloning and Quantum Computation

    Institute of Scientific and Technical Information of China (English)

    GAO Ting; YAN Feng-Li; WANG Zhi-Xi

    2004-01-01

    @@ We discuss the usefulness of quantum cloning and present examples of quantum computation tasks for which the cloning offers an advantage which cannot be matched by any approach that does not resort to quantum cloning.In these quantum computations, we need to distribute quantum information contained in the states about which we have some partial information. To perform quantum computations, we use a state-dependent probabilistic quantum cloning procedure to distribute quantum information in the middle of a quantum computation.

  20. Ground state cooling of a quantum electromechanical system with a silicon nitride membrane in a 3D loop-gap cavity

    Science.gov (United States)

    Noguchi, Atsushi; Yamazaki, Rekishu; Ataka, Manabu; Fujita, Hiroyuki; Tabuchi, Yutaka; Ishikawa, Toyofumi; Usami, Koji; Nakamura, Yasunobu

    2016-10-01

    Cavity electro-(opto-)mechanics gives us a quantum tool to access mechanical modes in a massive object. Here we develop a quantum electromechanical system in which a vibrational mode of a SiN x membrane are coupled to a three-dimensional loop-gap superconducting microwave cavity. The tight confinement of the electric field across a mechanically compliant narrow-gap capacitor realizes the quantum strong coupling regime under a red-sideband pump field and the quantum ground state cooling of the mechanical mode. We also demonstrate strong coupling between two mechanical modes, which is induced by two-tone parametric drives and mediated by a virtual photon in the cavity.

  1. Coherent control of ground state excitons in the nonlinear regime within an ensemble of self-assembled InAs quantum dots

    Energy Technology Data Exchange (ETDEWEB)

    Moldaschl, Thomas; Mueller, Thomas; Golka, Sebastian; Parz, Wolfgang; Strasser, Gottfried; Unterrainer, Karl [Photonics Institute and Center for Micro- and Nanostructures, Vienna University of Technology (Austria)

    2009-04-15

    In this work femtosecond spectral hole burning spectroscopy is used to resonantly excite ground state excitons in an ensemble of self-assembled InAs/GaAs quantum dots with a strong pump pulse. Two fundamental coherent nonlinear effects are observed with the aid of the intrinsic time- and frequency resolution of the setup: The low temperature Rabi oscillation of the two-level system associated with the excitonic ground state transition and the observation of two-photon absorption in the surrounding GaAs crystal matrix. The emergence of the latter effect also infers the existence of charged excitons in the nominally undoped QD sample, backed up by the observation of additional spectral holes next to the excitonic transitions. (copyright 2009 WILEY-VCH Verlag GmbH and Co. KGaA, Weinheim) (orig.)

  2. Explorations in quantum computing

    CERN Document Server

    Williams, Colin P

    2011-01-01

    By the year 2020, the basic memory components of a computer will be the size of individual atoms. At such scales, the current theory of computation will become invalid. ""Quantum computing"" is reinventing the foundations of computer science and information theory in a way that is consistent with quantum physics - the most accurate model of reality currently known. Remarkably, this theory predicts that quantum computers can perform certain tasks breathtakingly faster than classical computers -- and, better yet, can accomplish mind-boggling feats such as teleporting information, breaking suppos

  3. Algorithms for Quantum Computers

    CERN Document Server

    Smith, Jamie

    2010-01-01

    This paper surveys the field of quantum computer algorithms. It gives a taste of both the breadth and the depth of the known algorithms for quantum computers, focusing on some of the more recent results. It begins with a brief review of quantum Fourier transform based algorithms, followed by quantum searching and some of its early generalizations. It continues with a more in-depth description of two more recent developments: algorithms developed in the quantum walk paradigm, followed by tensor network evaluation algorithms (which include approximating the Tutte polynomial).

  4. Blind Quantum Signature with Blind Quantum Computation

    Science.gov (United States)

    Li, Wei; Shi, Ronghua; Guo, Ying

    2017-04-01

    Blind quantum computation allows a client without quantum abilities to interact with a quantum server to perform a unconditional secure computing protocol, while protecting client's privacy. Motivated by confidentiality of blind quantum computation, a blind quantum signature scheme is designed with laconic structure. Different from the traditional signature schemes, the signing and verifying operations are performed through measurement-based quantum computation. Inputs of blind quantum computation are securely controlled with multi-qubit entangled states. The unique signature of the transmitted message is generated by the signer without leaking information in imperfect channels. Whereas, the receiver can verify the validity of the signature using the quantum matching algorithm. The security is guaranteed by entanglement of quantum system for blind quantum computation. It provides a potential practical application for e-commerce in the cloud computing and first-generation quantum computation.

  5. Blind Quantum Signature with Blind Quantum Computation

    Science.gov (United States)

    Li, Wei; Shi, Ronghua; Guo, Ying

    2016-12-01

    Blind quantum computation allows a client without quantum abilities to interact with a quantum server to perform a unconditional secure computing protocol, while protecting client's privacy. Motivated by confidentiality of blind quantum computation, a blind quantum signature scheme is designed with laconic structure. Different from the traditional signature schemes, the signing and verifying operations are performed through measurement-based quantum computation. Inputs of blind quantum computation are securely controlled with multi-qubit entangled states. The unique signature of the transmitted message is generated by the signer without leaking information in imperfect channels. Whereas, the receiver can verify the validity of the signature using the quantum matching algorithm. The security is guaranteed by entanglement of quantum system for blind quantum computation. It provides a potential practical application for e-commerce in the cloud computing and first-generation quantum computation.

  6. Quantum Computation by Adiabatic Evolution

    CERN Document Server

    Farhi, E; Gutmann, S; Sipser, M; Farhi, Edward; Goldstone, Jeffrey; Gutmann, Sam; Sipser, Michael

    2000-01-01

    We give a quantum algorithm for solving instances of the satisfiability problem, based on adiabatic evolution. The evolution of the quantum state is governed by a time-dependent Hamiltonian that interpolates between an initial Hamiltonian, whose ground state is easy to construct, and a final Hamiltonian, whose ground state encodes the satisfying assignment. To ensure that the system evolves to the desired final ground state, the evolution time must be big enough. The time required depends on the minimum energy difference between the two lowest states of the interpolating Hamiltonian. We are unable to estimate this gap in general. We give some special symmetric cases of the satisfiability problem where the symmetry allows us to estimate the gap and we show that, in these cases, our algorithm runs in polynomial time.

  7. Quantum Computational Cryptography

    Science.gov (United States)

    Kawachi, Akinori; Koshiba, Takeshi

    As computational approaches to classical cryptography have succeeded in the establishment of the foundation of the network security, computational approaches even to quantum cryptography are promising, since quantum computational cryptography could offer richer applications than the quantum key distribution. Our project focused especially on the quantum one-wayness and quantum public-key cryptosystems. The one-wayness of functions (or permutations) is one of the most important notions in computational cryptography. First, we give an algorithmic characterization of quantum one-way permutations. In other words, we show a necessary and sufficient condition for quantum one-way permutations in terms of reflection operators. Second, we introduce a problem of distinguishing between two quantum states as a new underlying problem that is harder to solve than the graph automorphism problem. The new problem is a natural generalization of the distinguishability problem between two probability distributions, which are commonly used in computational cryptography. We show that the problem has several cryptographic properties and they enable us to construct a quantum publickey cryptosystem, which is likely to withstand any attack of a quantum adversary.

  8. Quantum Analog Computing

    Science.gov (United States)

    Zak, M.

    1998-01-01

    Quantum analog computing is based upon similarity between mathematical formalism of quantum mechanics and phenomena to be computed. It exploits a dynamical convergence of several competing phenomena to an attractor which can represent an externum of a function, an image, a solution to a system of ODE, or a stochastic process.

  9. Adiabatic quantum computation and quantum phase transitions

    CERN Document Server

    Latorre, J I; Latorre, Jose Ignacio; Orus, Roman

    2003-01-01

    We analyze the ground state entanglement in a quantum adiabatic evolution algorithm designed to solve the NP-complete Exact Cover problem. The entropy of entanglement seems to obey linear and universal scaling at the point where the mass gap becomes small, suggesting that the system passes near a quantum phase transition. Such a large scaling of entanglement suggests that the effective connectivity of the system diverges as the number of qubits goes to infinity and that this algorithm cannot be efficiently simulated by classical means. On the other hand, entanglement in Grover's algorithm is bounded by a constant.

  10. Entanglement in systems of oscillators and quantum computations

    OpenAIRE

    Ozhigov, Yuri I.

    2012-01-01

    It is shown that quantum devices based only on oscillators cannot serve as the universal quantum computer, despite of entanglement in such devices, which we roughly estimate for the ideal case and for the harmful entanglement with photonic modes. We show that quasi-particles are the native shell for the entanglement already for ground state, in contast to the free electromagnetic field where vacuum state does not produce entanglement at all.

  11. Quantum computing with trapped ions

    Energy Technology Data Exchange (ETDEWEB)

    Hughes, R.J.

    1998-01-01

    The significance of quantum computation for cryptography is discussed. Following a brief survey of the requirements for quantum computational hardware, an overview of the ion trap quantum computation project at Los Alamos is presented. The physical limitations to quantum computation with trapped ions are analyzed and an assessment of the computational potential of the technology is made.

  12. Applicability of Rydberg atoms to quantum computers

    Science.gov (United States)

    Ryabtsev, Igor I.; Tretyakov, Denis B.; Beterov, Ilya I.

    2005-01-01

    The applicability of Rydberg atoms to quantum computers is examined from an experimental point of view. In many recent theoretical proposals, the excitation of atoms into highly excited Rydberg states was considered as a way to achieve quantum entanglement in cold atomic ensembles via dipole-dipole interactions that could be strong for Rydberg atoms. Appropriate conditions to realize a conditional quantum phase gate have been analysed. We also present the results of modelling experiments on microwave spectroscopy of single- and multi-atom excitations at the one-photon 37S1/2 → 37P1/2 and two-photon 37S1/2 → 38S1/2 transitions in an ensemble of a few sodium Rydberg atoms. The microwave spectra were investigated for various final states of the ensemble initially prepared in its ground state. The results may be applied to the studies on collective laser excitation of ground-state atoms aiming to realize quantum gates.

  13. Ion Trap Quantum Computing

    Science.gov (United States)

    2011-12-01

    an inspiring speech at the MIT Physics of Computation 1st Conference in 1981, Feynman proposed the development of a computer that would obey the...on ion trap based 36 quantum computing for physics and computer science students would include lecture notes, slides, lesson plans, a syllabus...reading lists, videos, demonstrations, and laboratories. 37 LIST OF REFERENCES [1] R. P. Feynman , “Simulating physics with computers,” Int. J

  14. Concurrent Quantum Computation

    CERN Document Server

    Yamaguchi, F; Yamamoto, Y

    2000-01-01

    A quantum computer is a multi-particle interferometer that comprises beam splitters at both ends and arms, where the n two-level particles undergo the interactions among them. The arms are designed so that relevant functions required to produce a computational result is stored in the phase shifts of the 2^n arms. They can be detected by interferometry that allows us to utilize quantum parallelism. Quantum algorithms are accountable for what interferometers to be constructed to compute particular problems. A standard formalism for constructing the arms has been developed by the extension of classical reversible gate arrays. By its nature of sequential applications of logic operations, the required number of gates increases exponentially as the problem size grows. This may cause a crucial obstacle to perform a quantum computation within a limited decoherence time. We propose a direct and concurrent construction of the interferometer arms by one-time evolution of a physical system with arbitrary multi-particle i...

  15. Quantum computing: towards reality

    Science.gov (United States)

    Trabesinger, Andreas

    2017-03-01

    The concept of computers that harness the laws of quantum mechanics has transformed our thinking about how information can be processed. Now the environment exists to make prototype devices a reality.

  16. Adiabatic quantum computing

    OpenAIRE

    Lobe, Elisabeth; Stollenwerk, Tobias; Tröltzsch, Anke

    2015-01-01

    In the recent years, the field of adiabatic quantum computing has gained importance due to the advances in the realisation of such machines, especially by the company D-Wave Systems. These machines are suited to solve discrete optimisation problems which are typically very hard to solve on a classical computer. Due to the quantum nature of the device it is assumed that there is a substantial speedup compared to classical HPC facilities. We explain the basic principles of adiabatic ...

  17. The Repeated Computation of the Bond Length and Ground- State Energy for H2 +%H2+键长和基态能量的再计算

    Institute of Scientific and Technical Information of China (English)

    李旭; 胡先权

    2002-01-01

    Ritz variation method was used to find the numerical relation bctween the energy near the ground - state of the hydrogenmolecular ion H2 + .and the changes of the variation parameter andthe bond length, the computation formula of bond length and ground- state energy for H2 * was also obtained by means of the method ofparabolie interpolation. The computation results were much closer toexperinental values than those of Refs. [ 1,2]' s.%用Ritz变分法求出了氢分子离子H2+基态能量附近的能量随变分参数和分子键长变化的数值关系,并用抛物线插值法获得了H2+键长和基态能量的值及其计算公式,比文献[1,2]更接近于实验值.

  18. Quantum Computers and Quantum Computer Languages: Quantum Assembly Language and Quantum C Language

    OpenAIRE

    Blaha, Stephen

    2002-01-01

    We show a representation of Quantum Computers defines Quantum Turing Machines with associated Quantum Grammars. We then create examples of Quantum Grammars. Lastly we develop an algebraic approach to high level Quantum Languages using Quantum Assembly language and Quantum C language as examples.

  19. Quantum Computers and Quantum Computer Languages: Quantum Assembly Language and Quantum C

    OpenAIRE

    Blaha, Stephen

    2002-01-01

    We show a representation of Quantum Computers defines Quantum Turing Machines with associated Quantum Grammars. We then create examples of Quantum Grammars. Lastly we develop an algebraic approach to high level Quantum Languages using Quantum Assembly language and Quantum C language as examples.

  20. Quantum Computers and Quantum Computer Languages: Quantum Assembly Language and Quantum C

    OpenAIRE

    Blaha, Stephen

    2002-01-01

    We show a representation of Quantum Computers defines Quantum Turing Machines with associated Quantum Grammars. We then create examples of Quantum Grammars. Lastly we develop an algebraic approach to high level Quantum Languages using Quantum Assembly language and Quantum C language as examples.

  1. Quantum Computers and Quantum Computer Languages: Quantum Assembly Language and Quantum C Language

    OpenAIRE

    Blaha, Stephen

    2002-01-01

    We show a representation of Quantum Computers defines Quantum Turing Machines with associated Quantum Grammars. We then create examples of Quantum Grammars. Lastly we develop an algebraic approach to high level Quantum Languages using Quantum Assembly language and Quantum C language as examples.

  2. Ground state lasing at 1.30 microm from InAs/GaAs quantum dot lasers grown by metal-organic chemical vapor deposition.

    Science.gov (United States)

    Guimard, Denis; Ishida, Mitsuru; Bordel, Damien; Li, Lin; Nishioka, Masao; Tanaka, Yu; Ekawa, Mitsuru; Sudo, Hisao; Yamamoto, Tsuyoshi; Kondo, Hayato; Sugawara, Mitsuru; Arakawa, Yasuhiko

    2010-03-12

    We investigated the effects of post-growth annealing on the photoluminescence (PL) characteristics of InAs/GaAs quantum dots (QDs) grown by metal-organic chemical vapor deposition (MOCVD). The onset temperature at which both the peak linewidth and the PL intensity degraded and the blueshift of the ground state emission wavelength occurred was found to depend on both the QD density and the In composition of the capping layer. This behavior is particularly important in view of QD integration in photonic devices. From the knowledge of the dependences of the PL characteristics after annealing on the QD and capping growth conditions, ground state lasing at 1.30 microm could be demonstrated from InAs/GaAs QDs grown by MOCVD. Finally, we compared the laser characteristics of InAs/GaAs QDs with those of InAs/Sb:GaAs QDs, grown according to the antimony-mediated growth technique, and showed that InAs/Sb:GaAs QDs are more appropriate for laser fabrication at 1.3 microm by MOCVD.

  3. Ground state lasing at 1.30 {mu}m from InAs/GaAs quantum dot lasers grown by metal-organic chemical vapor deposition

    Energy Technology Data Exchange (ETDEWEB)

    Guimard, Denis; Ishida, Mitsuru; Bordel, Damien; Li Lin; Nishioka, Masao; Arakawa, Yasuhiko [Institute of Industrial Science, University of Tokyo, 4-6-1 Komaba, Meguro-ku, Tokyo 153-8505 (Japan); Tanaka, Yu; Kondo, Hayato; Sugawara, Mitsuru [QD Laser Inc., 1-8-1 Ohtemachi, Chyoda-ku, Tokyo 100-0004 (Japan); Ekawa, Mitsuru; Sudo, Hisao; Yamamoto, Tsuyoshi, E-mail: dguimard@iis.u-tokyo.ac.jp [Fujitsu Laboratories Limited, 10-1 Morinosato-Wakamiya, Atsugi 243-0197 (Japan)

    2010-03-12

    We investigated the effects of post-growth annealing on the photoluminescence (PL) characteristics of InAs/GaAs quantum dots (QDs) grown by metal-organic chemical vapor deposition (MOCVD). The onset temperature at which both the peak linewidth and the PL intensity degraded and the blueshift of the ground state emission wavelength occurred was found to depend on both the QD density and the In composition of the capping layer. This behavior is particularly important in view of QD integration in photonic devices. From the knowledge of the dependences of the PL characteristics after annealing on the QD and capping growth conditions, ground state lasing at 1.30 {mu}m could be demonstrated from InAs/GaAs QDs grown by MOCVD. Finally, we compared the laser characteristics of InAs/GaAs QDs with those of InAs/Sb:GaAs QDs, grown according to the antimony-mediated growth technique, and showed that InAs/Sb:GaAs QDs are more appropriate for laser fabrication at 1.3 {mu}m by MOCVD.

  4. Sideband cooling an ion to the quantum ground state in a Penning trap with very low heating rate

    CERN Document Server

    Goodwin, J F; Thompson, R C; Segal, D M

    2014-01-01

    We report the laser cooling of a single $^{40}\\text{Ca}^+$ ion in a Penning trap to the motional ground state in one dimension. Cooling is performed in the strong binding limit on the 729-nm electric quadrupole $S_{1/2}\\leftrightarrow D_{5/2}$ transition, broadened by a quench laser coupling the $D_{5/2}$ and $P_{3/2}$ levels. We find the final phonon number to be $\\bar{n}=0.012\\pm0.009$. We measure the heating rate of the trap to be exceptionally low with $\\dot{\\bar{n}}=0.08\\pm 0.12~\\textrm{s}^{-1}$ and a scaled spectral noise density of $\\omega S_{\\omega}<1.6\\times10^{-10}~\\textrm{V}^{2}\\textrm{m}^{-2}\\textrm{Hz}^{-1}\\textrm{s}^{-1}$, which is consistent with the large ion-electrode distance. We perform Rabi oscillations on the sideband-cooled ion and observe a coherence time of $0.7\\pm 0.1~\\textrm{ms}$, noting that the practical performance is limited primarily by the intensity noise of the probe laser.

  5. Adiabatic Quantum Computing

    CERN Document Server

    Pinski, Sebastian D

    2011-01-01

    Adiabatic Quantum Computing (AQC) is a relatively new subject in the world of quantum computing, let alone Physics. Inspiration for this project has come from recent controversy around D-Wave Systems in British Columbia, Canada, who claim to have built a working AQC which is now commercially available and hope to be distributing a 1024 qubit chip by the end of 2008. Their 16 qubit chip was demonstrated online for the Supercomputing 2007 conference within which a few small problems were solved; although the explanations that journalists and critics received were minimal and very little was divulged in the question and answer session. This 'unconvincing' demonstration has caused physicists and computer scientists to hit back at D-Wave. The aim of this project is to give an introduction to the historic advances in classical and quantum computing and to explore the methods of AQC. Through numerical simulations an algorithm for the Max Independent Set problem is empirically obtained.

  6. Oxford ion-trap quantum computing project.

    Science.gov (United States)

    Lucas, D M; Donald, C J S; Home, J P; McDonnell, M J; Ramos, A; Stacey, D N; Stacey, J-P; Steane, A M; Webster, S C

    2003-07-15

    We describe recent progress in the development of an ion-trap quantum information processor. We discuss the choice of ion species and describe recent experiments on read-out for a ground-state qubit and photoionization trap loading.

  7. Estimation of beryllium ground state energy by Monte Carlo simulation

    Energy Technology Data Exchange (ETDEWEB)

    Kabir, K. M. Ariful [Department of Physical Sciences, School of Engineering and Computer Science, Independent University, Bangladesh (IUB) Dhaka (Bangladesh); Halder, Amal [Department of Mathematics, University of Dhaka Dhaka (Bangladesh)

    2015-05-15

    Quantum Monte Carlo method represent a powerful and broadly applicable computational tool for finding very accurate solution of the stationary Schrödinger equation for atoms, molecules, solids and a variety of model systems. Using variational Monte Carlo method we have calculated the ground state energy of the Beryllium atom. Our calculation are based on using a modified four parameters trial wave function which leads to good result comparing with the few parameters trial wave functions presented before. Based on random Numbers we can generate a large sample of electron locations to estimate the ground state energy of Beryllium. Our calculation gives good estimation for the ground state energy of the Beryllium atom comparing with the corresponding exact data.

  8. Properties of the single-site reduced density matrix in the Bose-Bose resonance model in the ground state and in quantum quenches

    Science.gov (United States)

    Dorfner, F.; Heidrich-Meisner, F.

    2016-06-01

    We study properties of the single-site reduced density matrix in the Bose-Bose resonance model as a function of system parameters. This model describes a single-component Bose gas with a resonant coupling to a diatomic molecular state, here defined on a lattice. A main goal is to demonstrate that the eigenstates of the single-site reduced density matrix have structures that are characteristic for the various quantum phases of this system. Since the Hamiltonian conserves only the global particle number but not the number of bosons and molecules individually, these eigenstates, referred to as optimal modes, can be nontrivial linear combinations of bare eigenstates of the molecular and boson particle number. We numerically analyze the optimal modes and their weights, the latter giving the importance of the corresponding state, in the ground state of the Bose-Bose resonance model. We find that the single-site von Neumann entropy is sensitive to the location of the phase boundaries. We explain the structure of the optimal modes and their weight spectra using perturbation theory and via a comparison to results for the single-component Bose-Hubbard model. We further study the dynamical evolution of the optimal modes and of the single-site entanglement entropy in two quantum quenches that cross phase boundaries of the model and show that these quantities are thermal in the steady state. For our numerical calculations, we use the density-matrix renormalization group method for ground-state calculations and time evolution in a Krylov subspace for the quench dynamics as well as exact diagonalization.

  9. Optical quantum computing.

    Science.gov (United States)

    O'Brien, Jeremy L

    2007-12-07

    In 2001, all-optical quantum computing became feasible with the discovery that scalable quantum computing is possible using only single-photon sources, linear optical elements, and single-photon detectors. Although it was in principle scalable, the massive resource overhead made the scheme practically daunting. However, several simplifications were followed by proof-of-principle demonstrations, and recent approaches based on cluster states or error encoding have dramatically reduced this worrying resource overhead, making an all-optical architecture a serious contender for the ultimate goal of a large-scale quantum computer. Key challenges will be the realization of high-efficiency sources of indistinguishable single photons, low-loss, scalable optical circuits, high-efficiency single-photon detectors, and low-loss interfacing of these components.

  10. Introduction to topological quantum matter & quantum computation

    CERN Document Server

    Stanescu, Tudor D

    2017-01-01

    What is -topological- about topological quantum states? How many types of topological quantum phases are there? What is a zero-energy Majorana mode, how can it be realized in a solid state system, and how can it be used as a platform for topological quantum computation? What is quantum computation and what makes it different from classical computation? Addressing these and other related questions, Introduction to Topological Quantum Matter & Quantum Computation provides an introduction to and a synthesis of a fascinating and rapidly expanding research field emerging at the crossroads of condensed matter physics, mathematics, and computer science. Providing the big picture, this book is ideal for graduate students and researchers entering this field as it allows for the fruitful transfer of paradigms and ideas amongst different areas, and includes many specific examples to help the reader understand abstract and sometimes challenging concepts. It explores the topological quantum world beyond the well-know...

  11. Quantum probabilistically cloning and computation

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    In this article we make a review on the usefulness of probabilistically cloning and present examples of quantum computation tasks for which quantum cloning offers an advantage which cannot be matched by any approach that does not resort to it.In these quantum computations,one needs to distribute quantum information contained in states about which we have some partial information.To perform quantum computations,one uses state-dependent probabilistic quantum cloning procedure to distribute quantum information in the middle of a quantum computation.And we discuss the achievable efficiencies and the efficient quantum logic network for probabilistic cloning the quantum states used in implementing quantum computation tasks for which cloning provides enhancement in performance.

  12. Abstract quantum computing machines and quantum computational logics

    Science.gov (United States)

    Chiara, Maria Luisa Dalla; Giuntini, Roberto; Sergioli, Giuseppe; Leporini, Roberto

    2016-06-01

    Classical and quantum parallelism are deeply different, although it is sometimes claimed that quantum Turing machines are nothing but special examples of classical probabilistic machines. We introduce the concepts of deterministic state machine, classical probabilistic state machine and quantum state machine. On this basis, we discuss the question: To what extent can quantum state machines be simulated by classical probabilistic state machines? Each state machine is devoted to a single task determined by its program. Real computers, however, behave differently, being able to solve different kinds of problems. This capacity can be modeled, in the quantum case, by the mathematical notion of abstract quantum computing machine, whose different programs determine different quantum state machines. The computations of abstract quantum computing machines can be linguistically described by the formulas of a particular form of quantum logic, termed quantum computational logic.

  13. Demonstration of blind quantum computing.

    Science.gov (United States)

    Barz, Stefanie; Kashefi, Elham; Broadbent, Anne; Fitzsimons, Joseph F; Zeilinger, Anton; Walther, Philip

    2012-01-20

    Quantum computers, besides offering substantial computational speedups, are also expected to preserve the privacy of a computation. We present an experimental demonstration of blind quantum computing in which the input, computation, and output all remain unknown to the computer. We exploit the conceptual framework of measurement-based quantum computation that enables a client to delegate a computation to a quantum server. Various blind delegated computations, including one- and two-qubit gates and the Deutsch and Grover quantum algorithms, are demonstrated. The client only needs to be able to prepare and transmit individual photonic qubits. Our demonstration is crucial for unconditionally secure quantum cloud computing and might become a key ingredient for real-life applications, especially when considering the challenges of making powerful quantum computers widely available.

  14. Basic concepts in quantum computation

    CERN Document Server

    Ekert, A K; Inamori, H; Ekert, Artur; Hayden, Patrick; Inamori, Hitoshi

    2000-01-01

    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 remarks

  15. Quantum Mobile Crypto-Computation

    Institute of Scientific and Technical Information of China (English)

    XIONGYan; CHENHuanhuan; GUNaijie; MIAOFuyou

    2005-01-01

    In this paper, a quantum approach for solving the mobile crypto-computation problem is proposed. In our approach, quantum signature and quantum entanglement have been employed to strengthen the security of mobile computation. Theory analysis shows that our solution is secure against classic and quantum attacks.

  16. Detecting topological order in a ground state wave function

    OpenAIRE

    2005-01-01

    A large class of topological orders can be understood and classified using the string-net condensation picture. These topological orders can be characterized by a set of data (N, d_i, F^{ijk}_{lmn}, \\delta_{ijk}). We describe a way to detect this kind of topological order using only the ground state wave function. The method involves computing a quantity called the ``topological entropy'' which directly measures the quantum dimension D = \\sum_i d^2_i.

  17. Holographic quantum computing.

    Science.gov (United States)

    Tordrup, Karl; Negretti, Antonio; Mølmer, Klaus

    2008-07-25

    We propose to use a single mesoscopic ensemble of trapped polar molecules for quantum computing. A "holographic quantum register" with hundreds of qubits is encoded in collective excitations with definite spatial phase variations. Each phase pattern is uniquely addressed by optical Raman processes with classical optical fields, while one- and two-qubit gates and qubit readout are accomplished by transferring the qubit states to a stripline microwave cavity field and a Cooper pair box where controllable two-level unitary dynamics and detection is governed by classical microwave fields.

  18. Adiabatic Quantum Computation is Equivalent to Standard Quantum Computation

    CERN Document Server

    Aharonov, D; Kempe, J; Landau, Z; Lloyd, S; Regev, O; Aharonov, Dorit; Dam, Wim van; Kempe, Julia; Landau, Zeph; Lloyd, Seth; Regev, Oded

    2004-01-01

    Adiabatic quantum computation has recently attracted attention in the physics and computer science communities, but its computational power has been unknown. We settle this question and describe an efficient adiabatic simulation of any given quantum algorithm, which implies that the adiabatic computation model and the conventional quantum circuit model are polynomially equivalent. Our result can be extended to the physically realistic setting of particles arranged on a two-dimensional grid with nearest neighbor interactions. The equivalence between the models provides a new vantage point from which to tackle the central issues in quantum computation, namely designing new quantum algorithms and constructing fault tolerant quantum computers. In particular, by translating the main open questions in quantum algorithms to the language of spectral gaps of sparse matrices, the result makes quantum algorithmic questions accessible to a wider scientific audience, acquainted with mathematical physics, expander theory a...

  19. Ground state of 16O

    Science.gov (United States)

    Pieper, Steven C.; Wiringa, R. B.; Pandharipande, V. R.

    1990-01-01

    A variational method is used to study the ground state of 16O. Expectation values are computed with a cluster expansion for the noncentral correlations in the wave function; the central correlations and exchanges are treated to all orders by Monte Carlo integration. The expansion has good convergence. Results are reported for the Argonne v14 two-nucleon and Urbana VII three-nucleon potentials.

  20. Quantum Computation Toward Quantum Gravity

    Science.gov (United States)

    Zizzi, P. A.

    2001-08-01

    The aim of this paper is to enlighten the emerging relevance of Quantum Information Theory in the field of Quantum Gravity. As it was suggested by J. A. Wheeler, information theory must play a relevant role in understanding the foundations of Quantum Mechanics (the "It from bit" proposal). Here we suggest that quantum information must play a relevant role in Quantum Gravity (the "It from qubit" proposal). The conjecture is that Quantum Gravity, the theory which will reconcile Quantum Mechanics with General Relativity, can be formulated in terms of quantum bits of information (qubits) stored in space at the Planck scale. This conjecture is based on the following arguments: a) The holographic principle, b) The loop quantum gravity approach and spin networks, c) Quantum geometry and black hole entropy. From the above arguments, as they stand in the literature, it follows that the edges of spin networks pierce the black hole horizon and excite curvature degrees of freedom on the surface. These excitations are micro-states of Chern-Simons theory and account of the black hole entropy which turns out to be a quarter of the area of the horizon, (in units of Planck area), in accordance with the holographic principle. Moreover, the states which dominate the counting correspond to punctures of spin j = 1/2 and one can in fact visualize each micro-state as a bit of information. The obvious generalization of this result is to consider open spin networks with edges labeled by the spin -1/ 2 representation of SU(2) in a superposed state of spin "on" and spin "down." The micro-state corresponding to such a puncture will be a pixel of area which is "on" and "off" at the same time, and it will encode a qubit of information. This picture, when applied to quantum cosmology, describes an early inflationary universe which is a discrete version of the de Sitter universe.

  1. Quantum Computation and Spin Electronics

    OpenAIRE

    DiVincenzo, David P.; Burkard, Guido; Loss, Daniel; Sukhorukov, Eugene V.

    1999-01-01

    In this chapter we explore the connection between mesoscopic physics and quantum computing. After giving a bibliography providing a general introduction to the subject of quantum information processing, we review the various approaches that are being considered for the experimental implementation of quantum computing and quantum communication in atomic physics, quantum optics, nuclear magnetic resonance, superconductivity, and, especially, normal-electron solid state physics. We discuss five ...

  2. Properties of ground state and anomalous quantum fluctuations in one-dimensional polaron-soliton ystems——the effects of electron-two-phonon interaction and non-adiabatic quantum correlations

    Institute of Scientific and Technical Information of China (English)

    Luo Zhi-Hua; Cao Xi-Jin; Yu Chao-Fan

    2011-01-01

    Based on the Holstein model Hamiltonian of one-dimensional molecular crystals, by making use of the expansion approach of the correlated squeezed-coherent states of phonon instead of the two-phonon coherent state expansion scheme, the properties of the ground state and the anomalous quantum fluctuations are investigated in a strongly coupled electron-phonon system with special consideration of the electron-two-phonon interaction. The effective renormalization ((~α)i) of the displacement of the squeezed phonons with the effect of the squeezed-coherent states of phonon and both the electron-displaced phonon and the polaron-squeezed phonon correlations have been combined to obtain the anomalous quantum fluctuations for the corrections of the coherent state. Due to these non-adiabatic correlations, the effective displacement parameter (~α)i is larger than the ordinary parameter αi(0). In comparison with the electron-one-phonon interaction (g) corrected as (~α)ig, we have found the electron-two-phonon interaction (g1) corrected as (~α)2ig1 is enhanced significantly. For this reason, the ground state energy (EO(2)) contributed by the electron-two-phonon interaction is more negative than the single-phonon case (EO(1)) and the soliton solution is more stable. At the same time, the effects of the electron-two-phonon interaction greatly increase the polaron energy and the quantum fluctuations. Furthermore,in a deeper level, we have considered the effect of the polaron-squeezed phonon correlation (f-correlation). Since this correlation parameter f > 1, this effect will strengthen the electron-one and two-phonon interactions by f(~α)ig and f2( ~α)2i1, respectively. The final results show that the ground state energy and the polaron energy will appear more negative further and the quantum fluctuations will gain further improvement.

  3. Blind Quantum Computation

    CERN Document Server

    Arrighi, P; Arrighi, Pablo; Salvail, Louis

    2003-01-01

    We investigate the possibility of having someone carry out the work of executing a function for you, but without letting him learn anything about your input. Say Alice wants Bob to compute some well-known function f upon her input x, but wants to prevent Bob from learning anything about x. The situation arises for instance if client Alice has limited computational resources in comparison with mistrusted server Bob, or if x is an inherently mobile piece of data. Could there be a protocol whereby Bob is forced to compute f(x) "blindly", i.e. without observing x? We provide such a blind computation protocol for the class of functions which admit an efficient procedure to generate random input-output pairs, e.g. factorization. The setting is quantum, the security is unconditional, the eavesdropper is as malicious as can be. Keywords: Secure Circuit Evaluation, Secure Two-party Computation, Information Hiding, Information gain vs disturbance.

  4. Short Introduction to Quantum Computation

    Science.gov (United States)

    2007-11-02

    Proceedings of the Air Force Office of Scientific Research Computational Mathematics Meeting 1996 Revision 2 Short Introduction to Quantum...useful for nanoscale computing and quantum computing. KEY WORDS: quantum computing, nano-scale computing, Moore’s law 1 Introduction It is likely that...memory) Digital Devices magnetostrictive delay line Intel 1103 integrated circuit IBM 3340 disk drive Smallest DRAM cell reported on at ISSC Current

  5. Relativistic quantum chemistry on quantum computers

    DEFF Research Database (Denmark)

    Veis, L.; Visnak, J.; Fleig, T.

    2012-01-01

    The past few years have witnessed a remarkable interest in the application of quantum computing for solving problems in quantum chemistry more efficiently than classical computers allow. Very recently, proof-of-principle experimental realizations have been reported. However, so far only...... the nonrelativistic regime (i.e., the Schrodinger equation) has been explored, while it is well known that relativistic effects can be very important in chemistry. We present a quantum algorithm for relativistic computations of molecular energies. We show how to efficiently solve the eigenproblem of the Dirac......-Coulomb Hamiltonian on a quantum computer and demonstrate the functionality of the proposed procedure by numerical simulations of computations of the spin-orbit splitting in the SbH molecule. Finally, we propose quantum circuits with three qubits and nine or ten controlled-NOT (CNOT) gates, which implement a proof...

  6. Fundamentals of universality in one-way quantum computation

    CERN Document Server

    Van den Nest, M; Dür, W; Miyake, A

    2007-01-01

    We build a framework allowing for a systematic investigation of the issue: "Which quantum states are universal resources for one-way quantum computation?" We start by re-examining what is exactly meant by "universality" in quantum computation, and what the implications are for universal one-way quantum computation. Given the framework of a measurement-based quantum computer, where quantum information is processed by local operations only, the most general universal one-way quantum computer is one which is capable of accepting arbitrary classical inputs and producing arbitrary quantum outputs--we refer to this property as CQ-universality. We then show that a systematic study of CQ-universality in one-way quantum computation is possible by identifying entanglement features that must be present in every universal resource. These insights are used to identify several states as being not universal, such as 1D cluster states, W states, and ground states of non-critical 1D spin systems. Our criteria are strengthened...

  7. Trajectory approach to the Schrödinger–Langevin equation with linear dissipation for ground states

    Energy Technology Data Exchange (ETDEWEB)

    Chou, Chia-Chun, E-mail: ccchou@mx.nthu.edu.tw

    2015-11-15

    The Schrödinger–Langevin equation with linear dissipation is integrated by propagating an ensemble of Bohmian trajectories for the ground state of quantum systems. Substituting the wave function expressed in terms of the complex action into the Schrödinger–Langevin equation yields the complex quantum Hamilton–Jacobi equation with linear dissipation. We transform this equation into the arbitrary Lagrangian–Eulerian version with the grid velocity matching the flow velocity of the probability fluid. The resulting equation is simultaneously integrated with the trajectory guidance equation. Then, the computational method is applied to the harmonic oscillator, the double well potential, and the ground vibrational state of methyl iodide. The excellent agreement between the computational and the exact results for the ground state energies and wave functions shows that this study provides a synthetic trajectory approach to the ground state of quantum systems.

  8. Quantum computing of semiclassical formulas.

    Science.gov (United States)

    Georgeot, B; Giraud, O

    2008-04-01

    We show that semiclassical formulas such as the Gutzwiller trace formula can be implemented on a quantum computer more efficiently than on a classical device. We give explicit quantum algorithms which yield quantum observables from classical trajectories, and which alternatively test the semiclassical approximation by computing classical actions from quantum evolution. The gain over classical computation is in general quadratic, and can be larger in some specific cases.

  9. Quantum Computing, Metrology, and Imaging

    CERN Document Server

    Lee, H; Dowling, J P; Lee, Hwang; Lougovski, Pavel; Dowling, Jonathan P.

    2005-01-01

    Information science is entering into a new era in which certain subtleties of quantum mechanics enables large enhancements in computational efficiency and communication security. Naturally, precise control of quantum systems required for the implementation of quantum information processing protocols implies potential breakthoughs in other sciences and technologies. We discuss recent developments in quantum control in optical systems and their applications in metrology and imaging.

  10. Quantum computing on encrypted data.

    Science.gov (United States)

    Fisher, K A G; Broadbent, A; Shalm, L K; Yan, Z; Lavoie, J; Prevedel, R; Jennewein, T; Resch, K J

    2014-01-01

    The ability to perform computations on encrypted data is a powerful tool for protecting privacy. Recently, protocols to achieve this on classical computing systems have been found. Here, we present an efficient solution to the quantum analogue of this problem that enables arbitrary quantum computations to be carried out on encrypted quantum data. We prove that an untrusted server can implement a universal set of quantum gates on encrypted quantum bits (qubits) without learning any information about the inputs, while the client, knowing the decryption key, can easily decrypt the results of the computation. We experimentally demonstrate, using single photons and linear optics, the encryption and decryption scheme on a set of gates sufficient for arbitrary quantum computations. As our protocol requires few extra resources compared with other schemes it can be easily incorporated into the design of future quantum servers. These results will play a key role in enabling the development of secure distributed quantum systems.

  11. Quantum computing on encrypted data

    Science.gov (United States)

    Fisher, K. A. G.; Broadbent, A.; Shalm, L. K.; Yan, Z.; Lavoie, J.; Prevedel, R.; Jennewein, T.; Resch, K. J.

    2014-01-01

    The ability to perform computations on encrypted data is a powerful tool for protecting privacy. Recently, protocols to achieve this on classical computing systems have been found. Here, we present an efficient solution to the quantum analogue of this problem that enables arbitrary quantum computations to be carried out on encrypted quantum data. We prove that an untrusted server can implement a universal set of quantum gates on encrypted quantum bits (qubits) without learning any information about the inputs, while the client, knowing the decryption key, can easily decrypt the results of the computation. We experimentally demonstrate, using single photons and linear optics, the encryption and decryption scheme on a set of gates sufficient for arbitrary quantum computations. As our protocol requires few extra resources compared with other schemes it can be easily incorporated into the design of future quantum servers. These results will play a key role in enabling the development of secure distributed quantum systems.

  12. Quantum computer for dummies (in Russian)

    OpenAIRE

    Grozin, Andrey

    2011-01-01

    An introduction (in Russian) to quantum computers, quantum cryptography, and quantum teleportation for students who have no previous knowledge of these subjects, but know quantum mechanics. Several simple examples are considered in detail using the quantum computer emulator QCL.

  13. Programmable architecture for quantum computing

    NARCIS (Netherlands)

    Chen, J.; Wang, L.; Charbon, E.; Wang, B.

    2013-01-01

    A programmable architecture called “quantum FPGA (field-programmable gate array)” (QFPGA) is presented for quantum computing, which is a hybrid model combining the advantages of the qubus system and the measurement-based quantum computation. There are two kinds of buses in QFPGA, the local bus and t

  14. Fluxon-controlled quantum computer

    Science.gov (United States)

    Fujii, Toshiyuki; Matsuo, Shigemasa; Hatakenaka, Noriyuki

    2016-11-01

    We propose a fluxon-controlled quantum computer incorporated with three-qubit quantum error correction using special gate operations, i.e. joint-phase and SWAP gate operations, inherent in capacitively coupled superconducting flux qubits. The proposed quantum computer acts exactly like a knitting machine at home.

  15. Programmable architecture for quantum computing

    NARCIS (Netherlands)

    Chen, J.; Wang, L.; Charbon, E.; Wang, B.

    2013-01-01

    A programmable architecture called “quantum FPGA (field-programmable gate array)” (QFPGA) is presented for quantum computing, which is a hybrid model combining the advantages of the qubus system and the measurement-based quantum computation. There are two kinds of buses in QFPGA, the local bus and t

  16. Quantum computing with defects.

    Science.gov (United States)

    Weber, J R; Koehl, W F; Varley, J B; Janotti, A; Buckley, B B; Van de Walle, C G; Awschalom, D D

    2010-05-11

    Identifying and designing physical systems for use as qubits, the basic units of quantum information, are critical steps in the development of a quantum computer. Among the possibilities in the solid state, a defect in diamond known as the nitrogen-vacancy (NV(-1)) center stands out for its robustness--its quantum state can be initialized, manipulated, and measured with high fidelity at room temperature. Here we describe how to systematically identify other deep center defects with similar quantum-mechanical properties. We present a list of physical criteria that these centers and their hosts should meet and explain how these requirements can be used in conjunction with electronic structure theory to intelligently sort through candidate defect systems. To illustrate these points in detail, we compare electronic structure calculations of the NV(-1) center in diamond with those of several deep centers in 4H silicon carbide (SiC). We then discuss the proposed criteria for similar defects in other tetrahedrally coordinated semiconductors.

  17. Digitized adiabatic quantum computing with a superconducting circuit.

    Science.gov (United States)

    Barends, R; Shabani, A; Lamata, L; Kelly, J; Mezzacapo, A; Las Heras, U; Babbush, R; Fowler, A G; Campbell, B; Chen, Yu; Chen, Z; Chiaro, B; Dunsworth, A; Jeffrey, E; Lucero, E; Megrant, A; Mutus, J Y; Neeley, M; Neill, C; O'Malley, P J J; Quintana, C; Roushan, P; Sank, D; Vainsencher, A; Wenner, J; White, T C; Solano, E; Neven, H; Martinis, John M

    2016-06-09

    Quantum mechanics can help to solve complex problems in physics and chemistry, provided they can be programmed in a physical device. In adiabatic quantum computing, a system is slowly evolved from the ground state of a simple initial Hamiltonian to a final Hamiltonian that encodes a computational problem. The appeal of this approach lies in the combination of simplicity and generality; in principle, any problem can be encoded. In practice, applications are restricted by limited connectivity, available interactions and noise. A complementary approach is digital quantum computing, which enables the construction of arbitrary interactions and is compatible with error correction, but uses quantum circuit algorithms that are problem-specific. Here we combine the advantages of both approaches by implementing digitized adiabatic quantum computing in a superconducting system. We tomographically probe the system during the digitized evolution and explore the scaling of errors with system size. We then let the full system find the solution to random instances of the one-dimensional Ising problem as well as problem Hamiltonians that involve more complex interactions. This digital quantum simulation of the adiabatic algorithm consists of up to nine qubits and up to 1,000 quantum logic gates. The demonstration of digitized adiabatic quantum computing in the solid state opens a path to synthesizing long-range correlations and solving complex computational problems. When combined with fault-tolerance, our approach becomes a general-purpose algorithm that is scalable.

  18. Digitized adiabatic quantum computing with a superconducting circuit

    Science.gov (United States)

    Barends, R.; Shabani, A.; Lamata, L.; Kelly, J.; Mezzacapo, A.; Heras, U. Las; Babbush, R.; Fowler, A. G.; Campbell, B.; Chen, Yu; Chen, Z.; Chiaro, B.; Dunsworth, A.; Jeffrey, E.; Lucero, E.; Megrant, A.; Mutus, J. Y.; Neeley, M.; Neill, C.; O'Malley, P. J. J.; Quintana, C.; Roushan, P.; Sank, D.; Vainsencher, A.; Wenner, J.; White, T. C.; Solano, E.; Neven, H.; Martinis, John M.

    2016-06-01

    Quantum mechanics can help to solve complex problems in physics and chemistry, provided they can be programmed in a physical device. In adiabatic quantum computing, a system is slowly evolved from the ground state of a simple initial Hamiltonian to a final Hamiltonian that encodes a computational problem. The appeal of this approach lies in the combination of simplicity and generality; in principle, any problem can be encoded. In practice, applications are restricted by limited connectivity, available interactions and noise. A complementary approach is digital quantum computing, which enables the construction of arbitrary interactions and is compatible with error correction, but uses quantum circuit algorithms that are problem-specific. Here we combine the advantages of both approaches by implementing digitized adiabatic quantum computing in a superconducting system. We tomographically probe the system during the digitized evolution and explore the scaling of errors with system size. We then let the full system find the solution to random instances of the one-dimensional Ising problem as well as problem Hamiltonians that involve more complex interactions. This digital quantum simulation of the adiabatic algorithm consists of up to nine qubits and up to 1,000 quantum logic gates. The demonstration of digitized adiabatic quantum computing in the solid state opens a path to synthesizing long-range correlations and solving complex computational problems. When combined with fault-tolerance, our approach becomes a general-purpose algorithm that is scalable.

  19. Layered Architecture for Quantum Computing

    National Research Council Canada - National Science Library

    Jones, N. Cody; Van Meter, Rodney; Fowler, Austin G; McMahon, Peter L; Kim, Jungsang; Ladd, Thaddeus D; Yamamoto, Yoshihisa

    2012-01-01

    .... We discuss many of the prominent techniques for implementing circuit-model quantum computing and introduce several new methods, with an emphasis on employing surface-code quantum error correction...

  20. Quantum computing: Efficient fault tolerance

    Science.gov (United States)

    Gottesman, Daniel

    2016-12-01

    Dealing with errors in a quantum computer typically requires complex programming and many additional quantum bits. A technique for controlling errors has been proposed that alleviates both of these problems.

  1. Hypercomputation based on quantum computing

    CERN Document Server

    Sicard, A; Ospina, J; Sicard, Andr\\'es; V\\'elez, Mario; Ospina, Juan

    2004-01-01

    We present a quantum algorithm for a (classically) incomputable decision problem: the Hilbert's tenth problem; namely, we present a hypercomputation model based on quantum computation. The model is inspired by the one proposed by Tien D. Kieu. Our model exploits the quantum adiabatic process and the characteristics of the representation of the dynamical algebra su(1,1) associated to the infinite square well. Furthermore, it is demonstrated that the model proposed is a universal quantum computation model.

  2. Addition on a Quantum Computer

    CERN Document Server

    Draper, Thomas G

    2000-01-01

    A new method for computing sums on a quantum computer is introduced. This technique uses the quantum Fourier transform and reduces the number of qubits necessary for addition by removing the need for temporary carry bits. This approach also allows the addition of a classical number to a quantum superposition without encoding the classical number in the quantum register. This method also allows for massive parallelization in its execution.

  3. Interfacing external quantum devices to a universal quantum computer.

    Science.gov (United States)

    Lagana, Antonio A; Lohe, Max A; von Smekal, Lorenz

    2011-01-01

    We present a scheme to use external quantum devices using the universal quantum computer previously constructed. We thereby show how the universal quantum computer can utilize networked quantum information resources to carry out local computations. Such information may come from specialized quantum devices or even from remote universal quantum computers. We show how to accomplish this by devising universal quantum computer programs that implement well known oracle based quantum algorithms, namely the Deutsch, Deutsch-Jozsa, and the Grover algorithms using external black-box quantum oracle devices. In the process, we demonstrate a method to map existing quantum algorithms onto the universal quantum computer.

  4. Interfacing external quantum devices to a universal quantum computer.

    Directory of Open Access Journals (Sweden)

    Antonio A Lagana

    Full Text Available We present a scheme to use external quantum devices using the universal quantum computer previously constructed. We thereby show how the universal quantum computer can utilize networked quantum information resources to carry out local computations. Such information may come from specialized quantum devices or even from remote universal quantum computers. We show how to accomplish this by devising universal quantum computer programs that implement well known oracle based quantum algorithms, namely the Deutsch, Deutsch-Jozsa, and the Grover algorithms using external black-box quantum oracle devices. In the process, we demonstrate a method to map existing quantum algorithms onto the universal quantum computer.

  5. Massively parallel quantum computer simulator

    NARCIS (Netherlands)

    De Raedt, K.; Michielsen, K.; De Raedt, H.; Trieu, B.; Arnold, G.; Richter, M.; Lippert, Th.; Watanabe, H.; Ito, N.

    2007-01-01

    We describe portable software to simulate universal quantum computers on massive parallel Computers. We illustrate the use of the simulation software by running various quantum algorithms on different computer architectures, such as a IBM BlueGene/L, a IBM Regatta p690+, a Hitachi SR11000/J1, a Cray

  6. Towards quantum chemistry on a quantum computer.

    Science.gov (United States)

    Lanyon, B P; Whitfield, J D; Gillett, G G; Goggin, M E; Almeida, M P; Kassal, I; Biamonte, J D; Mohseni, M; Powell, B J; Barbieri, M; Aspuru-Guzik, A; White, A G

    2010-02-01

    Exact first-principles calculations of molecular properties are currently intractable because their computational cost grows exponentially with both the number of atoms and basis set size. A solution is to move to a radically different model of computing by building a quantum computer, which is a device that uses quantum systems themselves to store and process data. Here we report the application of the latest photonic quantum computer technology to calculate properties of the smallest molecular system: the hydrogen molecule in a minimal basis. We calculate the complete energy spectrum to 20 bits of precision and discuss how the technique can be expanded to solve large-scale chemical problems that lie beyond the reach of modern supercomputers. These results represent an early practical step toward a powerful tool with a broad range of quantum-chemical applications.

  7. Stability of the electroweak ground state in the Standard Model and its extensions

    Directory of Open Access Journals (Sweden)

    Luca Di Luzio

    2016-02-01

    Full Text Available We review the formalism by which the tunnelling probability of an unstable ground state can be computed in quantum field theory, with special reference to the Standard Model of electroweak interactions. We describe in some detail the approximations implicitly adopted in such calculation. Particular attention is devoted to the role of scale invariance, and to the different implications of scale-invariance violations due to quantum effects and possible new degrees of freedom. We show that new interactions characterized by a new energy scale, close to the Planck mass, do not invalidate the main conclusions about the stability of the Standard Model ground state derived in absence of such terms.

  8. Fault-tolerant quantum computation

    CERN Document Server

    Preskill, J

    1997-01-01

    The discovery of quantum error correction has greatly improved the long-term prospects for quantum computing technology. Encoded quantum information can be protected from errors that arise due to uncontrolled interactions with the environment, or due to imperfect implementations of quantum logical operations. Recovery from errors can work effectively even if occasional mistakes occur during the recovery procedure. Furthermore, encoded quantum information can be processed without serious propagation of errors. In principle, an arbitrarily long quantum computation can be performed reliably, provided that the average probability of error per gate is less than a certain critical value, the accuracy threshold. It may be possible to incorporate intrinsic fault tolerance into the design of quantum computing hardware, perhaps by invoking topological Aharonov-Bohm interactions to process quantum information.

  9. The Semi-Quantum Computer

    CERN Document Server

    Vianna, R O; Monken, C H; Vianna, Reinaldo O.; Rabelo, Wilson R. M.

    2003-01-01

    We discuss the performance of the Search and Fourier Transform algorithms on a hybrid computer constituted of classical and quantum processors working together. We show that this semi-quantum computer would be an improvement over a pure classical architecture, no matter how few qubits are available and, therefore, it suggests an easier implementable technology than a pure quantum computer with arbitrary number of qubits.

  10. Quantum information. Teleportation - cryptography - quantum computer; Quanteninformation. Teleportation - Kryptografie - Quantencomputer

    Energy Technology Data Exchange (ETDEWEB)

    Koenneker, Carsten (comp.)

    2012-11-01

    The following topics are dealt with: Reality in the test facility, quantum teleportation, the reality of quanta, interaction-free quantum measurement, rules for quantum computers, quantum computers with ions, spintronics with diamond, the limits of the quantum computers, a view in the future of quantum optics. (HSI)

  11. Simulation of electronic structure Hamiltonians in a superconducting quantum computer architecture

    Energy Technology Data Exchange (ETDEWEB)

    Kaicher, Michael; Wilhelm, Frank K. [Theoretical Physics, Saarland University, 66123 Saarbruecken (Germany); Love, Peter J. [Department of Physics, Haverford College, Haverford, Pennsylvania 19041 (United States)

    2015-07-01

    Quantum chemistry has become one of the most promising applications within the field of quantum computation. Simulating the electronic structure Hamiltonian (ESH) in the Bravyi-Kitaev (BK)-Basis to compute the ground state energies of atoms/molecules reduces the number of qubit operations needed to simulate a single fermionic operation to O(log(n)) as compared to O(n) in the Jordan-Wigner-Transformation. In this work we will present the details of the BK-Transformation, show an example of implementation in a superconducting quantum computer architecture and compare it to the most recent quantum chemistry algorithms suggesting a constant overhead.

  12. Spin Glass a Bridge Between Quantum Computation and Statistical Mechanics

    Science.gov (United States)

    Ohzeki, Masayuki

    2013-09-01

    In this chapter, we show two fascinating topics lying between quantum information processing and statistical mechanics. First, we introduce an elaborated technique, the surface code, to prepare the particular quantum state with robustness against decoherence. Interestingly, the theoretical limitation of the surface code, accuracy threshold, to restore the quantum state has a close connection with the problem on the phase transition in a special model known as spin glasses, which is one of the most active researches in statistical mechanics. The phase transition in spin glasses is an intractable problem, since we must strive many-body system with complicated interactions with change of their signs depending on the distance between spins. Fortunately, recent progress in spin-glass theory enables us to predict the precise location of the critical point, at which the phase transition occurs. It means that statistical mechanics is available for revealing one of the most interesting parts in quantum information processing. We show how to import the special tool in statistical mechanics into the problem on the accuracy threshold in quantum computation. Second, we show another interesting technique to employ quantum nature, quantum annealing. The purpose of quantum annealing is to search for the most favored solution of a multivariable function, namely optimization problem. The most typical instance is the traveling salesman problem to find the minimum tour while visiting all the cities. In quantum annealing, we introduce quantum fluctuation to drive a particular system with the artificial Hamiltonian, in which the ground state represents the optimal solution of the specific problem we desire to solve. Induction of the quantum fluctuation gives rise to the quantum tunneling effect, which allows nontrivial hopping from state to state. We then sketch a strategy to control the quantum fluctuation efficiently reaching the ground state. Such a generic framework is called

  13. A global approach to ground state solutions

    Directory of Open Access Journals (Sweden)

    Philip Korman

    2008-08-01

    Full Text Available We study radial solutions of semilinear Laplace equations. We try to understand all solutions of the problem, regardless of the boundary behavior. It turns out that one can study uniqueness or multiplicity properties of ground state solutions by considering curves of solutions of the corresponding Dirichlet and Neumann problems. We show that uniqueness of ground state solutions can sometimes be approached by a numerical computation.

  14. A global approach to ground state solutions

    OpenAIRE

    2008-01-01

    We study radial solutions of semilinear Laplace equations. We try to understand all solutions of the problem, regardless of the boundary behavior. It turns out that one can study uniqueness or multiplicity properties of ground state solutions by considering curves of solutions of the corresponding Dirichlet and Neumann problems. We show that uniqueness of ground state solutions can sometimes be approached by a numerical computation.

  15. Quantum Computing over Finite Fields

    CERN Document Server

    James, Roshan P; Sabry, Amr

    2011-01-01

    In recent work, Benjamin Schumacher and Michael~D. Westmoreland investigate a version of quantum mechanics which they call "modal quantum theory" but which we prefer to call "discrete quantum theory". This theory is obtained by instantiating the mathematical framework of Hilbert spaces with a finite field instead of the field of complex numbers. This instantiation collapses much the structure of actual quantum mechanics but retains several of its distinguishing characteristics including the notions of superposition, interference, and entanglement. Furthermore, discrete quantum theory excludes local hidden variable models, has a no-cloning theorem, and can express natural counterparts of quantum information protocols such as superdense coding and teleportation. Our first result is to distill a model of discrete quantum computing from this quantum theory. The model is expressed using a monadic metalanguage built on top of a universal reversible language for finite computations, and hence is directly implementab...

  16. Simulating chemistry using quantum computers

    CERN Document Server

    Kassal, Ivan; Perdomo-Ortiz, Alejandro; Yung, Man-Hong; Aspuru-Guzik, Alán

    2010-01-01

    The difficulty of simulating quantum systems, well-known to quantum chemists, prompted the idea of quantum computation. One can avoid the steep scaling associated with the exact simulation of increasingly large quantum systems on conventional computers, by mapping the quantum system to another, more controllable one. In this review, we discuss to what extent the ideas in quantum computation, now a well-established field, have been applied to chemical problems. We describe algorithms that achieve significant advantages for the electronic-structure problem, the simulation of chemical dynamics, protein folding, and other tasks. Although theory is still ahead of experiment, we outline recent advances that have led to the first chemical calculations on small quantum information processors.

  17. Simulating chemistry using quantum computers.

    Science.gov (United States)

    Kassal, Ivan; Whitfield, James D; Perdomo-Ortiz, Alejandro; Yung, Man-Hong; Aspuru-Guzik, Alán

    2011-01-01

    The difficulty of simulating quantum systems, well known to quantum chemists, prompted the idea of quantum computation. One can avoid the steep scaling associated with the exact simulation of increasingly large quantum systems on conventional computers, by mapping the quantum system to another, more controllable one. In this review, we discuss to what extent the ideas in quantum computation, now a well-established field, have been applied to chemical problems. We describe algorithms that achieve significant advantages for the electronic-structure problem, the simulation of chemical dynamics, protein folding, and other tasks. Although theory is still ahead of experiment, we outline recent advances that have led to the first chemical calculations on small quantum information processors.

  18. Algorithms on ensemble quantum computers.

    Science.gov (United States)

    Boykin, P Oscar; Mor, Tal; Roychowdhury, Vwani; Vatan, Farrokh

    2010-06-01

    In ensemble (or bulk) quantum computation, all computations are performed on an ensemble of computers rather than on a single computer. Measurements of qubits in an individual computer cannot be performed; instead, only expectation values (over the complete ensemble of computers) can be measured. As a result of this limitation on the model of computation, many algorithms cannot be processed directly on such computers, and must be modified, as the common strategy of delaying the measurements usually does not resolve this ensemble-measurement problem. Here we present several new strategies for resolving this problem. Based on these strategies we provide new versions of some of the most important quantum algorithms, versions that are suitable for implementing on ensemble quantum computers, e.g., on liquid NMR quantum computers. These algorithms are Shor's factorization algorithm, Grover's search algorithm (with several marked items), and an algorithm for quantum fault-tolerant computation. The first two algorithms are simply modified using a randomizing and a sorting strategies. For the last algorithm, we develop a classical-quantum hybrid strategy for removing measurements. We use it to present a novel quantum fault-tolerant scheme. More explicitly, we present schemes for fault-tolerant measurement-free implementation of Toffoli and σ(z)(¼) as these operations cannot be implemented "bitwise", and their standard fault-tolerant implementations require measurement.

  19. Quantum information processing in nanostructures Quantum optics; Quantum computing

    CERN Document Server

    Reina-Estupinan, J H

    2002-01-01

    Since information has been regarded os a physical entity, the field of quantum information theory has blossomed. This brings novel applications, such as quantum computation. This field has attracted the attention of numerous researchers with backgrounds ranging from computer science, mathematics and engineering, to the physical sciences. Thus, we now have an interdisciplinary field where great efforts are being made in order to build devices that should allow for the processing of information at a quantum level, and also in the understanding of the complex structure of some physical processes at a more basic level. This thesis is devoted to the theoretical study of structures at the nanometer-scale, 'nanostructures', through physical processes that mainly involve the solid-state and quantum optics, in order to propose reliable schemes for the processing of quantum information. Initially, the main results of quantum information theory and quantum computation are briefly reviewed. Next, the state-of-the-art of ...

  20. Models of optical quantum computing

    Directory of Open Access Journals (Sweden)

    Krovi Hari

    2017-03-01

    Full Text Available I review some work on models of quantum computing, optical implementations of these models, as well as the associated computational power. In particular, we discuss the circuit model and cluster state implementations using quantum optics with various encodings such as dual rail encoding, Gottesman-Kitaev-Preskill encoding, and coherent state encoding. Then we discuss intermediate models of optical computing such as boson sampling and its variants. Finally, we review some recent work in optical implementations of adiabatic quantum computing and analog optical computing. We also provide a brief description of the relevant aspects from complexity theory needed to understand the results surveyed.

  1. Singlet Ground State Magnetism:

    DEFF Research Database (Denmark)

    Loidl, A.; Knorr, K.; Kjems, Jørgen;

    1979-01-01

    The magneticGamma 1 –Gamma 4 exciton of the singlet ground state system TbP has been studied by inelastic neutron scattering above the antiferromagnetic ordering temperature. Considerable dispersion and a pronounced splitting was found in the [100] and [110] directions. Both the band width...... and the splitting increased rapidly as the transition temperature was approached in accordance with the predictions of the RPA-theory. The dispersion is analysed in terms of a phenomenological model using interactions up to the fourth nearest neighbour....

  2. Quasicrystals and Quantum Computing

    Science.gov (United States)

    Berezin, Alexander A.

    1997-03-01

    In Quantum (Q) Computing qubits form Q-superpositions for macroscopic times. One scheme for ultra-fast (Q) computing can be based on quasicrystals. Ultrafast processing in Q-coherent structures (and the very existence of durable Q-superpositions) may be 'consequence' of presence of entire manifold of integer arithmetic (A0, aleph-naught of Georg Cantor) at any 4-point of space-time, furthermore, at any point of any multidimensional phase space of (any) N-particle Q-system. The latter, apart from quasicrystals, can include dispersed and/or diluted systems (Berezin, 1994). In such systems such alleged centrepieces of Q-Computing as ability for fast factorization of long integers can be processed by sheer virtue of the fact that entire infinite pattern of prime numbers is instantaneously available as 'free lunch' at any instant/point. Infinitely rich pattern of A0 (including pattern of primes and almost primes) acts as 'independent' physical effect which directly generates Q-dynamics (and physical world) 'out of nothing'. Thus Q-nonlocality can be ultimately based on instantaneous interconnectedness through ever- the-same structure of A0 ('Platonic field' of integers).

  3. The Physics of Quantum Computation

    Science.gov (United States)

    Falci, Giuseppe; Paladino, Elisabette

    2015-10-01

    Quantum Computation has emerged in the past decades as a consequence of down-scaling of electronic devices to the mesoscopic regime and of advances in the ability of controlling and measuring microscopic quantum systems. QC has many interdisciplinary aspects, ranging from physics and chemistry to mathematics and computer science. In these lecture notes we focus on physical hardware, present day challenges and future directions for design of quantum architectures.

  4. Quantum computing with collective ensembles of multilevel systems.

    Science.gov (United States)

    Brion, E; Mølmer, K; Saffman, M

    2007-12-31

    We propose a new physical approach for encoding and processing of quantum information in ensembles of multilevel quantum systems, where the different bits are not carried by individual particles but associated with the collective population of different internal levels. One- and two-bit gates are implemented by collective internal state transitions taking place in the presence of an excitation blockade mechanism, which restricts the population of each internal state to the values zero and unity. Quantum computers with 10-20 bits can be built via this scheme in single trapped clouds of ground state atoms subject to the Rydberg excitation blockade mechanism, and the linear dependence between register size and the number of internal quantum states in atoms offers realistic means to reach larger registers.

  5. Avoiding Quantum Chaos in Quantum Computation

    CERN Document Server

    Berman, G P; Izrailev, F M; Tsifrinovich, V I

    2001-01-01

    We study a one-dimensional chain of nuclear $1/2-$spins in an external time-dependent magnetic field. This model is considered as a possible candidate for experimental realization of quantum computation. According to the general theory of interacting particles, one of the most dangerous effects is quantum chaos which can destroy the stability of quantum operations. According to the standard viewpoint, the threshold for the onset of quantum chaos due to an interaction between spins (qubits) strongly decreases with an increase of the number of qubits. Contrary to this opinion, we show that the presence of a magnetic field gradient helps to avoid quantum chaos which turns out to disappear with an increase of the number of qubits. We give analytical estimates which explain this effect, together with numerical data supporting

  6. Quantum entanglement and quantum computational algorithms

    Indian Academy of Sciences (India)

    Arvind

    2001-02-01

    The existence of entangled quantum states gives extra power to quantum computers over their classical counterparts. Quantum entanglement shows up qualitatively at the level of two qubits. We demonstrate that the one- and the two-bit Deutsch-Jozsa algorithm does not require entanglement and can be mapped onto a classical optical scheme. It is only for three and more input bits that the DJ algorithm requires the implementation of entangling transformations and in these cases it is impossible to implement this algorithm classically

  7. Quantum computing in neural networks

    CERN Document Server

    Gralewicz, P

    2004-01-01

    According to the statistical interpretation of quantum theory, quantum computers form a distinguished class of probabilistic machines (PMs) by encoding n qubits in 2n pbits. This raises the possibility of a large-scale quantum computing using PMs, especially with neural networks which have the innate capability for probabilistic information processing. Restricting ourselves to a particular model, we construct and numerically examine the performance of neural circuits implementing universal quantum gates. A discussion on the physiological plausibility of proposed coding scheme is also provided.

  8. Quantum Computation Beyond the Circuit Model

    OpenAIRE

    Jordan, Stephen P.

    2008-01-01

    The quantum circuit model is the most widely used model of quantum computation. It provides both a framework for formulating quantum algorithms and an architecture for the physical construction of quantum computers. However, several other models of quantum computation exist which provide useful alternative frameworks for both discovering new quantum algorithms and devising new physical implementations of quantum computers. In this thesis, I first present necessary background material for a ge...

  9. Ground state of a confined Yukawa plasma

    CERN Document Server

    Henning, C; Block, D; Bonitz, M; Golubnichiy, V; Ludwig, P; Piel, A

    2006-01-01

    The ground state of an externally confined one-component Yukawa plasma is derived analytically. In particular, the radial density profile is computed. The results agree very well with computer simulations on three-dimensional spherical Coulomb crystals. We conclude in presenting an exact equation for the density distribution for a confinement potential of arbitrary geometry.

  10. Cryptography, quantum computation and trapped ions

    Energy Technology Data Exchange (ETDEWEB)

    Hughes, Richard J.

    1998-03-01

    The significance of quantum computation for cryptography is discussed. Following a brief survey of the requirements for quantum computational hardware, an overview of the ion trap quantum computation project at Los Alamos is presented. The physical limitations to quantum computation with trapped ions are analyzed and an assessment of the computational potential of the technology is made.

  11. Universal blind quantum computation for hybrid system

    Science.gov (United States)

    Huang, He-Liang; Bao, Wan-Su; Li, Tan; Li, Feng-Guang; Fu, Xiang-Qun; Zhang, Shuo; Zhang, Hai-Long; Wang, Xiang

    2017-08-01

    As progress on the development of building quantum computer continues to advance, first-generation practical quantum computers will be available for ordinary users in the cloud style similar to IBM's Quantum Experience nowadays. Clients can remotely access the quantum servers using some simple devices. In such a situation, it is of prime importance to keep the security of the client's information. Blind quantum computation protocols enable a client with limited quantum technology to delegate her quantum computation to a quantum server without leaking any privacy. To date, blind quantum computation has been considered only for an individual quantum system. However, practical universal quantum computer is likely to be a hybrid system. Here, we take the first step to construct a framework of blind quantum computation for the hybrid system, which provides a more feasible way for scalable blind quantum computation.

  12. Experimental quantum computing without entanglement.

    Science.gov (United States)

    Lanyon, B P; Barbieri, M; Almeida, M P; White, A G

    2008-11-14

    Deterministic quantum computation with one pure qubit (DQC1) is an efficient model of computation that uses highly mixed states. Unlike pure-state models, its power is not derived from the generation of a large amount of entanglement. Instead it has been proposed that other nonclassical correlations are responsible for the computational speedup, and that these can be captured by the quantum discord. In this Letter we implement DQC1 in an all-optical architecture, and experimentally observe the generated correlations. We find no entanglement, but large amounts of quantum discord-except in three cases where an efficient classical simulation is always possible. Our results show that even fully separable, highly mixed, states can contain intrinsically quantum mechanical correlations and that these could offer a valuable resource for quantum information technologies.

  13. Repeat-until-success linear optics distributed quantum computing.

    Science.gov (United States)

    Lim, Yuan Liang; Beige, Almut; Kwek, Leong Chuan

    2005-07-15

    We demonstrate the possibility to perform distributed quantum computing using only single-photon sources (atom-cavity-like systems), linear optics, and photon detectors. The qubits are encoded in stable ground states of the sources. To implement a universal two-qubit gate, two photons should be generated simultaneously and pass through a linear optics network, where a measurement is performed on them. Gate operations can be repeated until a success is heralded without destroying the qubits at any stage of the operation. In contrast with other schemes, this does not require explicit qubit-qubit interactions, a priori entangled ancillas, nor the feeding of photons into photon sources.

  14. Quantum information and computing

    CERN Document Server

    Ohya, M; Watanabe, N

    2006-01-01

    The main purpose of this volume is to emphasize the multidisciplinary aspects of this very active new line of research in which concrete technological and industrial realizations require the combined efforts of experimental and theoretical physicists, mathematicians and engineers. Contents: Coherent Quantum Control of ?-Atoms through the Stochastic Limit (L Accardi et al.); Recent Advances in Quantum White Noise Calculus (L Accardi & A Boukas); Joint Extension of States of Fermion Subsystems (H Araki); Fidelity of Quantum Teleportation Model Using Beam Splittings (K-H Fichtner et al.); Quantum

  15. Computing on Anonymous Quantum Network

    CERN Document Server

    Kobayashi, Hirotada; Tani, Seiichiro

    2010-01-01

    This paper considers distributed computing on an anonymous quantum network, a network in which no party has a unique identifier and quantum communication and computation are available. It is proved that the leader election problem can exactly (i.e., without error in bounded time) be solved with at most the same complexity up to a constant factor as that of exactly computing symmetric functions (without intermediate measurements for a distributed and superposed input), if the number of parties is given to every party. A corollary of this result is a more efficient quantum leader election algorithm than existing ones: the new quantum algorithm runs in O(n) rounds with bit complexity O(mn^2), on an anonymous quantum network with n parties and m communication links. Another corollary is the first quantum algorithm that exactly computes any computable Boolean function with round complexity O(n) and with smaller bit complexity than that of existing classical algorithms in the worst case over all (computable) Boolea...

  16. Quantum-enhanced Sensing and Efficient Quantum Computation

    Science.gov (United States)

    2015-07-27

    Quantum -enhanced sensing and efficient quantum computation Ian Walmsley THE UNIVERSITY OF...COVERED (From - To) 1 February 2013 - 31 January 2015 4. TITLE AND SUBTITLE Quantum -enhanced sensing and efficient quantum computation 5a. CONTRACT...1895616013 Standard Form 298 (Rev. 8/98) Prescribed by ANSI Std. Z39.18 Final report for “ Quantum ‐Enhanced Sensing and Efficient  Quantum   Computation

  17. Quantum Computing via The Bethe Ansatz

    OpenAIRE

    Zhang, Yong,

    2011-01-01

    We recognize quantum circuit model of computation as factorisable scattering model and propose that a quantum computer is associated with a quantum many-body system solved by the Bethe ansatz. As an typical example to support our perspectives on quantum computation, we study quantum computing in one-dimensional nonrelativistic system with delta-function interaction, where the two-body scattering matrix satisfies the factorisation equation (the quantum Yang--Baxter equation) and acts as a para...

  18. A quantum computer network

    CERN Document Server

    Kesidis, George

    2009-01-01

    Wong's diffusion network is a stochastic, zero-input Hopfield network with a Gibbs stationary distribution over a bounded, connected continuum. Previously, logarithmic thermal annealing was demonstrated for the diffusion network and digital versions of it were studied and applied to imaging. Recently, "quantum" annealed Markov chains have garnered significant attention because of their improved performance over "pure" thermal annealing. In this note, a joint quantum and thermal version of Wong's diffusion network is described and its convergence properties are studied. Different choices for "auxiliary" functions are discussed, including those of the kinetic type previously associated with quantum annealing.

  19. Massive Parallel Quantum Computer Simulator

    CERN Document Server

    De Raedt, K; De Raedt, H; Ito, N; Lippert, T; Michielsen, K; Richter, M; Trieu, B; Watanabe, H; Lippert, Th.

    2006-01-01

    We describe portable software to simulate universal quantum computers on massive parallel computers. We illustrate the use of the simulation software by running various quantum algorithms on different computer architectures, such as a IBM BlueGene/L, a IBM Regatta p690+, a Hitachi SR11000/J1, a Cray X1E, a SGI Altix 3700 and clusters of PCs running Windows XP. We study the performance of the software by simulating quantum computers containing up to 36 qubits, using up to 4096 processors and up to 1 TB of memory. Our results demonstrate that the simulator exhibits nearly ideal scaling as a function of the number of processors and suggest that the simulation software described in this paper may also serve as benchmark for testing high-end parallel computers.

  20. Thermal ground state and nonthermal probes

    CERN Document Server

    Grandou, Thierry

    2015-01-01

    The Euclidean formulation of SU(2) Yang-Mills thermodynamics admits periodic, (anti)selfdual solutions to the fundamental, classical equation of motion which possess one unit of topological charge: (anti)calorons. A spatial coarse graining over the central region in a pair of such localised field configurations with trivial holonomy generates an inert adjoint scalar field $\\phi$, effectively describing the pure quantum part of the thermal ground state in the induced quantum field theory. The latter's local vertices are mediated by just-not-resolved (anti)caloron centers of action $\\hbar$. This is the basic reason for a rapid convergence of the loop expansion of thermodynamical quantities, polarization tensors, etc., their effective loop momenta being severely constrained in entirely fixed and physical unitary-Coulomb gauge. Here we show for the limit of zero holonomy how (anti)calorons associate a temperature independent electric permittivity and magnetic permeability to the thermal ground state of SU(2)$_{\\t...

  1. Continuous Quantum Computation

    Science.gov (United States)

    2007-03-01

    Eigenvalues and Eigenvectors”, by D.S. Abrams and S. Lloyd Physical Review Letters , 1999, Vol. 83, 5162-5156 [6] “Design of Strongly Modulating...by Y.S. Weinstein, S.Lloyd, J.V. Emerson and D.G. Cory, Physical Review Letters , 2002, Vol. 89,157902 [8] “The Edge of Quantum Chaos”, by Y.S...Weinstein, S. Lloyd and C. Tsallis, Physical Review Letters , 2002, Vol. 89, 214101 [9] “Fidelity Decay as an Efficient Indicator of Quantum Chaos

  2. Delegating private quantum computations12

    Science.gov (United States)

    Broadbent, Anne

    2015-09-01

    We give a protocol for the delegation of quantum computation on encrypted data. More specifically, we show that in a client-server scenario, where the client holds the encryption key for an encrypted quantum register held by the server, it is possible for the server to perform a universal set of quantum gates on the quantum data. All Clifford group gates are non-interactive, while the remaining non-Clifford group gate that we implement (the p/8 gate) requires the client to prepare and send a single random auxiliary qubit (chosen among four possibilities), and exchange classical communication. This construction improves on previous work, which requires either multiple auxiliary qubits or two-way quantum communication. Using a reduction to an entanglement-based protocol, we show privacy against any adversarial server according to a simulation-based security definition.

  3. QCE : A Simulator for Quantum Computer Hardware

    NARCIS (Netherlands)

    Michielsen, Kristel; Raedt, Hans De

    2003-01-01

    The Quantum Computer Emulator (QCE) described in this paper consists of a simulator of a generic, general purpose quantum computer and a graphical user interface. The latter is used to control the simulator, to define the hardware of the quantum computer and to debug and execute quantum algorithms.

  4. Blind Quantum Computation

    DEFF Research Database (Denmark)

    Salvail, Louis; Arrighi, Pablo

    2006-01-01

    protocol for the class of functions which admit an efficient procedure to generate random input-output pairs, e.g. factorization. The cheat-sensitive security achieved relies only upon quantum theory being true. The security analysis carried out assumes the eavesdropper performs individual attacks....

  5. Cavity QED: applications to quantum computation

    Science.gov (United States)

    Xiong, Han; Zubairy, M. Suhail

    2004-10-01

    Possible schemes to implement the basic quantum gates for quantum computation have been presented based on cavity quantum electrodynamics (QED) systems. We then discuss schemes to implement several important quantum algorithms such as the discrete quantum fourier transform (QFT) algorithm and Grover's quantum search algorithm based on these quantum gates. Some other applications of cavity QED based systems including the implementations of a quantum disentanglement eraser and an entanglement amplifier are also discussed.

  6. Handbook of computational quantum chemistry

    CERN Document Server

    Cook, David B

    2005-01-01

    Quantum chemistry forms the basis of molecular modeling, a tool widely used to obtain important chemical information and visual images of molecular systems. Recent advances in computing have resulted in considerable developments in molecular modeling, and these developments have led to significant achievements in the design and synthesis of drugs and catalysts. This comprehensive text provides upper-level undergraduates and graduate students with an introduction to the implementation of quantum ideas in molecular modeling, exploring practical applications alongside theoretical explanations.Wri

  7. Using a quantum computer to investigate quantum chaos

    OpenAIRE

    Schack, Ruediger

    1997-01-01

    We show that the quantum baker's map, a prototypical map invented for theoretical studies of quantum chaos, has a very simple realization in terms of quantum gates. Chaos in the quantum baker's map could be investigated experimentally on a quantum computer based on only 3 qubits.

  8. Computational studies of quantum dot sensitized solar cells

    Science.gov (United States)

    Kolesov, Grigory

    This thesis presents a computational study of quantum dot (QD) sensitized solar cells. First part deals with the non-equilibrium many-body theory or non-equilibrium Green's function (NEGF) theory. In this approach I study electron dynamics in the quantum-dot sensitized solar cell subjected to time-dependent fields. NEGF theory, because it does not impose any conditions on a perturbation, is the fundamental one to describe ultrafast processes in small, strongly correlated systems and/or in strong fields. In this research I do not only perform analytical derivation, but also design and implement spectral numerical solution for the resulting complex system of partial integrodifferential equations. This numerical solution yielded an order of magnitude speedup over the methods used previously in the field. The forth chapter of this thesis deals with calculation of optical properties and the ground state configuration of Zn2SnO4 (ZTO). ZTO is used by experimentalists in UW to grow nanorods which are then sensitized by QDs. ZTO is a challenging material for computational analysis because of its inverse spinel structure; thus it has an immense number of configurations matching the X-ray diffraction experiments. I've applied a cluster expansion method and have found the ground state configuration and phase diagram for ZTO. Calculations of optical properties of ground state bulk ZTO were done with a recently developed DFT functional. The optical band gap obtained in these calculations matched the experimental value. The last chapter describes development of the general simulator for interdigitated array electrodes. The application of this simulation together with the experiments may lead to understanding of reaction parameters and mechanisms important for development of electrochemical solar cells.

  9. Crushing runtimes in adiabatic quantum computation with Energy Landscape Manipulation (ELM): Application to Quantum Factoring

    Science.gov (United States)

    Dattani, Nike; Tanburn, Richard; Lunt, Oliver

    We introduce two methods for speeding up adiabatic quantum computations by increasing the energy between the ground and first excited states. Our methods are even more general. They can be used to shift a Hamiltonian's density of states away from the ground state, so that fewer states occupy the low-lying energies near the minimum, hence allowing for faster adiabatic passages to find the ground state with less risk of getting caught in an undesired low-lying excited state during the passage. Even more generally, our methods can be used to transform a discrete optimization problem into a new one whose unique minimum still encodes the desired answer, but with the objective function's values forming a different landscape. Aspects of the landscape such as the objective function's range, or the values of certain coefficients, or how many different inputs lead to a given output value, can be decreased *or* increased. One of the many examples for which these methods are useful is in finding the ground state of a Hamiltonian using NMR. We apply our methods to an AQC algorithm for integer factorization, and the first method reduces the maximum runtime in our example by up to 754%, and the second method reduces the maximum runtime of another example by up to 250%.

  10. Adiabatic quantum computation along quasienergies

    CERN Document Server

    Tanaka, Atushi

    2009-01-01

    The parametric deformations of quasienergies and eigenvectors of unitary operators are applied to the design of quantum adiabatic algorithms. The conventional, standard adiabatic quantum computation proceeds along eigenenergies of parameter-dependent Hamiltonians. By contrast, discrete adiabatic computation utilizes adiabatic passage along the quasienergies of parameter-dependent unitary operators. For example, such computation can be realized by a concatenation of parameterized quantum circuits, with an adiabatic though inevitably discrete change of the parameter. A design principle of adiabatic passage along quasienergy is recently proposed: Cheon's quasienergy and eigenspace anholonomies on unitary operators is available to realize anholonomic adiabatic algorithms [Tanaka and Miyamoto, Phys. Rev. Lett. 98, 160407 (2007)], which compose a nontrivial family of discrete adiabatic algorithms. It is straightforward to port a standard adiabatic algorithm to an anholonomic adiabatic one, except an introduction of...

  11. Quantum Walks for Computer Scientists

    CERN Document Server

    Venegas-Andraca, Salvador

    2008-01-01

    Quantum computation, one of the latest joint ventures between physics and the theory of computation, is a scientific field whose main goals include the development of hardware and algorithms based on the quantum mechanical properties of those physical systems used to implement such algorithms. Solving difficult tasks (for example, the Satisfiability Problem and other NP-complete problems) requires the development of sophisticated algorithms, many of which employ stochastic processes as their mathematical basis. Discrete random walks are a popular choice among those stochastic processes. Inspir

  12. Reversible computing fundamentals, quantum computing, and applications

    CERN Document Server

    De Vos, Alexis

    2010-01-01

    Written by one of the few top internationally recognized experts in the field, this book concentrates on those topics that will remain fundamental, such as low power computing, reversible programming languages, and applications in thermodynamics. It describes reversible computing from various points of view: Boolean algebra, group theory, logic circuits, low-power electronics, communication, software, quantum computing. It is this multidisciplinary approach that makes it unique.Backed by numerous examples, this is useful for all levels of the scientific and academic community, from undergr

  13. Atomic physics: A milestone in quantum computing

    Science.gov (United States)

    Bartlett, Stephen D.

    2016-08-01

    Quantum computers require many quantum bits to perform complex calculations, but devices with more than a few bits are difficult to program. A device based on five atomic quantum bits shows a way forward. See Letter p.63

  14. Nanophotonic quantum computer based on atomic quantum transistor

    Energy Technology Data Exchange (ETDEWEB)

    Andrianov, S N [Institute of Advanced Research, Academy of Sciences of the Republic of Tatarstan, Kazan (Russian Federation); Moiseev, S A [Kazan E. K. Zavoisky Physical-Technical Institute, Kazan Scientific Center, Russian Academy of Sciences, Kazan (Russian Federation)

    2015-10-31

    We propose a scheme of a quantum computer based on nanophotonic elements: two buses in the form of nanowaveguide resonators, two nanosized units of multiatom multiqubit quantum memory and a set of nanoprocessors in the form of photonic quantum transistors, each containing a pair of nanowaveguide ring resonators coupled via a quantum dot. The operation modes of nanoprocessor photonic quantum transistors are theoretically studied and the execution of main logical operations by means of them is demonstrated. We also discuss the prospects of the proposed nanophotonic quantum computer for operating in high-speed optical fibre networks. (quantum computations)

  15. Phase Information in Quantum Oracle Computing

    OpenAIRE

    Machta, J.

    1998-01-01

    Computational devices may be supplied with external sources of information (oracles). Quantum oracles may transmit phase information which is available to a quantum computer but not a classical computer. One consequence of this observation is that there is an oracle which is of no assistance to a classical computer but which allows a quantum computer to solve undecidable problems. Thus useful relativized separations between quantum and classical complexity classes must exclude the transmissio...

  16. ASCR Workshop on Quantum Computing for Science

    Energy Technology Data Exchange (ETDEWEB)

    Aspuru-Guzik, Alan [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Van Dam, Wim [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Farhi, Edward [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Gaitan, Frank [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Humble, Travis [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Jordan, Stephen [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Landahl, Andrew J [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Love, Peter [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Lucas, Robert [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Preskill, John [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Muller, Richard P. [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Svore, Krysta [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Wiebe, Nathan [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States); Williams, Carl [Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)

    2015-06-01

    This report details the findings of the DOE ASCR Workshop on Quantum Computing for Science that was organized to assess the viability of quantum computing technologies to meet the computational requirements of the DOE’s science and energy mission, and to identify the potential impact of quantum technologies. The workshop was held on February 17-18, 2015, in Bethesda, MD, to solicit input from members of the quantum computing community. The workshop considered models of quantum computation and programming environments, physical science applications relevant to DOE's science mission as well as quantum simulation, and applied mathematics topics including potential quantum algorithms for linear algebra, graph theory, and machine learning. This report summarizes these perspectives into an outlook on the opportunities for quantum computing to impact problems relevant to the DOE’s mission as well as the additional research required to bring quantum computing to the point where it can have such impact.

  17. Quantum Computation: Entangling with the Future

    Science.gov (United States)

    Jiang, Zhang

    2017-01-01

    Commercial applications of quantum computation have become viable due to the rapid progress of the field in the recent years. Efficient quantum algorithms are discovered to cope with the most challenging real-world problems that are too hard for classical computers. Manufactured quantum hardware has reached unprecedented precision and controllability, enabling fault-tolerant quantum computation. Here, I give a brief introduction on what principles in quantum mechanics promise its unparalleled computational power. I will discuss several important quantum algorithms that achieve exponential or polynomial speedup over any classical algorithm. Building a quantum computer is a daunting task, and I will talk about the criteria and various implementations of quantum computers. I conclude the talk with near-future commercial applications of a quantum computer.

  18. Barium Ions for Quantum Computation

    CERN Document Server

    Dietrich, M R; Bowler, R; Kurz, N; Salacka, J S; Shu, G; Blinov, B B

    2009-01-01

    Individually trapped 137Ba+ in an RF Paul trap is proposed as a qubit ca ndidate, and its various benefits are compared to other ionic qubits. We report the current experimental status of using this ion for quantum computation. Fut ure plans and prospects are discussed.

  19. An Early Quantum Computing Proposal

    Energy Technology Data Exchange (ETDEWEB)

    Lee, Stephen Russell [Los Alamos National Laboratory; Alexander, Francis Joseph [Los Alamos National Laboratory; Barros, Kipton Marcos [Los Alamos National Laboratory; Daniels, Marcus G. [Los Alamos National Laboratory; Gattiker, James R. [Los Alamos National Laboratory; Hamada, Michael Scott [Los Alamos National Laboratory; Howse, James Walter [Los Alamos National Laboratory; Loncaric, Josip [Los Alamos National Laboratory; Pakin, Scott D. [Los Alamos National Laboratory; Somma, Rolando Diego [Los Alamos National Laboratory; Vernon, Louis James [Los Alamos National Laboratory

    2016-04-04

    The D-Wave 2X is the third generation of quantum processing created by D-Wave. NASA (with Google and USRA) and Lockheed Martin (with USC), both own D-Wave systems. Los Alamos National Laboratory (LANL) purchased a D-Wave 2X in November 2015. The D-Wave 2X processor contains (nominally) 1152 quantum bits (or qubits) and is designed to specifically perform quantum annealing, which is a well-known method for finding a global minimum of an optimization problem. This methodology is based on direct execution of a quantum evolution in experimental quantum hardware. While this can be a powerful method for solving particular kinds of problems, it also means that the D-Wave 2X processor is not a general computing processor and cannot be programmed to perform a wide variety of tasks. It is a highly specialized processor, well beyond what NNSA currently thinks of as an “advanced architecture.”A D-Wave is best described as a quantum optimizer. That is, it uses quantum superposition to find the lowest energy state of a system by repeated doses of power and settling stages. The D-Wave produces multiple solutions to any suitably formulated problem, one of which is the lowest energy state solution (global minimum). Mapping problems onto the D-Wave requires defining an objective function to be minimized and then encoding that function in the Hamiltonian of the D-Wave system. The quantum annealing method is then used to find the lowest energy configuration of the Hamiltonian using the current D-Wave Two, two-level, quantum processor. This is not always an easy thing to do, and the D-Wave Two has significant limitations that restrict problem sizes that can be run and algorithmic choices that can be made. Furthermore, as more people are exploring this technology, it has become clear that it is very difficult to come up with general approaches to optimization that can both utilize the D-Wave and that can do better than highly developed algorithms on conventional computers for

  20. Experimental realization of nonadiabatic holonomic quantum computation.

    Science.gov (United States)

    Feng, Guanru; Xu, Guofu; Long, Guilu

    2013-05-10

    Because of its geometric nature, holonomic quantum computation is fault tolerant against certain types of control errors. Although proposed more than a decade ago, the experimental realization of holonomic quantum computation is still an open challenge. In this Letter, we report the first experimental demonstration of nonadiabatic holonomic quantum computation in a liquid NMR quantum information processor. Two noncommuting one-qubit holonomic gates, rotations about x and z axes, and the two-qubit holonomic CNOT gate are realized by evolving the work qubits and an ancillary qubit nonadiabatically. The successful realizations of these universal elementary gates in nonadiabatic holonomic quantum computation demonstrates the experimental feasibility of this quantum computing paradigm.

  1. Quantum Chromodynamics: Computational Aspects

    CERN Document Server

    Schaefer, Thomas

    2016-01-01

    We present a brief introduction to QCD, the QCD phase diagram, and non-equilibrium phenomena in QCD. We emphasize aspects of the theory that can be addressed using computational methods, in particular euclidean path integral Monte Carlo, fluid dynamics, kinetic theory, classical field theory and holographic duality.

  2. General Quantum Interference Principle and Duality Computer

    Institute of Scientific and Technical Information of China (English)

    LONG Gui-Lu

    2006-01-01

    In this article, we propose a general principle of quantum interference for quantum system, and based on this we propose a new type of computing machine, the duality computer, that may outperform in principle both classical computer and the quantum computer. According to the general principle of quantum interference, the very essence of quantum interference is the interference of thesub-waves of the quantum system itself. A quantum system considered here can be any quantum system: a single microscopic particle, a composite quantum system such as an atom or a molecule, or a loose collection of a few quantum objects such as two independent photons. In the duality computer,the wave of the duality computer is split into several sub-waves and they pass through different routes, where different computing gate operations are performed. These sub-waves are then re-combined to interfere to give the computational results. The quantum computer, however, has only used the particle nature of quantum object. In a duality computer,it may be possible to find a marked item from an unsorted database using only a single query, and all NP-complete problems may have polynomial algorithms. Two proof-of-the-principle designs of the duality computer are presented:the giant molecule scheme and the nonlinear quantum optics scheme. We also propose thought experiment to check the related fundamental issues, the measurement efficiency of a partial wave function.

  3. Quantum mechanics and computation; Quanta y Computacion

    Energy Technology Data Exchange (ETDEWEB)

    Cirac Sasturain, J. I.

    2000-07-01

    We review how some of the basic principles of Quantum Mechanics can be used in the field of computation. In particular, we explain why a quantum computer can perform certain tasks in a much more efficient way than the computers we have available nowadays. We give the requirements for a quantum system to be able to implement a quantum computer and illustrate these requirements in some particular physical situations. (Author) 16 refs.

  4. Problems and solutions in quantum computing and quantum information

    CERN Document Server

    Steeb, Willi-Hans

    2012-01-01

    Quantum computing and quantum information are two of the fastest growing and most exciting research fields in physics. Entanglement, teleportation and the possibility of using the non-local behavior of quantum mechanics to factor integers in random polynomial time have also added to this new interest. This book supplies a huge collection of problems in quantum computing and quantum information together with their detailed solutions, which will prove to be invaluable to students as well as researchers in these fields. All the important concepts and topics such as quantum gates and quantum circuits, product Hilbert spaces, entanglement and entanglement measures, deportation, Bell states, Bell inequality, Schmidt decomposition, quantum Fourier transform, magic gate, von Neumann entropy, quantum cryptography, quantum error corrections, number states and Bose operators, coherent states, squeezed states, Gaussian states, POVM measurement, quantum optics networks, beam splitter, phase shifter and Kerr Hamilton opera...

  5. Classical computing, quantum computing, and Shor's factoring algorithm

    CERN Document Server

    Manin, Yu I

    1999-01-01

    This is an expository talk written for the Bourbaki Seminar. After a brief introduction, Section 1 discusses in the categorical language the structure of the classical deterministic computations. Basic notions of complexity icluding the P/NP problem are reviewed. Section 2 introduces the notion of quantum parallelism and explains the main issues of quantum computing. Section 3 is devoted to four quantum subroutines: initialization, quantum computing of classical Boolean functions, quantum Fourier transform, and Grover's search algorithm. The central Section 4 explains Shor's factoring algorithm. Section 5 relates Kolmogorov's complexity to the spectral properties of computable function. Appendix contributes to the prehistory of quantum computing.

  6. Strange attractor simulated on a quantum computer

    OpenAIRE

    2002-01-01

    We show that dissipative classical dynamics converging to a strange attractor can be simulated on a quantum computer. Such quantum computations allow to investigate efficiently the small scale structure of strange attractors, yielding new information inaccessible to classical computers. This opens new possibilities for quantum simulations of various dissipative processes in nature.

  7. Experimental demonstration of blind quantum computing

    Science.gov (United States)

    Barz, Stefanie; Kashefi, Elham; Broadbent, Anne; Fitzsimons, Joe; Zeilinger, Anton; Walther, Philip

    2012-02-01

    Quantum computers are among the most promising applications of quantum-enhanced technologies. Quantum effects such as superposition and entanglement enable computational speed-ups that are unattainable using classical computers. The challenges in realising quantum computers suggest that in the near future, only a few facilities worldwide will be capable of operating such devices. In order to exploit these computers, users would seemingly have to give up their privacy. It was recently shown that this is not the case and that, via the universal blind quantum computation protocol, quantum mechanics provides a way to guarantee that the user's data remain private. Here, we demonstrate the first experimental version of this protocol using polarisation-entangled photonic qubits. We demonstrate various blind one- and two-qubit gate operations as well as blind versions of the Deutsch's and Grover's algorithms. When the technology to build quantum computers becomes available, this will become an important privacy-preserving feature of quantum information processing.

  8. Experimental Demonstration of Blind Quantum Computing

    CERN Document Server

    Barz, Stefanie; Broadbent, Anne; Fitzsimons, Joseph F; Zeilinger, Anton; Walther, Philip

    2011-01-01

    Quantum computers, besides offering substantial computational speedups, are also expected to provide the possibility of preserving the privacy of a computation. Here we show the first such experimental demonstration of blind quantum computation where the input, computation, and output all remain unknown to the computer. We exploit the conceptual framework of measurement-based quantum computation that enables a client to delegate a computation to a quantum server. We demonstrate various blind delegated computations, including one- and two-qubit gates and the Deutsch and Grover algorithms. Remarkably, the client only needs to be able to prepare and transmit individual photonic qubits. Our demonstration is crucial for future unconditionally secure quantum cloud computing and might become a key ingredient for real-life applications, especially when considering the challenges of making powerful quantum computers widely available.

  9. Quantum computing and the entanglement frontier

    CERN Document Server

    Preskill, John

    2012-01-01

    Quantum information science explores the frontier of highly complex quantum states, the "entanglement frontier." This study is motivated by the observation (widely believed but unproven) that classical systems cannot simulate highly entangled quantum systems efficiently, and we hope to hasten the day when well controlled quantum systems can perform tasks surpassing what can be done in the classical world. One way to achieve such "quantum supremacy" would be to run an algorithm on a quantum computer which solves a problem with a super-polynomial speedup relative to classical computers, but there may be other ways that can be achieved sooner, such as simulating exotic quantum states of strongly correlated matter. To operate a large scale quantum computer reliably we will need to overcome the debilitating effects of decoherence, which might be done using "standard" quantum hardware protected by quantum error-correcting codes, or by exploiting the nonabelian quantum statistics of anyons realized in solid state sy...

  10. Electric field modulation of the tetragonal domain orientation revealed in the magnetic ground state of quantum paraelectric EuTiO3

    Science.gov (United States)

    Petrović, A. P.; Kato, Y.; Sunku, S. S.; Ito, T.; Sengupta, P.; Spalek, L.; Shimuta, M.; Katsufuji, T.; Batista, C. D.; Saxena, S. S.; Panagopoulos, C.

    2013-02-01

    We present a study of the thermodynamic and magnetic properties of single-crystal EuTiO3. Signatures of metastability are visible in the heat capacity below the cubic-tetragonal phase transition at 283 K, supporting the evidence for a mismatch between long and short range structural order from previous x-ray diffraction studies. Employing the anisotropic magnetization as an indirect structural probe, we confirm the emergence of multiple orthogonal domains at low temperature. Torque magnetometry is capable of revealing the nature and temperature dependence of the magnetic anisotropy in spite of the domain misalignment; we hence deduce that tetragonal EuTiO3 enters an easy-axis antiferromagnetic phase at 5.6 K, with a first-order phase transition to an easy-plane ground state below 3 K. Our experimentally determined magnetic phase diagram is accurately reproduced by a three-dimensional (3D) anisotropic Heisenberg spin model. Furthermore, we demonstrate that electric field cooling acts to suppress this orientational disorder by realigning the domains due to the strong coupling between electric fields and lattice dipoles characteristic of paraelectric materials.

  11. Quantum Computation and Decision Trees

    CERN Document Server

    Farhi, E; Farhi, Edward; Gutmann, Sam

    1998-01-01

    Many interesting computational problems can be reformulated in terms of decision trees. A natural classical algorithm is to then run a random walk on the tree, starting at the root, to see if the tree contains a node n levels from the root. We devise a quantum mechanical algorithm that evolves a state, initially localized at the root, through the tree. We prove that if the classical strategy succeeds in reaching level n in time polynomial in n, then so does the quantum algorithm. Moreover, we find examples of trees for which the classical algorithm requires time exponential in n, but for which the quantum algorithm succeeds in polynomial time. The examples we have so far, however, could also be solved in polynomial time by different classical algorithms.

  12. Geometry of quantum computation with qutrits.

    Science.gov (United States)

    Li, Bin; Yu, Zu-Huan; Fei, Shao-Ming

    2013-01-01

    Determining the quantum circuit complexity of a unitary operation is an important problem in quantum computation. By using the mathematical techniques of Riemannian geometry, we investigate the efficient quantum circuits in quantum computation with n qutrits. We show that the optimal quantum circuits are essentially equivalent to the shortest path between two points in a certain curved geometry of SU(3(n)). As an example, three-qutrit systems are investigated in detail.

  13. Quantum chemistry simulation on quantum computers: theories and experiments.

    Science.gov (United States)

    Lu, Dawei; Xu, Boruo; Xu, Nanyang; Li, Zhaokai; Chen, Hongwei; Peng, Xinhua; Xu, Ruixue; Du, Jiangfeng

    2012-07-14

    It has been claimed that quantum computers can mimic quantum systems efficiently in the polynomial scale. Traditionally, those simulations are carried out numerically on classical computers, which are inevitably confronted with the exponential growth of required resources, with the increasing size of quantum systems. Quantum computers avoid this problem, and thus provide a possible solution for large quantum systems. In this paper, we first discuss the ideas of quantum simulation, the background of quantum simulators, their categories, and the development in both theories and experiments. We then present a brief introduction to quantum chemistry evaluated via classical computers followed by typical procedures of quantum simulation towards quantum chemistry. Reviewed are not only theoretical proposals but also proof-of-principle experimental implementations, via a small quantum computer, which include the evaluation of the static molecular eigenenergy and the simulation of chemical reaction dynamics. Although the experimental development is still behind the theory, we give prospects and suggestions for future experiments. We anticipate that in the near future quantum simulation will become a powerful tool for quantum chemistry over classical computations.

  14. Optically simulated universal quantum computation

    Science.gov (United States)

    Francisco, D.; Ledesma, S.

    2008-04-01

    Recently, classical optics based systems to emulate quantum information processing have been proposed. The analogy is based on the possibility of encoding a quantum state of a system with a 2N-dimensional Hilbert space as an image in the input of an optical system. The probability amplitude of each state of a certain basis is associated with the complex amplitude of the electromagnetic field in a given slice of the laser wavefront. Temporal evolution is represented as the change of the complex amplitude of the field when the wavefront pass through a certain optical arrangement. Different modules that represent universal gates for quantum computation have been implemented. For instance, unitary operations acting on the qbits space (or U(2) gates) are represented by means of two phase plates, two spherical lenses and a phase grating in a typical image processing set up. In this work, we present CNOT gates which are emulated by means of a cube prism that splits a pair of adjacent rays incoming from the input image. As an example of application, we present an optical module that can be used to simulate the quantum teleportation process. We also show experimental results that illustrate the validity of the analogy. Although the experimental results obtained are promising and show the capability of the system for simulate the real quantum process, we must take into account that any classical simulation of quantum phenomena, has as fundamental limitation the impossibility of representing non local entanglement. In this classical context, quantum teleportation has only an illustrative interpretation.

  15. Brain Neurons as Quantum Computers:

    Science.gov (United States)

    Bershadskii, A.; Dremencov, E.; Bershadskii, J.; Yadid, G.

    The question: whether quantum coherent states can sustain decoherence, heating and dissipation over time scales comparable to the dynamical timescales of brain neurons, has been actively discussed in the last years. A positive answer on this question is crucial, in particular, for consideration of brain neurons as quantum computers. This discussion was mainly based on theoretical arguments. In the present paper nonlinear statistical properties of the Ventral Tegmental Area (VTA) of genetically depressive limbic brain are studied in vivo on the Flinders Sensitive Line of rats (FSL). VTA plays a key role in the generation of pleasure and in the development of psychological drug addiction. We found that the FSL VTA (dopaminergic) neuron signals exhibit multifractal properties for interspike frequencies on the scales where healthy VTA dopaminergic neurons exhibit bursting activity. For high moments the observed multifractal (generalized dimensions) spectrum coincides with the generalized dimensions spectrum calculated for a spectral measure of a quantum system (so-called kicked Harper model, actively used as a model of quantum chaos). This observation can be considered as a first experimental (in vivo) indication in the favor of the quantum (at least partially) nature of brain neurons activity.

  16. Diamond NV centers for quantum computing and quantum networks

    NARCIS (Netherlands)

    Childress, L.; Hanson, R.

    2013-01-01

    The exotic features of quantum mechanics have the potential to revolutionize information technologies. Using superposition and entanglement, a quantum processor could efficiently tackle problems inaccessible to current-day computers. Nonlocal correlations may be exploited for intrinsically secure co

  17. Exploiting Locality in Quantum Computation for Quantum Chemistry.

    Science.gov (United States)

    McClean, Jarrod R; Babbush, Ryan; Love, Peter J; Aspuru-Guzik, Alán

    2014-12-18

    Accurate prediction of chemical and material properties from first-principles quantum chemistry is a challenging task on traditional computers. Recent developments in quantum computation offer a route toward highly accurate solutions with polynomial cost; however, this solution still carries a large overhead. In this Perspective, we aim to bring together known results about the locality of physical interactions from quantum chemistry with ideas from quantum computation. We show that the utilization of spatial locality combined with the Bravyi-Kitaev transformation offers an improvement in the scaling of known quantum algorithms for quantum chemistry and provides numerical examples to help illustrate this point. We combine these developments to improve the outlook for the future of quantum chemistry on quantum computers.

  18. Quantum Computation with Nonlinear Optics

    Science.gov (United States)

    Liu, Yang; Zhang, Wen-Hong; Zhang, Cun-Lin; Long, Gui-Lu

    2008-01-01

    We propose a scheme of quantum computation with nonlinear quantum optics. Polarization states of photons are used for qubits. Photons with different frequencies represent different qubits. Single qubit rotation operation is implemented through optical elements like the Faraday polarization rotator. Photons are separated into different optical paths, or merged into a single optical path using dichromatic mirrors. The controlled-NOT gate between two qubits is implemented by the proper combination of parametric up and down conversions. This scheme has the following features: (1) No auxiliary qubits are required in the controlled-NOT gate operation; (2) No measurement is required in the course of the computation; (3) It is resource efficient and conceptually simple.

  19. Quantum Computation with Nonlinear Optics

    Institute of Scientific and Technical Information of China (English)

    LU Ke; LIU Yang; LIN Zhen-Quan; ZHANG Wen-Hong; SUN Yun-Fei; ZHANG Cun-Lin; LONG Gui-Lu

    2008-01-01

    We propose a scheme of quantum computation with nonlinear quantum optics. Polarization states of photons are used for qubits. Photons with different frequencies represent different qubits. Single qubit rotation operation is implemented through optical elements like the Faraday polarization rotator. Photons are separated into different optical paths, or merged into a single optical path using dichromatic mirrors. The controlled-NOT gate between two qubits is implemented by the proper combination of parametric up and down conversions. This scheme has the following features: (1) No auxiliary qubits are required in the controlled-NOT gate operation; (2) No measurement is required in the courseof the computation; (3) It is resource efficient and conceptually simple.

  20. Quantum ballistic evolution in quantum mechanics application to quantum computers

    CERN Document Server

    Benioff, P

    1996-01-01

    Quantum computers are important examples of processes whose evolution can be described in terms of iterations of single step operators or their adjoints. Based on this, Hamiltonian evolution of processes with associated step operators T is investigated here. The main limitation of this paper is to processes which evolve quantum ballistically, i.e. motion restricted to a collection of nonintersecting or distinct paths on an arbitrary basis. The main goal of this paper is proof of a theorem which gives necessary and sufficient conditions that T must satisfy so that there exists a Hamiltonian description of quantum ballistic evolution for the process, namely, that T is a partial isometry and is orthogonality preserving and stable on some basis. Simple examples of quantum ballistic evolution for quantum Turing machines with one and with more than one type of elementary step are discussed. It is seen that for nondeterministic machines the basis set can be quite complex with much entanglement present. It is also pr...

  1. EXPLORATIONS IN QUANTUM COMPUTING FOR FINANCIAL APPLICATIONS

    OpenAIRE

    Gare, Jesse

    2010-01-01

    Quantum computers have the potential to increase the solution speed for many computational problems. This paper is a first step into possible applications for quantum computing in the context of computational finance. The fundamental ideas of quantum computing are introduced, followed by an exposition of the algorithms of Deutsch and Grover. Improved mean and median estimation are shown as results of Grover?s generalized framework. The algorithm for mean estimation is refined to an improved M...

  2. Holonomic Quantum Computation in Subsystems

    Science.gov (United States)

    Oreshkov, Ognyan

    2009-08-01

    We introduce a generalized method of holonomic quantum computation (HQC) based on encoding in subsystems. As an application, we propose a scheme for applying holonomic gates to unencoded qubits by the use of a noisy ancillary qubit. This scheme does not require initialization in a subspace since all dynamical effects factor out as a transformation on the ancilla. We use this approach to show how fault-tolerant HQC can be realized via 2-local Hamiltonians with perturbative gadgets.

  3. Holonomic quantum computation in subsystems

    OpenAIRE

    Oreshkov, Ognyan

    2009-01-01

    We introduce a generalized method of holonomic quantum computation (HQC) based on encoding in subsystems. As an application, we propose a scheme for applying holonomic gates to unencoded qubits by the use of a noisy ancillary qubit. This scheme does not require initialization in a subspace since all dynamical effects factor out as a transformation on the ancilla. We use this approach to show how fault-tolerant HQC can be realized via 2-local Hamiltonians with perturbative gadgets.

  4. Toward a superconducting quantum computer. Harnessing macroscopic quantum coherence.

    Science.gov (United States)

    Tsai, Jaw-Shen

    2010-01-01

    Intensive research on the construction of superconducting quantum computers has produced numerous important achievements. The quantum bit (qubit), based on the Josephson junction, is at the heart of this research. This macroscopic system has the ability to control quantum coherence. This article reviews the current state of quantum computing as well as its history, and discusses its future. Although progress has been rapid, the field remains beset with unsolved issues, and there are still many new research opportunities open to physicists and engineers.

  5. Geometry of discrete quantum computing

    Science.gov (United States)

    Hanson, Andrew J.; Ortiz, Gerardo; Sabry, Amr; Tai, Yu-Tsung

    2013-05-01

    Conventional quantum computing entails a geometry based on the description of an n-qubit state using 2n infinite precision complex numbers denoting a vector in a Hilbert space. Such numbers are in general uncomputable using any real-world resources, and, if we have the idea of physical law as some kind of computational algorithm of the universe, we would be compelled to alter our descriptions of physics to be consistent with computable numbers. Our purpose here is to examine the geometric implications of using finite fields Fp and finite complexified fields \\mathbf {F}_{p^2} (based on primes p congruent to 3 (mod4)) as the basis for computations in a theory of discrete quantum computing, which would therefore become a computable theory. Because the states of a discrete n-qubit system are in principle enumerable, we are able to determine the proportions of entangled and unentangled states. In particular, we extend the Hopf fibration that defines the irreducible state space of conventional continuous n-qubit theories (which is the complex projective space \\mathbf {CP}^{2^{n}-1}) to an analogous discrete geometry in which the Hopf circle for any n is found to be a discrete set of p + 1 points. The tally of unit-length n-qubit states is given, and reduced via the generalized Hopf fibration to \\mathbf {DCP}^{2^{n}-1}, the discrete analogue of the complex projective space, which has p^{2^{n}-1} (p-1)\\,\\prod _{k=1}^{n-1} ( p^{2^{k}}+1) irreducible states. Using a measure of entanglement, the purity, we explore the entanglement features of discrete quantum states and find that the n-qubit states based on the complexified field \\mathbf {F}_{p^2} have pn(p - 1)n unentangled states (the product of the tally for a single qubit) with purity 1, and they have pn + 1(p - 1)(p + 1)n - 1 maximally entangled states with purity zero.

  6. Elucidating reaction mechanisms on quantum computers.

    Science.gov (United States)

    Reiher, Markus; Wiebe, Nathan; Svore, Krysta M; Wecker, Dave; Troyer, Matthias

    2017-07-18

    With rapid recent advances in quantum technology, we are close to the threshold of quantum devices whose computational powers can exceed those of classical supercomputers. Here, we show that a quantum computer can be used to elucidate reaction mechanisms in complex chemical systems, using the open problem of biological nitrogen fixation in nitrogenase as an example. We discuss how quantum computers can augment classical computer simulations used to probe these reaction mechanisms, to significantly increase their accuracy and enable hitherto intractable simulations. Our resource estimates show that, even when taking into account the substantial overhead of quantum error correction, and the need to compile into discrete gate sets, the necessary computations can be performed in reasonable time on small quantum computers. Our results demonstrate that quantum computers will be able to tackle important problems in chemistry without requiring exorbitant resources.

  7. Experimental one-way quantum computing.

    Science.gov (United States)

    Walther, P; Resch, K J; Rudolph, T; Schenck, E; Weinfurter, H; Vedral, V; Aspelmeyer, M; Zeilinger, A

    2005-03-10

    Standard quantum computation is based on sequences of unitary quantum logic gates that process qubits. The one-way quantum computer proposed by Raussendorf and Briegel is entirely different. It has changed our understanding of the requirements for quantum computation and more generally how we think about quantum physics. This new model requires qubits to be initialized in a highly entangled cluster state. From this point, the quantum computation proceeds by a sequence of single-qubit measurements with classical feedforward of their outcomes. Because of the essential role of measurement, a one-way quantum computer is irreversible. In the one-way quantum computer, the order and choices of measurements determine the algorithm computed. We have experimentally realized four-qubit cluster states encoded into the polarization state of four photons. We characterize the quantum state fully by implementing experimental four-qubit quantum state tomography. Using this cluster state, we demonstrate the feasibility of one-way quantum computing through a universal set of one- and two-qubit operations. Finally, our implementation of Grover's search algorithm demonstrates that one-way quantum computation is ideally suited for such tasks.

  8. Quantum machine learning what quantum computing means to data mining

    CERN Document Server

    Wittek, Peter

    2014-01-01

    Quantum Machine Learning bridges the gap between abstract developments in quantum computing and the applied research on machine learning. Paring down the complexity of the disciplines involved, it focuses on providing a synthesis that explains the most important machine learning algorithms in a quantum framework. Theoretical advances in quantum computing are hard to follow for computer scientists, and sometimes even for researchers involved in the field. The lack of a step-by-step guide hampers the broader understanding of this emergent interdisciplinary body of research. Quantum Machine L

  9. Adiabatic quantum computation and quantum annealing theory and practice

    CERN Document Server

    McGeoch, Catherine C

    2014-01-01

    Adiabatic quantum computation (AQC) is an alternative to the better-known gate model of quantum computation. The two models are polynomially equivalent, but otherwise quite dissimilar: one property that distinguishes AQC from the gate model is its analog nature. Quantum annealing (QA) describes a type of heuristic search algorithm that can be implemented to run in the ``native instruction set'''' of an AQC platform. D-Wave Systems Inc. manufactures {quantum annealing processor chips} that exploit quantum properties to realize QA computations in hardware. The chips form the centerpiece of a nov

  10. Quantum Computing with Very Noisy Devices

    CERN Document Server

    Knill, E

    2004-01-01

    There are quantum algorithms that can efficiently simulate quantum physics, factor large numbers and estimate integrals. As a result, quantum computers can solve otherwise intractable computational problems. One of the main problems of experimental quantum computing is to preserve fragile quantum states in the presence of errors. It is known that if the needed elementary operations (gates) can be implemented with error probabilities below a threshold, then it is possible to efficiently quantum compute with arbitrary accuracy. Here we give evidence that for independent errors the theoretical threshold is well above 3%, which is a significant improvement over that of earlier calculations. However, the resources required at such high error probabilities are excessive. Fortunately, they decrease rapidly with decreasing error probabilities. If we had quantum resources comparable to the considerable resources available in today's digital computers, we could implement non-trivial quantum algorithms at error probabil...

  11. Strangeness in the baryon ground states

    CERN Document Server

    Semke, A

    2012-01-01

    We compute the strangeness content of the baryon ground states based on an analysis of recent lattice simulations of the BMW, PACS, LHPC and HSC groups for the pion-mass dependence of the baryon masses. Our results rely on the relativistic chiral Lagrangian and large-$N_c$ sum rule estimates of the counter terms relevant for the baryon masses at N$^3$LO. A partial summation is implied by the use of physical baryon and meson masses in the one-loop contributions to the baryon self energies. A simultaneous description of the lattice results of the BMW, LHPC, PACS and HSC groups is achieved. We predict the pion- and strangeness sigma terms and the pion-mass dependence of the octet and decuplet ground states at different strange quark masses.

  12. Ground states of fermionic lattice Hamiltonians with permutation symmetry

    Science.gov (United States)

    Kraus, Christina V.; Lewenstein, Maciej; Cirac, J. Ignacio

    2013-08-01

    We study the ground states of lattice Hamiltonians that are invariant under permutations, in the limit where the number of lattice sites N→∞. For spin systems, these are product states, a fact that follows directly from the quantum de Finetti theorem. For fermionic systems, however, the problem is very different, since mode operators acting on different sites do not commute, but anticommute. We construct a family of fermionic states, F, from which such ground states can be easily computed. They are characterized by few parameters whose number only depends on M, the number of modes per lattice site. We also give an explicit construction for M=1,2. In the first case, F is contained in the set of Gaussian states, whereas in the second it is not. Inspired by that construction, we build a set of fermionic variational wave functions, and apply it to the Fermi-Hubbard model in two spatial dimensions, obtaining results that go beyond the generalized Hartree-Fock theory.

  13. The Quantum Human Computer (QHC) Hypothesis

    Science.gov (United States)

    Salmani-Nodoushan, Mohammad Ali

    2008-01-01

    This article attempts to suggest the existence of a human computer called Quantum Human Computer (QHC) on the basis of an analogy between human beings and computers. To date, there are two types of computers: Binary and Quantum. The former operates on the basis of binary logic where an object is said to exist in either of the two states of 1 and…

  14. Universal quantum computation with qudits

    Science.gov (United States)

    Luo, MingXing; Wang, XiaoJun

    2014-09-01

    Quantum circuit model has been widely explored for various quantum applications such as Shors algorithm and Grovers searching algorithm. Most of previous algorithms are based on the qubit systems. Herein a proposal for a universal circuit is given based on the qudit system, which is larger and can store more information. In order to prove its universality for quantum applications, an explicit set of one-qudit and two-qudit gates is provided for the universal qudit computation. The one-qudit gates are general rotation for each two-dimensional subspace while the two-qudit gates are their controlled extensions. In comparison to previous quantum qudit logical gates, each primitive qudit gate is only dependent on two free parameters and may be easily implemented. In experimental implementation, multilevel ions with the linear ion trap model are used to build the qudit systems and use the coupling of neighbored levels for qudit gates. The controlled qudit gates may be realized with the interactions of internal and external coordinates of the ion.

  15. Energy-efficient quantum computing

    Science.gov (United States)

    Ikonen, Joni; Salmilehto, Juha; Möttönen, Mikko

    2017-04-01

    In the near future, one of the major challenges in the realization of large-scale quantum computers operating at low temperatures is the management of harmful heat loads owing to thermal conduction of cabling and dissipation at cryogenic components. This naturally raises the question that what are the fundamental limitations of energy consumption in scalable quantum computing. In this work, we derive the greatest lower bound for the gate error induced by a single application of a bosonic drive mode of given energy. Previously, such an error type has been considered to be inversely proportional to the total driving power, but we show that this limitation can be circumvented by introducing a qubit driving scheme which reuses and corrects drive pulses. Specifically, our method serves to reduce the average energy consumption per gate operation without increasing the average gate error. Thus our work shows that precise, scalable control of quantum systems can, in principle, be implemented without the introduction of excessive heat or decoherence.

  16. A Random Matrix Model of Adiabatic Quantum Computing

    CERN Document Server

    Mitchell, D R; Lue, W; Williams, C P; Mitchell, David R.; Adami, Christoph; Lue, Waynn; Williams, Colin P.

    2004-01-01

    We present an analysis of the quantum adiabatic algorithm for solving hard instances of 3-SAT (an NP-complete problem) in terms of Random Matrix Theory (RMT). We determine the global regularity of the spectral fluctuations of the instantaneous Hamiltonians encountered during the interpolation between the starting Hamiltonians and the ones whose ground states encode the solutions to the computational problems of interest. At each interpolation point, we quantify the degree of regularity of the average spectral distribution via its Brody parameter, a measure that distinguishes regular (i.e., Poissonian) from chaotic (i.e., Wigner-type) distributions of normalized nearest-neighbor spacings. We find that for hard problem instances, i.e., those having a critical ratio of clauses to variables, the spectral fluctuations typically become irregular across a contiguous region of the interpolation parameter, while the spectrum is regular for easy instances. Within the hard region, RMT may be applied to obtain a mathemat...

  17. Parallel computing and quantum chromodynamics

    CERN Document Server

    Bowler, K C

    1999-01-01

    The study of Quantum Chromodynamics (QCD) remains one of the most challenging topics in elementary particle physics. The lattice formulation of QCD, in which space-time is treated as a four- dimensional hypercubic grid of points, provides the means for a numerical solution from first principles but makes extreme demands upon computational performance. High Performance Computing (HPC) offers us the tantalising prospect of a verification of QCD through the precise reproduction of the known masses of the strongly interacting particles. It is also leading to the development of a phenomenological tool capable of disentangling strong interaction effects from weak interaction effects in the decays of one kind of quark into another, crucial for determining parameters of the standard model of particle physics. The 1980s saw the first attempts to apply parallel architecture computers to lattice QCD. The SIMD and MIMD machines used in these pioneering efforts were the ICL DAP and the Cosmic Cube, respectively. These wer...

  18. Non-unitary probabilistic quantum computing

    Science.gov (United States)

    Gingrich, Robert M.; Williams, Colin P.

    2004-01-01

    We present a method for designing quantum circuits that perform non-unitary quantum computations on n-qubit states probabilistically, and give analytic expressions for the success probability and fidelity.

  19. Model dynamics for quantum computing

    Science.gov (United States)

    Tabakin, Frank

    2017-08-01

    A model master equation suitable for quantum computing dynamics is presented. In an ideal quantum computer (QC), a system of qubits evolves in time unitarily and, by virtue of their entanglement, interfere quantum mechanically to solve otherwise intractable problems. In the real situation, a QC is subject to decoherence and attenuation effects due to interaction with an environment and with possible short-term random disturbances and gate deficiencies. The stability of a QC under such attacks is a key issue for the development of realistic devices. We assume that the influence of the environment can be incorporated by a master equation that includes unitary evolution with gates, supplemented by a Lindblad term. Lindblad operators of various types are explored; namely, steady, pulsed, gate friction, and measurement operators. In the master equation, we use the Lindblad term to describe short time intrusions by random Lindblad pulses. The phenomenological master equation is then extended to include a nonlinear Beretta term that describes the evolution of a closed system with increasing entropy. An external Bath environment is stipulated by a fixed temperature in two different ways. Here we explore the case of a simple one-qubit system in preparation for generalization to multi-qubit, qutrit and hybrid qubit-qutrit systems. This model master equation can be used to test the stability of memory and the efficacy of quantum gates. The properties of such hybrid master equations are explored, with emphasis on the role of thermal equilibrium and entropy constraints. Several significant properties of time-dependent qubit evolution are revealed by this simple study.

  20. Classical ground states of symmetric Heisenberg spin systems

    CERN Document Server

    Schmidt, H J

    2003-01-01

    We investigate the ground states of classical Heisenberg spin systems which have point group symmetry. Examples are the regular polygons (spin rings) and the seven quasi-regular polyhedra including the five Platonic solids. For these examples, ground states with special properties, e.g. coplanarity or symmetry, can be completely enumerated using group-theoretical methods. For systems having coplanar (anti-) ground states with vanishing total spin we also calculate the smallest and largest energies of all states having a given total spin S. We find that these extremal energies depend quadratically on S and prove that, under certain assumptions, this happens only for systems with coplanar S = 0 ground states. For general systems the corresponding parabolas represent lower and upper bounds for the energy values. This provides strong support and clarifies the conditions for the so-called rotational band structure hypothesis which has been numerically established for many quantum spin systems.

  1. Embracing the quantum limit in silicon computing.

    Science.gov (United States)

    Morton, John J L; McCamey, Dane R; Eriksson, Mark A; Lyon, Stephen A

    2011-11-16

    Quantum computers hold the promise of massive performance enhancements across a range of applications, from cryptography and databases to revolutionary scientific simulation tools. Such computers would make use of the same quantum mechanical phenomena that pose limitations on the continued shrinking of conventional information processing devices. Many of the key requirements for quantum computing differ markedly from those of conventional computers. However, silicon, which plays a central part in conventional information processing, has many properties that make it a superb platform around which to build a quantum computer.

  2. Decoherence, Control, and Symmetry in Quantum Computers

    CERN Document Server

    Bacon, D J

    2003-01-01

    In this thesis we describe methods for avoiding the detrimental effects of decoherence while at the same time still allowing for computation of the quantum information. The philosophy of the method discussed in the first part of this thesis is to use a symmetry of the decoherence mechanism to find robust encodings of the quantum information. Stability, control, and methods for using decoherence-free information in a quantum computer are presented with a specific emphasis on decoherence due to a collective coupling between the system and its environment. Universal quantum computation on such collective decoherence decoherence-free encodings is demonstrated. Rigorous definitions of control and the use of encoded universality in quantum computers are addressed. Explicit gate constructions for encoded universality on ion trap and exchange based quantum computers are given. In the second part of the thesis we examine physical systems with error correcting properties. We examine systems that can store quantum infor...

  3. On the computation of quantum characteristic exponents

    CERN Document Server

    Vilela-Mendes, R; Coutinho, Ricardo

    1998-01-01

    A quantum characteristic exponent may be defined, with the same operational meaning as the classical Lyapunov exponent when the latter is expressed as a functional of densities. Existence conditions and supporting measure properties are discussed as well as the problems encountered in the numerical computation of the quantum exponents. Although an example of true quantum chaos may be exhibited, the taming effect of quantum mechanics on chaos is quite apparent in the computation of the quantum exponents. However, even when the exponents vanish, the functionals used for their definition may still provide a characterization of distinct complexity classes for quantum behavior.

  4. Contextuality supplies the 'magic' for quantum computation.

    Science.gov (United States)

    Howard, Mark; Wallman, Joel; Veitch, Victor; Emerson, Joseph

    2014-06-19

    Quantum computers promise dramatic advantages over their classical counterparts, but the source of the power in quantum computing has remained elusive. Here we prove a remarkable equivalence between the onset of contextuality and the possibility of universal quantum computation via 'magic state' distillation, which is the leading model for experimentally realizing a fault-tolerant quantum computer. This is a conceptually satisfying link, because contextuality, which precludes a simple 'hidden variable' model of quantum mechanics, provides one of the fundamental characterizations of uniquely quantum phenomena. Furthermore, this connection suggests a unifying paradigm for the resources of quantum information: the non-locality of quantum theory is a particular kind of contextuality, and non-locality is already known to be a critical resource for achieving advantages with quantum communication. In addition to clarifying these fundamental issues, this work advances the resource framework for quantum computation, which has a number of practical applications, such as characterizing the efficiency and trade-offs between distinct theoretical and experimental schemes for achieving robust quantum computation, and putting bounds on the overhead cost for the classical simulation of quantum algorithms.

  5. Helping Students Learn Quantum Mechanics for Quantum Computing

    CERN Document Server

    Singh, Chandralekha

    2016-01-01

    Quantum information science and technology is a rapidly growing interdisciplinary field drawing researchers from science and engineering fields. Traditional instruction in quantum mechanics is insufficient to prepare students for research in quantum computing because there is a lack of emphasis in the current curriculum on quantum formalism and dynamics. We are investigating the difficulties students have with quantum mechanics and are developing and evaluating quantum interactive learning tutorials (QuILTs) to reduce the difficulties. Our investigation includes interviews with individual students and the development and administration of free-response and multiple-choice tests. We discuss the implications of our research and development project on helping students learn quantum mechanics relevant for quantum computing.

  6. Quantum fields on the computer

    CERN Document Server

    1992-01-01

    This book provides an overview of recent progress in computer simulations of nonperturbative phenomena in quantum field theory, particularly in the context of the lattice approach. It is a collection of extensive self-contained reviews of various subtopics, including algorithms, spectroscopy, finite temperature physics, Yukawa and chiral theories, bounds on the Higgs meson mass, the renormalization group, and weak decays of hadrons.Physicists with some knowledge of lattice gauge ideas will find this book a useful and interesting source of information on the recent developments in the field.

  7. Distributed Quantum Computation over Noisy Channels

    CERN Document Server

    Ekert, A K; Macchiavello, C; Cirac, J I

    1999-01-01

    We analyse the use of entangled states to perform quantum computations non locally among distant nodes in a quantum network. We show that for a sufficiently large number of nodes maximally entangled states are always advantageous over independent computations in each node, even in the presence of noise during the computation process.

  8. Quantum computation with two-dimensional graphene quantum dots

    Institute of Scientific and Technical Information of China (English)

    Li Jie-Sen; Li Zhi-Bing; Yao Dao-Xin

    2012-01-01

    We study an array of graphene nano sheets that form a two-dimensional S =1/2 Kagome spin lattice used for quantum computation.The edge states of the graphene nano sheets axe used to form quantum dots to confine electrons and perform the computation.We propose two schemes of bang-bang control to combat decoherence and realize gate operations on this array of quantum dots.It is shown that both schemes contain a great amount of information for quantum computation.The corresponding gate operations are also proposed.

  9. Quantum Computing in Solid State Systems

    CERN Document Server

    Ruggiero, B; Granata, C

    2006-01-01

    The aim of Quantum Computation in Solid State Systems is to report on recent theoretical and experimental results on the macroscopic quantum coherence of mesoscopic systems, as well as on solid state realization of qubits and quantum gates. Particular attention has been given to coherence effects in Josephson devices. Other solid state systems, including quantum dots, optical, ion, and spin devices which exhibit macroscopic quantum coherence are also discussed. Quantum Computation in Solid State Systems discusses experimental implementation of quantum computing and information processing devices, and in particular observations of quantum behavior in several solid state systems. On the theoretical side, the complementary expertise of the contributors provides models of the various structures in connection with the problem of minimizing decoherence.

  10. An introduction to reliable quantum computation

    CERN Document Server

    Aliferis, Panos

    2011-01-01

    This is an introduction to software methods of quantum fault tolerance. Broadly speaking, these methods describe strategies for using the noisy hardware components of a quantum computer to perform computations while continually monitoring and actively correcting the hardware faults. We discuss parallels and differences with similar methods for ordinary digital computation, we discuss some of the noise models used in designing and analyzing noisy quantum circuits, and we sketch the logic of some of the central results in this area of research.

  11. Quantum computing. Defining and detecting quantum speedup.

    Science.gov (United States)

    Rønnow, Troels F; Wang, Zhihui; Job, Joshua; Boixo, Sergio; Isakov, Sergei V; Wecker, David; Martinis, John M; Lidar, Daniel A; Troyer, Matthias

    2014-07-25

    The development of small-scale quantum devices raises the question of how to fairly assess and detect quantum speedup. Here, we show how to define and measure quantum speedup and how to avoid pitfalls that might mask or fake such a speedup. We illustrate our discussion with data from tests run on a D-Wave Two device with up to 503 qubits. By using random spin glass instances as a benchmark, we found no evidence of quantum speedup when the entire data set is considered and obtained inconclusive results when comparing subsets of instances on an instance-by-instance basis. Our results do not rule out the possibility of speedup for other classes of problems and illustrate the subtle nature of the quantum speedup question.

  12. Quantum computing with incoherent resources and quantum jumps.

    Science.gov (United States)

    Santos, M F; Cunha, M Terra; Chaves, R; Carvalho, A R R

    2012-04-27

    Spontaneous emission and the inelastic scattering of photons are two natural processes usually associated with decoherence and the reduction in the capacity to process quantum information. Here we show that, when suitably detected, these photons are sufficient to build all the fundamental blocks needed to perform quantum computation in the emitting qubits while protecting them from deleterious dissipative effects. We exemplify this by showing how to efficiently prepare graph states for the implementation of measurement-based quantum computation.

  13. Prospects for quantum computation with trapped ions

    Energy Technology Data Exchange (ETDEWEB)

    Hughes, R.J.; James, D.F.V.

    1997-12-31

    Over the past decade information theory has been generalized to allow binary data to be represented by two-state quantum mechanical systems. (A single two-level system has come to be known as a qubit in this context.) The additional freedom introduced into information physics with quantum systems has opened up a variety of capabilities that go well beyond those of conventional information. For example, quantum cryptography allows two parties to generate a secret key even in the presence of eavesdropping. But perhaps the most remarkable capabilities have been predicted in the field of quantum computation. Here, a brief survey of the requirements for quantum computational hardware, and an overview of the in trap quantum computation project at Los Alamos are presented. The physical limitations to quantum computation with trapped ions are discussed.

  14. Disciplines, models, and computers: the path to computational quantum chemistry.

    Science.gov (United States)

    Lenhard, Johannes

    2014-12-01

    Many disciplines and scientific fields have undergone a computational turn in the past several decades. This paper analyzes this sort of turn by investigating the case of computational quantum chemistry. The main claim is that the transformation from quantum to computational quantum chemistry involved changes in three dimensions. First, on the side of instrumentation, small computers and a networked infrastructure took over the lead from centralized mainframe architecture. Second, a new conception of computational modeling became feasible and assumed a crucial role. And third, the field of computa- tional quantum chemistry became organized in a market-like fashion and this market is much bigger than the number of quantum theory experts. These claims will be substantiated by an investigation of the so-called density functional theory (DFT), the arguably pivotal theory in the turn to computational quantum chemistry around 1990.

  15. Universal adiabatic quantum computation via the space-time circuit-to-Hamiltonian construction.

    Science.gov (United States)

    Gosset, David; Terhal, Barbara M; Vershynina, Anna

    2015-04-10

    We show how to perform universal adiabatic quantum computation using a Hamiltonian which describes a set of particles with local interactions on a two-dimensional grid. A single parameter in the Hamiltonian is adiabatically changed as a function of time to simulate the quantum circuit. We bound the eigenvalue gap above the unique ground state by mapping our model onto the ferromagnetic XXZ chain with kink boundary conditions; the gap of this spin chain was computed exactly by Koma and Nachtergaele using its q-deformed version of SU(2) symmetry. We also discuss a related time-independent Hamiltonian which was shown by Janzing to be capable of universal computation. We observe that in the limit of large system size, the time evolution is equivalent to the exactly solvable quantum walk on Young's lattice.

  16. Quantum computing with realistically noisy devices.

    Science.gov (United States)

    Knill, E

    2005-03-03

    In theory, quantum computers offer a means of solving problems that would be intractable on conventional computers. Assuming that a quantum computer could be constructed, it would in practice be required to function with noisy devices called 'gates'. These gates cause decoherence of the fragile quantum states that are central to the computer's operation. The goal of so-called 'fault-tolerant quantum computing' is therefore to compute accurately even when the error probability per gate (EPG) is high. Here we report a simple architecture for fault-tolerant quantum computing, providing evidence that accurate quantum computing is possible for EPGs as high as three per cent. Such EPGs have been experimentally demonstrated, but to avoid excessive resource overheads required by the necessary architecture, lower EPGs are needed. Assuming the availability of quantum resources comparable to the digital resources available in today's computers, we show that non-trivial quantum computations at EPGs of as high as one per cent could be implemented.

  17. Multilayer microwave integrated quantum circuits for scalable quantum computing

    Science.gov (United States)

    Brecht, Teresa; Pfaff, Wolfgang; Wang, Chen; Chu, Yiwen; Frunzio, Luigi; Devoret, Michel H.; Schoelkopf, Robert J.

    2016-02-01

    As experimental quantum information processing (QIP) rapidly advances, an emerging challenge is to design a scalable architecture that combines various quantum elements into a complex device without compromising their performance. In particular, superconducting quantum circuits have successfully demonstrated many of the requirements for quantum computing, including coherence levels that approach the thresholds for scaling. However, it remains challenging to couple a large number of circuit components through controllable channels while suppressing any other interactions. We propose a hardware platform intended to address these challenges, which combines the advantages of integrated circuit fabrication and the long coherence times achievable in three-dimensional circuit quantum electrodynamics. This multilayer microwave integrated quantum circuit platform provides a path towards the realisation of increasingly complex superconducting devices in pursuit of a scalable quantum computer.

  18. High orbital angular momentum quantum numbers in the electronic ground states of Fe$_2^+$ and Co$_2^+$ as determined by x-ray absorption and x-ray magnetic circular dichroism spectroscopy

    CERN Document Server

    Zamudio-Bayer, V; Langenberg, A; Lawicki, A; Terasaki, A; Issendorff, B v; Lau, J T

    2015-01-01

    The $^6\\Delta$ electronic ground state of the Co$_2^+$ diatomic molecular cation has been assigned experimentally by x-ray absorption and x-ray magnetic circular dichroism spectroscopy in a cryogenic ion trap. Three candidates, $^6\\Phi$, $^6\\Gamma$, and $^8\\Gamma$, for the electronic ground state of Fe$_2^+$ have been identified. These states carry sizable ground-state orbital angular momenta that disagree with theoretical predictions from multireference configuration interaction and density functional theory. Our results show that the ground states of neutral and cationic diatomic molecules of $3d$ elements cannot be assumed to be connected by a one-electron process.

  19. Computational quantum-classical boundary of noisy commuting quantum circuits.

    Science.gov (United States)

    Fujii, Keisuke; Tamate, Shuhei

    2016-05-18

    It is often said that the transition from quantum to classical worlds is caused by decoherence originated from an interaction between a system of interest and its surrounding environment. Here we establish a computational quantum-classical boundary from the viewpoint of classical simulatability of a quantum system under decoherence. Specifically, we consider commuting quantum circuits being subject to decoherence. Or equivalently, we can regard them as measurement-based quantum computation on decohered weighted graph states. To show intractability of classical simulation in the quantum side, we utilize the postselection argument and crucially strengthen it by taking noise effect into account. Classical simulatability in the classical side is also shown constructively by using both separable criteria in a projected-entangled-pair-state picture and the Gottesman-Knill theorem for mixed state Clifford circuits. We found that when each qubit is subject to a single-qubit complete-positive-trace-preserving noise, the computational quantum-classical boundary is sharply given by the noise rate required for the distillability of a magic state. The obtained quantum-classical boundary of noisy quantum dynamics reveals a complexity landscape of controlled quantum systems. This paves a way to an experimentally feasible verification of quantum mechanics in a high complexity limit beyond classically simulatable region.

  20. Quantum Computer Games: Schrodinger Cat and Hounds

    Science.gov (United States)

    Gordon, Michal; Gordon, Goren

    2012-01-01

    The quantum computer game "Schrodinger cat and hounds" is the quantum extension of the well-known classical game fox and hounds. Its main objective is to teach the unique concepts of quantum mechanics in a fun way. "Schrodinger cat and hounds" demonstrates the effects of superposition, destructive and constructive interference, measurements and…

  1. Quantum Computer Games: Schrodinger Cat and Hounds

    Science.gov (United States)

    Gordon, Michal; Gordon, Goren

    2012-01-01

    The quantum computer game "Schrodinger cat and hounds" is the quantum extension of the well-known classical game fox and hounds. Its main objective is to teach the unique concepts of quantum mechanics in a fun way. "Schrodinger cat and hounds" demonstrates the effects of superposition, destructive and constructive interference, measurements and…

  2. Nonlinear optics quantum computing with circuit QED.

    Science.gov (United States)

    Adhikari, Prabin; Hafezi, Mohammad; Taylor, J M

    2013-02-08

    One approach to quantum information processing is to use photons as quantum bits and rely on linear optical elements for most operations. However, some optical nonlinearity is necessary to enable universal quantum computing. Here, we suggest a circuit-QED approach to nonlinear optics quantum computing in the microwave regime, including a deterministic two-photon phase gate. Our specific example uses a hybrid quantum system comprising a LC resonator coupled to a superconducting flux qubit to implement a nonlinear coupling. Compared to the self-Kerr nonlinearity, we find that our approach has improved tolerance to noise in the qubit while maintaining fast operation.

  3. The one-way quantum computer - a non-network model of quantum computation

    CERN Document Server

    Raussendorf, R; Briegel, H J; Raussendorf, Robert; Browne, Daniel E.; Briegel, Hans J.

    2001-01-01

    A one-way quantum computer works by only performing a sequence of one-qubit measurements on a particular entangled multi-qubit state, the cluster state. No non-local operations are required in the process of computation. Any quantum logic network can be simulated on the one-way quantum computer. On the other hand, the network model of quantum computation cannot explain all ways of processing quantum information possible with the one-way quantum computer. In this paper, two examples of the non-network character of the one-way quantum computer are given. First, circuits in the Clifford group can be performed in a single time step. Second, the realisation of a particular circuit --the bit-reversal gate-- on the one-way quantum computer has no network interpretation. (Submitted to J. Mod. Opt, Gdansk ESF QIT conference issue.)

  4. An overview of quantum computation models: quantum automata

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    Quantum automata,as theoretical models of quantum computers,include quantum finite automata (QFA),quantum sequential machines (QSM),quantum pushdown automata (QPDA),quantum Turing machines (QTM),quantum cellular automata (QCA),and the others,for example,automata theory based on quantum logic (orthomodular lattice-valued automata).In this paper,we try to outline a basic progress in the research on these models,focusing on QFA,QSM,QPDA,QTM,and orthomodular lattice-valued automata.Also,other models closely relative to them are mentioned.In particular,based on the existing results in the literature,we finally address a number of problems to be studied in future.

  5. Quantum state diffusion, localization and computation

    CERN Document Server

    Schack, R; Percival, I C

    1995-01-01

    Numerical simulation of individual open quantum systems has proven advantages over density operator computations. Quantum state diffusion with a moving basis (MQSD) provides a practical numerical simulation method which takes full advantage of the localization of quantum states into wave packets occupying small regions of classical phase space. Following and extending the original proposal of Percival, Alber and Steimle, we show that MQSD can provide a further gain over ordinary QSD and other quantum trajectory methods of many orders of magnitude in computational space and time. Because of these gains, it is even possible to calculate an open quantum system trajectory when the corresponding isolated system is intractable. MQSD is particularly advantageous where classical or semiclassical dynamics provides an adequate qualitative picture but is numerically inaccurate because of significant quantum effects. The principles are illustrated by computations for the quantum Duffing oscillator and for second harmonic...

  6. Distributed measurement-based quantum computation

    CERN Document Server

    Danos, V; Kashefi, E; Panangaden, P; Danos, Vincent; Hondt, Ellie D'; Kashefi, Elham; Panangaden, Prakash

    2005-01-01

    We develop a formal model for distributed measurement-based quantum computations, adopting an agent-based view, such that computations are described locally where possible. Because the network quantum state is in general entangled, we need to model it as a global structure, reminiscent of global memory in classical agent systems. Local quantum computations are described as measurement patterns. Since measurement-based quantum computation is inherently distributed, this allows us to extend naturally several concepts of the measurement calculus, a formal model for such computations. Our goal is to define an assembly language, i.e. we assume that computations are well-defined and we do not concern ourselves with verification techniques. The operational semantics for systems of agents is given by a probabilistic transition system, and we define operational equivalence in a way that it corresponds to the notion of bisimilarity. With this in place, we prove that teleportation is bisimilar to a direct quantum channe...

  7. The potential of the quantum computer

    CERN Multimedia

    2006-01-01

    The Physics Section of the University of Geneva is continuing its series of lectures, open to the general public, on the most recent developments in the field of physics. The next lecture, given by Professor Michel Devoret of Yale University in the United States, will be on the potential of the quantum computer. The quantum computer is, as yet, a hypothetical machine which would operate on the basic principles of quantum mechanics. Compared to standard computers, it represents a significant gain in computing power for certain complex calculations. Quantum operations can simultaneously explore a very large number of possibilities. The correction of quantum errors, which until recently had been deemed impossible, has now become a well-established technique. Several prototypes for, as yet, very simple quantum processors have been developed. The lecture will begin with a demonstration in the auditorium of the detection of cosmic rays and, in collaboration with Professor E. Ellberger of the Conservatoire de M...

  8. Quantum computer of wire circuit architecture

    CERN Document Server

    Moiseev, S A; Andrianov, S N

    2010-01-01

    First solid state quantum computer was built using transmons (cooper pair boxes). The operation of the computer is limited because of using a number of the rigit cooper boxes working with fixed frequency at temperatures of superconducting material. Here, we propose a novel architecture of quantum computer based on a flexible wire circuit of many coupled quantum nodes containing controlled atomic (molecular) ensembles. We demonstrate wide opportunities of the proposed computer. Firstly, we reveal a perfect storage of external photon qubits to multi-mode quantum memory node and demonstrate a reversible exchange of the qubits between any arbitrary nodes. We found optimal parameters of atoms in the circuit and self quantum modes for quantum processing. The predicted perfect storage has been observed experimentally for microwave radiation on the lithium phthalocyaninate molecule ensemble. Then also, for the first time we show a realization of the efficient basic two-qubit gate with direct coupling of two arbitrary...

  9. Adiabatic Quantum Computation: Coherent Control Back Action

    Science.gov (United States)

    Goswami, Debabrata

    2013-01-01

    Though attractive from scalability aspects, optical approaches to quantum computing are highly prone to decoherence and rapid population loss due to nonradiative processes such as vibrational redistribution. We show that such effects can be reduced by adiabatic coherent control, in which quantum interference between multiple excitation pathways is used to cancel coupling to the unwanted, non-radiative channels. We focus on experimentally demonstrated adiabatic controlled population transfer experiments wherein the details on the coherence aspects are yet to be explored theoretically but are important for quantum computation. Such quantum computing schemes also form a back-action connection to coherent control developments. PMID:23788822

  10. Quantum Computing: Linear Optics Implementations

    CERN Document Server

    Sundsøy, Pål

    2016-01-01

    One of the main problems that optical quantum computing has to overcome is the efficient construction of two-photon gates. Theoretically these gates can be realized using Kerr-nonlinearities, but the techniques involved are experimentally very difficult. We therefore employ linear optics with projective measurements to generate these non-linearities. The downside is that the measurement-induced nonlinearities achieved with linear optics are less versatile and the success rate can be quite low. This project is mainly the result of a literature study but also a theoretical work on the physics behind quantum optical multiports which is essential for realizing two-photon gates. By applying different postcorrection techniques we increase the probability of success in a modifed non-linear sign shift gate which is foundational for the two photon controlled-NOT gate. We prove that it's not possible to correct the states by only using a single beam splitter. We show that it might be possible to increase the probabilit...

  11. Borromean ground state of fermions in two dimensions

    DEFF Research Database (Denmark)

    G. Volosniev, A.; V. Fedorov, D.; S. Jensen, A.;

    2014-01-01

    -body threshold. They are the lowest in a possible sequence of so-called super-Efimov states. While the observation of the super-Efimov scaling could be very difficult, the borromean ground state should be observable in cold atomic gases and could be the basis for producing a quantum gas of three-body states...

  12. On the Ground State Wave Function of Matrix Theory

    CERN Document Server

    Lin, Ying-Hsuan

    2014-01-01

    We propose an explicit construction of the leading terms in the asymptotic expansion of the ground state wave function of BFSS SU(N) matrix quantum mechanics. Our proposal is consistent with the expected factorization property in various limits of the Coulomb branch, and involves a different scaling behavior from previous suggestions. We comment on some possible physical implications.

  13. On the ground state wave function of matrix theory

    Science.gov (United States)

    Lin, Ying-Hsuan; Yin, Xi

    2015-11-01

    We propose an explicit construction of the leading terms in the asymptotic expansion of the ground state wave function of BFSS SU( N ) matrix quantum mechanics. Our proposal is consistent with the expected factorization property in various limits of the Coulomb branch, and involves a different scaling behavior from previous suggestions. We comment on some possible physical implications.

  14. Quantum Genetic Algorithms for Computer Scientists

    OpenAIRE

    Rafael Lahoz-Beltra

    2016-01-01

    Genetic algorithms (GAs) are a class of evolutionary algorithms inspired by Darwinian natural selection. They are popular heuristic optimisation methods based on simulated genetic mechanisms, i.e., mutation, crossover, etc. and population dynamical processes such as reproduction, selection, etc. Over the last decade, the possibility to emulate a quantum computer (a computer using quantum-mechanical phenomena to perform operations on data) has led to a new class of GAs known as “Quantum Geneti...

  15. On the completeness of quantum computation models

    CERN Document Server

    Arrighi, Pablo

    2010-01-01

    The notion of computability is stable (i.e. independent of the choice of an indexing) over infinite-dimensional vector spaces provided they have a finite "tensorial dimension". Such vector spaces with a finite tensorial dimension permit to define an absolute notion of completeness for quantum computation models and give a precise meaning to the Church-Turing thesis in the framework of quantum theory. (Extra keywords: quantum programming languages, denotational semantics, universality.)

  16. Quantum computation architecture using optical tweezers

    DEFF Research Database (Denmark)

    Weitenberg, Christof; Kuhr, Stefan; Mølmer, Klaus;

    2011-01-01

    We present a complete architecture for scalable quantum computation with ultracold atoms in optical lattices using optical tweezers focused to the size of a lattice spacing. We discuss three different two-qubit gates based on local collisional interactions. The gates between arbitrary qubits...... quantum computing....

  17. Quantum computer: an appliance for playing market games

    OpenAIRE

    Piotrowski, Edward W.; Jan Sladkowski

    2003-01-01

    Recent development in quantum computation and quantum information theory allows to extend the scope of game theory for the quantum world. The authors have recently proposed a quantum description of financial market in terms of quantum game theory. The paper contain an analysis of such markets that shows that there would be advantage in using quantum computers and quantum strategies.

  18. Physical implementation of a Majorana fermion surface code for fault-tolerant quantum computation

    Science.gov (United States)

    Vijay, Sagar; Fu, Liang

    2016-12-01

    We propose a physical realization of a commuting Hamiltonian of interacting Majorana fermions realizing Z 2 topological order, using an array of Josephson-coupled topological superconductor islands. The required multi-body interaction Hamiltonian is naturally generated by a combination of charging energy induced quantum phase-slips on the superconducting islands and electron tunneling between islands. Our setup improves on a recent proposal for implementing a Majorana fermion surface code (Vijay et al 2015 Phys. Rev. X 5 041038), a ‘hybrid’ approach to fault-tolerant quantum computation that combines (1) the engineering of a stabilizer Hamiltonian with a topologically ordered ground state with (2) projective stabilizer measurements to implement error correction and a universal set of logical gates. Our hybrid strategy has advantages over the traditional surface code architecture in error suppression and single-step stabilizer measurements, and is widely applicable to implementing stabilizer codes for quantum computation.

  19. Performing quantum computing experiments in the cloud

    Science.gov (United States)

    Devitt, Simon J.

    2016-09-01

    Quantum computing technology has reached a second renaissance in the past five years. Increased interest from both the private and public sector combined with extraordinary theoretical and experimental progress has solidified this technology as a major advancement in the 21st century. As anticipated my many, some of the first realizations of quantum computing technology has occured over the cloud, with users logging onto dedicated hardware over the classical internet. Recently, IBM has released the Quantum Experience, which allows users to access a five-qubit quantum processor. In this paper we take advantage of this online availability of actual quantum hardware and present four quantum information experiments. We utilize the IBM chip to realize protocols in quantum error correction, quantum arithmetic, quantum graph theory, and fault-tolerant quantum computation by accessing the device remotely through the cloud. While the results are subject to significant noise, the correct results are returned from the chip. This demonstrates the power of experimental groups opening up their technology to a wider audience and will hopefully allow for the next stage of development in quantum information technology.

  20. Computing a Turing-Incomputable Problem from Quantum Computing

    CERN Document Server

    Sicard, A; Ospina, J; Sicard, Andr\\'es; V\\'elez, Mario; Ospina, Juan

    2003-01-01

    A hypercomputation model named Infinite Square Well Hypercomputation Model (ISWHM) is built from quantum computation. This model is inspired by the model proposed by Tien D. Kieu quant-ph/0203034 and solves an Turing-incomputable problem. For the proposed model and problem, a simulation of its behavior is made. Furthermore, it is demonstrated that ISWHM is a universal quantum computation model.

  1. Universal quantum computation with little entanglement.

    Science.gov (United States)

    Van den Nest, Maarten

    2013-02-01

    We show that universal quantum computation can be achieved in the standard pure-state circuit model while the entanglement entropy of every bipartition is small in each step of the computation. The entanglement entropy required for large-scale quantum computation even tends to zero. Moreover we show that the same conclusion applies to many entanglement measures commonly used in the literature. This includes e.g., the geometric measure, localizable entanglement, multipartite concurrence, squashed entanglement, witness-based measures, and more generally any entanglement measure which is continuous in a certain natural sense. These results demonstrate that many entanglement measures are unsuitable tools to assess the power of quantum computers.

  2. Teleportation of Two Quantum States via the Quantum Computation

    Institute of Scientific and Technical Information of China (English)

    FENG Mang; ZHU Xi-Wen; FANG Xi-Ming; YAN Min; SHI Lei

    2000-01-01

    A scheme of teleportation of two unknown quantum states via quantum computation is proposed. The comparison with the former proposals shows that our scheme is more in tune with the original teleportation proposal and the effciency is higher. The teleportation of an unknown entangled state is also discussed.

  3. Numerical characteristics of quantum computer simulation

    Science.gov (United States)

    Chernyavskiy, A.; Khamitov, K.; Teplov, A.; Voevodin, V.; Voevodin, Vl.

    2016-12-01

    The simulation of quantum circuits is significantly important for the implementation of quantum information technologies. The main difficulty of such modeling is the exponential growth of dimensionality, thus the usage of modern high-performance parallel computations is relevant. As it is well known, arbitrary quantum computation in circuit model can be done by only single- and two-qubit gates, and we analyze the computational structure and properties of the simulation of such gates. We investigate the fact that the unique properties of quantum nature lead to the computational properties of the considered algorithms: the quantum parallelism make the simulation of quantum gates highly parallel, and on the other hand, quantum entanglement leads to the problem of computational locality during simulation. We use the methodology of the AlgoWiki project (algowiki-project.org) to analyze the algorithm. This methodology consists of theoretical (sequential and parallel complexity, macro structure, and visual informational graph) and experimental (locality and memory access, scalability and more specific dynamic characteristics) parts. Experimental part was made by using the petascale Lomonosov supercomputer (Moscow State University, Russia). We show that the simulation of quantum gates is a good base for the research and testing of the development methods for data intense parallel software, and considered methodology of the analysis can be successfully used for the improvement of the algorithms in quantum information science.

  4. Ground states of the SU(N) Heisenberg model.

    Science.gov (United States)

    Kawashima, Naoki; Tanabe, Yuta

    2007-02-02

    The SU(N) Heisenberg model with various single-row representations is investigated by quantum Monte Carlo simulations. While the zero-temperature phase boundary agrees qualitatively with the theoretical predictions based on the 1/N expansion, some unexpected features are also observed. For N> or =5 with the fundamental representation, for example, it is suggested that the ground states possess exact or approximate U(1) degeneracy. In addition, for the representation of Young tableau with more than one column, the ground state shows no valence-bond-solid order even at N greater than the threshold value.

  5. Toward Triplet Ground State NaLi Molecules

    Science.gov (United States)

    Ebadi, Sepehr; Jamison, Alan; Rvachov, Timur; Jing, Li; Son, Hyungmok; Jiang, Yijun; Zwierlein, Martin; Ketterle, Wolfgang

    2016-05-01

    The NaLi molecule is expected to have a long lifetime in the triplet ground-state due to its fermionic nature, large rotational constant, and weak spin-orbit coupling. The triplet state has both electric and magnetic dipole moments, affording unique opportunities in quantum simulation and ultracold chemistry. We have mapped the excited state NaLi triplet potential by means of photoassociation spectroscopy. We report on this and our further progress toward the creation of the triplet ground-state molecules using STIRAP. NSF, ARO-MURI, Samsung, NSERC.

  6. Quantum Computation Using Optically Coupled Quantum Dot Arrays

    Science.gov (United States)

    Pradhan, Prabhakar; Anantram, M. P.; Wang, K. L.; Roychowhury, V. P.; Saini, Subhash (Technical Monitor)

    1998-01-01

    A solid state model for quantum computation has potential advantages in terms of the ease of fabrication, characterization, and integration. The fundamental requirements for a quantum computer involve the realization of basic processing units (qubits), and a scheme for controlled switching and coupling among the qubits, which enables one to perform controlled operations on qubits. We propose a model for quantum computation based on optically coupled quantum dot arrays, which is computationally similar to the atomic model proposed by Cirac and Zoller. In this model, individual qubits are comprised of two coupled quantum dots, and an array of these basic units is placed in an optical cavity. Switching among the states of the individual units is done by controlled laser pulses via near field interaction using the NSOM technology. Controlled rotations involving two or more qubits are performed via common cavity mode photon. We have calculated critical times, including the spontaneous emission and switching times, and show that they are comparable to the best times projected for other proposed models of quantum computation. We have also shown the feasibility of accessing individual quantum dots using the NSOM technology by calculating the photon density at the tip, and estimating the power necessary to perform the basic controlled operations. We are currently in the process of estimating the decoherence times for this system; however, we have formulated initial arguments which seem to indicate that the decoherence times will be comparable, if not longer, than many other proposed models.

  7. Computational security of quantum encryption

    NARCIS (Netherlands)

    Alagic, G.; Broadbent, A.; Fefferman, B.; Gagliardoni, T.; Schaffner, C.; St. Jules, M.; Nascimento, A.C.A.; Barreto, P.

    2016-01-01

    Quantum-mechanical devices have the potential to transform cryptography. Most research in this area has focused either on the information-theoretic advantages of quantum protocols or on the security of classical cryptographic schemes against quantum attacks. In this work, we initiate the study of

  8. Numerical computation for teaching quantum statistics

    Science.gov (United States)

    Price, Tyson; Swendsen, Robert H.

    2013-11-01

    The study of ideal quantum gases reveals surprising quantum effects that can be observed in macroscopic systems. The properties of bosons are particularly unusual because a macroscopic number of particles can occupy a single quantum state. We describe a computational approach that supplements the usual analytic derivations applicable in the thermodynamic limit. The approach involves directly summing over the quantum states for finite systems and avoids the need for doing difficult integrals. The results display the unusual behavior of quantum gases even for relatively small systems.

  9. Hyper-parallel photonic quantum computation with coupled quantum dots

    Science.gov (United States)

    Ren, Bao-Cang; Deng, Fu-Guo

    2014-01-01

    It is well known that a parallel quantum computer is more powerful than a classical one. So far, there are some important works about the construction of universal quantum logic gates, the key elements in quantum computation. However, they are focused on operating on one degree of freedom (DOF) of quantum systems. Here, we investigate the possibility of achieving scalable hyper-parallel quantum computation based on two DOFs of photon systems. We construct a deterministic hyper-controlled-not (hyper-CNOT) gate operating on both the spatial-mode and the polarization DOFs of a two-photon system simultaneously, by exploiting the giant optical circular birefringence induced by quantum-dot spins in double-sided optical microcavities as a result of cavity quantum electrodynamics (QED). This hyper-CNOT gate is implemented by manipulating the four qubits in the two DOFs of a two-photon system without auxiliary spatial modes or polarization modes. It reduces the operation time and the resources consumed in quantum information processing, and it is more robust against the photonic dissipation noise, compared with the integration of several cascaded CNOT gates in one DOF. PMID:24721781

  10. Conceptual aspects of geometric quantum computation

    Science.gov (United States)

    Sjöqvist, Erik; Azimi Mousolou, Vahid; Canali, Carlo M.

    2016-10-01

    Geometric quantum computation is the idea that geometric phases can be used to implement quantum gates, i.e., the basic elements of the Boolean network that forms a quantum computer. Although originally thought to be limited to adiabatic evolution, controlled by slowly changing parameters, this form of quantum computation can as well be realized at high speed by using nonadiabatic schemes. Recent advances in quantum gate technology have allowed for experimental demonstrations of different types of geometric gates in adiabatic and nonadiabatic evolution. Here, we address some conceptual issues that arise in the realizations of geometric gates. We examine the appearance of dynamical phases in quantum evolution and point out that not all dynamical phases need to be compensated for in geometric quantum computation. We delineate the relation between Abelian and non-Abelian geometric gates and find an explicit physical example where the two types of gates coincide. We identify differences and similarities between adiabatic and nonadiabatic realizations of quantum computation based on non-Abelian geometric phases.

  11. Effective pure states for bulk quantum computation

    Energy Technology Data Exchange (ETDEWEB)

    Knill, E.; Chuang, I.; Laflamme, R.

    1997-11-01

    In bulk quantum computation one can manipulate a large number of indistinguishable quantum computers by parallel unitary operations and measure expectation values of certain observables with limited sensitivity. The initial state of each computer in the ensemble is known but not pure. Methods for obtaining effective pure input states by a series of manipulations have been described by Gershenfeld and Chuang (logical labeling) and Corey et al. (spatial averaging) for the case of quantum computation with nuclear magnetic resonance. We give a different technique called temporal averaging. This method is based on classical randomization, requires no ancilla qubits and can be implemented in nuclear magnetic resonance without using gradient fields. We introduce several temporal averaging algorithms suitable for both high temperature and low temperature bulk quantum computing and analyze the signal to noise behavior of each.

  12. Quantum Computing with Electron Spins in Quantum Dots

    CERN Document Server

    Vandersypen, L M K; Van Beveren, L H W; Elzerman, J M; Greidanus, J S; De Franceschi, S; Kouwenhoven, Leo P

    2002-01-01

    We present a set of concrete and realistic ideas for the implementation of a small-scale quantum computer using electron spins in lateral GaAs/AlGaAs quantum dots. Initialization is based on leads in the quantum Hall regime with tunable spin-polarization. Read-out hinges on spin-to-charge conversion via spin-selective tunneling to or from the leads, followed by measurement of the number of electron charges on the dot via a charge detector. Single-qubit manipulation relies on a microfabricated wire located close to the quantum dot, and two-qubit interactions are controlled via the tunnel barrier connecting the respective quantum dots. Based on these ideas, we have begun a series of experiments in order to demonstrate unitary control and to measure the coherence time of individual electron spins in quantum dots.

  13. Fault tolerant quantum computation with nondeterministic gates.

    Science.gov (United States)

    Li, Ying; Barrett, Sean D; Stace, Thomas M; Benjamin, Simon C

    2010-12-17

    In certain approaches to quantum computing the operations between qubits are nondeterministic and likely to fail. For example, a distributed quantum processor would achieve scalability by networking together many small components; operations between components should be assumed to be failure prone. In the ultimate limit of this architecture each component contains only one qubit. Here we derive thresholds for fault-tolerant quantum computation under this extreme paradigm. We find that computation is supported for remarkably high failure rates (exceeding 90%) providing that failures are heralded; meanwhile the rate of unknown errors should not exceed 2 in 10(4) operations.

  14. Measurement Based Quantum Computation on Fractal Lattices

    Directory of Open Access Journals (Sweden)

    Michal Hajdušek

    2010-06-01

    Full Text Available In this article we extend on work which establishes an analology between one-way quantum computation and thermodynamics to see how the former can be performed on fractal lattices. We find fractals lattices of arbitrary dimension greater than one which do all act as good resources for one-way quantum computation, and sets of fractal lattices with dimension greater than one all of which do not. The difference is put down to other topological factors such as ramification and connectivity. This work adds confidence to the analogy and highlights new features to what we require for universal resources for one-way quantum computation.

  15. Non-Mechanism in Quantum Oracle Computing

    CERN Document Server

    Castagnoli, G C

    1999-01-01

    A typical oracle problem is finding which software program is installed on a computer, by running the computer and testing its input-output behaviour. The program is randomly chosen from a set of programs known to the problem solver. As well known, some oracle problems are solved more efficiently by using quantum algorithms; this naturally implies changing the computer to quantum, while the choice of the software program remains sharp. In order to highlight the non-mechanistic origin of this higher efficiency, also the uncertainty about which program is installed must be represented in a quantum way.

  16. Quantum Computation explained to my Mother

    CERN Document Server

    Arrighi, P

    2003-01-01

    There are many falsely intuitive introductions to quantum theory and quantum computation in a handwave. There are also numerous documents which teach those subjects in a mathematically sound manner. To my knowledge this paper is the shortest of the latter category. The aim is to deliver a short yet rigorous and self-contained introduction to Quantum Computation, whilst assuming the reader has no prior knowledge of anything but the fundamental operations on real numbers. Successively I introduce complex matrices; the postulates of quantum theory and the simplest quantum algorithm. The document originates from a fifty minutes talk addressed to a non-specialist audience, in which I sought to take the shortest mathematical path that proves a quantum algorithm right.

  17. Borromean ground state of fermions in two dimensions

    Science.gov (United States)

    Volosniev, A. G.; Fedorov, D. V.; Jensen, A. S.; Zinner, N. T.

    2014-09-01

    The study of quantum mechanical bound states is as old as quantum theory itself. Yet, it took many years to realize that three-body Borromean systems that are bound when any two-body subsystem is unbound are abundant in nature. Here we demonstrate the existence of Borromean systems of spin-polarized (spinless) identical fermions in two spatial dimensions. The ground state with zero orbital (planar) angular momentum exists in a Borromean window between critical two- and three-body strengths. The doubly degenerate first excited states of angular momentum one appears only very close to the two-body threshold. They are the lowest in a possible sequence of so-called super-Efimov states. While the observation of the super-Efimov scaling could be very difficult, the Borromean ground state should be observable in cold atomic gases and could be the basis for producing a quantum gas of three-body states in two dimensions.

  18. Local reversibility and entanglement structure of many-body ground states

    CERN Document Server

    Kuwahara, Tomotaka; Amico, Luigi; Vedral, Vlatko

    2015-01-01

    The low-temperature physics of quantum many-body systems is largely governed by the structure of their ground states. Minimizing the energy of local interactions, ground states often reflect strong properties of locality such as the area law for entanglement entropy and the exponential decay of correlations between spatially separated observables. In this letter we present a novel characterization of locality in quantum states, which we call `local reversibility'. It characterizes the type of operations that are needed to reverse the action of a general disturbance on the state. We prove that unique ground states of gapped local Hamiltonian are locally reversible. This way, we identify new fundamental features of many-body ground states, which cannot be derived from the aforementioned properties. We use local reversibility to distinguish between states enjoying microscopic and macroscopic quantum phenomena. To demonstrate the potential of our approach, we prove specific properties of ground states, which are ...

  19. Ramsey numbers and adiabatic quantum computing.

    Science.gov (United States)

    Gaitan, Frank; Clark, Lane

    2012-01-06

    The graph-theoretic Ramsey numbers are notoriously difficult to calculate. In fact, for the two-color Ramsey numbers R(m,n) with m, n≥3, only nine are currently known. We present a quantum algorithm for the computation of the Ramsey numbers R(m,n). We show how the computation of R(m,n) can be mapped to a combinatorial optimization problem whose solution can be found using adiabatic quantum evolution. We numerically simulate this adiabatic quantum algorithm and show that it correctly determines the Ramsey numbers R(3,3) and R(2,s) for 5≤s≤7. We then discuss the algorithm's experimental implementation, and close by showing that Ramsey number computation belongs to the quantum complexity class quantum Merlin Arthur.

  20. Materials Frontiers to Empower Quantum Computing

    Energy Technology Data Exchange (ETDEWEB)

    Taylor, Antoinette Jane [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Sarrao, John Louis [Los Alamos National Lab. (LANL), Los Alamos, NM (United States); Richardson, Christopher [Laboratory for Physical Sciences, College Park, MD (United States)

    2015-06-11

    This is an exciting time at the nexus of quantum computing and materials research. The materials frontiers described in this report represent a significant advance in electronic materials and our understanding of the interactions between the local material and a manufactured quantum state. Simultaneously, directed efforts to solve materials issues related to quantum computing provide an opportunity to control and probe the fundamental arrangement of matter that will impact all electronic materials. An opportunity exists to extend our understanding of materials functionality from electronic-grade to quantum-grade by achieving a predictive understanding of noise and decoherence in qubits and their origins in materials defects and environmental coupling. Realizing this vision systematically and predictively will be transformative for quantum computing and will represent a qualitative step forward in materials prediction and control.

  1. Characterization of ground state entanglement by single-qubit operations and excitation energies

    CERN Document Server

    Giampaolo, S M; Illuminati, F; Verrucchi, P; Giampaolo, Salvatore M.; Illuminati, Fabrizio; Siena, Silvio De; Verrucchi, Paola

    2006-01-01

    We consider single-qubit unitary operations and study the associated excitation energies above the ground state of interacting quantum spins. We prove that there exists a unique operation such that the vanishing of the corresponding excitation energy determines a necessary and sufficient condition for the separability of the ground state. We show that the energy difference associated to factorization exhibits a monotonic behavior with the one-tangle and the entropy of entanglement, including non analiticity at quantum critical points. The single-qubit excitation energy thus provides an independent, directly observable characterization of ground state entanglement, and a simple relation connecting two universal physical resources, energy and nonlocal quantum correlations.

  2. Reducing computational complexity of quantum correlations

    Science.gov (United States)

    Chanda, Titas; Das, Tamoghna; Sadhukhan, Debasis; Pal, Amit Kumar; SenDe, Aditi; Sen, Ujjwal

    2015-12-01

    We address the issue of reducing the resource required to compute information-theoretic quantum correlation measures such as quantum discord and quantum work deficit in two qubits and higher-dimensional systems. We show that determination of the quantum correlation measure is possible even if we utilize a restricted set of local measurements. We find that the determination allows us to obtain a closed form of quantum discord and quantum work deficit for several classes of states, with a low error. We show that the computational error caused by the constraint over the complete set of local measurements reduces fast with an increase in the size of the restricted set, implying usefulness of constrained optimization, especially with the increase of dimensions. We perform quantitative analysis to investigate how the error scales with the system size, taking into account a set of plausible constructions of the constrained set. Carrying out a comparative study, we show that the resource required to optimize quantum work deficit is usually higher than that required for quantum discord. We also demonstrate that minimization of quantum discord and quantum work deficit is easier in the case of two-qubit mixed states of fixed ranks and with positive partial transpose in comparison to the corresponding states having nonpositive partial transpose. Applying the methodology to quantum spin models, we show that the constrained optimization can be used with advantage in analyzing such systems in quantum information-theoretic language. For bound entangled states, we show that the error is significantly low when the measurements correspond to the spin observables along the three Cartesian coordinates, and thereby we obtain expressions of quantum discord and quantum work deficit for these bound entangled states.

  3. Experimental comparison of two quantum computing architectures

    Science.gov (United States)

    Linke, Norbert M.; Maslov, Dmitri; Roetteler, Martin; Debnath, Shantanu; Figgatt, Caroline; Landsman, Kevin A.; Wright, Kenneth; Monroe, Christopher

    2017-01-01

    We run a selection of algorithms on two state-of-the-art 5-qubit quantum computers that are based on different technology platforms. One is a publicly accessible superconducting transmon device (www.research.ibm.com/ibm-q) with limited connectivity, and the other is a fully connected trapped-ion system. Even though the two systems have different native quantum interactions, both can be programed in a way that is blind to the underlying hardware, thus allowing a comparison of identical quantum algorithms between different physical systems. We show that quantum algorithms and circuits that use more connectivity clearly benefit from a better-connected system of qubits. Although the quantum systems here are not yet large enough to eclipse classical computers, this experiment exposes critical factors of scaling quantum computers, such as qubit connectivity and gate expressivity. In addition, the results suggest that codesigning particular quantum applications with the hardware itself will be paramount in successfully using quantum computers in the future. PMID:28325879

  4. Is the Brain a Quantum Computer?

    Science.gov (United States)

    Litt, Abninder; Eliasmith, Chris; Kroon, Frederick W.; Weinstein, Steven; Thagard, Paul

    2006-01-01

    We argue that computation via quantum mechanical processes is irrelevant to explaining how brains produce thought, contrary to the ongoing speculations of many theorists. First, quantum effects do not have the temporal properties required for neural information processing. Second, there are substantial physical obstacles to any organic…

  5. Experimental comparison of two quantum computing architectures.

    Science.gov (United States)

    Linke, Norbert M; Maslov, Dmitri; Roetteler, Martin; Debnath, Shantanu; Figgatt, Caroline; Landsman, Kevin A; Wright, Kenneth; Monroe, Christopher

    2017-03-28

    We run a selection of algorithms on two state-of-the-art 5-qubit quantum computers that are based on different technology platforms. One is a publicly accessible superconducting transmon device (www. ibm.com/ibm-q) with limited connectivity, and the other is a fully connected trapped-ion system. Even though the two systems have different native quantum interactions, both can be programed in a way that is blind to the underlying hardware, thus allowing a comparison of identical quantum algorithms between different physical systems. We show that quantum algorithms and circuits that use more connectivity clearly benefit from a better-connected system of qubits. Although the quantum systems here are not yet large enough to eclipse classical computers, this experiment exposes critical factors of scaling quantum computers, such as qubit connectivity and gate expressivity. In addition, the results suggest that codesigning particular quantum applications with the hardware itself will be paramount in successfully using quantum computers in the future.

  6. Directional coupling for quantum computing and communication.

    Science.gov (United States)

    Nikolopoulos, Georgios M

    2008-11-14

    We introduce the concept of directional coupling, i.e., the selective transfer of a state between adjacent quantum wires, in the context of quantum computing and communication. Our analysis rests upon a mathematical analogy between a dual-channel directional coupler and a composite spin system.

  7. An introduction to quantum computing algorithms

    CERN Document Server

    Pittenger, Arthur O

    2000-01-01

    In 1994 Peter Shor [65] published a factoring algorithm for a quantum computer that finds the prime factors of a composite integer N more efficiently than is possible with the known algorithms for a classical com­ puter. Since the difficulty of the factoring problem is crucial for the se­ curity of a public key encryption system, interest (and funding) in quan­ tum computing and quantum computation suddenly blossomed. Quan­ tum computing had arrived. The study of the role of quantum mechanics in the theory of computa­ tion seems to have begun in the early 1980s with the publications of Paul Benioff [6]' [7] who considered a quantum mechanical model of computers and the computation process. A related question was discussed shortly thereafter by Richard Feynman [35] who began from a different perspec­ tive by asking what kind of computer should be used to simulate physics. His analysis led him to the belief that with a suitable class of "quantum machines" one could imitate any quantum system.

  8. Scaling ion traps for quantum computing

    CSIR Research Space (South Africa)

    Uys, H

    2010-09-01

    Full Text Available The design, fabrication and preliminary testing of a chipscale, multi-zone, surface electrode ion trap is reported. The modular design and fabrication techniques used are anticipated to advance scalability of ion trap quantum computing architectures...

  9. Optimised resource construction for verifiable quantum computation

    Science.gov (United States)

    Kashefi, Elham; Wallden, Petros

    2017-04-01

    Recent developments have brought the possibility of achieving scalable quantum networks and quantum devices closer. From the computational point of view these emerging technologies become relevant when they are no longer classically simulatable. Hence a pressing challenge is the construction of practical methods to verify the correctness of the outcome produced by universal or non-universal quantum devices. A promising approach that has been extensively explored is the scheme of verification via encryption through blind quantum computation. We present here a new construction that simplifies the required resources for any such verifiable protocol. We obtain an overhead that is linear in the size of the input (computation), while the security parameter remains independent of the size of the computation and can be made exponentially small (with a small extra cost). Furthermore our construction is generic and could be applied to any universal or non-universal scheme with a given underlying graph.

  10. Universality of Black Hole Quantum Computing

    CERN Document Server

    Dvali, Gia; Lust, Dieter; Omar, Yasser; Richter, Benedikt

    2016-01-01

    By analyzing the key properties of black holes from the point of view of quantum information, we derive a model-independent picture of black hole quantum computing. It has been noticed that this picture exhibits striking similarities with quantum critical condensates, allowing the use of a common language to describe quantum computing in both systems. We analyze such quantum computing by allowing coupling to external modes, under the condition that the external influence must be soft-enough in order not to offset the basic properties of the system. We derive model-independent bounds on some crucial time-scales, such as the times of gate operation, decoherence, maximal entanglement and total scrambling. We show that for black hole type quantum computers all these time-scales are of the order of the black hole half-life time. Furthermore, we construct explicitly a set of Hamiltonians that generates a universal set of quantum gates for the black hole type computer. We find that the gates work at maximal energy e...

  11. Quantum Mechanical Nature in Liquid NMR Quantum Computing

    Institute of Scientific and Technical Information of China (English)

    LONGGui-Lu; YANHai-Yang; 等

    2002-01-01

    The quantum nature of bulk ensemble NMR quantum computing-the center of recent heated debate,is addressed.Concepts of the mixed state and entanglement are examined,and the data in a two-qubit liquid NMR quantum computation are analyzed.the main points in this paper are;i) Density matrix describes the "state" of an average particle in an ensemble.It does not describe the state of an individual particle in an ensemble;ii) Entanglement is a property of the wave function of a microscopic particle(such as a molecule in a liquid NMR sample),and separability of the density matrix canot be used to measure the entanglement of mixed ensemble;iii) The state evolution in bulkensemble NMR quantum computation is quantum-mechanical;iv) The coefficient before the effective pure state density matrix,ε,is a measure of the simultaneity of the molecules in an ensemble,It reflets the intensity of the NMR signal and has no significance in quantifying the entanglement in the bulk ensemble NMR system.The decomposition of the density matrix into product states is only an indication that the ensemble can be prepared by an ensemble with the particles unentangeld.We conclude that effective-pure-state NMR quantum computation is genuine,not just classical simulations.

  12. Delayed Commutation in Quantum Computer Networks

    Science.gov (United States)

    García-Escartín, Juan Carlos; Chamorro-Posada, Pedro

    2006-09-01

    In the same way that classical computer networks connect and enhance the capabilities of classical computers, quantum networks can combine the advantages of quantum information and communication. We propose a nonclassical network element, a delayed commutation switch, that can solve the problem of switching time in packet switching networks. With the help of some local ancillary qubits and superdense codes, we can route a qubit packet after part of it has left the network node.

  13. Delayed commutation in quantum computer networks

    CERN Document Server

    Garcia-Escartin, J C; Chamorro-Posada, Pedro; Garcia-Escartin, Juan Carlos

    2005-01-01

    In the same way that classical computer networks connect and enhance the capabilities of classical computers, quantum networks can combine the advantages of quantum information and communications. We propose a non-classical network element, a delayed commutation switch, that can solve the problem of switching time in packet switching networks. With the help of some local ancillary qubits and superdense codes we can route the information after part of it has left the network node.

  14. Braid group representation on quantum computation

    Energy Technology Data Exchange (ETDEWEB)

    Aziz, Ryan Kasyfil, E-mail: kasyfilryan@gmail.com [Department of Computational Sciences, Bandung Institute of Technology (Indonesia); Muchtadi-Alamsyah, Intan, E-mail: ntan@math.itb.ac.id [Algebra Research Group, Bandung Institute of Technology (Indonesia)

    2015-09-30

    There are many studies about topological representation of quantum computation recently. One of diagram representation of quantum computation is by using ZX-Calculus. In this paper we will make a diagrammatical scheme of Dense Coding. We also proved that ZX-Calculus diagram of maximally entangle state satisfies Yang-Baxter Equation and therefore, we can construct a Braid Group representation of set of maximally entangle state.

  15. Quantum Computing and Shor`s Factoring Algorithm

    OpenAIRE

    Volovich, Igor V.

    2001-01-01

    Lectures on quantum computing. Contents: Algorithms. Quantum circuits. Quantum Fourier transform. Elements of number theory. Modular exponentiation. Shor`s algorithm for finding the order. Computational complexity of Schor`s algorithm. Factoring integers. NP-complete problems.

  16. Private quantum computation: an introduction to blind quantum computing and related protocols

    Science.gov (United States)

    Fitzsimons, Joseph F.

    2017-06-01

    Quantum technologies hold the promise of not only faster algorithmic processing of data, via quantum computation, but also of more secure communications, in the form of quantum cryptography. In recent years, a number of protocols have emerged which seek to marry these concepts for the purpose of securing computation rather than communication. These protocols address the task of securely delegating quantum computation to an untrusted device while maintaining the privacy, and in some instances the integrity, of the computation. We present a review of the progress to date in this emerging area.

  17. EDITORIAL: Quantum Computing and the Feynman Festival

    Science.gov (United States)

    Brandt, Howard E.; Kim, Young S.; Man'ko, Margarita A.

    2003-12-01

    The Feynman Festival is a new interdisciplinary conference developed for studying Richard Feynman and his physics. The first meeting of this new conference series was held at the University of Maryland on 23--28 August 2002 (http://www.physics.umd.edu/robot/feynman.html) and the second meeting is scheduled for August 2004 at the same venue. According to Feynman, the different aspects of nature are different aspects of the same thing. Therefore, the ultimate purpose of the conference is to find Feynman's same thing from all different theories. For this reason, the first meeting of the Festival did not begin with a fixed formula, but composed its scientific programme based on responses from the entire physics community. The conference drew the most enthusiastic response from the community of quantum computing, the field initiated by Feynman. Encouraged by the response, we decided to edit a special issue of Journal of Optics B: Quantum and Semiclassical Optics on quantum computing in connection with the first Feynman Festival. The authorship is not restricted to the participants of the Feynman Festival, and all interested parties were encouraged to submit their papers on this subject. Needless to say, all the papers were peer reviewed according to the well-established standards of the journal. The subject of quantum computing is not restricted to building and operating computers. It requires a deeper understanding of how quantum mechanics works in materials as well as in our minds. Indeed, it covers the basic foundations of quantum mechanics, measurement theory, information theory, quantum optics, atomic physics and condensed matter physics. It may be necessary to develop new mathematical tools to accommodate the language that nature speaks. It is gratifying to note that this special issue contains papers covering all these aspects of quantum computing. As Feynman noted, we could be discussing these diversified issues to study one problem. In our case, this `one

  18. Superadiabatic holonomic quantum computation in cavity QED

    Science.gov (United States)

    Liu, Bao-Jie; Huang, Zhen-Hua; Xue, Zheng-Yuan; Zhang, Xin-Ding

    2017-06-01

    Adiabatic quantum control is a powerful tool for quantum engineering and a key component in some quantum computation models, where accurate control over the timing of the involved pulses is not needed. However, the adiabatic condition requires that the process be very slow and thus limits its application in quantum computation, where quantum gates are preferred to be fast due to the limited coherent times of the quantum systems. Here, we propose a feasible scheme to implement universal holonomic quantum computation based on non-Abelian geometric phases with superadiabatic quantum control, where the adiabatic manipulation is sped up while retaining its robustness against errors in the timing control. Consolidating the advantages of both strategies, our proposal is thus both robust and fast. The cavity QED system is adopted as a typical example to illustrate the merits where the proposed scheme can be realized in a tripod configuration by appropriately controlling the pulse shapes and their relative strength. To demonstrate the distinct performance of our proposal, we also compare our scheme with the conventional adiabatic strategy.

  19. Fundamental gravitational limitations to quantum computing

    CERN Document Server

    Gambini, R; Pullin, J; Gambini, Rodolfo; Porto, Rafael A.; Pullin, Jorge

    2005-01-01

    Lloyd has considered the ultimate limitations physics places on quantum computers. He concludes in particular that for an ``ultimate laptop'' (a computer of one liter of volume and one kilogram of mass) the maximum number of operations per second is bounded by $10^{51}$. The limit is derived considering ordinary quantum mechanics. Here we consider additional limits that are placed by quantum gravity ideas, namely the use of a relational notion of time and fundamental gravitational limits that exist on time measurements. We then particularize for the case of an ultimate laptop and show that the maximum number of operations is further constrained to $10^{47}$ per second.

  20. Natural and artificial atoms for quantum computation

    Energy Technology Data Exchange (ETDEWEB)

    Buluta, Iulia; Ashhab, Sahel; Nori, Franco, E-mail: fnori@riken.jp [Advanced Science Institute, RIKEN, Wako-shi, Saitama, 351-0198 (Japan)

    2011-10-15

    Remarkable progress towards realizing quantum computation has been achieved using natural and artificial atoms as qubits. This paper presents a brief overview of the current status of different types of qubits. On the one hand, natural atoms (such as neutral atoms and ions) have long coherence times, and could be stored in large arrays, providing ideal 'quantum memories'. On the other hand, artificial atoms (such as superconducting circuits or semiconductor quantum dots) have the advantage of custom-designed features and could be used as 'quantum processing units'. Natural and artificial atoms can be coupled with each other and can also be interfaced with photons for long-distance communications. Hybrid devices made of natural/artificial atoms and photons may provide the next-generation design for quantum computers.

  1. Quantum Fourier transform in computational basis

    Science.gov (United States)

    Zhou, S. S.; Loke, T.; Izaac, J. A.; Wang, J. B.

    2017-03-01

    The quantum Fourier transform, with exponential speed-up compared to the classical fast Fourier transform, has played an important role in quantum computation as a vital part of many quantum algorithms (most prominently, Shor's factoring algorithm). However, situations arise where it is not sufficient to encode the Fourier coefficients within the quantum amplitudes, for example in the implementation of control operations that depend on Fourier coefficients. In this paper, we detail a new quantum scheme to encode Fourier coefficients in the computational basis, with fidelity 1 - δ and digit accuracy ɛ for each Fourier coefficient. Its time complexity depends polynomially on log (N), where N is the problem size, and linearly on 1/δ and 1/ɛ . We also discuss an application of potential practical importance, namely the simulation of circulant Hamiltonians.

  2. Brain-Computer Interfaces and Quantum Robots

    CERN Document Server

    Pessa, Eliano

    2009-01-01

    The actual (classical) Brain-Computer Interface attempts to use brain signals to drive suitable actuators performing the actions corresponding to subject's intention. However this goal is not fully reached, and when BCI works, it does only in particular situations. The reason of this unsatisfactory result is that intention cannot be conceived simply as a set of classical input-output relationships. It is therefore necessary to resort to quantum theory, allowing the occurrence of stable coherence phenomena, in turn underlying high-level mental processes such as intentions and strategies. More precisely, within the context of a dissipative Quantum Field Theory of brain operation it is possible to introduce generalized coherent states associated, within the framework of logic, to the assertions of a quantum metalanguage. The latter controls the quantum-mechanical computing corresponding to standard mental operation. It thus become possible to conceive a Quantum Cyborg in which a human mind controls, through a qu...

  3. Cat-qubits for quantum computation

    Science.gov (United States)

    Mirrahimi, Mazyar

    2016-08-01

    The development of quantum Josephson circuits has created a strong expectation for reliable processing of quantum information. While this progress has already led to various proof-of-principle experiments on small-scale quantum systems, a major scaling step is required towards many-qubit protocols. Fault-tolerant computation with protected logical qubits usually comes at the expense of a significant overhead in the hardware. Each of the involved physical qubits still needs to satisfy the best achieved properties (coherence times, coupling strengths and tunability). Here, and in the aim of addressing alternative approaches to deal with these obstacles, I overview a series of recent theoretical proposals, and the experimental developments following these proposals, to enable a hardware-efficient paradigm for quantum memory protection and universal quantum computation. xml:lang="fr"

  4. Robust dynamical decoupling for quantum computing and quantum memory.

    Science.gov (United States)

    Souza, Alexandre M; Alvarez, Gonzalo A; Suter, Dieter

    2011-06-17

    Dynamical decoupling (DD) is a popular technique for protecting qubits from the environment. However, unless special care is taken, experimental errors in the control pulses used in this technique can destroy the quantum information instead of preserving it. Here, we investigate techniques for making DD sequences robust against different types of experimental errors while retaining good decoupling efficiency in a fluctuating environment. We present experimental data from solid-state nuclear spin qubits and introduce a new DD sequence that is suitable for quantum computing and quantum memory.

  5. Quantum algorithms for computational nuclear physics

    Directory of Open Access Journals (Sweden)

    Višňák Jakub

    2015-01-01

    Full Text Available While quantum algorithms have been studied as an efficient tool for the stationary state energy determination in the case of molecular quantum systems, no similar study for analogical problems in computational nuclear physics (computation of energy levels of nuclei from empirical nucleon-nucleon or quark-quark potentials have been realized yet. Although the difference between the above mentioned studies might seem negligible, it will be examined. First steps towards a particular simulation (on classical computer of the Iterative Phase Estimation Algorithm for deuterium and tritium nuclei energy level computation will be carried out with the aim to prove algorithm feasibility (and extensibility to heavier nuclei for its possible practical realization on a real quantum computer.

  6. Quantum Genetic Algorithms for Computer Scientists

    Directory of Open Access Journals (Sweden)

    Rafael Lahoz-Beltra

    2016-10-01

    Full Text Available Genetic algorithms (GAs are a class of evolutionary algorithms inspired by Darwinian natural selection. They are popular heuristic optimisation methods based on simulated genetic mechanisms, i.e., mutation, crossover, etc. and population dynamical processes such as reproduction, selection, etc. Over the last decade, the possibility to emulate a quantum computer (a computer using quantum-mechanical phenomena to perform operations on data has led to a new class of GAs known as “Quantum Genetic Algorithms” (QGAs. In this review, we present a discussion, future potential, pros and cons of this new class of GAs. The review will be oriented towards computer scientists interested in QGAs “avoiding” the possible difficulties of quantum-mechanical phenomena.

  7. Elements of quantum computing history, theories and engineering applications

    CERN Document Server

    Akama, Seiki

    2015-01-01

    A quantum computer is a computer based on a computational model which uses quantum mechanics, which is a subfield of physics to study phenomena at the micro level. There has been a growing interest on quantum computing in the 1990's, and some quantum computers at the experimental level were recently implemented. Quantum computers enable super-speed computation, and can solve some important problems whose solutions were regarded impossible or intractable with traditional computers. This book provides a quick introduction to quantum computing for readers who have no backgrounds of both theory of computation and quantum mechanics. “Elements of Quantum Computing” presents the history, theories, and engineering applications of quantum computing. The book is suitable to computer scientists, physicist, and software engineers.

  8. Universality of black hole quantum computing

    Energy Technology Data Exchange (ETDEWEB)

    Dvali, Gia [Muenchen Univ. (Germany). Arnold Sommerfeld Center for Theoretical Physics; Max-Planck-Institut fuer Physik, Muenchen (Germany); New York Univ., NY (United States). Center for Cosmology and Particle Physics; Gomez, Cesar [Muenchen Univ. (Germany). Arnold Sommerfeld Center for Theoretical Physics; Univ. Autonoma de Madrid (Spain). Inst. de Fisica Teorica UAM-CSIC; Luest, Dieter [Muenchen Univ. (Germany). Arnold Sommerfeld Center for Theoretical Physics; Max-Planck-Institut fuer Physik, Muenchen (Germany); Omar, Yasser [Instituto de Telecomunicacoes (Portugal). Physics of Information and Quantum Technologies Group; Lisboa Univ. (Portugal). Inst. Superior Tecnico; Richter, Benedikt [Muenchen Univ. (Germany). Arnold Sommerfeld Center for Theoretical Physics; Instituto de Telecomunicacoes (Portugal). Physics of Information and Quantum Technologies Group; Lisboa Univ. (Portugal). Inst. Superior Tecnico

    2017-01-15

    By analyzing the key properties of black holes from the point of view of quantum information, we derive a model-independent picture of black hole quantum computing. It has been noticed that this picture exhibits striking similarities with quantum critical condensates, allowing the use of a common language to describe quantum computing in both systems. We analyze such quantum computing by allowing coupling to external modes, under the condition that the external influence must be soft-enough in order not to offset the basic properties of the system. We derive model-independent bounds on some crucial time-scales, such as the times of gate operation, decoherence, maximal entanglement and total scrambling. We show that for black hole type quantum computers all these time-scales are of the order of the black hole half-life time. Furthermore, we construct explicitly a set of Hamiltonians that generates a universal set of quantum gates for the black hole type computer. We find that the gates work at maximal energy efficiency. Furthermore, we establish a fundamental bound on the complexity of quantum circuits encoded on these systems, and characterize the unitary operations that are implementable. It becomes apparent that the computational power is very limited due to the fact that the black hole life-time is of the same order of the gate operation time. As a consequence, it is impossible to retrieve its information, within the life-time of a black hole, by externally coupling to the black hole qubits. However, we show that, in principle, coupling to some of the internal degrees of freedom allows acquiring knowledge about the micro-state. Still, due to the trivial complexity of operations that can be performed, there is no time advantage over the collection of Hawking radiation and subsequent decoding. (copyright 2016 WILEY-VCH Verlag GmbH and Co. KGaA, Weinheim)

  9. Compressed quantum computation using a remote five-qubit quantum computer

    Science.gov (United States)

    Hebenstreit, M.; Alsina, D.; Latorre, J. I.; Kraus, B.

    2017-05-01

    The notion of compressed quantum computation is employed to simulate the Ising interaction of a one-dimensional chain consisting of n qubits using the universal IBM cloud quantum computer running on log2(n ) qubits. The external field parameter that controls the quantum phase transition of this model translates into particular settings of the quantum gates that generate the circuit. We measure the magnetization, which displays the quantum phase transition, on a two-qubit system, which simulates a four-qubit Ising chain, and show its agreement with the theoretical prediction within a certain error. We also discuss the relevant point of how to assess errors when using a cloud quantum computer with a limited amount of runs. As a solution, we propose to use validating circuits, that is, to run independent controlled quantum circuits of similar complexity to the circuit of interest.

  10. Coherent Control of Ground State NaK Molecules

    Science.gov (United States)

    Yan, Zoe; Park, Jee Woo; Loh, Huanqian; Will, Sebastian; Zwierlein, Martin

    2016-05-01

    Ultracold dipolar molecules exhibit anisotropic, tunable, long-range interactions, making them attractive for the study of novel states of matter and quantum information processing. We demonstrate the creation and control of 23 Na40 K molecules in their rovibronic and hyperfine ground state. By applying microwaves, we drive coherent Rabi oscillations of spin-polarized molecules between the rotational ground state (J=0) and J=1. The control afforded by microwave manipulation allows us to pursue engineered dipolar interactions via microwave dressing. By driving a two-photon transition, we are also able to observe Ramsey fringes between different J=0 hyperfine states, with coherence times as long as 0.5s. The realization of long coherence times between different molecular states is crucial for applications in quantum information processing. NSF, AFOSR- MURI, Alfred P. Sloan Foundation, DARPA-OLE

  11. Cluster expansion for ground states of local Hamiltonians

    Science.gov (United States)

    Bastianello, Alvise; Sotiriadis, Spyros

    2016-08-01

    A central problem in many-body quantum physics is the determination of the ground state of a thermodynamically large physical system. We construct a cluster expansion for ground states of local Hamiltonians, which naturally incorporates physical requirements inherited by locality as conditions on its cluster amplitudes. Applying a diagrammatic technique we derive the relation of these amplitudes to thermodynamic quantities and local observables. Moreover we derive a set of functional equations that determine the cluster amplitudes for a general Hamiltonian, verify the consistency with perturbation theory and discuss non-perturbative approaches. Lastly we verify the persistence of locality features of the cluster expansion under unitary evolution with a local Hamiltonian and provide applications to out-of-equilibrium problems: a simplified proof of equilibration to the GGE and a cumulant expansion for the statistics of work, for an interacting-to-free quantum quench.

  12. Cluster expansion for ground states of local Hamiltonians

    Directory of Open Access Journals (Sweden)

    Alvise Bastianello

    2016-08-01

    Full Text Available A central problem in many-body quantum physics is the determination of the ground state of a thermodynamically large physical system. We construct a cluster expansion for ground states of local Hamiltonians, which naturally incorporates physical requirements inherited by locality as conditions on its cluster amplitudes. Applying a diagrammatic technique we derive the relation of these amplitudes to thermodynamic quantities and local observables. Moreover we derive a set of functional equations that determine the cluster amplitudes for a general Hamiltonian, verify the consistency with perturbation theory and discuss non-perturbative approaches. Lastly we verify the persistence of locality features of the cluster expansion under unitary evolution with a local Hamiltonian and provide applications to out-of-equilibrium problems: a simplified proof of equilibration to the GGE and a cumulant expansion for the statistics of work, for an interacting-to-free quantum quench.

  13. Cluster expansion for ground states of local Hamiltonians

    Energy Technology Data Exchange (ETDEWEB)

    Bastianello, Alvise, E-mail: abastia@sissa.it [SISSA, via Bonomea 265, 34136 Trieste (Italy); INFN, Sezione di Trieste (Italy); Sotiriadis, Spyros [SISSA, via Bonomea 265, 34136 Trieste (Italy); INFN, Sezione di Trieste (Italy); Institut de Mathématiques de Marseille (I2M), Aix Marseille Université, CNRS, Centrale Marseille, UMR 7373, 39, rue F. Joliot Curie, 13453, Marseille (France); University of Roma Tre, Department of Mathematics and Physics, L.go S.L. Murialdo 1, 00146 Roma (Italy)

    2016-08-15

    A central problem in many-body quantum physics is the determination of the ground state of a thermodynamically large physical system. We construct a cluster expansion for ground states of local Hamiltonians, which naturally incorporates physical requirements inherited by locality as conditions on its cluster amplitudes. Applying a diagrammatic technique we derive the relation of these amplitudes to thermodynamic quantities and local observables. Moreover we derive a set of functional equations that determine the cluster amplitudes for a general Hamiltonian, verify the consistency with perturbation theory and discuss non-perturbative approaches. Lastly we verify the persistence of locality features of the cluster expansion under unitary evolution with a local Hamiltonian and provide applications to out-of-equilibrium problems: a simplified proof of equilibration to the GGE and a cumulant expansion for the statistics of work, for an interacting-to-free quantum quench.

  14. Efficient quantum circuits for one-way quantum computing.

    Science.gov (United States)

    Tanamoto, Tetsufumi; Liu, Yu-Xi; Hu, Xuedong; Nori, Franco

    2009-03-13

    While Ising-type interactions are ideal for implementing controlled phase flip gates in one-way quantum computing, natural interactions between solid-state qubits are most often described by either the XY or the Heisenberg models. We show an efficient way of generating cluster states directly using either the imaginary SWAP (iSWAP) gate for the XY model, or the sqrt[SWAP] gate for the Heisenberg model. Our approach thus makes one-way quantum computing more feasible for solid-state devices.

  15. Ground-state entanglement in a three-spin transverse Ising model with energy current

    Institute of Scientific and Technical Information of China (English)

    Zhang Yong; Liu Dan; Long Gui-Lu

    2007-01-01

    The ground-state entanglement associated with a three-spin transverse Ising model is studied. By introducing an energy current into the system, a quantum phase transition to energy-current phase may be presented with the variation of external magnetic field; and the ground-state entanglement varies suddenly at the critical point of quantum phase transition. In our model, the introduction of energy current makes the entanglement between any two qubits become maximally robust.

  16. Quantum Adiabatic Evolution Algorithms with Different Paths

    CERN Document Server

    Farhi, E; Gutmann, S; Farhi, Edward; Goldstone, Jeffrey; Gutmann, Sam

    2002-01-01

    In quantum adiabatic evolution algorithms, the quantum computer follows the ground state of a slowly varying Hamiltonian. The ground state of the initial Hamiltonian is easy to construct; the ground state of the final Hamiltonian encodes the solution of the computational problem. These algorithms have generally been studied in the case where the "straight line" path from initial to final Hamiltonian is taken. But there is no reason not to try paths involving terms that are not linear combinations of the initial and final Hamiltonians. We give several proposals for randomly generating new paths. Using one of these proposals, we convert an algorithmic failure into a success.

  17. Free spin quantum computation with semiconductor nanostructures

    CERN Document Server

    Zhang, W M; Soo, C; Zhang, Wei-Min; Wu, Yin-Zhong; Soo, Chopin

    2005-01-01

    Taking the excess electron spin in a unit cell of semiconductor multiple quantum-dot structure as a qubit, we can implement scalable quantum computation without resorting to spin-spin interactions. The technique of single electron tunnelings and the structure of quantum-dot cellular automata (QCA) are used to create a charge entangled state of two electrons which is then converted into spin entanglement states by using single spin rotations. Deterministic two-qubit quantum gates can also be manipulated using only single spin rotations with help of QCA. A single-short read-out of spin states can be realized by coupling the unit cell to a quantum point contact.

  18. Universality of Entanglement and Quantum Computation Complexity

    CERN Document Server

    Orus, R; Orus, Roman; Latorre, Jose I.

    2004-01-01

    We study the universality of scaling of entanglement in Shor's factoring algorithm and in adiabatic quantum algorithms across a quantum phase transition for both the NP-complete Exact Cover problem as well as the Grover's problem. The analytic result for Shor's algorithm shows a linear scaling of the entropy in terms of the number of qubits, therefore difficulting the possibility of an efficient classical simulation protocol. A similar result is obtained numerically for the quantum adiabatic evolution Exact Cover algorithm, which also shows universality of the quantum phase transition the system evolves nearby. On the other hand, entanglement in Grover's adiabatic algorithm remains a bounded quantity even at the critical point. A classification of scaling of entanglement appears as a natural grading of the computational complexity of simulating quantum phase transitions.

  19. Progress in theoretical quantum computing

    Institute of Scientific and Technical Information of China (English)

    2008-01-01

    @@ Computing is perhaps one of the most distinguished features that differentiate humans from animals.Aside from counting numbers using fingers and toes,abacus was the first great computing machine of human civilization.

  20. Quantum Computation by Pairing Trapped Ultracold Ions

    Institute of Scientific and Technical Information of China (English)

    冯芒; 朱熙文; 高克林; 施磊

    2001-01-01

    Superpositional wavefunction oscillations for the implementation of quantum algorithms modify the desired interference required for the quantum computation. We propose a scheme with trapped ultracold ion-pairs beingqubits to diminish the detrimental effect of the wavefunction oscillations, which is applied to the two-qubitGrover's search. It can be also found that the qubits in our scheme are more robust against the decoherencecaused by the environment, and the model is scalable.

  1. Entanglement and Quantum Computation: An Overview

    Energy Technology Data Exchange (ETDEWEB)

    Perez, R.B.

    2000-06-27

    This report presents a selective compilation of basic facts from the fields of particle entanglement and quantum information processing prepared for those non-experts in these fields that may have interest in an area of physics showing counterintuitive, ''spooky'' (Einstein's words) behavior. In fact, quantum information processing could, in the near future, provide a new technology to sustain the benefits to the U.S. economy due to advanced computer technology.

  2. Quantum Computational Complexity of Spin Glasses

    Science.gov (United States)

    2011-03-19

    canonical problem of classical statistical mechanics: computation of the classical partition function. We have approached this problem using the Potts...enumerator polynomial from coding theory and Z and exploited the fact that there exists a quantum algorithm for efficiently estimating Gauss sums in...computational complexity of the canonical problem of classical statistical mechanics: computation of the classical partition function. We have approached this

  3. Quantum computation with ``hot`` trapped ions

    Energy Technology Data Exchange (ETDEWEB)

    James, D.F.V. [Los Alamos National Lab., NM (United States); Schneider, S. [Los Alamos National Lab., NM (United States)]|[Univ. of Queensland, St. Lucia, Queensland (Australia); Milburn, G.J. [Univ. of Queensland, St. Lucia, Queensland (Australia)

    1998-12-31

    The authors describe two methods that have been proposed to circumvent the problem of heating by external electromagnetic fields in ion trap quantum computers. Firstly the higher order modes of ion oscillation (i.e., modes other than the center-of-mass mode) have much slower heating rates, and can therefore be employed as a reliable quantum information bus. Secondly they discuss a recently proposed method combining adiabatic passage and a number-state dependent phase shift which allows quantum gates to be performed using the center-of-mass mode as the information bus, regardless of its initial state.

  4. Computations in quantum mechanics made easy

    Science.gov (United States)

    Korsch, H. J.; Rapedius, K.

    2016-09-01

    Convenient and simple numerical techniques for performing quantum computations based on matrix representations of Hilbert space operators are presented and illustrated by various examples. The applications include the calculations of spectral and dynamical properties for one-dimensional and two-dimensional single-particle systems as well as bosonic many-particle and open quantum systems. Due to their technical simplicity these methods are well suited as a tool for teaching quantum mechanics to undergraduates and graduates. Explicit implementations of the presented numerical methods in Matlab are given.

  5. Quantum computation with ions in microscopic traps

    Science.gov (United States)

    Šašura, Marek; Steane, Andrew M.

    2002-12-01

    We discuss a possible experimental realization of fast quantum gates with high fidelity with ions confined in microscopic traps. The original proposal of this physical system for quantum computation comes from Cirac and Zoller (Nature 404, 579 (2000)). In this paper we analyse a sensitivity of the ion-trap quantum gate on various experimental parameters which was omitted in the original proposal. We address imprecision of laser pulses, impact of photon scattering, nonzero temperature effects and influence of laser intensity fluctuations on the total fidelity of the two-qubit phase gate.

  6. Quantum Mechanical Nature in Liquid NMR Quantum Computing

    Institute of Scientific and Technical Information of China (English)

    LONG Gui-Lu; YAN Hai-Yang; LI Yan-Song; TU Chang-Cun; ZHU Sheng-Jiang; RUAN Dong; SUN Yang; TAO Jia-Xun; CHEN Hao-Ming

    2002-01-01

    The quantum nature of bulk ensemble NMR quantum computing the center of recent heated debate,is addressed. Concepts of the mixed state and entanglement are examined, and the data in a two-qubit liquid NMRquantum computation are analyzed. The main points in this paper are: i) Density matrix describes the "state" of anaverage particle in an ensemble. It does not describe the state of an individual particle in an ensemble; ii) Entanglementis a property of the wave function of a microscopic particle (such as a molecule in a liquid NMR sample), and separabilityof the density matrix cannot be used to measure the entanglement of mixed ensemble; iii) The state evolution in bulk-ensemble NMRquantum computation is quantum-mechanical; iv) The coefficient before the effective pure state densitymatrix, e, is a measure of the simultaneity of the molecules in an ensemble. It reflects the intensity of the NMR signaland has no significance in quantifying the entanglement in the bulk ensemble NMR system. The decomposition of thedensity matrix into product states is only an indication that the ensemble can be prepared by an ensemble with theparticles unentangled. We conclude that effective-pure-state NMR quantum computation is genuine, not just classicalsimulations.

  7. Fault-Tolerant Postselected Quantum Computation: Threshold Analysis

    CERN Document Server

    Knill, E

    2004-01-01

    The schemes for fault-tolerant postselected quantum computation given in [Knill, Fault-Tolerant Postselected Quantum Computation: Schemes, http://arxiv.org/abs/quant-ph/0402171] are analyzed to determine their error-tolerance. The analysis is based on computer-assisted heuristics. It indicates that if classical and quantum communication delays are negligible, then scalable qubit-based quantum computation is possible with errors above 1% per elementary quantum gate.

  8. Can the human brain do quantum computing?

    Science.gov (United States)

    Rocha, A F; Massad, E; Coutinho, F A B

    2004-01-01

    The electrical membrane properties have been the key issues in the understanding of the cerebral physiology for more than almost two centuries. But, molecular neurobiology has now discovered that biochemical transactions play an important role in neuronal computations. Quantum computing (QC) is becoming a reality both from the theoretical point of view as well as from practical applications. Quantum mechanics is the most accurate description at atomic level and it lies behind all chemistry that provides the basis for biology ... maybe the magic of entanglement is also crucial for life. The purpose of the present paper is to discuss the dendrite spine as a quantum computing device, taking into account what is known about the physiology of the glutamate receptors and the cascade of biochemical transactions triggered by the glutamate binding to these receptors.

  9. Quantum computing without wavefunctions: time-dependent density functional theory for universal quantum computation.

    Science.gov (United States)

    Tempel, David G; Aspuru-Guzik, Alán

    2012-01-01

    We prove that the theorems of TDDFT can be extended to a class of qubit Hamiltonians that are universal for quantum computation. The theorems of TDDFT applied to universal Hamiltonians imply that single-qubit expectation values can be used as the basic variables in quantum computation and information theory, rather than wavefunctions. From a practical standpoint this opens the possibility of approximating observables of interest in quantum computations directly in terms of single-qubit quantities (i.e. as density functionals). Additionally, we also demonstrate that TDDFT provides an exact prescription for simulating universal Hamiltonians with other universal Hamiltonians that have different, and possibly easier-to-realize two-qubit interactions. This establishes the foundations of TDDFT for quantum computation and opens the possibility of developing density functionals for use in quantum algorithms.

  10. Quantum Computing Using Superconducting Qubits

    Science.gov (United States)

    2006-04-01

    highlighted in the " Molecular Motors" first feature article of the November, 2002, Physics Today, page 38. http://www.physicstoday.org/vol-5 5/iss-I I...12-2003. the article was in http://www.mosac.com/ fisica /news/leggi.php?codice= 191. News coverage in French include the following three newspapers... molecular vibra- Josephson junction devices have been proposed and experi- tional mode [12], motional quantum states of a trapped - - mentally

  11. Methodological testing: Are fast quantum computers illusions?

    Energy Technology Data Exchange (ETDEWEB)

    Meyer, Steven [Tachyon Design Automation, San Francisco, CA (United States)

    2013-07-01

    Popularity of the idea for computers constructed from the principles of QM started with Feynman's 'Lectures On Computation', but he called the idea crazy and dependent on statistical mechanics. In 1987, Feynman published a paper in 'Quantum Implications - Essays in Honor of David Bohm' on negative probabilities which he said gave him cultural shock. The problem with imagined fast quantum computers (QC) is that speed requires both statistical behavior and truth of the mathematical formalism. The Swedish Royal Academy 2012 Nobel Prize in physics press release touted the discovery of methods to control ''individual quantum systems'', to ''measure and control very fragile quantum states'' which enables ''first steps towards building a new type of super fast computer based on quantum physics.'' A number of examples where widely accepted mathematical descriptions have turned out to be problematic are examined: Problems with the use of Oracles in P=NP computational complexity, Paul Finsler's proof of the continuum hypothesis, and Turing's Enigma code breaking versus William tutte's Colossus. I view QC research as faith in computational oracles with wished for properties. Arther Fine's interpretation in 'The Shaky Game' of Einstein's skepticism toward QM is discussed. If Einstein's reality as space-time curvature is correct, then space-time computers will be the next type of super fast computer.

  12. Towards universal quantum computation through relativistic motion

    CERN Document Server

    Bruschi, David Edward; Kok, Pieter; Johansson, Göran; Delsing, Per; Fuentes, Ivette

    2013-01-01

    We show how to use relativistic motion to generate continuous variable Gaussian cluster states within cavity modes. Our results can be demonstrated experimentally using superconducting circuits where tunable boundary conditions correspond to mirrors moving with velocities close to the speed of light. In particular, we propose the generation of a quadripartite square cluster state as a first example that can be readily implemented in the laboratory. Since cluster states are universal resources for universal one-way quantum computation, our results pave the way for relativistic quantum computation schemes.

  13. Towards Lagrangian approach to quantum computations

    CERN Document Server

    Vlasov, A Yu

    2003-01-01

    In this work is discussed possibility and actuality of Lagrangian approach to quantum computations. Finite-dimensional Hilbert spaces used in this area provide some challenge for such consideration. The model discussed here can be considered as an analogue of Weyl quantization of field theory via path integral in L. D. Faddeev's approach. Weyl quantization is possible to use also in finite-dimensional case, and some formulas may be simply rewritten with change of integrals to finite sums. On the other hand, there are specific difficulties relevant to finite case. This work has some allusions with phase space models of quantum computations developed last time by different authors.

  14. Resource-efficient linear optical quantum computation.

    Science.gov (United States)

    Browne, Daniel E; Rudolph, Terry

    2005-07-01

    We introduce a scheme for linear optics quantum computation, that makes no use of teleported gates, and requires stable interferometry over only the coherence length of the photons. We achieve a much greater degree of efficiency and a simpler implementation than previous proposals. We follow the "cluster state" measurement based quantum computational approach, and show how cluster states may be efficiently generated from pairs of maximally polarization entangled photons using linear optical elements. We demonstrate the universality and usefulness of generic parity measurements, as well as introducing the use of redundant encoding of qubits to enable utilization of destructive measurements--both features of use in a more general context.

  15. Processor core model for quantum computing.

    Science.gov (United States)

    Yung, Man-Hong; Benjamin, Simon C; Bose, Sougato

    2006-06-09

    We describe an architecture based on a processing "core," where multiple qubits interact perpetually, and a separate "store," where qubits exist in isolation. Computation consists of single qubit operations, swaps between the store and the core, and free evolution of the core. This enables computation using physical systems where the entangling interactions are "always on." Alternatively, for switchable systems, our model constitutes a prescription for optimizing many-qubit gates. We discuss implementations of the quantum Fourier transform, Hamiltonian simulation, and quantum error correction.

  16. Topics in linear optical quantum computation

    Science.gov (United States)

    Glancy, Scott Charles

    This thesis covers several topics in optical quantum computation. A quantum computer is a computational device which is able to manipulate information by performing unitary operations on some physical system whose state can be described as a vector (or mixture of vectors) in a Hilbert space. The basic unit of information, called the qubit, is considered to be a system with two orthogonal states, which are assigned logical values of 0 and 1. Photons make excellent candidates to serve as qubits. They have little interactions with the environment. Many operations can be performed using very simple linear optical devices such as beam splitters and phase shifters. Photons can easily be processed through circuit-like networks. Operations can be performed in very short times. Photons are ideally suited for the long-distance communication of quantum information. The great difficulty in constructing an optical quantum computer is that photons naturally interact weakly with one another. This thesis first gives a brief review of two early approaches to optical quantum computation. It will describe how any discrete unitary operation can be performed using a single photon and a network of beam splitters, and how the Kerr effect can be used to construct a two photon logic gate. Second, this work provides a thorough introduction to the linear optical quantum computer developed by Knill, Laflamme, and Milburn. It then presents this author's results on the reliability of this scheme when implemented using imperfect photon detectors. This author finds that quantum computers of this sort cannot be built using current technology. Third, this dissertation describes a method for constructing a linear optical quantum computer using nearly orthogonal coherent states of light as the qubits. It shows how a universal set of logic operations can be performed, including calculations of the fidelity with which these operations may be accomplished. It discusses methods for reducing and

  17. Quantum game simulator, using the circuit model of quantum computation

    Science.gov (United States)

    Vlachos, Panagiotis; Karafyllidis, Ioannis G.

    2009-10-01

    We present a general two-player quantum game simulator that can simulate any two-player quantum game described by a 2×2 payoff matrix (two strategy games).The user can determine the payoff matrices for both players, their strategies and the amount of entanglement between their initial strategies. The outputs of the simulator are the expected payoffs of each player as a function of the other player's strategy parameters and the amount of entanglement. The simulator also produces contour plots that divide the strategy spaces of the game in regions in which players can get larger payoffs if they choose to use a quantum strategy against any classical one. We also apply the simulator to two well-known quantum games, the Battle of Sexes and the Chicken game. Program summaryProgram title: Quantum Game Simulator (QGS) Catalogue identifier: AEED_v1_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEED_v1_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 3416 No. of bytes in distributed program, including test data, etc.: 583 553 Distribution format: tar.gz Programming language: Matlab R2008a (C) Computer: Any computer that can sufficiently run Matlab R2008a Operating system: Any system that can sufficiently run Matlab R2008a Classification: 4.15 Nature of problem: Simulation of two player quantum games described by a payoff matrix. Solution method: The program calculates the matrices that comprise the Eisert setup for quantum games based on the quantum circuit model. There are 5 parameters that can be altered. We define 3 of them as constant. We play the quantum game for all possible values for the other 2 parameters and store the results in a matrix. Unusual features: The software provides an easy way of simulating any two-player quantum games. Running time: Approximately

  18. Random Numbers and Quantum Computers

    Science.gov (United States)

    McCartney, Mark; Glass, David

    2002-01-01

    The topic of random numbers is investigated in such a way as to illustrate links between mathematics, physics and computer science. First, the generation of random numbers by a classical computer using the linear congruential generator and logistic map is considered. It is noted that these procedures yield only pseudo-random numbers since…

  19. Quantum-Enhanced Cyber Security: Experimental Computation on Quantum-Encrypted Data

    Science.gov (United States)

    2017-03-02

    AFRL-AFOSR-UK-TR-2017-0020 Quantum-Enhanced Cyber Security : Experimental Computation on Quantum-Encrypted Data Philip Walther UNIVERSITT WIEN Final...REPORT TYPE Final 3. DATES COVERED (From - To) 15 Oct 2015 to 31 Dec 2016 4. TITLE AND SUBTITLE Quantum-Enhanced Cyber Security : Experimental Computation...FORM SF 298 Final Report for FA9550-1-6-1-0004 Quantum-enhanced cyber security : Experimental quantum computation with quantum-encrypted data

  20. Quantum error correcting codes and one-way quantum computing: Towards a quantum memory

    CERN Document Server

    Schlingemann, D

    2003-01-01

    For realizing a quantum memory we suggest to first encode quantum information via a quantum error correcting code and then concatenate combined decoding and re-encoding operations. This requires that the encoding and the decoding operation can be performed faster than the typical decoherence time of the underlying system. The computational model underlying the one-way quantum computer, which has been introduced by Hans Briegel and Robert Raussendorf, provides a suitable concept for a fast implementation of quantum error correcting codes. It is shown explicitly in this article is how encoding and decoding operations for stabilizer codes can be realized on a one-way quantum computer. This is based on the graph code representation for stabilizer codes, on the one hand, and the relation between cluster states and graph codes, on the other hand.

  1. Langevin equation path integral ground state.

    Science.gov (United States)

    Constable, Steve; Schmidt, Matthew; Ing, Christopher; Zeng, Tao; Roy, Pierre-Nicholas

    2013-08-15

    We propose a Langevin equation path integral ground state (LePIGS) approach for the calculation of ground state (zero temperature) properties of molecular systems. The approach is based on a modification of the finite temperature path integral Langevin equation (PILE) method (J. Chem. Phys. 2010, 133, 124104) to the case of open Feynman paths. Such open paths are necessary for a ground state formulation. We illustrate the applicability of the method using model systems and the weakly bound water-parahydrogen dimer. We show that the method can lead to converged zero point energies and structural properties.

  2. Computational approach for calculating bound states in quantum field theory

    Science.gov (United States)

    Lv, Q. Z.; Norris, S.; Brennan, R.; Stefanovich, E.; Su, Q.; Grobe, R.

    2016-09-01

    We propose a nonperturbative approach to calculate bound-state energies and wave functions for quantum field theoretical models. It is based on the direct diagonalization of the corresponding quantum field theoretical Hamiltonian in an effectively discretized and truncated Hilbert space. We illustrate this approach for a Yukawa-like interaction between fermions and bosons in one spatial dimension and show where it agrees with the traditional method based on the potential picture and where it deviates due to recoil and radiative corrections. This method permits us also to obtain some insight into the spatial characteristics of the distribution of the fermions in the ground state, such as the bremsstrahlung-induced widening.

  3. Reduced M(atrix) theory models: ground state solutions

    CERN Document Server

    López, J L

    2015-01-01

    We propose a method to find exact ground state solutions to reduced models of the SU($N$) invariant matrix model arising from the quantization of the 11-dimensional supermembrane action in the light-cone gauge. We illustrate the method by applying it to lower dimensional toy models and for the SU(2) group. This approach could, in principle, be used to find ground state solutions to the complete 9-dimensional model and for any SU($N$) group. The Hamiltonian, the supercharges and the constraints related to the SU($2$) symmetry are built from operators that generate a multicomponent spinorial wave function. The procedure is based on representing the fermionic degrees of freedom by means of Dirac-like gamma matrices, as was already done in the first proposal of supersymmetric (SUSY) quantum cosmology. We exhibit a relation between these finite $N$ matrix theory ground state solutions and SUSY quantum cosmology wave functions giving a possible physical significance of the theory even for finite $N$.

  4. Quantum Computing in Non Euclidean Geometry

    CERN Document Server

    Resconi, Germano

    2009-01-01

    The recent debate on hyper-computation has raised new questions both on the computational abilities of quantum systems and the Church-Turing Thesis role in Physics. We propose here the idea of geometry of effective physical process as the essentially physical notion of computation. In Quantum mechanics we cannot use the traditional Euclidean geometry but we introduce more sophisticate non Euclidean geometry which include a new kind of information diffuse in the entire universe and that we can represent as Fisher information or active information. We remark that from the Fisher information we can obtain the Bohm and Hiley quantum potential and the classical Schrodinger equation. We can see the quantum phenomena do not affect a limited region of the space but is reflected in a change of the geometry of all the universe. In conclusion any local physical change or physical process is reflected in all the universe by the change of its geometry, This is the deepest meaning of the entanglement in Quantum mechanics a...

  5. A surface code quantum computer in silicon.

    Science.gov (United States)

    Hill, Charles D; Peretz, Eldad; Hile, Samuel J; House, Matthew G; Fuechsle, Martin; Rogge, Sven; Simmons, Michelle Y; Hollenberg, Lloyd C L

    2015-10-01

    The exceptionally long quantum coherence times of phosphorus donor nuclear spin qubits in silicon, coupled with the proven scalability of silicon-based nano-electronics, make them attractive candidates for large-scale quantum computing. However, the high threshold of topological quantum error correction can only be captured in a two-dimensional array of qubits operating synchronously and in parallel-posing formidable fabrication and control challenges. We present an architecture that addresses these problems through a novel shared-control paradigm that is particularly suited to the natural uniformity of the phosphorus donor nuclear spin qubit states and electronic confinement. The architecture comprises a two-dimensional lattice of donor qubits sandwiched between two vertically separated control layers forming a mutually perpendicular crisscross gate array. Shared-control lines facilitate loading/unloading of single electrons to specific donors, thereby activating multiple qubits in parallel across the array on which the required operations for surface code quantum error correction are carried out by global spin control. The complexities of independent qubit control, wave function engineering, and ad hoc quantum interconnects are explicitly avoided. With many of the basic elements of fabrication and control based on demonstrated techniques and with simulated quantum operation below the surface code error threshold, the architecture represents a new pathway for large-scale quantum information processing in silicon and potentially in other qubit systems where uniformity can be exploited.

  6. Dynamics of a Ground-State Cooled Ion Colliding with Ultracold Atoms

    Science.gov (United States)

    Meir, Ziv; Sikorsky, Tomas; Ben-shlomi, Ruti; Akerman, Nitzan; Dallal, Yehonatan; Ozeri, Roee

    2016-12-01

    Ultracold atom-ion mixtures are gaining increasing interest due to their potential applications in ultracold and state-controlled chemistry, quantum computing, and many-body physics. Here, we studied the dynamics of a single ground-state cooled ion during few, to many, Langevin (spiraling) collisions with ultracold atoms. We measured the ion's energy distribution and observed a clear deviation from the Maxwell-Boltzmann distribution, characterized by an exponential tail, to a power-law distribution best described by a Tsallis function. Unlike previous experiments, the energy scale of atom-ion interactions is not determined by either the atomic cloud temperature or the ion's trap residual excess-micromotion energy. Instead, it is determined by the force the atom exerts on the ion during a collision which is then amplified by the trap dynamics. This effect is intrinsic to ion Paul traps and sets the lower bound of atom-ion steady-state interaction energy in these systems. Despite the fact that our system is eventually driven out of the ultracold regime, we are capable of studying quantum effects by limiting the interaction to the first collision when the ion is initialized in the ground state of the trap.

  7. Forbidden Electronic Transitions between the Singlet Ground State and the Triplet Excited State of Pt(II) Complexes.

    Science.gov (United States)

    Zheng, Greg Y.; Rillema, D. Paul; DePriest, Jeff; Woods, Clifton

    1998-07-13

    Direct access to the triplet emitting state from the ground state is observed for Pt(II) complexes containing heterocyclic (CwedgeC', CwedgeN, NwedgeN') and bis(diphenylphosphino)alkane (PwedgeP') ligands. Extinction coefficients for such transitions are in the range 4-25 M(-)(1) cm(-)(1). Emission quantum yields resulting from singlet-to-triplet excitation are as high as 61-77 times the emission quantum yields resulting from singlet-to-singlet excitation at 296 K. The intersystem crossing quantum yield from the singlet excited state to triplet emitting state is lower than 2% at 296 K but is greatly enhanced at 77 K. The forbidden electronic transition observed for Pt(II) complexes is attributed to result from spin-orbit coupling due to the presence of Pt(II) in the skeleton structure. The importance of excitation spectra on the computation of emission quantum yields is discussed.

  8. Ground-State Analysis for an Exactly Solvable Coupled-Spin Hamiltonian

    Directory of Open Access Journals (Sweden)

    Eduardo Mattei

    2013-11-01

    Full Text Available We introduce a Hamiltonian for two interacting su(2 spins. We use a mean-field analysis and exact Bethe ansatz results to investigate the ground-state properties of the system in the classical limit, defined as the limit of infinite spin (or highest weight. Complementary insights are provided through investigation of the energy gap, ground-state fidelity, and ground-state entanglement, which are numerically computed for particular parameter values. Despite the simplicity of the model, a rich array of ground-state features are uncovered. Finally, we discuss how this model may be seen as an analogue of the exactly solvable p+ip pairing Hamiltonian.

  9. Quantum Computing: Selected Internet Resources for Librarians, Researchers, and the Casually Curious

    OpenAIRE

    Cirasella, Jill

    2009-01-01

    This article is an annotated selection of the most important and informative Internet resources for learning about quantum computing, finding quantum computing literature, and tracking quantum computing news.

  10. Quantum computation over the butterfly network

    CERN Document Server

    Kinjo, Yoshiyuki; Soeda, Akihito; Turner, Peter S

    2010-01-01

    In order to investigate distributed quantum computation under restricted network resources, we introduce a quantum computation task over the butterfly network where both quantum and classical communications are limited. We consider performing a two qubit global unitary operation on two unknown inputs given at different nodes, with outputs at two distinct nodes. By using a particular resource scenario introduced by Hayashi, which is capable of performing a swap operation by adding two maximally entangled qubits (ebits) between the two input nodes, we show that any controlled unitary operation can be performed without adding any entanglement resource. We also construct protocols for performing controlled traceless unitary operations with a 1-ebit resource and for performing global Clifford operations with a 2-ebit resource.

  11. Ensemble Theory for Stealthy Hyperuniform Disordered Ground States

    Directory of Open Access Journals (Sweden)

    S. Torquato

    2015-05-01

    Full Text Available It has been shown numerically that systems of particles interacting with isotropic “stealthy” bounded long-ranged pair potentials (similar to Friedel oscillations have classical ground states that are (counterintuitively disordered, hyperuniform, and highly degenerate. Disordered hyperuniform systems have received attention recently because they are distinguishable exotic states of matter poised between a crystal and liquid that are endowed with novel thermodynamic and physical properties. The task of formulating an ensemble theory that yields analytical predictions for the structural characteristics and other properties of stealthy degenerate ground states in d-dimensional Euclidean space R^{d} is highly nontrivial because the dimensionality of the configuration space depends on the number density ρ and there is a multitude of ways of sampling the ground-state manifold, each with its own probability measure for finding a particular ground-state configuration. The purpose of this paper is to take some initial steps in this direction. Specifically, we derive general exact relations for thermodynamic properties (energy, pressure, and isothermal compressibility that apply to any ground-state ensemble as a function of ρ in any d, and we show how disordered degenerate ground states arise as part of the ground-state manifold. We also derive exact integral conditions that both the pair correlation function g_{2}(r and structure factor S(k must obey for any d. We then specialize our results to the canonical ensemble (in the zero-temperature limit by exploiting an ansatz that stealthy states behave remarkably like “pseudo”-equilibrium hard-sphere systems in Fourier space. Our theoretical predictions for g_{2}(r and S(k are in excellent agreement with computer simulations across the first three space dimensions. These results are used to obtain order metrics, local number variance, and nearest-neighbor functions across dimensions. We also derive

  12. Ensemble Theory for Stealthy Hyperuniform Disordered Ground States

    Science.gov (United States)

    Torquato, S.; Zhang, G.; Stillinger, F. H.

    2015-04-01

    It has been shown numerically that systems of particles interacting with isotropic "stealthy" bounded long-ranged pair potentials (similar to Friedel oscillations) have classical ground states that are (counterintuitively) disordered, hyperuniform, and highly degenerate. Disordered hyperuniform systems have received attention recently because they are distinguishable exotic states of matter poised between a crystal and liquid that are endowed with novel thermodynamic and physical properties. The task of formulating an ensemble theory that yields analytical predictions for the structural characteristics and other properties of stealthy degenerate ground states in d -dimensional Euclidean space Rd is highly nontrivial because the dimensionality of the configuration space depends on the number density ρ and there is a multitude of ways of sampling the ground-state manifold, each with its own probability measure for finding a particular ground-state configuration. The purpose of this paper is to take some initial steps in this direction. Specifically, we derive general exact relations for thermodynamic properties (energy, pressure, and isothermal compressibility) that apply to any ground-state ensemble as a function of ρ in any d , and we show how disordered degenerate ground states arise as part of the ground-state manifold. We also derive exact integral conditions that both the pair correlation function g2(r ) and structure factor S (k ) must obey for any d . We then specialize our results to the canonical ensemble (in the zero-temperature limit) by exploiting an ansatz that stealthy states behave remarkably like "pseudo"-equilibrium hard-sphere systems in Fourier space. Our theoretical predictions for g2(r ) and S (k ) are in excellent agreement with computer simulations across the first three space dimensions. These results are used to obtain order metrics, local number variance, and nearest-neighbor functions across dimensions. We also derive accurate analytical

  13. Simulation of the hydrogen ground state in stochastic electrodynamics

    Science.gov (United States)

    Nieuwenhuizen, Theo M.; Liska, Matthew T. P.

    2015-10-01

    Stochastic electrodynamics is a classical theory which assumes that the physical vacuum consists of classical stochastic fields with average energy \\frac{1}{2}{{\\hslash }}ω in each mode, i.e., the zero-point Planck spectrum. While this classical theory explains many quantum phenomena related to harmonic oscillator problems, hard results on nonlinear systems are still lacking. In this work the hydrogen ground state is studied by numerically solving the Abraham-Lorentz equation in the dipole approximation. First the stochastic Gaussian field is represented by a sum over Gaussian frequency components, next the dynamics is solved numerically using OpenCL. The approach improves on work by Cole and Zou 2003 by treating the full 3d problem and reaching longer simulation times. The results are compared with a conjecture for the ground state phase space density. Though short time results suggest a trend towards confirmation, in all attempted modellings the atom ionises at longer times.

  14. Ground-State Phase Diagram of S = 1 Diamond Chains

    Science.gov (United States)

    Hida, Kazuo; Takano, Ken'ichi

    2017-03-01

    We investigate the ground-state phase diagram of a spin-1 diamond chain. Owing to a series of conservation laws, any eigenstate of this system can be expressed using the eigenstates of finite odd-length chains or infinite chains with spins 1 and 2. The ground state undergoes quantum phase transitions with varying λ, a parameter that controls frustration. Exact upper and lower bounds for the phase boundaries between these phases are obtained. The phase boundaries are determined numerically in the region not explored in a previous work [Takano et al., https://doi.org/10.1088/0953-8984/8/35/009" xlink:type="simple">J. Phys.: Condens. Matter 8, 6405 (1996)].

  15. EIT ground-state cooling of long ion strings

    CERN Document Server

    Lechner, R; Hempel, C; Jurcevic, P; Lanyon, B P; Monz, T; Brownnutt, M; Blatt, R; Roos, C F

    2016-01-01

    Electromagnetically-induced-transparency (EIT) cooling is a ground-state cooling technique for trapped particles. EIT offers a broader cooling range in frequency space compared to more established methods. In this work, we experimentally investigate EIT cooling in strings of trapped atomic ions. In strings of up to 18 ions, we demonstrate simultaneous ground state cooling of all radial modes in under 1 ms. This is a particularly important capability in view of emerging quantum simulation experiments with large numbers of trapped ions. Our analysis of the EIT cooling dynamics is based on a novel technique enabling single-shot measurements of phonon numbers, by rapid adiabatic passage on a vibrational sideband of a narrow transition.

  16. A simulator for quantum computer hardware

    NARCIS (Netherlands)

    Michielsen, K.F L; de Raedt, H.A.; De Raedt, K.

    2002-01-01

    We present new examples of the use of the quantum computer (QC) emulator. For educational purposes we describe the implementation of the CNOT and Toffoli gate, two basic building blocks of a QC, on a three qubit NMR-like QC.

  17. The quantum computer game: citizen science

    Science.gov (United States)

    Damgaard, Sidse; Mølmer, Klaus; Sherson, Jacob

    2013-05-01

    Progress in the field of quantum computation is hampered by daunting technical challenges. Here we present an alternative approach to solving these by enlisting the aid of computer players around the world. We have previously examined a quantum computation architecture involving ultracold atoms in optical lattices and strongly focused tweezers of light. In The Quantum Computer Game (see http://www.scienceathome.org/), we have encapsulated the time-dependent Schrödinger equation for the problem in a graphical user interface allowing for easy user input. Players can then search the parameter space with real-time graphical feedback in a game context with a global high-score that rewards short gate times and robustness to experimental errors. The game which is still in a demo version has so far been tried by several hundred players. Extensions of the approach to other models such as Gross-Pitaevskii and Bose-Hubbard are currently under development. The game has also been incorporated into science education at high-school and university level as an alternative method for teaching quantum mechanics. Initial quantitative evaluation results are very positive. AU Ideas Center for Community Driven Research, CODER.

  18. Computer animations of quantum field theory

    Energy Technology Data Exchange (ETDEWEB)

    Cohen, E. (Centre d' Etudes de Saclay, 91 - Gif-sur-Yvette (France). Service de Physique Theorique)

    1992-07-01

    A visualization mehtod for quantum field theories based on the transfer matrix formalism is presented. It generates computer animations simulating the time evolution of complex physical systems subject to local Hamiltonians. The method may be used as a means of gaining insight to theories such as QCD, and as an educational tool in explaining high-energy physics. (orig.).

  19. Blind quantum computing with weak coherent pulses.

    Science.gov (United States)

    Dunjko, Vedran; Kashefi, Elham; Leverrier, Anthony

    2012-05-18

    The universal blind quantum computation (UBQC) protocol [A. Broadbent, J. Fitzsimons, and E. Kashefi, in Proceedings of the 50th Annual IEEE Symposiumon Foundations of Computer Science (IEEE Computer Society, Los Alamitos, CA, USA, 2009), pp. 517-526.] allows a client to perform quantum computation on a remote server. In an ideal setting, perfect privacy is guaranteed if the client is capable of producing specific, randomly chosen single qubit states. While from a theoretical point of view, this may constitute the lowest possible quantum requirement, from a pragmatic point of view, generation of such states to be sent along long distances can never be achieved perfectly. We introduce the concept of ϵ blindness for UBQC, in analogy to the concept of ϵ security developed for other cryptographic protocols, allowing us to characterize the robustness and security properties of the protocol under possible imperfections. We also present a remote blind single qubit preparation protocol with weak coherent pulses for the client to prepare, in a delegated fashion, quantum states arbitrarily close to perfect random single qubit states. This allows us to efficiently achieve ϵ-blind UBQC for any ϵ>0, even if the channel between the client and the server is arbitrarily lossy.

  20. Geometry of abstraction in quantum computation

    NARCIS (Netherlands)

    Pavlovic, D.; Abramsky, S.; Mislove, M.W.

    2012-01-01

    Quantum algorithms are sequences of abstract operations, per­ formed on non-existent computers. They are in obvious need of categorical semantics. We present some steps in this direction, following earlier contribu­ tions of Abramsky, Goecke and Selinger. In particular, we analyze f

  1. Blind Quantum Computing with Weak Coherent Pulses

    Science.gov (United States)

    Dunjko, Vedran; Kashefi, Elham; Leverrier, Anthony

    2012-05-01

    The universal blind quantum computation (UBQC) protocol [A. Broadbent, J. Fitzsimons, and E. Kashefi, in Proceedings of the 50th Annual IEEE Symposiumon Foundations of Computer Science (IEEE Computer Society, Los Alamitos, CA, USA, 2009), pp. 517-526.] allows a client to perform quantum computation on a remote server. In an ideal setting, perfect privacy is guaranteed if the client is capable of producing specific, randomly chosen single qubit states. While from a theoretical point of view, this may constitute the lowest possible quantum requirement, from a pragmatic point of view, generation of such states to be sent along long distances can never be achieved perfectly. We introduce the concept of ɛ blindness for UBQC, in analogy to the concept of ɛ security developed for other cryptographic protocols, allowing us to characterize the robustness and security properties of the protocol under possible imperfections. We also present a remote blind single qubit preparation protocol with weak coherent pulses for the client to prepare, in a delegated fashion, quantum states arbitrarily close to perfect random single qubit states. This allows us to efficiently achieve ɛ-blind UBQC for any ɛ>0, even if the channel between the client and the server is arbitrarily lossy.

  2. Simulations of Probabilities for Quantum Computing

    Science.gov (United States)

    Zak, M.

    1996-01-01

    It has been demonstrated that classical probabilities, and in particular, probabilistic Turing machine, can be simulated by combining chaos and non-LIpschitz dynamics, without utilization of any man-made devices (such as random number generators). Self-organizing properties of systems coupling simulated and calculated probabilities and their link to quantum computations are discussed.

  3. Quantum Computation and Information From Theory to Experiment

    CERN Document Server

    Imai, Hiroshi

    2006-01-01

    Recently, the field of quantum computation and information has been developing through a fusion of results from various research fields in theoretical and practical areas. This book consists of the reviews of selected topics charterized by great progress and cover the field from theoretical areas to experimental ones. It contains fundamental areas, quantum query complexity, quantum statistical inference, quantum cloning, quantum entanglement, additivity. It treats three types of quantum security system, quantum public key cryptography, quantum key distribution, and quantum steganography. A photonic system is highlighted for the realization of quantum information processing.

  4. On the ground state of metallic hydrogen

    Science.gov (United States)

    Chakravarty, S.; Ashcroft, N. W.

    1978-01-01

    A proposed liquid ground state of metallic hydrogen at zero temperature is explored and a variational upper bound to the ground state energy is calculated. The possibility that the metallic hydrogen is a liquid around the metastable point (rs = 1.64) cannot be ruled out. This conclusion crucially hinges on the contribution to the energy arising from the third order in the electron-proton interaction which is shown here to be more significant in the liquid phase than in crystals.

  5. Quantum computation with nuclear spins in quantum dots

    Energy Technology Data Exchange (ETDEWEB)

    Christ, H.

    2008-01-24

    The role of nuclear spins for quantum information processing in quantum dots is theoretically investigated in this thesis. Building on the established fact that the most strongly coupled environment for the potential electron spin quantum bit are the surrounding lattice nuclear spins interacting via the hyperfine interaction, we turn this vice into a virtue by designing schemes for harnessing this strong coupling. In this perspective, the ensemble of nuclear spins can be considered an asset, suitable for an active role in quantum information processing due to its intrinsic long coherence times. We present experimentally feasible protocols for the polarization, i.e. initialization, of the nuclear spins and a quantitative solution to our derived master equation. The polarization limiting destructive interference effects, caused by the collective nature of the nuclear coupling to the electron spin, are studied in detail. Efficient ways of mitigating these constraints are presented, demonstrating that highly polarized nuclear ensembles in quantum dots are feasible. At high, but not perfect, polarization of the nuclei the evolution of an electron spin in contact with the spin bath can be efficiently studied by means of a truncation of the Hilbert space. It is shown that the electron spin can function as a mediator of universal quantum gates for collective nuclear spin qubits, yielding a promising architecture for quantum information processing. Furthermore, we show that at high polarization the hyperfine interaction of electron and nuclear spins resembles the celebrated Jaynes-Cummings model of quantum optics. This result opens the door for transfer of knowledge from the mature field of quantum computation with atoms and photons. Additionally, tailored specifically for the quantum dot environment, we propose a novel scheme for the generation of highly squeezed collective nuclear states. Finally we demonstrate that even an unprepared completely mixed nuclear spin

  6. Theoretical studies for experimental implementation of quantum computing with trapped ions

    Science.gov (United States)

    Yoshimura, Bryce T.

    Certain quantum many-body physics problems, such as the transverse field Ising model are intractable on a classical computer, meaning that as the number of particles grows, or spins, the amount of memory and computational time required to solve the problem exactly increases faster than a polynomial behavior. However, quantum simulators are being developed to efficiently solve quantum problems that are intractable via conventional computing. Some of the most successful quantum simulators are based on ion traps. Their success depends on the ability to achieve long coherence time, precise spin control, and high fidelity in state preparation. In this work, I present calculations that characterizes the oblate Paul trap that creates two-dimensional Coulomb crystals in a triangular lattice and phonon modes. We also calculate the spin-spin Ising-like interaction that can be generated in the oblate Paul trap using the same techinques as the linear radiofrequency Paul trap. In addition, I discuss two possible challenges that arise in the Penning trap: the effects of defects ( namely when Be+ → BeH+) and the creation of a more uniform spin-spin Ising-like interaction. We show that most properties are not significantly influenced by the appearance of defects, and that by adding two potentials to the Penning trap a more uniform spin-spin Ising-like interaction can be achieved. Next, I discuss techniques tfor preparing the ground state of the Ising-like Hamiltonian. In particular, we explore the use of the bang-bang protocol to prepare the ground state and compare optimized results to conventional adiabatic ramps ( the exponential and locally adiabatic ramp ). The bang-bang optimization in general outperforms the exponential; however the locally adiabatic ramp consistently is somewhat better. However, compared to the locally adiabatic ramp, the bang-bang optimization is simpler to implement, and it has the advantage of providingrovide a simple procedure for estimating the

  7. Ground state correlations and mean field using the exp(S) method

    CERN Document Server

    Heisenberg, J H; Heisenberg, Jochen H.; Mihaila, Bogdan

    1999-01-01

    This document gives a detailed account of the terms used in the computation of the ground state mean field and the ground state correlations. While the general approach to this description is given in a separate paper (nucl-th/9802029) we give here the explicite expressions used.

  8. Universal Quantum Gates Based on Both Geometric and Dynamic Phases in Quantum Dots

    Institute of Scientific and Technical Information of China (English)

    杨开宇; 朱诗亮; 汪子丹

    2003-01-01

    A large-scalable quantum computer model, whose qubits are represented by the subspace subtended by the ground state and the single exciton state on semiconductor quantum dots, is proposed. A universal set of quantum gates in this system may be achieved by a mixed approach, composed of dynamic evolution and nonadiabatic geometric phase.

  9. Quantum Computing: Theoretical versus Practical Possibility

    CERN Document Server

    Paraoanu, G S

    2011-01-01

    An intense effort is being made today to build a quantum computer. Instead of presenting what has been achieved, I invoke here analogies from the history of science in an attempt to glimpse what the future might hold. Quantum computing is possible in principle - there are no known laws of Nature that prevent it - yet scaling up the few qubits demonstrated so far has proven to be exceedingly difficult. While this could be regarded merely as a technological or practical impediment, I argue that this difficulty might be a symptom of new laws of physics waiting to be discovered. I also introduce a distinction between "strong" and "weak" emergentist positions. The former assumes that a critical value of a parameter exists (one that is most likely related to the complexity of the states involved) at which the quantum-mechanical description breaks down, in other words, that quantum mechanics will turn out to be an incomplete description of reality. The latter assumes that quantum mechanics will remain as a universal...

  10. The Ground State of (CS) 4 Is Different from That of (CO) 4 : An Experimental Test of a Computational Prediction by Negative Ion Photoelectron Spectroscopy

    Energy Technology Data Exchange (ETDEWEB)

    Zhang, Jian; Hrovat, David A.; Sun, Zhenrong; Bao, Xiaoguang; Borden, Weston Thatcher; Wang, Xue-Bin

    2013-08-22

    Cyclobutane-1,2,3,4-tetrathione, (CS)4, has recently been calculated to have a singlet ground state, 1A1g, in which the highest b2g MO is doubly occupied and the lowest a2u MO is empty. Thus, (CS)4 is predicted to have a different ground state than its lighter congener, (CO)4, which has a triplet ground state, 3B1u, in which these two MOs are each singly occupied. Here we report the results of a negative ion photoelectron spectroscopy (NIPES) study of the radical anion (CS)4∙-, designed to test the prediction that (CS)4 has a singlet ground state. The NIPE spectrum reveals that (CS)4 does, indeed, have a singlet ground state with electron affinity (EA) = 3.75 eV. The lowest triplet state is found to lie 0.31 eV higher in energy than the ground state, and the open-shell singlet is 0.14 eV higher in energy than the triplet state. Calculations at the (U)CCSD(T)/aug-cc-pVTZ//(U)B3LYP/6-311+G(2df) level support the spectral assignments, giving EA = 3.71 eV, EST = 0.44 eV. These calculated values are, respectively, 0.04 eV (0.9 kcal/mol) smaller, and 0.13 eV (3.0 kcal/mol) larger than the corresponding experimental values. In addition, RASPT2 calculations with various active spaces converge on a 1B1u-3B1u energy gap of 0.137 eV, in excellent agreement with the 0.14 eV energy difference obtained from the NIPE spectrum. Finally, calculations of the Franck-Condon factors for transitions from the ground state of (CS)4∙- to the ground (1A1g) and two excited states (3B1u, 1B1u) of (CS)4 account for all of the major spectral peaks, and nicely reproduce vibrational structure observed in each electronic transition. The close correspondence between the calculated and the observed features in the NIPE spectrum of (CS)4∙- provides unequivocal proof that (CS)4, unlike (CO)4, has a singlet ground state.

  11. Quantum computing implementations with neutral particles

    DEFF Research Database (Denmark)

    Negretti, Antonio; Treutlein, Philipp; Calarco, Tommaso

    2011-01-01

    We review quantum information processing with cold neutral particles, that is, atoms or polar molecules. First, we analyze the best suited degrees of freedom of these particles for storing quantum information, and then we discuss both single- and two-qubit gate implementations. We focus our discu...... optimal control theory might be a powerful tool to enhance the speed up of the gate operations as well as to achieve high fidelities required for fault tolerant quantum computation.......We review quantum information processing with cold neutral particles, that is, atoms or polar molecules. First, we analyze the best suited degrees of freedom of these particles for storing quantum information, and then we discuss both single- and two-qubit gate implementations. We focus our...... discussion mainly on collisional quantum gates, which are best suited for atom-chip-like devices, as well as on gate proposals conceived for optical lattices. Additionally, we analyze schemes both for cold atoms confined in optical cavities and hybrid approaches to entanglement generation, and we show how...

  12. Quantum Computers: A New Paradigm in Information Technology

    Directory of Open Access Journals (Sweden)

    Mahesh S. Raisinghani

    2001-01-01

    Full Text Available The word 'quantum' comes from the Latin word quantus meaning 'how much'. Quantum computing is a fundamentally new mode of information processing that can be performed only by harnessing physical phenomena unique to quantum mechanics (especially quantum interference. Paul Benioff of the Argonne National Laboratory first applied quantum theory to computers in 1981 and David Deutsch of Oxford proposed quantum parallel computers in 1985, years before the realization of qubits in 1995. However, it may be well into the 21st century before we see quantum computing used at a commercial level for a variety of reasons discussed in this paper. The subject of quantum computing brings together ideas from classical information theory, computer science, and quantum physics. This paper discusses some of the current advances, applications, and chal-lenges of quantum computing as well as its impact on corporate computing and implications for management. It shows how quantum computing can be utilized to process and store information, as well as impact cryptography for perfectly secure communication, algorithmic searching, factorizing large numbers very rapidly, and simulating quantum-mechanical systems efficiently. A broad interdisciplinary effort will be needed if quantum com-puters are to fulfill their destiny as the world's fastest computing devices.

  13. A repeat-until-success quantum computing scheme

    Energy Technology Data Exchange (ETDEWEB)

    Beige, A [School of Physics and Astronomy, University of Leeds, Leeds LS2 9JT (United Kingdom); Lim, Y L [DSO National Laboratories, 20 Science Park Drive, Singapore 118230, Singapore (Singapore); Kwek, L C [Department of Physics, National University of Singapore, 2 Science Drive 3, Singapore 117542, Singapore (Singapore)

    2007-06-15

    Recently we proposed a hybrid architecture for quantum computing based on stationary and flying qubits: the repeat-until-success (RUS) quantum computing scheme. The scheme is largely implementation independent. Despite the incompleteness theorem for optical Bell-state measurements in any linear optics set-up, it allows for the implementation of a deterministic entangling gate between distant qubits. Here we review this distributed quantum computation scheme, which is ideally suited for integrated quantum computation and communication purposes.

  14. QCWAVE, a Mathematica quantum computer simulation update

    CERN Document Server

    Tabakin, Frank

    2011-01-01

    This Mathematica 7.0/8.0 package upgrades and extends the quantum computer simulation code called QDENSITY. Use of the density matrix was emphasized in QDENSITY, although that code was also applicable to a quantum state description. In the present version, the quantum state version is stressed and made amenable to future extensions to parallel computer simulations. The add-on QCWAVE extends QDENSITY in several ways. The first way is to describe the action of one, two and three- qubit quantum gates as a set of small ($2 \\times 2, 4\\times 4$ or $8\\times 8$) matrices acting on the $2^{n_q}$ amplitudes for a system of $n_q$ qubits. This procedure was described in our parallel computer simulation QCMPI and is reviewed here. The advantage is that smaller storage demands are made, without loss of speed, and that the procedure can take advantage of message passing interface (MPI) techniques, which will hopefully be generally available in future Mathematica versions. Another extension of QDENSITY provided here is a mu...

  15. Efficient quantum computing using coherent photon conversion.

    Science.gov (United States)

    Langford, N K; Ramelow, S; Prevedel, R; Munro, W J; Milburn, G J; Zeilinger, A

    2011-10-12

    Single photons are excellent quantum information carriers: they were used in the earliest demonstrations of entanglement and in the production of the highest-quality entanglement reported so far. However, current schemes for preparing, processing and measuring them are inefficient. For example, down-conversion provides heralded, but randomly timed, single photons, and linear optics gates are inherently probabilistic. Here we introduce a deterministic process--coherent photon conversion (CPC)--that provides a new way to generate and process complex, multiquanta states for photonic quantum information applications. The technique uses classically pumped nonlinearities to induce coherent oscillations between orthogonal states of multiple quantum excitations. One example of CPC, based on a pumped four-wave-mixing interaction, is shown to yield a single, versatile process that provides a full set of photonic quantum processing tools. This set satisfies the DiVincenzo criteria for a scalable quantum computing architecture, including deterministic multiqubit entanglement gates (based on a novel form of photon-photon interaction), high-quality heralded single- and multiphoton states free from higher-order imperfections, and robust, high-efficiency detection. It can also be used to produce heralded multiphoton entanglement, create optically switchable quantum circuits and implement an improved form of down-conversion with reduced higher-order effects. Such tools are valuable building blocks for many quantum-enabled technologies. Finally, using photonic crystal fibres we experimentally demonstrate quantum correlations arising from a four-colour nonlinear process suitable for CPC and use these measurements to study the feasibility of reaching the deterministic regime with current technology. Our scheme, which is based on interacting bosonic fields, is not restricted to optical systems but could also be implemented in optomechanical, electromechanical and superconducting

  16. Scheme for Quantum Computing Immune to Decoherence

    Science.gov (United States)

    Williams, Colin; Vatan, Farrokh

    2008-01-01

    A constructive scheme has been devised to enable mapping of any quantum computation into a spintronic circuit in which the computation is encoded in a basis that is, in principle, immune to quantum decoherence. The scheme is implemented by an algorithm that utilizes multiple physical spins to encode each logical bit in such a way that collective errors affecting all the physical spins do not disturb the logical bit. The scheme is expected to be of use to experimenters working on spintronic implementations of quantum logic. Spintronic computing devices use quantum-mechanical spins (typically, electron spins) to encode logical bits. Bits thus encoded (denoted qubits) are potentially susceptible to errors caused by noise and decoherence. The traditional model of quantum computation is based partly on the assumption that each qubit is implemented by use of a single two-state quantum system, such as an electron or other spin-1.2 particle. It can be surprisingly difficult to achieve certain gate operations . most notably, those of arbitrary 1-qubit gates . in spintronic hardware according to this model. However, ironically, certain 2-qubit interactions (in particular, spin-spin exchange interactions) can be achieved relatively easily in spintronic hardware. Therefore, it would be fortunate if it were possible to implement any 1-qubit gate by use of a spin-spin exchange interaction. While such a direct representation is not possible, it is possible to achieve an arbitrary 1-qubit gate indirectly by means of a sequence of four spin-spin exchange interactions, which could be implemented by use of four exchange gates. Accordingly, the present scheme provides for mapping any 1-qubit gate in the logical basis into an equivalent sequence of at most four spin-spin exchange interactions in the physical (encoded) basis. The complexity of the mathematical derivation of the scheme from basic quantum principles precludes a description within this article; it must suffice to report

  17. Simulating quantum systems on classical computers with matrix product states

    Energy Technology Data Exchange (ETDEWEB)

    Kleine, Adrian

    2010-11-08

    In this thesis, the numerical simulation of strongly-interacting many-body quantum-mechanical systems using matrix product states (MPS) is considered. Matrix-Product-States are a novel representation of arbitrary quantum many-body states. Using quantum information theory, it is possible to show that Matrix-Product-States provide a polynomial-sized representation of one-dimensional quantum systems, thus allowing an efficient simulation of one-dimensional quantum system on classical computers. Matrix-Product-States form the conceptual framework of the density-matrix renormalization group (DMRG). After a general introduction in the first chapter of this thesis, the second chapter deals with Matrix-Product-States, focusing on the development of fast and stable algorithms. To obtain algorithms to efficiently calculate ground states, the density-matrix renormalization group is reformulated using the Matrix-Product-States framework. Further, time-dependent problems are considered. Two different algorithms are presented, one based on a Trotter decomposition of the time-evolution operator, the other one on Krylov subspaces. Finally, the evaluation of dynamical spectral functions is discussed, and a correction vector-based method is presented. In the following chapters, the methods presented in the second chapter, are applied to a number of different physical problems. The third chapter deals with the existence of chiral phases in isotropic one-dimensional quantum spin systems. A preceding analytical study based on a mean-field approach indicated the possible existence of those phases in an isotropic Heisenberg model with a frustrating zig-zag interaction and a magnetic field. In this thesis, the existence of the chiral phases is shown numerically by using Matrix-Product-States-based algorithms. In the fourth chapter, we propose an experiment using ultracold atomic gases in optical lattices, which allows a well controlled observation of the spin-charge separation (of

  18. Ion Trap Quantum Computers: Performance Limits and Experimental Progress

    Science.gov (United States)

    Hughes, Richard

    1998-03-01

    In a quantum computer information would be represented by the quantum mechanical states of suitable atomic-scale systems. (A single bit of information represented by a two-level quantum system is known as a qubit.) This notion leads to the possibility of computing with quantum mechanical superpositions of numbers ("quantum parallelism"), which for certain problems would make Quantum/quantum.html>quantum computation very much more efficient than classical computation. The possibility of rapidly factoring the large integers used in public-key cryptography is an important example. (Public key cryptosystems derive their security from the difficuty of factoring, and similar problems, with conventional computers.) Quantum computational hardware development is in its infancy, but an experimental study of quantum computation with laser-cooled trapped calcium ions that is under way at Los Alamos will be described. One of the pricipal obstacles to practical quantum computation is the inevitable loss of quantum coherence of the complex quantum states involved. The results of a theoretical analysis showing that quantum factoring of small integers should be possible with trapped ions will be presented. The prospects for larger-scale computations will be discussed.

  19. Measurement-Based and Universal Blind Quantum Computation

    Science.gov (United States)

    Broadbent, Anne; Fitzsimons, Joseph; Kashefi, Elham

    Measurement-based quantum computation (MBQC) is a novel approach to quantum computation where the notion of measurement is the main driving force of computation. This is in contrast with the more traditional circuit model which is based on unitary operation. We review here the mathematical model underlying MBQC and the first quantum cryptographic protocol designed using the unique features of MBQC.

  20. Laser cooling a neutral atom to the three-dimensional vibrational ground state of an optical tweezer

    CERN Document Server

    Kaufman, Adam M; Regal, Cindy A

    2012-01-01

    We report three-dimensional ground state cooling of a single neutral atom in an optical tweezer. After employing Raman sideband cooling for 33 ms, we measure via sideband spectroscopy a three-dimensional ground state occupation of ~90%. Ground state neutral atoms in optical tweezers will be instrumental in numerous quantum logic applications and for nanophotonic interfaces that require a versatile platform for storing, moving, and manipulating ultracold single neutral atoms.

  1. Logic and algebraic structures in quantum computing

    CERN Document Server

    Eskandarian, Ali; Harizanov, Valentina S

    2016-01-01

    Arising from a special session held at the 2010 North American Annual Meeting of the Association for Symbolic Logic, this volume is an international cross-disciplinary collaboration with contributions from leading experts exploring connections across their respective fields. Themes range from philosophical examination of the foundations of physics and quantum logic, to exploitations of the methods and structures of operator theory, category theory, and knot theory in an effort to gain insight into the fundamental questions in quantum theory and logic. The book will appeal to researchers and students working in related fields, including logicians, mathematicians, computer scientists, and physicists. A brief introduction provides essential background on quantum mechanics and category theory, which, together with a thematic selection of articles, may also serve as the basic material for a graduate course or seminar.

  2. Realizing the quantum baker's map on a 3-qubit NMR quantum computer

    CERN Document Server

    Brun, T A; Brun, Todd A.; Schack, Ruediger

    1999-01-01

    By numerically simulating an implementation of the quantum baker's map on a 3-qubit NMR quantum computer based on the molecule trichloroethylene, we demonstrate the feasibility of quantum chaos experiments on present-day quantum computers. We give detailed descriptions of proposed experiments that investigate (a) the rate of entropy increase due to decoherence and (b) the phenomenon of hypersensitivity to perturbation.

  3. QDENSITY—A Mathematica quantum computer simulation

    Science.gov (United States)

    Juliá-Díaz, Bruno; Burdis, Joseph M.; Tabakin, Frank

    2009-03-01

    This Mathematica 6.0 package is a simulation of a Quantum Computer. The program provides a modular, instructive approach for generating the basic elements that make up a quantum circuit. The main emphasis is on using the density matrix, although an approach using state vectors is also implemented in the package. The package commands are defined in Qdensity.m which contains the tools needed in quantum circuits, e.g., multiqubit kets, projectors, gates, etc. New version program summaryProgram title: QDENSITY 2.0 Catalogue identifier: ADXH_v2_0 Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADXH_v2_0.html Program obtainable from: CPC Program Library, Queen's University, Belfast, N. Ireland Licensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.html No. of lines in distributed program, including test data, etc.: 26 055 No. of bytes in distributed program, including test data, etc.: 227 540 Distribution format: tar.gz Programming language: Mathematica 6.0 Operating system: Any which supports Mathematica; tested under Microsoft Windows XP, Macintosh OS X, and Linux FC4 Catalogue identifier of previous version: ADXH_v1_0 Journal reference of previous version: Comput. Phys. Comm. 174 (2006) 914 Classification: 4.15 Does the new version supersede the previous version?: Offers an alternative, more up to date, implementation Nature of problem: Analysis and design of quantum circuits, quantum algorithms and quantum clusters. Solution method: A Mathematica package is provided which contains commands to create and analyze quantum circuits. Several Mathematica notebooks containing relevant examples: Teleportation, Shor's Algorithm and Grover's search are explained in detail. A tutorial, Tutorial.nb is also enclosed. Reasons for new version: The package has been updated to make it fully compatible with Mathematica 6.0 Summary of revisions: The package has been updated to make it fully compatible with Mathematica 6.0 Running time: Most examples

  4. A Rosetta Stone for Quantum Mechanics with an Introduction to Quantum Computation

    CERN Document Server

    Lomonaco, S J

    2000-01-01

    The purpose of these lecture notes is to provide readers, who have some mathematical background but little or no exposure to quantum mechanics and quantum computation, with enough material to begin reading the research literature in quantum computation and quantum information theory. This paper is a written version of the first of eight one hour lectures given in the American Mathematical Society (AMS) Short Course on Quantum Computation held in conjunction with the Annual Meeting of the AMS in Washington, DC, USA in January 2000, and will appear in the AMS PSAPM volume entitled "Quantum Computation." Part 1 of the paper is an introduction the to the concept of the qubit. Part 2 gives an introduction to quantum mechanics covering such topics as Dirac notation, quantum measurement, Heisenberg uncertainty, Schrodinger's equation, density operators, partial trace, multipartite quantum systems, the Heisenberg versus the Schrodinger picture, quantum entanglement, EPR paradox, quantum entropy. Part 3 gives a brief ...

  5. Scalable quantum computer architecture with coupled donor-quantum dot qubits

    Science.gov (United States)

    Schenkel, Thomas; Lo, Cheuk Chi; Weis, Christoph; Lyon, Stephen; Tyryshkin, Alexei; Bokor, Jeffrey

    2014-08-26

    A quantum bit computing architecture includes a plurality of single spin memory donor atoms embedded in a semiconductor layer, a plurality of quantum dots arranged with the semiconductor layer and aligned with the donor atoms, wherein a first voltage applied across at least one pair of the aligned quantum dot and donor atom controls a donor-quantum dot coupling. A method of performing quantum computing in a scalable architecture quantum computing apparatus includes arranging a pattern of single spin memory donor atoms in a semiconductor layer, forming a plurality of quantum dots arranged with the semiconductor layer and aligned with the donor atoms, applying a first voltage across at least one aligned pair of a quantum dot and donor atom to control a donor-quantum dot coupling, and applying a second voltage between one or more quantum dots to control a Heisenberg exchange J coupling between quantum dots and to cause transport of a single spin polarized electron between quantum dots.

  6. Universal quantum gates for Single Cooper Pair Box based quantum computing

    Science.gov (United States)

    Echternach, P.; Williams, C. P.; Dultz, S. C.; Braunstein, S.; Dowling, J. P.

    2000-01-01

    We describe a method for achieving arbitrary 1-qubit gates and controlled-NOT gates within the context of the Single Cooper Pair Box (SCB) approach to quantum computing. Such gates are sufficient to support universal quantum computation.

  7. Applications of computational quantum mechanics

    Science.gov (United States)

    Temel, Burcin

    This original research dissertation is composed of a new numerical technique based on Chebyshev polynomials that is applied on scattering problems, a phenomenological kinetics study for CO oxidation on RuO2 surface, and an experimental study on methanol coupling with doped metal oxide catalysts. Minimum Error Method (MEM), a least-squares minimization method, provides an efficient and accurate alternative to solve systems of ordinary differential equations. Existing methods usually utilize matrix methods which are computationally costful. MEM, which is based on the Chebyshev polynomials as a basis set, uses the recursion relationships and fast Chebyshev transforms which scale as O(N). For large basis set calculations this provides an enormous computational efficiency in the calculations. Chebyshev polynomials are also able to represent non-periodic problems very accurately. We applied MEM on elastic and inelastic scattering problems: it is more efficient and accurate than traditionally used Kohn variational principle, and it also provides the wave function in the interaction region. Phenomenological kinetics (PK) is widely used in industry to predict the optimum conditions for a chemical reaction. PK neglects the fluctuations, assumes no lateral interactions, and considers an ideal mix of reactants. The rate equations are tested by fitting the rate constants to the results of the experiments. Unfortunately, there are numerous examples where a fitted mechanism was later shown to be erroneous. We have undertaken a thorough comparison between the phenomenological equations and the results of kinetic Monte Carlo (KMC) simulations performed on the same system. The PK equations are qualitatively consistent with the KMC results but are quantitatively erroneous as a result of interplays between the adsorption and desorption events. The experimental study on methanol coupling with doped metal oxide catalysts demonstrates the doped metal oxides as a new class of catalysts

  8. Non-unitary probabilistic quantum computing circuit and method

    Science.gov (United States)

    Williams, Colin P. (Inventor); Gingrich, Robert M. (Inventor)

    2009-01-01

    A quantum circuit performing quantum computation in a quantum computer. A chosen transformation of an initial n-qubit state is probabilistically obtained. The circuit comprises a unitary quantum operator obtained from a non-unitary quantum operator, operating on an n-qubit state and an ancilla state. When operation on the ancilla state provides a success condition, computation is stopped. When operation on the ancilla state provides a failure condition, computation is performed again on the ancilla state and the n-qubit state obtained in the previous computation, until a success condition is obtained.

  9. Direct certification of a class of quantum simulations

    Science.gov (United States)

    Hangleiter, D.; Kliesch, M.; Schwarz, M.; Eisert, J.

    2017-03-01

    One of the main challenges in the field of quantum simulation and computation is to identify ways to certify the correct functioning of a device when a classical efficient simulation is not available. Important cases are situations in which one cannot classically calculate local expectation values of state preparations efficiently. In this work, we develop weak-membership formulations of the certification of ground state preparations. We provide a non-interactive protocol for certifying ground states of frustration-free Hamiltonians based on simple energy measurements of local Hamiltonian terms. This certification protocol can be applied to classically intractable analog quantum simulations: For example, using Feynman-Kitaev Hamiltonians, one can encode universal quantum computation in such ground states. Moreover, our certification protocol is applicable to ground state encodings of IQP circuits aiming at the demonstration of quantum supremacy. These can be certified efficiently when the error is polynomially bounded.

  10. Fate of the Superconducting Ground State on the Moyal Plane

    CERN Document Server

    Basu, Prasad; Vaidya, Sachindeo

    2009-01-01

    It is known that Berry curvature of the band structure of certain crystals can lead to effective noncommutativity between spatial coordinates. Using the techniques of twisted quantum field theory, we investigate the question of the formation of a paired state of twisted fermions in such a system. We find that to leading order in the noncommutativity parameter, the gap between the non-interacting ground state and the paired state is {\\it smaller} compared to its commutative counterpart. This suggests that BCS type superconductivity, if present in such systems, is more fragile and easier to disrupt.

  11. Ground states for nonuniform periodic Ising chains

    Science.gov (United States)

    Martínez-Garcilazo, J. P.; Ramírez, C.

    2015-04-01

    We generalize Morita's works [J. Phys. A 7, 289 (1974), 10.1088/0305-4470/7/2/014; J. Phys. A 7, 1613 (1974), 10.1088/0305-4470/7/13/015] on ground states of Ising chains, for chains with a periodic structure and different spins, to any interaction order. The main assumption is translational invariance. The length of the irreducible blocks is a multiple of the period of the chain. If there is parity invariance, it restricts the length in general only in the diatomic case. There are degenerated states and under certain circumstances there could be nonregular ground states. We illustrate the results and give the ground state diagrams in several cases.

  12. Ground states of linearly coupled Schrodinger systems

    Directory of Open Access Journals (Sweden)

    Haidong Liu

    2017-01-01

    Full Text Available This article concerns the standing waves of a linearly coupled Schrodinger system which arises from nonlinear optics and condensed matter physics. The coefficients of the system are spatially dependent and have a mixed behavior: they are periodic in some directions and tend to positive constants in other directions. Under suitable assumptions, we prove that the system has a positive ground state. In addition, when the L-infinity-norm of the coupling coefficient tends to zero, the asymptotic behavior of the ground states is also obtained.

  13. Trapped Antihydrogen in Its Ground State

    CERN Document Server

    Gabrielse, G; Kolthammer, W S; McConnell, R; Richerme, P; Grzonka, D; Oelert, W; Sefzick, T; Zielinski, M; Fitzakerley, D W; George, M C; Hessels, E A; Storry, C H; Weel, M; Mullers, A; Walz, J

    2012-01-01

    Antihydrogen atoms are confined in an Ioffe trap for 15 to 1000 seconds -- long enough to ensure that they reach their ground state. Though reproducibility challenges remain in making large numbers of cold antiprotons and positrons interact, 5 +/- 1 simultaneously-confined ground state atoms are produced and observed on average, substantially more than previously reported. Increases in the number of simultaneously trapped antithydrogen atoms H are critical if laser-cooling of trapped antihydrogen is to be demonstrated, and spectroscopic studies at interesting levels of precision are to be carried out.

  14. How detrimental is decoherence in adiabatic quantum computation?

    CERN Document Server

    Albash, Tameem

    2015-01-01

    Recent experiments with increasingly larger numbers of qubits have sparked renewed interest in adiabatic quantum computation, and in particular quantum annealing. A central question that is repeatedly asked is whether quantum features of the evolution can survive over the long time-scales used for quantum annealing relative to standard measures of the decoherence time. We reconsider the role of decoherence in adiabatic quantum computation and quantum annealing using the adiabatic quantum master equation formalism. We restrict ourselves to the weak-coupling and singular-coupling limits, which correspond to decoherence in the energy eigenbasis and in the computational basis, respectively. We demonstrate that decoherence in the instantaneous energy eigenbasis does not necessarily detrimentally affect adiabatic quantum computation, and in particular that a short single-qubit $T_2$ time need not imply adverse consequences for the success of the quantum adiabatic algorithm. We further demonstrate that boundary canc...

  15. PREFACE: Quantum Information, Communication, Computation and Cryptography

    Science.gov (United States)

    Benatti, F.; Fannes, M.; Floreanini, R.; Petritis, D.

    2007-07-01

    The application of quantum mechanics to information related fields such as communication, computation and cryptography is a fast growing line of research that has been witnessing an outburst of theoretical and experimental results, with possible practical applications. On the one hand, quantum cryptography with its impact on secrecy of transmission is having its first important actual implementations; on the other hand, the recent advances in quantum optics, ion trapping, BEC manipulation, spin and quantum dot technologies allow us to put to direct test a great deal of theoretical ideas and results. These achievements have stimulated a reborn interest in various aspects of quantum mechanics, creating a unique interplay between physics, both theoretical and experimental, mathematics, information theory and computer science. In view of all these developments, it appeared timely to organize a meeting where graduate students and young researchers could be exposed to the fundamentals of the theory, while senior experts could exchange their latest results. The activity was structured as a school followed by a workshop, and took place at The Abdus Salam International Center for Theoretical Physics (ICTP) and The International School for Advanced Studies (SISSA) in Trieste, Italy, from 12-23 June 2006. The meeting was part of the activity of the Joint European Master Curriculum Development Programme in Quantum Information, Communication, Cryptography and Computation, involving the Universities of Cergy-Pontoise (France), Chania (Greece), Leuven (Belgium), Rennes1 (France) and Trieste (Italy). This special issue of Journal of Physics A: Mathematical and Theoretical collects 22 contributions from well known experts who took part in the workshop. They summarize the present day status of the research in the manifold aspects of quantum information. The issue is opened by two review articles, the first by G Adesso and F Illuminati discussing entanglement in continuous variable

  16. A Geometric Algebra Perspective On Quantum Computational Gates And Universality In Quantum Computing

    CERN Document Server

    Cafaro, Carlo

    2010-01-01

    We investigate the utility of geometric (Clifford) algebras (GA) methods in two specific applications to quantum information science. First, using the multiparticle spacetime algebra (MSTA, the geometric algebra of a relativistic configuration space), we present an explicit algebraic description of one and two-qubit quantum states together with a MSTA characterization of one and two-qubit quantum computational gates. Second, using the above mentioned characterization and the GA description of the Lie algebras SO(3) and SU(2) based on the rotor group Spin+(3, 0) formalism, we reexamine Boykin's proof of universality of quantum gates. We conclude that the MSTA approach does lead to a useful conceptual unification where the complex qubit space and the complex space of unitary operators acting on them become united, with both being made just by multivectors in real space. Finally, the GA approach to rotations based on the rotor group does bring conceptual and computational advantages compared to standard vectoria...

  17. Type II Quantum Computing Algorithm For Computational Fluid Dynamics

    Science.gov (United States)

    2006-03-01

    Hall/CRC (2003) 30. Gilbert Strang, Linear Algebra and its Applications. Thompson Learning, Inc (1988) 31. George Arfken and Hans Weber, Mathematical ... method is called ensemble Figure 3. Ensemble measurement averages the measurement results of N identical quantum computers to obtain the magnitude of...the lattice Boltzmann equation. There are two methods of modeling this mesoscopic equation. The first approach is to directly simulate the

  18. Interactive Quantum Mechanics Quantum Experiments on the Computer

    CERN Document Server

    Brandt, S; Dahmen, H.D

    2011-01-01

    Extra Materials available on extras.springer.com INTERACTIVE QUANTUM MECHANICS allows students to perform their own quantum-physics experiments on their computer, in vivid 3D color graphics. Topics covered include: •        harmonic waves and wave packets, •        free particles as well as bound states and scattering in various potentials in one and three dimensions (both stationary and time dependent), •        two-particle systems, coupled harmonic oscillators, •        distinguishable and indistinguishable particles, •        coherent and squeezed states in time-dependent motion, •        quantized angular momentum, •        spin and magnetic resonance, •        hybridization. For the present edition the physics scope has been widened appreciably. Moreover, INTERQUANTA can now produce user-defined movies of quantum-mechanical situations. Movies can be viewed directly and also be saved to be shown later in any browser. Sections on spec...

  19. Quantum chaos and random matrix theory for fidelity decay in quantum computations with static imperfections

    CERN Document Server

    Frahm, K M; Shepelyansky, D L; Fleckinger, Robert; Frahm, Klaus M.; Shepelyansky, Dima L.

    2004-01-01

    We determine the universal law for fidelity decay in quantum computations of complex dynamics in presence of internal static imperfections in a quantum computer. Our approach is based on random matrix theory applied to quantum computations in presence of imperfections. The theoretical predictions are tested and confirmed in extensive numerical simulations of a quantum algorithm for quantum chaos in the dynamical tent map with up to 18 qubits. The theory developed determines the time scales for reliable quantum computations in absence of the quantum error correction codes. These time scales are related to the Heisenberg time, the Thouless time, and the decay time given by Fermi's golden rule which are well known in the context of mesoscopic systems. The comparison is presented for static imperfection effects and random errors in quantum gates. A new convenient method for the quantum computation of the coarse-grained Wigner function is also proposed.

  20. Dynamics of a ground-state cooled ion colliding with ultra-cold atoms

    CERN Document Server

    Meir, Ziv; Ben-shlomi, Ruti; Akerman, Nitzan; Dallal, Yehonatan; Ozeri, Roee

    2016-01-01

    Ultra-cold atom-ion mixtures are gaining increasing interest due to their potential applications in quantum chemistry, quantum computing and many-body physics. The polarization potential between atoms and ions scales as 1/r^4 and extends to 100's of nm. This long length-scale interaction can form macroscopic objects while exhibiting quantum features such as Feshbach and shape resonances at sufficiently low temperatures. So far, reaching the quantum regime of atom-ion interaction has been impeded by the ion's excess micromotion (EMM) which sets a scale for the steady-state energy. In this work, we studied the dynamics of a ground-state cooled ion with negligible EMM during few, to many, Langevin (spiraling) collisions with ultra-cold atoms. We measured the energy distribution of the ion using both coherent (Rabi) and non-coherent (photon scattering) spectroscopy. We observed a clear deviation from a Maxwell-Boltzmann thermal distribution to a Tsallis energy distribution characterized by a power-law tail of hig...

  1. Electron momentum spectroscopy of dimethyl ether taking account of nuclear dynamics in the electronic ground state

    Energy Technology Data Exchange (ETDEWEB)

    Morini, Filippo; Deleuze, Michael Simon, E-mail: michael.deleuze@uhasselt.be [Center of Molecular and Materials Modelling, Hasselt University, Agoralaan Gebouw D, B-3590 Diepenbeek (Belgium); Watanabe, Noboru; Kojima, Masataka; Takahashi, Masahiko [Institute of Multidisciplinary Research for Advanced Materials, Tohoku University, Sendai 980-8577 (Japan)

    2015-10-07

    The influence of nuclear dynamics in the electronic ground state on the (e,2e) momentum profiles of dimethyl ether has been analyzed using the harmonic analytical quantum mechanical and Born-Oppenheimer molecular dynamics approaches. In spite of fundamental methodological differences, results obtained with both approaches consistently demonstrate that molecular vibrations in the electronic ground state have a most appreciable influence on the momentum profiles associated to the 2b{sub 1}, 6a{sub 1}, 4b{sub 2}, and 1a{sub 2} orbitals. Taking this influence into account considerably improves the agreement between theoretical and newly obtained experimental momentum profiles, with improved statistical accuracy. Both approaches point out in particular the most appreciable role which is played by a few specific molecular vibrations of A{sub 1}, B{sub 1}, and B{sub 2} symmetries, which correspond to C–H stretching and H–C–H bending modes. In line with the Herzberg-Teller principle, the influence of these molecular vibrations on the computed momentum profiles can be unraveled from considerations on the symmetry characteristics of orbitals and their energy spacing.

  2. Adiabatic Quantum Simulators

    CERN Document Server

    Biamonte, J D; Whitfield, J D; Fitzsimons, J; Aspuru-Guzik, A

    2010-01-01

    In his famous 1981 talk, Feynman proposed that unlike classical computers, which would presumably experience an exponential slowdown when simulating quantum phenomena, a universal quantum simulator would not. An ideal quantum simulator would be error resistant, easily controllable, and built using existing technology. Moving away from gate-model and projective measurement based implementations of quantum computing may offer a less resource-intensive, and consequently a more feasible solution. Here we consider an adiabatic quantum simulator which simulates the ground state properties of sparse Hamiltonians consisting of one- and two-body interaction terms, using sparse Hamiltonians with at most three-body interactions. Properties of such Hamiltonians can be well approximated with Hamiltonians containing only two-local terms. The register holding the simulated ground state is brought adiabatically into interaction with a probe qubit, followed by a single diabatic gate operation on the probe which then undergoes...

  3. Software Systems for High-performance Quantum Computing

    Energy Technology Data Exchange (ETDEWEB)

    Humble, Travis S [ORNL; Britt, Keith A [ORNL

    2016-01-01

    Quantum computing promises new opportunities for solving hard computational problems, but harnessing this novelty requires breakthrough concepts in the design, operation, and application of computing systems. We define some of the challenges facing the development of quantum computing systems as well as software-based approaches that can be used to overcome these challenges. Following a brief overview of the state of the art, we present models for the quantum programming and execution models, the development of architectures for hybrid high-performance computing systems, and the realization of software stacks for quantum networking. This leads to a discussion of the role that conventional computing plays in the quantum paradigm and how some of the current challenges for exascale computing overlap with those facing quantum computing.

  4. Review on the study of entanglement in quantum computation speedup

    Institute of Scientific and Technical Information of China (English)

    DING ShengChao; JIN Zhi

    2007-01-01

    The role the quantum entanglement plays in quantum computation speedup has been widely disputed.Some believe that quantum computation's speedup over classical computation is impossible if entanglement is absent, while others claim that the presence of entanglement is not a necessary condition for some quantum algorithms.This paper discusses this problem systematically.Simulating quantum computation with classical resources is analyzed and entanglement in known algorithms is reviewed.It is concluded that the presence of entanglement is a necessary but not sufficient condition in the pure state or pseudo-pure state quantum computation speedup.The case with the mixed state remains open.Further work on quantum computation will benefit from the presented results.

  5. Adiabatic quantum simulators

    Directory of Open Access Journals (Sweden)

    J. D. Biamonte

    2011-06-01

    Full Text Available In his famous 1981 talk, Feynman proposed that unlike classical computers, which would presumably experience an exponential slowdown when simulating quantum phenomena, a universal quantum simulator would not. An ideal quantum simulator would be controllable, and built using existing technology. In some cases, moving away from gate-model-based implementations of quantum computing may offer a more feasible solution for particular experimental implementations. Here we consider an adiabatic quantum simulator which simulates the ground state properties of sparse Hamiltonians consisting of one- and two-local interaction terms, using sparse Hamiltonians with at most three-local interactions. Properties of such Hamiltonians can be well approximated with Hamiltonians containing only two-local terms. The register holding the simulated ground state is brought adiabatically into interaction with a probe qubit, followed by a single diabatic gate operation on the probe which then undergoes free evolution until measured. This allows one to recover e.g. the ground state energy of the Hamiltonian being simulated. Given a ground state, this scheme can be used to verify the QMA-complete problem LOCAL HAMILTONIAN, and is therefore likely more powerful than classical computing.

  6. Popescu-Rohrlich correlations imply efficient instantaneous nonlocal quantum computation

    OpenAIRE

    Broadbent, Anne

    2015-01-01

    In instantaneous nonlocal quantum computation, two parties cooperate in order to perform a quantum computation on their joint inputs, while being restricted to a single round of simultaneous communication. Previous results showed that instantaneous nonlocal quantum computation is possible, at the cost of an exponential amount of prior shared entanglement (in the size of the input). Here, we show that a linear amount of entanglement suffices, (in the size of the computation), as long as the pa...

  7. Quantum simulation of superconductors on quantum computers. Toward the first applications of quantum processors

    Energy Technology Data Exchange (ETDEWEB)

    Dallaire-Demers, Pierre-Luc

    2016-10-07

    Quantum computers are the ideal platform for quantum simulations. Given enough coherent operations and qubits, such machines can be leveraged to simulate strongly correlated materials, where intricate quantum effects give rise to counter-intuitive macroscopic phenomena such as high-temperature superconductivity. Many phenomena of strongly correlated materials are encapsulated in the Fermi-Hubbard model. In general, no closed-form solution is known for lattices of more than one spatial dimension, but they can be numerically approximated using cluster methods. To model long-range effects such as order parameters, a powerful method to compute the cluster's Green's function consists in finding its self-energy through a variational principle. As is shown in this thesis, this allows the possibility of studying various phase transitions at finite temperature in the Fermi-Hubbard model. However, a classical cluster solver quickly hits an exponential wall in the memory (or computation time) required to store the computation variables. We show theoretically that the cluster solver can be mapped to a subroutine on a quantum computer whose quantum memory usage scales linearly with the number of orbitals in the simulated cluster and the number of measurements scales quadratically. We also provide a gate decomposition of the cluster Hamiltonian and a simple planar architecture for a quantum simulator that can also be used to simulate more general fermionic systems. We briefly analyze the Trotter-Suzuki errors and estimate the scaling properties of the algorithm for more complex applications. A quantum computer with a few tens of qubits could therefore simulate the thermodynamic properties of complex fermionic lattices inaccessible to classical supercomputers.

  8. Possible topological quantum computation via Khovanov homology: D-brane topological quantum computer

    Science.gov (United States)

    Vélez, Mario; Ospina, Juan

    2009-05-01

    A model of a D-Brane Topological Quantum Computer (DBTQC) is presented and sustained. The model is based on four-dimensional TQFTs of the Donaldson-Witten and Seiber-Witten kinds. It is argued that the DBTQC is able to compute Khovanov homology for knots, links and graphs. The DBTQC physically incorporates the mathematical process of categorification according to which the invariant polynomials for knots, links and graphs such as Jones, HOMFLY, Tutte and Bollobás-Riordan polynomials can be computed as the Euler characteristics corresponding to special homology complexes associated with knots, links and graphs. The DBTQC is conjectured as a powerful universal quantum computer in the sense that the DBTQC computes Khovanov homology which is considered like powerful that the Jones polynomial.

  9. Method of computation of energies in the fractional quantum Hall effect regime

    Directory of Open Access Journals (Sweden)

    M.A. Ammar

    2016-09-01

    Full Text Available In a previous work, we reported exact results of energies of the ground state in the fractional quantum Hall effect (FQHE regime for systems with up to N_{e}=6 electrons at the filling factor ν=1/3 by using the method of complex polar coordinates. In this work, we display interesting computational details of the previous calculation and extend the calculation to N_{e}=7 electrons at ν=1/3. Moreover, similar exact results are derived at the filling ν=1/5 for systems with up to N_{e}=6 electrons. The results that we obtained by analytical calculation are in good agreement with their analogues ones derived by the method of Monte Carlo in a precedent work.

  10. Milestones Toward Majorana-Based Quantum Computing

    Science.gov (United States)

    Aasen, David; Hell, Michael; Mishmash, Ryan V.; Higginbotham, Andrew; Danon, Jeroen; Leijnse, Martin; Jespersen, Thomas S.; Folk, Joshua A.; Marcus, Charles M.; Flensberg, Karsten; Alicea, Jason

    2016-07-01

    We introduce a scheme for preparation, manipulation, and read out of Majorana zero modes in semiconducting wires with mesoscopic superconducting islands. Our approach synthesizes recent advances in materials growth with tools commonly used in quantum-dot experiments, including gate control of tunnel barriers and Coulomb effects, charge sensing, and charge pumping. We outline a sequence of milestones interpolating between zero-mode detection and quantum computing that includes (1) detection of fusion rules for non-Abelian anyons using either proximal charge sensors or pumped current, (2) validation of a prototype topological qubit, and (3) demonstration of non-Abelian statistics by braiding in a branched geometry. The first two milestones require only a single wire with two islands, and additionally enable sensitive measurements of the system's excitation gap, quasiparticle poisoning rates, residual Majorana zero-mode splittings, and topological-qubit coherence times. These pre-braiding experiments can be adapted to other manipulation and read out schemes as well.

  11. Homomorphic encryption experiments on IBM's cloud quantum computing platform

    Science.gov (United States)

    Huang, He-Liang; Zhao, You-Wei; Li, Tan; Li, Feng-Guang; Du, Yu-Tao; Fu, Xiang-Qun; Zhang, Shuo; Wang, Xiang; Bao, Wan-Su

    2017-02-01

    Quantum computing has undergone rapid development in recent years. Owing to limitations on scalability, personal quantum computers still seem slightly unrealistic in the near future. The first practical quantum computer for ordinary users is likely to be on the cloud. However, the adoption of cloud computing is possible only if security is ensured. Homomorphic encryption is a cryptographic protocol that allows computation to be performed on encrypted data without decrypting them, so it is well suited to cloud computing. Here, we first applied homomorphic encryption on IBM's cloud quantum computer platform. In our experiments, we successfully implemented a quantum algorithm for linear equations while protecting our privacy. This demonstration opens a feasible path to the next stage of development of cloud quantum information technology.

  12. Black Hole Type Quantum Computing in Critical Bose-Einstein Systems

    CERN Document Server

    Dvali, Gia

    2015-01-01

    Recent ideas about understanding physics of black hole information-processing in terms of quantum criticality allow us to implement black hole mechanisms of quantum computing within critical Bose-Einstein systems. The generic feature, uncovered both by analytic and numeric studies, is the emergence at the critical point of gapless weakly-interacting modes, which act as qubits for information-storage at a very low energy cost. These modes can be effectively described in terms of either Bogoliubov or Goldstone degrees of freedom. The ground-state at the critical point is maximally entangled and far from being classical. We confirm this near-critical behavior by a new analytic method. We compute growth of entanglement and show its consistency with black hole type behavior. On the other hand, in the over-critical regime the system develops a Lyapunov exponent and scrambles quantum information very fast. By, manipulating the system parameters externally, we can put it in and out of various regimes and in this way ...

  13. The Quantum Socket: Three-Dimensional Wiring for Extensible Quantum Computing

    CERN Document Server

    Béjanin, J H; Rinehart, J R; Earnest, C T; McRae, C R H; Shiri, D; Bateman, J D; Rohanizadegan, Y; Penava, B; Breul, P; Royak, S; Zapatka, M; Fowler, A G; Mariantoni, M

    2016-01-01

    Quantum computing architectures are on the verge of scalability, a key requirement for the implementation of a universal quantum computer. The next stage in this quest is the realization of quantum error correction codes, which will mitigate the impact of faulty quantum information on a quantum computer. Architectures with ten or more quantum bits (qubits) have been realized using trapped ions and superconducting circuits. While these implementations are potentially scalable, true scalability will require systems engineering to combine quantum and classical hardware. One technology demanding imminent efforts is the realization of a suitable wiring method for the control and measurement of a large number of qubits. In this work, we introduce an interconnect solution for solid-state qubits: The quantum socket. The quantum socket fully exploits the third dimension to connect classical electronics to qubits with higher density and better performance than two-dimensional methods based on wire bonding. The quantum ...

  14. Measurement-only verifiable blind quantum computing with quantum input verification

    Science.gov (United States)

    Morimae, Tomoyuki

    2016-10-01

    Verifiable blind quantum computing is a secure delegated quantum computing where a client with a limited quantum technology delegates her quantum computing to a server who has a universal quantum computer. The client's privacy is protected (blindness), and the correctness of the computation is verifiable by the client despite her limited quantum technology (verifiability). There are mainly two types of protocols for verifiable blind quantum computing: the protocol where the client has only to generate single-qubit states and the protocol where the client needs only the ability of single-qubit measurements. The latter is called the measurement-only verifiable blind quantum computing. If the input of the client's quantum computing is a quantum state, whose classical efficient description is not known to the client, there was no way for the measurement-only client to verify the correctness of the input. Here we introduce a protocol of measurement-only verifiable blind quantum computing where the correctness of the quantum input is also verifiable.

  15. One-way quantum computing in the optical frequency comb.

    Science.gov (United States)

    Menicucci, Nicolas C; Flammia, Steven T; Pfister, Olivier

    2008-09-26

    One-way quantum computing allows any quantum algorithm to be implemented easily using just measurements. The difficult part is creating the universal resource, a cluster state, on which the measurements are made. We propose a scalable method that uses a single, multimode optical parametric oscillator (OPO). The method is very efficient and generates a continuous-variable cluster state, universal for quantum computation, with quantum information encoded in the quadratures of the optical frequency comb of the OPO.

  16. Computing the Exit Complexity of Knowledge in Distributed Quantum Computers

    Directory of Open Access Journals (Sweden)

    M.A.Abbas

    2013-01-01

    Full Text Available Distributed Quantum computers abide from the exit complexity of the knowledge. The exit complexity is the accrue of the nodal information needed to clarify the total egress system with deference to a distinguished exit node. The core objective of this paper is to compile an arrogant methodology for assessing the exit complexity of the knowledge in distributed quantum computers. The proposed methodology is based on contouring the knowledge using the unlabeled binary trees, hence building an benchmarked and a computer based model. The proposed methodology dramatizes knowledge autocratically calculates the exit complexity. The methodology consists of several amphitheaters, starting with detecting the baron aspect of the tree of others entitled express knowledge and then measure the volume of information and the complexity of behavior destining from the bargain of information. Then calculate egress resulting from episodes that do not lead to the withdrawal of the information. In the end is calculated total egress complexity and then appraised total exit complexity of the system. Given the complexity of the operations within the Distributed Computing Quantity, this research addresses effective transactions that could affect the three-dimensional behavior of knowledge. The results materialized that the best affair where total exit complexity as minimal as possible is a picture of a binary tree is entitled at the rate of positive and negative cardinal points medium value. It could be argued that these cardinal points should not amass the upper bound apex or minimum.

  17. Reversible logic synthesis methodologies with application to quantum computing

    CERN Document Server

    Taha, Saleem Mohammed Ridha

    2016-01-01

    This book opens the door to a new interesting and ambitious world of reversible and quantum computing research. It presents the state of the art required to travel around that world safely. Top world universities, companies and government institutions  are in a race of developing new methodologies, algorithms and circuits on reversible logic, quantum logic, reversible and quantum computing and nano-technologies. In this book, twelve reversible logic synthesis methodologies are presented for the first time in a single literature with some new proposals. Also, the sequential reversible logic circuitries are discussed for the first time in a book. Reversible logic plays an important role in quantum computing. Any progress in the domain of reversible logic can be directly applied to quantum logic. One of the goals of this book is to show the application of reversible logic in quantum computing. A new implementation of wavelet and multiwavelet transforms using quantum computing is performed for this purpose. Rese...

  18. A Rigorous Investigation on the Ground State of the Penson-Kolb Model

    Institute of Scientific and Technical Information of China (English)

    YANG Kai-Hua; TIAN Guang-Shan; HAN Ru-Qi

    2003-01-01

    By using either numerical calculations or analytical methods, such as the bosonization technique, the ground state of the Penson-Kolb model has been previously studied by several groups. Some physicists argued that, as far as the existence of superconductivity in this model is concerned, it is canonically equivalent to the negative-U Hubbard model.However, others did not agree. In the present paper, we shall investigate this model by an independent and rigorous approach. We show that the ground state of the Penson-Kolb model is nondegenerate and has a nonvanishing overlap with the ground state of the negative-U Hubbard model. Furthermore, we also show that the ground states of both the models have the same good quantum numbers and may have superconducting long-range order at the same momentum q = 0. Our results support the equivalence between these models.

  19. Efficient sympathetic motional ground-state cooling of a molecular ion

    CERN Document Server

    Wan, Yong; Wolf, Fabian; Schmidt, Piet O

    2015-01-01

    Cold molecular ions are promising candidates in various fields ranging from precision spectroscopy and test of fundamental physics to ultra-cold chemistry. Control of internal and external degrees of freedom is a prerequisite for many of these applications. Motional ground state cooling represents the starting point for quantum logic-assisted internal state preparation, detection, and spectroscopy protocols. Robust and fast cooling is crucial to maximize the fraction of time available for the actual experiment. We optimize the cooling rate of ground state cooling schemes for single $^{25}\\mathrm{Mg}^{+}$ ions and sympathetic ground state cooling of $^{24}\\mathrm{MgH}^{+}$. In particular, we show that robust cooling is achieved by combining pulsed Raman sideband cooling with continuous quench cooling. Furthermore, we experimentally demonstrate an efficient strategy for ground state cooling outside the Lamb-Dicke regime.

  20. Bott periodicity for Z2 symmetric ground states of gapped free-fermion systems

    CERN Document Server

    Kennedy, Ricardo

    2014-01-01

    Building on the symmetry classification of disordered fermions, we give a proof of the proposal by Kitaev, and others, for a "Bott clock" topological classification of free-fermion ground states of gapped systems with symmetries. Our approach differs from previous ones in that (i) we work in the standard framework of Hermitian quantum mechanics over the complex numbers, (ii) we directly formulate a mathematical model for ground states rather than spectrally flattened Hamiltonians, and (iii) we use homotopy-theoretic tools rather than K-theory. Key to our proof is a natural transformation that squares to the standard Bott map and relates the ground state of a d-dimensional system in symmetry class s to the ground state of a (d+1)-dimensional system in symmetry class s+1. This relation gives a new vantage point on topological insulators and superconductors.

  1. The clock of a quantum computer

    CERN Document Server

    Apolloni, B

    2002-01-01

    If the physical agent (the 'pointer', or 'cursor', or 'clocking mechanism') that sequentially scans the T lines of a long computer program is a microscopic system, two quantum phenomena become relevant: spreading of the probability distribution of the pointer along the program lines, and scattering of the probability amplitude at the two endpoints of the physical space allowed for its motion. We show that the first effect determines an upper bound O(T sup - sup 2 sup / sup 3) on the probability of finding the pointer exactly at the END line. By adding an adequate number delta of further empty lines ('telomers'), one can store the result of the computation up to the moment in which the pointer is scattered back into the active region. This leads to a less severe upper bound O(sq root delta/T) on the probability of finding the pointer either at the END line or within the additional empty lines. Our analysis is performed in the context of Feynman's model of quantum computation, the only model, to our knowledge, ...

  2. Nuclear ground-state masses and deformations: FRDM(2012)

    CERN Document Server

    Moller, P; Ichikawa, T; Sagawa, H

    2015-01-01

    We tabulate the atomic mass excesses and binding energies, ground-state shell-plus-pairing corrections, ground-state microscopic corrections, and nuclear ground-state deformations of 9318 nuclei ranging from $^{16}$O to $A=339$. The calculations are based on the finite-range droplet macroscopic model and the folded-Yukawa single-particle microscopic model. Relative to our FRDM(1992) mass table in {\\sc Atomic Data and Nuclear Data Tables} [{\\bf 59} 185 (1995)], the results are obtained in the same model, but with considerably improved treatment of deformation and fewer of the approximations that were necessary earlier, due to limitations in computer power. The more accurate execution of the model and the more extensive and more accurate experimental mass data base now available allows us to determine one additional macroscopic-model parameter, the density-symmetry coefficient $L$, which was not varied in the previous calculation, but set to zero. Because we now realize that the FRDM is inaccurate for some high...

  3. Boundedness and convergence of perturbed corrections for helium-like ions in ground states

    Institute of Scientific and Technical Information of China (English)

    Zhao Yun-Hui; Hai Wen-Hua; Zhao Cheng-Lin; Luo Xiao-Bing

    2008-01-01

    Applying the improved Rayleigh-Schr(o)dinger perturbation theory based on an integral equation to helium-like ions in ground states and treating electron correlations as perturbations,we obtain the second-order corrections to wavefunctions consisting of a few terms and the third-order corrections to energicity.It is demonstrated that the corrected wavefunctions are bounded and quadratically integrable,and the corresponding perturbation series is convergent.The results clear off the previous distrust for the convergence in the quantum perturbation theory and show a reciprocal development on the quantum perturbation problem of the ground state helium-like systems.

  4. Quantum Computation: Particle and Wave Aspects of Algorithms

    CERN Document Server

    Patel, Apoorva

    2011-01-01

    The driving force in the pursuit for quantum computation is the exciting possibility that quantum algorithms can be more efficient than their classical analogues. Research on the subject has unraveled several aspects of how that can happen. Clever quantum algorithms have been discovered in recent years, although not systematically, and the field remains under active investigation. Richard Feynman was one of the pioneers who foresaw the power of quantum computers. In this issue dedicated to him, I give an introduction to how particle and wave aspects contribute to the power of quantum computers. Shor's and Grover's algorithms are analysed as examples.

  5. Quantum Computing, $NP$-complete Problems and Chaotic Dynamics

    CERN Document Server

    Ohya, M; Ohya, Masanori; Volovich, Igor V.

    1999-01-01

    An approach to the solution of NP-complete problems based on quantumcomputing and chaotic dynamics is proposed. We consider the satisfiabilityproblem and argue that the problem, in principle, can be solved in polynomialtime if we combine the quantum computer with the chaotic dynamics amplifierbased on the logistic map. We discuss a possible implementation of such achaotic quantum computation by using the atomic quantum computer with quantumgates described by the Hartree-Fock equations. In this case, in principle, onecan build not only standard linear quantum gates but also nonlinear gates andmoreover they obey to Fermi statistics. This new type of entaglement relatedwith Fermi statistics can be interesting also for quantum communication theory.

  6. Quantum computing accelerator I/O : LDRD 52750 final report.

    Energy Technology Data Exchange (ETDEWEB)

    Schroeppel, Richard Crabtree; Modine, Normand Arthur; Ganti, Anand; Pierson, Lyndon George; Tigges, Christopher P.

    2003-12-01

    In a superposition of quantum states, a bit can be in both the states '0' and '1' at the same time. This feature of the quantum bit or qubit has no parallel in classical systems. Currently, quantum computers consisting of 4 to 7 qubits in a 'quantum computing register' have been built. Innovative algorithms suited to quantum computing are now beginning to emerge, applicable to sorting and cryptanalysis, and other applications. A framework for overcoming slightly inaccurate quantum gate interactions and for causing quantum states to survive interactions with surrounding environment is emerging, called quantum error correction. Thus there is the potential for rapid advances in this field. Although quantum information processing can be applied to secure communication links (quantum cryptography) and to crack conventional cryptosystems, the first few computing applications will likely involve a 'quantum computing accelerator' similar to a 'floating point arithmetic accelerator' interfaced to a conventional Von Neumann computer architecture. This research is to develop a roadmap for applying Sandia's capabilities to the solution of some of the problems associated with maintaining quantum information, and with getting data into and out of such a 'quantum computing accelerator'. We propose to focus this work on 'quantum I/O technologies' by applying quantum optics on semiconductor nanostructures to leverage Sandia's expertise in semiconductor microelectronic/photonic fabrication techniques, as well as its expertise in information theory, processing, and algorithms. The work will be guided by understanding of practical requirements of computing and communication architectures. This effort will incorporate ongoing collaboration between 9000, 6000 and 1000 and between junior and senior personnel. Follow-on work to fabricate and evaluate appropriate experimental nano/microstructures will be

  7. High Fidelity Adiabatic Quantum Computation via Dynamical Decoupling

    CERN Document Server

    Quiroz, Gregory

    2012-01-01

    We introduce high-order dynamical decoupling strategies for open system adiabatic quantum computation. Our numerical results demonstrate that a judicious choice of high-order dynamical decoupling method, in conjunction with an encoding which allows computation to proceed alongside decoupling, can dramatically enhance the fidelity of adiabatic quantum computation in spite of decoherence.

  8. Lecture Script: Introduction to Computational Quantum Mechanics

    CERN Document Server

    Schmied, Roman

    2014-01-01

    This document is the lecture script of a one-semester course taught at the University of Basel in the Fall semesters of 2012 and 2013. It is aimed at advanced students of physics who are familiar with the concepts and notations of quantum mechanics. Quantum mechanics lectures can often be separated into two classes. In the first class you get to know Schroedinger's equation and find the form and dynamics of simple physical systems (square well, harmonic oscillator, hydrogen atom); most calculations are analytic and inspired by calculations originally done in the 1920s and 1930s. In the second class you learn about large systems such as molecular structures, crystalline solids, or lattice models; these calculations are usually so complicated that it is difficult for the student to understand them in all detail. This lecture tries to bridge the gap between simple analytic calculations and complicated large-scale computations. We will revisit most of the problems encountered in introductory quantum mechanics, fo...

  9. Tomography and spectroscopy as quantum computations

    CERN Document Server

    Miquel, C; Saraceno, M; Knill, E H; Laflamme, R; Negrevergne, C; Miquel, Cesar; Paz, Juan Pablo; Saraceno, Marcos; Knill, Emmanuel; Laflamme, Raymond; Negrevergne, Camille

    2001-01-01

    Determining the state of a system and measuring properties of its evolution are two of the most important tasks a physicist faces. For the first purpose one can use tomography, a method that after subjecting the system to a number of experiments determines all independent elements of the density matrix. For the second task, one can resort to spectroscopy, a set of techniques used to determine the spectrum of eigenvalues of the evolution operator. In this letter, we show that tomography and spectroscopy can be naturally interpreted as dual forms of quantum computation. We show how to adapt the simplest case of the well-known phase estimation quantum algorithm to perform both tasks, giving it a natural interpretation as a simulated scattering experiment. We show how this algorithm can be used to implement an interesting form of tomography by performing a direct measurement of the Wigner function of a quantum system. We present results of such measurements performed on a system of three qubits using liquid state...

  10. Radio-frequency measurement in semiconductor quantum computation

    Science.gov (United States)

    Han, TianYi; Chen, MingBo; Cao, Gang; Li, HaiOu; Xiao, Ming; Guo, GuoPing

    2017-05-01

    Semiconductor quantum dots have attracted wide interest for the potential realization of quantum computation. To realize efficient quantum computation, fast manipulation and the corresponding readout are necessary. In the past few decades, considerable progress of quantum manipulation has been achieved experimentally. To meet the requirements of high-speed readout, radio-frequency (RF) measurement has been developed in recent years, such as RF-QPC (radio-frequency quantum point contact) and RF-DGS (radio-frequency dispersive gate sensor). Here we specifically demonstrate the principle of the radio-frequency reflectometry, then review the development and applications of RF measurement, which provides a feasible way to achieve high-bandwidth readout in quantum coherent control and also enriches the methods to study these artificial mesoscopic quantum systems. Finally, we prospect the future usage of radio-frequency reflectometry in scaling-up of the quantum computing models.

  11. Control aspects of quantum computing using pure and mixed states.

    Science.gov (United States)

    Schulte-Herbrüggen, Thomas; Marx, Raimund; Fahmy, Amr; Kauffman, Louis; Lomonaco, Samuel; Khaneja, Navin; Glaser, Steffen J

    2012-10-13

    Steering quantum dynamics such that the target states solve classically hard problems is paramount to quantum simulation and computation. And beyond, quantum control is also essential to pave the way to quantum technologies. Here, important control techniques are reviewed and presented in a unified frame covering quantum computational gate synthesis and spectroscopic state transfer alike. We emphasize that it does not matter whether the quantum states of interest are pure or not. While pure states underly the design of quantum circuits, ensemble mixtures of quantum states can be exploited in a more recent class of algorithms: it is illustrated by characterizing the Jones polynomial in order to distinguish between different (classes of) knots. Further applications include Josephson elements, cavity grids, ion traps and nitrogen vacancy centres in scenarios of closed as well as open quantum systems.

  12. Modular Universal Scalable Ion-trap Quantum Computer

    Science.gov (United States)

    2016-06-02

    trap quantum computer . This architecture has two separate layers of scalability: the first is to increase the number of ion qubits in a single trap...Distribution Unlimited UU UU UU UU 02-06-2016 1-Aug-2010 31-Jan-2016 Final Report: Modular Universal Scalable Ion-trap Quantum Computer The views...P.O. Box 12211 Research Triangle Park, NC 27709-2211 Ion trap quantum computation , scalable modular architectures REPORT DOCUMENTATION PAGE 11

  13. Topological quantum computing with only one mobile quasiparticle.

    Science.gov (United States)

    Simon, S H; Bonesteel, N E; Freedman, M H; Petrovic, N; Hormozi, L

    2006-02-24

    In a topological quantum computer, universal quantum computation is performed by dragging quasiparticle excitations of certain two dimensional systems around each other to form braids of their world lines in 2 + 1 dimensional space-time. In this Letter we show that any such quantum computation that can be done by braiding n identical quasiparticles can also be done by moving a single quasiparticle around n - 1 other identical quasiparticles whose positions remain fixed.

  14. Magnetic properties of ground-state mesons

    Energy Technology Data Exchange (ETDEWEB)

    Simonis, V. [Vilnius University Institute of Theoretical Physics and Astronomy, Vilnius (Lithuania)

    2016-04-15

    Starting with the bag model a method for the study of the magnetic properties (magnetic moments, magnetic dipole transition widths) of ground-state mesons is developed. We calculate the M1 transition moments and use them subsequently to estimate the corresponding decay widths. These are compared with experimental data, where available, and with the results obtained in other approaches. Finally, we give the predictions for the static magnetic moments of all ground-state vector mesons including those containing heavy quarks. We have a good agreement with experimental data for the M1 decay rates of light as well as heavy mesons. Therefore, we expect our predictions for the static magnetic properties (i.e., usual magnetic moments) to be of sufficiently high quality, too. (orig.)

  15. First observation of $^{13}$Li ground state

    CERN Document Server

    Kohley, Z; DeYoung, P A; Volya, A; Baumann, T; Bazin, D; Christian, G; Cooper, N L; Frank, N; Gade, A; Hall, C; Hinnefeld, J; Luther, B; Mosby, S; Peters, W A; Smith, J K; Snyder, J; Spyrou, A; Thoennessen, M

    2013-01-01

    The ground state of neutron-rich unbound $^{13}$Li was observed for the first time in a one-proton removal reaction from $^{14}$Be at a beam energy of 53.6 MeV/u. The $^{13}$Li ground state was reconstructed from $^{11}$Li and two neutrons giving a resonance energy of 120$^{+60}_{-80}$ keV. All events involving single and double neutron interactions in the Modular Neutron Array (MoNA) were analyzed, simulated, and fitted self-consistently. The three-body ($^{11}$Li+$n+n$) correlations within Jacobi coordinates showed strong dineutron characteristics. The decay energy spectrum of the intermediate $^{12}$Li system ($^{11}$Li+$n$) was described with an s-wave scattering length of greater than -4 fm, which is a smaller absolute value than reported in a previous measurement.

  16. Magnetic properties of ground-state mesons

    CERN Document Server

    Simonis, Vytautas

    2016-01-01

    Starting with the bag model a method for the study of the magnetic properties (magnetic moments, magnetic dipole transition widths) of ground-state mesons is developed. We calculate the M1 transition moments and use them subsequently to estimate the corresponding decay widths. These are compared with experimental data, where available, and with the results obtained in other approaches. Finally, we give the predictions for the static magnetic moments of all ground-state vector mesons including those containing heavy quarks. We have a good agreement with experimental data for the M1 decay rates of light as well as heavy mesons. Therefore, we expect our predictions for the static magnetic properties (usual magnetic moments) to be of sufficiently high quality, too.

  17. Electronic ground state of Ni$_2^+$

    CERN Document Server

    Zamudio-Bayer, V; Bülow, C; Leistner, G; Terasaki, A; Issendorff, B v; Lau, J T

    2016-01-01

    The $^{4}\\Phi_{9/2}$ ground state of the Ni$_2^+$ diatomic molecular cation is determined experimentally from temperature and magnetic-field-dependent x-ray magnetic circular dichroism spectroscopy in a cryogenic ion trap, where an electronic and rotational temperature of $7.4 \\pm 0.2$ K was achieved by buffer gas cooling of the molecular ion. The contribution of the magnetic dipole term to the x-ray magnetic circular dichroism spin sum rule amounts to $7\\, T_z = 0.17 \\pm 0.06$ $\\mu_B$ per atom, approximately 11 \\% of the spin magnetic moment. We find that, in general, homonuclear diatomic molecular cations of $3d$ transition metals seem to adopt maximum spin magnetic moments in their electronic ground states.

  18. Trapping cold ground state argon atoms.

    Science.gov (United States)

    Edmunds, P D; Barker, P F

    2014-10-31

    We trap cold, ground state argon atoms in a deep optical dipole trap produced by a buildup cavity. The atoms, which are a general source for the sympathetic cooling of molecules, are loaded in the trap by quenching them from a cloud of laser-cooled metastable argon atoms. Although the ground state atoms cannot be directly probed, we detect them by observing the collisional loss of cotrapped metastable argon atoms and determine an elastic cross section. Using a type of parametric loss spectroscopy we also determine the polarizability of the metastable 4s[3/2](2) state to be (7.3±1.1)×10(-39)  C m(2)/V. Finally, Penning and associative losses of metastable atoms in the absence of light assisted collisions, are determined to be (3.3±0.8)×10(-10)  cm(3) s(-1).

  19. Modeling fluid dynamics on type II quantum computers

    Science.gov (United States)

    Scoville, James; Weeks, David; Yepez, Jeffrey

    2006-03-01

    A quantum algorithm is presented for modeling the time evolution of density and flow fields governed by classical equations, such as the diffusion equation, the nonlinear Burgers equation, and the damped wave equation. The algorithm is intended to run on a type-II quantum computer, a parallel quantum computer consisting of a lattice of small type I quantum computers undergoing unitary evolution and interacting via information interchanges represented by an orthogonal matrices. Information is effectively transferred between adjacent quantum computers over classical communications channels because of controlled state demolition following local quantum mechanical qubit-qubit interactions within each quantum computer. The type-II quantum algorithm presented in this paper describes a methodology for generating quantum logic operations as a generalization of classical operations associated with finite-point group symmetries. The quantum mechanical evolution of multiple qubits within each node is described. Presented is a proof that the parallel quantum system obeys a finite-difference quantum Boltzman equation at the mesoscopic scale, leading in turn to various classical linear and nonlinear effective field theories at the macroscopic scale depending on the details of the local qubit-qubit interactions.

  20. Spin-free quantum computational simulations and symmetry adapted states

    CERN Document Server

    Whitfield, James Daniel

    2013-01-01

    The ideas of digital simulation of quantum systems using a quantum computer parallel the original ideas of numerical simulation using a classical computer. In order for quantum computational simulations to advance to a competitive point, many techniques from classical simulations must be imported into the quantum domain. In this article, we consider the applications of symmetry in the context of quantum simulation. Building upon well established machinery, we propose a form of first quantized simulation that only requires the spatial part of the wave function, thereby allowing spin-free quantum computational simulations. We go further and discuss the preparation of N-body states with specified symmetries based on projection techniques. We consider two simple examples, molecular hydrogen and cyclopropenyl cation, to illustrate the ideas. While the methods here represent adaptations of known quantum algorithms, they are the first to explicitly deal with preparing N-body symmetry-adapted states.

  1. Ground states for the fractional Schrodinger equation

    Directory of Open Access Journals (Sweden)

    Binhua Feng

    2013-05-01

    Full Text Available In this article, we show the existence of ground state solutions for the nonlinear Schrodinger equation with fractional Laplacian $$ (-Delta ^alpha u+ V(xu =lambda |u|^{p}uquadhbox{in $mathbb{R}^N$ for $alpha in (0,1$}. $$ We use the concentration compactness principle in fractional Sobolev spaces $H^alpha$ for $alpha in (0,1$. Our results generalize the corresponding results in the case $alpha =1$.

  2. A quantum computer on the basis of an atomic quantum transistor with built-in quantum memory

    Science.gov (United States)

    Moiseev, S. A.; Andrianov, S. N.

    2016-12-01

    A quantum transistor based quantum computer where the multiqubit quantum memory is a component of the quantum transistor and, correspondingly, takes part in the performance of quantum logical operations is considered. Proceeding from the generalized Jaynes-Cummings model, equations for coefficients of the wave function of the quantum system under consideration have been obtained for different stages of its evolution in processes of performing logical operations. The solution of the system of equations allows one to establish requirements that are imposed on the parameters of the initial Hamiltonian and must be satisfied for the effective operation of the computer; it also demonstrates the possibility of a universal set of quantum operations. Thus, based on the proposed approach, the possibility of constructing a compact multiatomic ensemble based on quantum computer using a quantum transistor for the implementation of two-qubit gates has been demonstrated.

  3. Electronic Ground State of Higher Acenes

    CERN Document Server

    Jiang, De-en

    2007-01-01

    We examine the electronic ground state of acenes with different number of fused benzene rings (up to 40) by using first principles density functional theory. Their properties are compared with those of infinite polyacene. We find that the ground state of acenes that consist of more than seven fused benzene rings is an antiferromagnetic (in other words, open-shell singlet) state, and we show that this singlet is not necessarily a diradical, because the spatially separated magnetizations for the spin-up and spin-down electrons increase with the size of the acene. For example, our results indicate that there are about four spin-up electrons localized at one zigzag edge of 20-acene. The reason that both acenes and polyacene have the antiferromagnetic ground state is due to the zigzag-shaped boundaries, which cause pi-electrons to localize and form spin orders at the edges. Both wider graphene ribbons and large rectangular-shaped polycyclic aromatic hydrocarbons have been shown to share this antiferromagnetic grou...

  4. Quantum Annealing and Computation: A Brief Documentary Note

    CERN Document Server

    Ghosh, Asim

    2013-01-01

    Major breakthrough in quantum computation has recently been achieved using quantum annealing to develop analog quantum computers instead of gate based computers. After a short introduction to quantum computation, we retrace very briefly the history of these developments and discuss the Indian researches in this connection and provide some interesting documents (in the Figs.) obtained from a chosen set of high impact papers (and also some recent news etc. blogs appearing in the Internet). This note is also designed to supplement an earlier note by Bose (Science and Culture, 79, pp. 337-378, 2013).

  5. Symmetry-protected topological phases with uniform computational power in one dimension

    Science.gov (United States)

    Raussendorf, Robert; Wang, Dong-Sheng; Prakash, Abhishodh; Wei, Tzu-Chieh; Stephen, David T.

    2017-07-01

    We investigate the usefulness of ground states of quantum spin chains with symmetry-protected topological order (SPTO) for measurement-based quantum computation. We show that, in spatial dimension 1, if an SPTO phase protects the identity gate, then, subject to an additional symmetry condition that is satisfied in all cases so far investigated, it can also be used for quantum computation.

  6. Quantum Genetics in terms of Quantum Reversible Automata and Quantum Computation of Genetic Codes and Reverse Transcription

    CERN Document Server

    Baianu,I C

    2004-01-01

    The concepts of quantum automata and quantum computation are studied in the context of quantum genetics and genetic networks with nonlinear dynamics. In previous publications (Baianu,1971a, b) the formal concept of quantum automaton and quantum computation, respectively, were introduced and their possible implications for genetic processes and metabolic activities in living cells and organisms were considered. This was followed by a report on quantum and abstract, symbolic computation based on the theory of categories, functors and natural transformations (Baianu,1971b; 1977; 1987; 2004; Baianu et al, 2004). The notions of topological semigroup, quantum automaton, or quantum computer, were then suggested with a view to their potential applications to the analogous simulation of biological systems, and especially genetic activities and nonlinear dynamics in genetic networks. Further, detailed studies of nonlinear dynamics in genetic networks were carried out in categories of n-valued, Lukasiewicz Logic Algebra...

  7. Classical and quantum computing with C++ and Java simulations

    CERN Document Server

    Hardy, Y

    2001-01-01

    Classical and Quantum computing provides a self-contained, systematic and comprehensive introduction to all the subjects and techniques important in scientific computing. The style and presentation are readily accessible to undergraduates and graduates. A large number of examples, accompanied by complete C++ and Java code wherever possible, cover every topic. Features and benefits: - Comprehensive coverage of the theory with many examples - Topics in classical computing include boolean algebra, gates, circuits, latches, error detection and correction, neural networks, Turing machines, cryptography, genetic algorithms - For the first time, genetic expression programming is presented in a textbook - Topics in quantum computing include mathematical foundations, quantum algorithms, quantum information theory, hardware used in quantum computing This book serves as a textbook for courses in scientific computing and is also very suitable for self-study. Students, professionals and practitioners in computer...

  8. A Blueprint for a Topologically Fault-tolerant Quantum Computer

    CERN Document Server

    Bonderson, Parsa; Freedman, Michael; Nayak, Chetan

    2010-01-01

    The advancement of information processing into the realm of quantum mechanics promises a transcendence in computational power that will enable problems to be solved which are completely beyond the known abilities of any "classical" computer, including any potential non-quantum technologies the future may bring. However, the fragility of quantum states poses a challenging obstacle for realization of a fault-tolerant quantum computer. The topological approach to quantum computation proposes to surmount this obstacle by using special physical systems -- non-Abelian topologically ordered phases of matter -- that would provide intrinsic fault-tolerance at the hardware level. The so-called "Ising-type" non-Abelian topological order is likely to be physically realized in a number of systems, but it can only provide a universal gate set (a requisite for quantum computation) if one has the ability to perform certain dynamical topology-changing operations on the system. Until now, practical methods of implementing thes...

  9. Computer science approach to quantum control

    Energy Technology Data Exchange (ETDEWEB)

    Janzing, D.

    2006-07-01

    Whereas it is obvious that every computation process is a physical process it has hardly been recognized that many complex physical processes bear similarities to computation processes. This is in particular true for the control of physical systems on the nanoscopic level: usually the system can only be accessed via a rather limited set of elementary control operations and for many purposes only a concatenation of a large number of these basic operations will implement the desired process. This concatenation is in many cases quite similar to building complex programs from elementary steps and principles for designing algorithm may thus be a paradigm for designing control processes. For instance, one can decrease the temperature of one part of a molecule by transferring its heat to the remaining part where it is then dissipated to the environment. But the implementation of such a process involves a complex sequence of electromagnetic pulses. This work considers several hypothetical control processes on the nanoscopic level and show their analogy to computation processes. We show that measuring certain types of quantum observables is such a complex task that every instrument that is able to perform it would necessarily be an extremely powerful computer. Likewise, the implementation of a heat engine on the nanoscale requires to process the heat in a way that is similar to information processing and it can be shown that heat engines with maximal efficiency would be powerful computers, too. In the same way as problems in computer science can be classified by complexity classes we can also classify control problems according to their complexity. Moreover, we directly relate these complexity classes for control problems to the classes in computer science. Unifying notions of complexity in computer science and physics has therefore two aspects: on the one hand, computer science methods help to analyze the complexity of physical processes. On the other hand, reasonable

  10. Simply Explain the computation Ability of Quantum Computation%浅释量子计算的计算能力

    Institute of Scientific and Technical Information of China (English)

    匡春光

    2001-01-01

    Quantum computation is a new field of computer science. It is given attention to for its powerful computation ability. The paper explains the cause of its powerful computation ability by giving two typical quantum computation algorithms.

  11. Alpha decay of even-even nuclei in the region 78{<=}Z{<=}102 to the ground state and excited states of daughter nuclei

    Energy Technology Data Exchange (ETDEWEB)

    Santhosh, K.P., E-mail: drkpsanthosh@gmail.co [School of Pure and Applied Physics, Kannur University, Payyanur Campus, Payyanur 670 327 (India); Sahadevan, Sabina; Joseph, Jayesh George [School of Pure and Applied Physics, Kannur University, Payyanur Campus, Payyanur 670 327 (India)

    2011-01-15

    Alpha half lives, branching ratios and hindrance factors of even-even nuclei in the range 78{<=}Z{<=}102 from ground state to ground state and ground state to excited states of daughter nuclei are computed using the Coulomb and proximity potential model for deformed nuclei (CPPMDN). The computed half life values and branching ratios are compared with experimental data and they are in good agreement. The standard deviation of half life and branching ratio are 0.79 and 0.94 respectively. It is found that the standard deviation of branching ratio for the ground state to ground state transition is only 0.25 and it increases as we move to the higher excited states which are due to the effect of nuclear structure. It is evident from the study that our ground state decay model is apt for describing not only the ground state to ground state decay but also decay to excited state.

  12. Preparing projected entangled pair states on a quantum computer.

    Science.gov (United States)

    Schwarz, Martin; Temme, Kristan; Verstraete, Frank

    2012-03-16

    We present a quantum algorithm to prepare injective projected entangled pair states (PEPS) on a quantum computer, a class of open tensor networks representing quantum states. The run time of our algorithm scales polynomially with the inverse of the minimum condition number of the PEPS projectors and, essentially, with the inverse of the spectral gap of the PEPS's parent Hamiltonian.

  13. Quantum Computing in Decoherence-Free Subspace Constructed by Triangulation

    Directory of Open Access Journals (Sweden)

    Qiao Bi

    2010-01-01

    Full Text Available A formalism for quantum computing in decoherence-free subspaces is presented. The constructed subspaces are partial triangulated to an index related to environment. The quantum states in the subspaces are just projected states which are ruled by a subdynamic kinetic equation. These projected states can be used to perform ideal quantum logical operations without decoherence.

  14. Ground state of a confined Yukawa plasma including correlation effects

    CERN Document Server

    Henning, C; Filinov, A; Piel, A; Bonitz, M

    2007-01-01

    The ground state of an externally confined one-component Yukawa plasma is derived analytically using the local density approximation (LDA). In particular, the radial density profile is computed. The results are compared with the recently obtained mean-field (MF) density profile \\cite{henning.pre06}. While the MF results are more accurate for weak screening, LDA with correlations included yields the proper description for large screening. By comparison with first-principle simulations for three-dimensional spherical Yukawa crystals we demonstrate that both approximations complement each other. Together they accurately describe the density profile in the full range of screening parameters.

  15. Photoabsorption by ground-state alkali-metal atoms.

    Science.gov (United States)

    Weisheit, J. C.

    1972-01-01

    Principal-series oscillator strengths and ground-state photoionization cross sections are computed for sodium, potassium, rubidium, and cesium. The degree of polarization of the photoelectrons is also predicted for each atom. The core-polarization correction to the dipole transition moment is included in all of the calculations, and the spin-orbit perturbation of valence-p-electron orbitals is included in the calculations of the Rb and Cs oscillator strengths and of all the photoionization cross sections. The results are compared with recent measurements.

  16. Expectation values of single-particle operators in the random phase approximation ground state.

    Science.gov (United States)

    Kosov, D S

    2017-02-07

    We developed a method for computing matrix elements of single-particle operators in the correlated random phase approximation ground state. Working with the explicit random phase approximation ground state wavefunction, we derived a practically useful and simple expression for a molecular property in terms of random phase approximation amplitudes. The theory is illustrated by the calculation of molecular dipole moments for a set of representative molecules.

  17. Relationship Between the Shape of Suspension Particle and Ground State Structure of Electrorheological Solid

    Institute of Scientific and Technical Information of China (English)

    WU Feng; HE Pei; CHEN Zu-Yao; JIANG Wan-Quan

    2000-01-01

    The effect of the shape of suspension particle in electrorheological (ER) fluid on the ground state structure of ER solid is discussed. The results of computation show that the ground state structure will change with the shape of suspension particle. This phenomenon is a kind of phase transitions that takes the shape factors of suspension particle as tuning parameters. The variation-value of interaction energy of the lattice structure of ER solid with the shape factors of suspension particle is sometimes noticeable.

  18. Expectation values of single-particle operators in the random phase approximation ground state

    Science.gov (United States)

    Kosov, D. S.

    2017-02-01

    We developed a method for computing matrix elements of single-particle operators in the correlated random phase approximation ground state. Working with the explicit random phase approximation ground state wavefunction, we derived a practically useful and simple expression for a molecular property in terms of random phase approximation amplitudes. The theory is illustrated by the calculation of molecular dipole moments for a set of representative molecules.

  19. Ground-state characterizations of systems predicted to exhibit L11 or L13 crystal structures

    Science.gov (United States)

    Nelson, Lance J.; Hart, Gus L. W.; Curtarolo, Stefano

    2012-02-01

    Despite their geometric simplicity, the crystal structures L11 (CuPt) and L13 (CdPt3) do not appear as ground states experimentally, except in Cu-Pt. We investigate the possibility that these phases are ground states in other binary intermetallic systems, but overlooked experimentally. Via the synergy between high-throughput and cluster-expansion computational methods, we conduct a thorough search for systems that may exhibit these phases and calculate order-disorder transition temperatures when they are predicted. High-throughput calculations predict L11 ground states in the systems Ag-Pd, Ag-Pt, Cu-Pt, Pd-Pt, Li-Pd, Li-Pt, and L13 ground states in the systems Cd-Pt, Cu-Pt, Pd-Pt, Li-Pd, Li-Pt. Cluster expansions confirm the appearance of these ground states in some cases. In the other cases, cluster expansion predicts unsuspected derivative superstructures as ground states. The order-disorder transition temperatures for all L11/L13 ground states were found to be sufficiently high that their physical manifestation may be possible.

  20. Counting Trees in Supersymmetric Quantum Mechanics

    CERN Document Server

    Cordova, Clay

    2015-01-01

    We study the supersymmetric ground states of the Kronecker model of quiver quantum mechanics. This is the simplest quiver with two gauge groups and bifundamental matter fields, and appears universally in four-dimensional N=2 systems. The ground state degeneracy may be written as a multi-dimensional contour integral, and the enumeration of poles can be simply phrased as counting bipartite trees. We solve this combinatorics problem, thereby obtaining exact formulas for the degeneracies of an infinite class of models. We also develop an algorithm to compute the angular momentum of the ground states, and present explicit expressions for the refined indices of theories where one rank is small.