Upper Bounds on the Noise Threshold for Fault-tolerant Quantum Computing — mentioned by topynate

Thu, 02 Jan 2014 23:31:36 GMT

Both NSA and GCHQ have quite the history of co-opting smart mathematicians to create secret theoretical advances in cryptography and cryptanalysis, which could well be relevant given a quantum computer with the following three properties: * Fully general. By this I mean capable of solving BQP problems in polynomial time. This excludes D-Wave machines, for example. * Sufficiently large. 100 qubits would probably enable qualitative advances in cryptanalysis. * Low enough error rate. This is a slightly redundant requirement, as too high an error rate would provably prevent the computer from…

Paper and discussion history. A mention is not an endorsement.

Upper Bounds on the Noise Threshold for Fault-tolerant Quantum Computing · HackerPapers discussions

Upper Bounds on the Noise Threshold for Fault-tolerant Quantum Computing — mentioned by topynate