If quantum mistake correction is used to scale quantum computer systems to functional programs, its overhead may undermine speedup made available from quite a few quantum algorithms.[96] For instance, integer factorization and also the discrete logarithm difficulty are acknowledged to get in BQP and so are suspected being beyond P. https://quantum-computing89122.azzablog.com/28294787/the-best-side-of-quantum-computing