Evidence
Every record below has been through review. Nothing on this page is an unreviewed claim: collected and under-review records are deliberately not listed. Every record traces back to a registered source.
4 records publicly listed.
-
Computing with many encoded logical qubits beyond break-even
ArXiv
-
Logical Computation Demonstrated with a Neutral Atom Quantum Processor
arXiv
-
Quantum error correction below the surface code threshold
Quantum error correction provides a path to reach practical quantum computing by combining multiple physical qubits into a logical qubit, where the logical error rate is suppressed exponentially as more qubits are added. However, this exponential suppression only occurs if …
-
How to compute a 256-bit elliptic curve private key with only 50 million Toffoli gates
We use Shor's algorithm for the computation of elliptic curve private keys as a case study for resource estimates in the silicon-photonics-inspired active-volume architecture. Here, a fault-tolerant surface-code quantum computer consists of modules with a logarithmic number of non-local inter-module …
This is a probabilistic model of CRQC capability based on public evidence. Its primary result is a forecast interval built from the percentiles the evidence can resolve. A percentile that does not cross within the model’s horizon is reported as undefined, never estimated, together with the share of scenarios that do not cross. The model is recalculated weekly and does not claim day-level or second-level certainty.