Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Bulletin of the American Physical Society

Quantum search algorithm with many bosons in optical lattices

David L. Feder

Published Mar 8, 2007• 0 citations
OpenAlex

Related papers

Quantum Search With Interacting Bosons on a Lattice: Mean-Field Theory and Many-Body Simulations of Quantum Walk Algorithms

Benjamin Douglas Dalfavero

•Jan 1, 2023•0 citations

Quantum computing in optical lattices

Hans J. Briegel

WORLD SCIENTIFIC eBooks•Jan 1, 2001•0 citations

Realizable quantum adiabatic search

Itay Hen

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 speedup can already be gained in three dimensions. We argue that the suggested scheme is realizable with present-day experimental capabilities.

arXiv:1612.06012•Europhysics Letters (EPL)•May 1, 2017•9 citations

Interacting bosons in an optical lattice

C. Moseley, O. Fialko, K. Ziegler

Annalen der Physik•Jun 23, 2008•0 citations

A new approach to shortest paths on networks based on the quantum bosonic mechanism

Xin Jiang, Hailong Wang, Shaoting Tang +3 more

This paper presents quantum bosonic shortest path searching (QBSPS), a natural, practical and highly heuristic physical algorithm for reasoning about the recognition of network structure via quantum dynamics. QBSPS is based on an Anderson-like itinerant bosonic system in which a boson's Green function is used as a navigation pointer for one to accurately approach the terminals. QBSPS is demonstrated by rigorous mathematical and physical proofs and plenty of simulations, showing how it can be used as a greedy routing to seek the shortest path between different locations. In methodology, it is an interesting and new algorithm rooted in the quantum mechanism other than combinatorics. In practice, for the all-pairs shortest-path problem in a random scale-free network with N vertices, QBSPS runs in O (μ( N ) ln ln N ) time. In application, we suggest that the corresponding experimental realizations are feasible by considering path searching in quantum optical communication networks; in this situation, the method performs a pure local search on networks without requiring the global structure that is necessary for current graph algorithms.

New Journal of Physics•Jan 17, 2011•11 citations

Optical lattice clocks and frequency comparison

Hidetoshi Katori, T. Takano, Masao Takamoto

We consider designs of optical lattice clocks in view of the quantum statistics, relevant atomic spins, and atom-lattice interactions. The first two issues lead to two optimal constructions for the clock: a one-dimensional (1D) optical lattice loaded with spin-polarized fermions and a 3D optical lattice loaded with bosons. By taking atomic multipolar interactions with the lattice fields into account, an "atomic motion insensitive" wavelength is proposed to provide a precise definition of the "magic wavelength." We then present a frequency comparison of these two optical lattice clocks: spin-polarized fermionic 87 Sr and bosonic 88 Sr prepared in 1D and 3D optical lattices, respectively. Synchronous interrogations of these two optical lattice clocks by the same probe laser allowed canceling out its frequency noise as a common mode noise to achieve a relative stability of 3 × 10 −17 for an averaging time of τ = 350 s. The scheme, therefore, provides us with a powerful means to investigate intrinsic uncertainty of the clocks regardless of the probe laser stability. We discuss prospects of the synchronous operation of the clocks on the measurement of the geoid height difference and on the search of constancy of fundamental constants.

Journal of Physics Conference Series•Jan 10, 2011•2 citations
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 speedup can already be gained in three dimensions. We argue that the suggested scheme is realizable with present-day experimental capabilities.
This paper presents quantum bosonic shortest path searching (QBSPS), a natural, practical and highly heuristic physical algorithm for reasoning about the recognition of network structure via quantum dynamics. QBSPS is based on an Anderson-like itinerant bosonic system in which a boson's Green function is used as a navigation pointer for one to accurately approach the terminals. QBSPS is demonstrated by rigorous mathematical and physical proofs and plenty of simulations, showing how it can be used as a greedy routing to seek the shortest path between different locations. In methodology, it is an interesting and new algorithm rooted in the quantum mechanism other than combinatorics. In practice, for the all-pairs shortest-path problem in a random scale-free network with N vertices, QBSPS runs in O (μ( N ) ln ln N ) time. In application, we suggest that the corresponding experimental realizations are feasible by considering path searching in quantum optical communication networks; in this situation, the method performs a pure local search on networks without requiring the global structure that is necessary for current graph algorithms.
We consider designs of optical lattice clocks in view of the quantum statistics, relevant atomic spins, and atom-lattice interactions. The first two issues lead to two optimal constructions for the clock: a one-dimensional (1D) optical lattice loaded with spin-polarized fermions and a 3D optical lattice loaded with bosons. By taking atomic multipolar interactions with the lattice fields into account, an "atomic motion insensitive" wavelength is proposed to provide a precise definition of the "magic wavelength." We then present a frequency comparison of these two optical lattice clocks: spin-polarized fermionic 87 Sr and bosonic 88 Sr prepared in 1D and 3D optical lattices, respectively. Synchronous interrogations of these two optical lattice clocks by the same probe laser allowed canceling out its frequency noise as a common mode noise to achieve a relative stability of 3 × 10 −17 for an averaging time of τ = 350 s. The scheme, therefore, provides us with a powerful means to investigate intrinsic uncertainty of the clocks regardless of the probe laser stability. We discuss prospects of the synchronous operation of the clocks on the measurement of the geoid height difference and on the search of constancy of fundamental constants.