CoChat

Hamiltonian oracles

Open access
Mochon, Carlos · 2007 · Physical Review A
Cited by 50

The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.

Abstract

Hamiltonian oracles are the continuum limit of the standard unitary quantum oracles. In this limit, the problem of finding the optimal query algorithm can be mapped into the problem of finding shortest paths on a manifold. The study of these shortest paths leads to lower bounds of the original unitary oracle problem. A number of example Hamiltonian oracles are studied in this paper, including oracle interrogation and the problem of computing the XOR of the hidden bits. Both of these problems are related to the study of geodesics on spheres with nonround metrics. For the case of two hidden bits a complete description of the geodesics is given. For $n$ hidden bits a simple lower bound is proven that shows the problems require a query time proportional to $n$, even in the continuum limit. Finally, the problem of continuous Grover search is reexamined leading to a modest improvement to the protocol of Farhi and Gutmann.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1103/physreva.75.042313

Cites

4 of 4 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

  • Quantum computation and decision trees

    Farhi, E., & Gutmann, S. (1998) · Physical Review A · doi:10.1103/physreva.58.915 · Cited by 1,215 · cited 1×

    “The algorithms for these problems employ the continuous quantum walk [13].”
  • Spatial search by quantum walk

    Childs, A. M., & Goldstone, J. (2004) · Physical Review A · doi:10.1103/physreva.70.022314 · Cited by 725 · cited 1×

    “Most of the subsequent work involving Hamiltonian oracles studied the problem of spatial search [11, 12], which is a variant of Grover search where the database has some spatial arrangement and only local moves are permitted.”
    Background
  • Quantum Computation as Geometry

    Nielsen, M. A., Dowling, M. R., Gu, M., & Doherty, A. C. (2006) · Science · doi:10.1126/science.1121541 · Cited by 539 · cited 1×

    “This question is in the spirit of recent work by Nielsen et al. [2, 3] which proposes a similar approach to the study of quantum circuit lower bounds.”
    Result
  • Spatial search and the Dirac equation

    Childs, A. M., & Goldstone, J. (2004) · Physical Review A · doi:10.1103/physreva.70.042312 · Cited by 146 · cited 1×

    “Most of the subsequent work involving Hamiltonian oracles studied the problem of spatial search [11, 12], which is a variant of Grover search where the database has some spatial arrangement and only local moves are permitted.”
    Background

Show all 4 references

Cited by

See all 50

Metadata

Authors
Mochon, C.
Venue
Physical Review A
Published
2007-04-13
Volume
75
Issue
4
ISSN
  • 0556-2791 (ISSN-L)
  • 1050-2947
  • 1094-1622
OpenAlex
W3038086750
Cited by
50
References
4
FWCI
3.55
Type
journal article
Language
en
Open access
green

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Hamiltonian oracles. https://app.cochat.ai/papers/10.1103/physreva.75.042313
The paper
Mochon, C. (2007). Hamiltonian oracles. Physical Review A. https://doi.org/10.1103/physreva.75.042313

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.