# NP Problem that cannot be solved by a quantum computer in polynomial time

1. Is there any NP-Problem that can't be (maybe even proven) solved by quantum computers. I'm not talking about quantum NP-Problems (if that's even a thing), but about normal NP.
2. If that NP Problem exists could you also use it for cryptography, since I don't want to buy a quantum computer just to be secure.

EDIT: I'm not talking about NP-complete, because that would have no use (I think) in cryptography and also not about symmetric key encryption.

• Closely related question; you have wrong ideas what NP-hardness means. – Raphael Jan 31 '17 at 18:11
• Yea I did, but now I think I understood it after some more research. – Zonko Jan 31 '17 at 18:18
• What is NP problem? If it NP-complete then there is no such problem known because relation between BQP and NP is currently unknown. If it is NP-hard, then recall BQP is in PSPACE so just take any problem outside of it. If it is a problem in NP and not necessary complete, then this is even stronger then unsolvability of NP-complete problem. If I remember correctly, even $BQP \in NP$ is unknown. – Eugene Jan 31 '17 at 19:50