> where we've empirically found hard for classical computing but we maybe could solve with quantum Are we talking complexity classes here, or just "problems we

> where we've empirically found hard for classical computing but we maybe could solve with quantum Are we talking complexity classes here, or just "problems we've found hard in practice, but that which may in fact be in P even if P != NP"? Like I would've thought that solving BQP problems like integer factorization would be the criterion (since they're proven to be faster under QC assuming P != NP etc.). But that's evidently the researchers aren't holding themselves up to that standard, so what bar are they using exactly? Are they just going with some sort of "if it walks like a duck then it's a duck" criterion, or are they using problems that they can formally prove lack efficient classical solutions under a well-regarded hypothesis like P != NP?