No, that's not really correct. The theoretical capability of a quantum computer to "collapse" to optimal routes to solutions during computation does not imply t

No, that's not really correct. The theoretical capability of a quantum computer to "collapse" to optimal routes to solutions during computation does not imply the existence of cryptographic trapdoor functions which are likewise intractable. More concisely: the existence of a quantum computer does not imply the existence of problems it cannot solve. They're orthogonal things. That being said, Mahadev's recent research constructing a quantum verification protocol using the LWE is exciting along similar lines to what you're thinking. It allows us to say with authority that one of the following must be true: 1. LWE protocols are not post-quantum resistant, or 2. Quantum verification is possible via LWE-based cryptography.