Is there any formal proof of this computational complexity ladder you mention? Saying quantum is more complex than classical seems to imply P != NP. I don’t kno

Is there any formal proof of this computational complexity ladder you mention? Saying quantum is more complex than classical seems to imply P != NP. I don’t know nearly enough about general relativity to know how complex that is, though I’d have assumed it’d be less than quantum.