Realizable quantum adiabatic search

  title={Realizable quantum adiabatic search},
  author={Itay Hen},
  journal={Europhysics Letters},
  • I. Hen
  • Published 19 December 2016
  • Physics
  • Europhysics Letters
Grover's unstructured search algorithm is one of the best examples to date for the superiority of quantum algorithms over classical ones. Its applicability, however, has been questioned by many due to its oracular nature. We propose a mechanism to carry out a quantum adiabatic variant of Grover's search algorithm using a single bosonic particle placed in an optical lattice. By studying the scaling of the gap and relevant matrix element in various spatial dimensions, we show that a quantum… 

Analog nature of quantum adiabatic unstructured search

It is found that the unstructured search algorithm’s quadratic speedup is generally not robust to the presence of any one of the above non-idealities, and in some cases it imposes unrealistic conditions on how the strength of these noise sources must scale to maintain the quadratics speedup.

Trotterized adiabatic quantum simulation and its application to a simple all-optical system

As first proposed for the adiabatic quantum information processing by Wu et al (2002 Phys. Rev. Lett. 89 057904), the Trotterization technique is a very useful tool for universal quantum computing,

How quantum is the speedup in adiabatic unstructured search?

  • I. Hen
  • Physics, Computer Science
    Quantum Inf. Process.
  • 2019
It is shown that similarly to its quantum counterpart, the classical construction may also provide a quadratic speedup over standard digital unstructured search and the meaning and the possible implications are discussed in the context of adiabatic quantum computing.

Superposition of Macroscopically Distinct States in Adiabatic Quantum Computation

  • T. Yuge
  • Physics
    Journal of the Physical Society of Japan
  • 2018
What are the conditions for adiabatic quantum computation (AQC) to outperform classical computation? Although there exist several quantum adiabatic algorithms achieving the strong quantum speedup,

Adiabatic dynamics and shortcuts to adiabaticity in many-body systems

In this thesis we study properties of the adiabatic and diabatic dynamics of many body quantum systems. As a test bed, we investigate Hamiltonian formulations for the quantum search algorithm and the

A Quantum N-Queens Solver

This work proposes a special purpose quantum simulator with the aim to solve the excluded diagonals N-queens completion problem using atoms and cavity mediated long range interactions and has no overhead from the embedding allowing to directly probe for a possible quantum advantage in near term devices for optimization problems.

Quantum algorithms for typical hard problems: a perspective of cryptanalysis

This paper discussed the designing methodology, algorithm framework and latest progress of the mathematic hard problems on which the typical cryptosystems depend, including integer factorization problem, discrete logarithmic problem and its variants, lattice problem, dihedral hidden subgroup problems and extrapolated dihedral coset problem.

Instruction Set Architectures for Quantum Processing Units

Emphasizing the interface to the QPU, instruction set architectures based on reduced and complex instruction sets, i.e., RISC and CISC architectures are analyzed, to clarify the role of conventional constraints on memory addressing and instruction widths within the quantum computing context.

Adiabatic quantum computation

Adiabatic quantum computing (AQC) started as an approach to solving optimization problems, and has evolved into an important universal alternative to the standard circuit model of quantum computing,



Space Searches with a Quantum Robot

A task example is considered in which a quantum robot searches a space region to find the location of a system, and quantum searches of higher dimensional space regions are more efficient than classical searches.

Quantum search of spatial regions

  • S. AaronsonA. Ambainis
  • Computer Science
    44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.
  • 2003
An 0(/spl radic/n)-qubit communication protocol for the disjointness problem is given, which improves an upper bound of Hoyer and de Wolf and matches a lower bound of Razborov.

Quantum Computation and Information

The problem of minimizing the number of qubits in quantum automata is presented in detail at a level appropriate for non-specialists in order to illustrate some key issues in quantum computation.

Algorithms for quantum computation: discrete logarithms and factoring

  • P. Shor
  • Computer Science
    Proceedings 35th Annual Symposium on Foundations of Computer Science
  • 1994
Las Vegas algorithms for finding discrete logarithms and factoring integers on a quantum computer that take a number of steps which is polynomial in the input size, e.g., the number of digits of the integer to be factored are given.

Quantum phase transitions

Abstract We give a general introduction to quantum phase transitions in strongly correlated electron systems. These transitions, which occur at zero temperature when a non-thermal parameter g such as

Physics I.1

Physics 1 Mr. Bigler Conservation of Momentum Unit: Momentum MA Curriculum Frameworks (2016): HS-PS2-2 MA Curriculum Frameworks (2006): 2.5 Mastery Objective(s): (Students will be able to...)  Solve

and s

+ i σ z i with a similar decomposition for other one-dimensional projections

    The above bound can actually be made tighter but will suffice for the current purposes

      in Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science

      • FOCS ’03
      • 2003