Under the hypothesis that P=NP, many cryptographic protocols are no longer secure (i.e. attacks are feasible).The BB84 algorithm is based on the idea that by observing a quantum state, one has to (in quantum theory) disturb that state. This makes them efficient against eavesdropping.Are quantum algorithms based on BB84 also subject to the hypothesis that P=NP? Or do they remain unaffected by the hypothesis?
What happens to quantum algorithms such as BB84 if P=NP
complexity theory;cryptography;quantum computing;p vs np