Published equation contexts

$500 n^{2} + n^{2} \lg n$

Why this formula appears here

The consequence for resource accounting is decisive. In published estimates for cryptographically relevant algorithms, the magic state factory dominates both the spatial footprint and the runtime. Gidney and Ekerå’s abstract circuit model — which, as they state, ignores overheads from distillation, routing and error correction — uses 3n + 0.002\, n $\lg$ n logical qubits, 0.3 $n^{3}$ + 0.0005\, $n^{3}$ $\lg$ n Toffoli gates and 500 $n^{2}$ + $n^{2}$ $\lg$ n measurement depth to factor n -bit RSA integers [ 14 ] . It is the Toffoli count that sets the demand for distilled states, and it is the distillation of those states that turns a modest logical qubit count into the twenty million noisy physical qubits…

Read the full article-specific guide →

Read the representative guide

n^{2}

Symbol n^2

The square of n: multiply n by itself.

Read this term in its guide →

n

Symbol n

n is a part of this expression. Its role is fixed by the surrounding article and by the operations shown in the formula.

Read this term in its guide →

How to interpret it

Read this expression with the definitions, units, and assumptions supplied by the article.

Research cited beside this formula

[14] How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits ↗

Published contexts (1)

A symbol can carry a different meaning in another article. Each occurrence keeps its own guide and term definitions.

500 n^{2} + n^{2} \lg n

Equation 40 · Quantum Information

Error Correction Is the Whole Problem in Quantum Computing

This mathematical expression combines the displayed quantities; its precise role follows from the surrounding article text.

The consequence for resource accounting is decisive. In published estimates for cryptographically relevant algorithms, the magic state factory dominates both the spatial footprint and the runtime. Gidney and Ekerå’s abstract circuit model — which, as they state, ignores overheads from distillation, routing and error correction — uses 3n + 0.002\, n $\lg$ n logical qubits, 0.3 $n^{3}$ + 0.0005\, $n^{3}$ $\lg$ n Toffoli gates and 500 $n^{2}$ + $n^{2}$ $\lg$ n measurement depth to factor n -bit RSA integers [ 14 ] . It is the Toffoli count that sets the demand for distilled states, and it is the distillation of those states that turns a modest logical qubit count into the twenty million noisy physical qubits…

Equation guide → · Article →

500n2+n2lg⁡n500 n^{2} + n^{2} \lg n500n2+n2lgn