pith. sign in

b.BPP ⊆BPPq.Now, let L = (Lyes,L no) be a promise problem inBPP

Again, since the quantum computation can be simulated classically by replacing the quantum randomness with classical randomness, the classical probabilistic circuit will also have

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
browse 1 citing papers

fields

quant-ph 1

years

2025 1

verdicts

UNVERDICTED 1

representative citing papers

The Guided Local Hamiltonian Problem for Stoquastic Hamiltonians

quant-ph · 2025-09-30 · unverdicted · novelty 8.0

The Guided Local Hamiltonian problem for stoquastic Hamiltonians is promise BPP-hard (even 2-local on lattices), BQP-hard under fixed local constraints, and admits a deterministic classical approximation algorithm when promise gap, overlap, and spectral gap are constant with constant-depth local-pre

citing papers explorer

Showing 1 of 1 citing paper.

  • The Guided Local Hamiltonian Problem for Stoquastic Hamiltonians quant-ph · 2025-09-30 · unverdicted · none · ref 41

    The Guided Local Hamiltonian problem for stoquastic Hamiltonians is promise BPP-hard (even 2-local on lattices), BQP-hard under fixed local constraints, and admits a deterministic classical approximation algorithm when promise gap, overlap, and spectral gap are constant with constant-depth local-pre