Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity · HackerPapers discussions

Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity — mentioned by Strilanc

Sun, 19 Dec 2021 16:18:50 GMT

I kinda of worry that if this site succeeded, it would slowly do to papers what news aggregators and the internet already did to news. Grind and incentivize them down into clickbait with no meat, with as few things as possible that people won't immediately understand. For example, looking over my own papers for examples, a one page note [1] got more scites than a paper I contributed to that introduced several techniques cumulatively dropping the projected cost of simulating a chemistry thing by more than a factor of a million [2]. That's a cherry picked example, the pattern isn't that…

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

Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity — mentioned by Strilanc

Fri, 29 Jun 2018 17:29:59 GMT

Even if the number of qubits doubled every year from here on out, it would be 15+ years until we had enough working space to run Shor's algorithm on modern cryptographic key sizes. Back of the envelope: - It takes 9n error-corrected qubits to break an n-bit ECDH key [1] - Each error-corrected qubit requires ~2500 physical qubits [2][3] - Typical ECDH key size is 256 bits [4] - This year would be the year of ~64 physical qubit machines. [5][6][7] - log_2(256 * 9 * 2500 / 64) ~= 16.4 years Note that every one of the quantities in the estimate is subject to future research. E.g. the error…

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