Quantum Metropolis Algorithms

Quant grinding Metropolis Algorithms is a quantum algorithmic framework that extends classical Markov chain Monte Carlo methods by enabling coherent state transitions and acceptance criteria through quantum superposition and interference to sample from the stationary distribution of a target Hamiltonian.

26

Publications

1.1K

Citations

46

Authors

34

Institutions

Publications per year

2017–2026

8

Authors

46

  1. MA
    M. A. Martín-Delgado

    Universidad Complutense de Madrid, Spain

    3 publications · 89 citations

    3

    h-index

  2. RC
    Roberto Campos

    Universidad Complutense de Madrid, Spain

    3 publications · 89 citations

    3

    h-index

  3. PA
    Pablo A. M. Casares

    Universidad Complutense de Madrid, Spain

    3 publications · 89 citations

    3

    h-index

  4. DM
    David M. Ceperley

    University of Illinois Urbana-Champaign, United States

    2 publications · 67 citations

    2

    h-index

  5. AA
    Alán Aspuru‐Guzik

    Harvard University, United States

    2 publications · 192 citations

    2

    h-index

1–5 of 46

Venues

  1. Physical Review Letters

    PRL · 3 publications · 267 citations

    3

    h-index

  2. The Journal of Chemical Physics

    3 publications · 72 citations

    3

    h-index

  3. Physical review. A/Physical review, A

    PRA · 2 publications · 56 citations

    2

    h-index

  4. arXiv (Cornell University)

    Repository · 2 publications · 51 citations

    2

    h-index

  5. AIP conference proceedings

    2 publications · 48 citations

    2

    h-index

1–5