Quantum computing with superconducting qubits
Read more

How to compute a 256-bit elliptic curve private key with only 50 million Toffoli gates
Read more

Quantum Security Analysis of AES

While AES was regarded as quantum safe, this paper and the references it makes to other papers clearly highlight that is not the case.
Today’s security estimates of how hard a problem is are one algorithm away from being very wrong.
Read more

How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits

Algorithms improve dramatically over time, and can optimize for error correction in the algorithm if it isn’t present in the hardware.
Read more

A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery

Litinski shows an algorithmic trade off between qubits used and total computation time in a clear example.
Read more

Daniel Litinski lecture on breaking eliptic curve keys on a Quantum computer

The active volume architecture and elliptic curve cryptography
Read more

A manufacturable platform for photonic quantum computing

Whilst holding great promise for low noise, ease of operation and networking, useful photonic quantum computing has been precluded by the need for beyond-state-of-the-art components, manufactured by the millions.
Read more

Active volume: An architecture for efficient fault-tolerant quantum computers with limited non-local connections

In existing general-purpose architectures for surface-code-based fault-tolerant quantum computers, the cost of a quantum computation is determined by the circuit volume, i.e., the number of qubits multiplied by the number of non-Clifford gates. We introduce an architecture using non-2D-local connections in which the cost does not scale with the number of qubits, and instead only with the number of logical operations.
Read more