3
votes
Do there exist problems known to be computationally intractable for quantum computer, but tractable for classical computer?
Other great answers address the question in the body of the posting, specifically about the relationship between BPP and BQP.
However the question in the title can be construed a bit more broadly. ...
Only top scored, non community-wiki answers of a minimum length are eligible
Related Tags
bqp × 20complexity-theory × 18
algorithm × 8
quantum-advantage × 2
deutsch-jozsa-algorithm × 2
forrelation × 2
quantum-gate × 1
circuit-construction × 1
nielsen-and-chuang × 1
simulation × 1
hamiltonian-simulation × 1
shors-algorithm × 1
hhl-algorithm × 1
speedup × 1
clifford-group × 1
terminology × 1
google-sycamore × 1
boson-sampling × 1
fourier-sampling × 1
postselection × 1
gottesman-knill × 1