• DocumentCode
    2703239
  • Title

    Mapping Binary Functions to a Practical Adiabatic Quantum Computer

  • Author

    Rosenbaum, David ; Perkowski, Marek

  • Author_Institution
    Dept. of Comput. Sci., Portland State Univ., Portland, OR, USA
  • fYear
    2010
  • fDate
    26-28 May 2010
  • Firstpage
    270
  • Lastpage
    275
  • Abstract
    Efficiently mapping binary functions to adiabatic quantum computers is an important problem because the resulting circuits can be used as oracles in Grover´s algorithm. This paper presents a method for mapping binary functions to a two-dimensional grid of qubits with nearest neighbor interactions which is used in a prototype from D-Wave Systems. This is done by writing the binary function in a special form. This allows the binary function to be implemented by converting each gate into a 3-local Hamiltonian. These 3-local Hamiltonians are then converted into two-local Hamiltonians which are mapped to the grid of qubits.
  • Keywords
    Boolean functions; Computational modeling; Computer science; Logic arrays; Logic circuits; Nearest neighbor searches; Polynomials; Prototypes; Quantum computing; Writing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Multiple-Valued Logic (ISMVL), 2010 40th IEEE International Symposium on
  • Conference_Location
    Barcelona, Spain
  • ISSN
    0195-623X
  • Print_ISBN
    978-1-4244-6752-5
  • Type

    conf

  • DOI
    10.1109/ISMVL.2010.57
  • Filename
    5489151