← All parts of this equation

Equation 1 · Part 2 · Comparing the Main Approaches to Post-CMOS, Neuromorphic, Photonic, and Quantum AI Compute

Symbol O

Tclassical=O ⁣(poly(k)log⁡(mn))≈Tquantum,T_{\text{classical}} = O\!\left(\mathrm{poly}(k)\log(mn)\right) \approx T_{\text{quantum}},
OO

What this part means

O is an input to the expression that computes the quantity on the left.

Its job in the formula

O is an input to the expression that computes the quantity on the left.

The passage around this formula

For quantum algorithms proposed to accelerate machine learning on ordinary classical data — the sense in which “quantum AI” is usually marketed — the evidence points the other way on two grounds. The first is trainability: McClean and colleagues showed in 2018 that for a wide class of the parameterized quantum circuits used in most proposed quantum machine learning models, the probability that a gradient in any direction is non-negligible shrinks exponentially with qubit count — a “barren plateau” that makes gradient-based training intractable at exactly the scale where an advantage would need to appear [ 12 ] . The second is the comparison baseline itself. In 2018, Ewin Tang showed that a…

Read this part in the article →

Learn the underlying idea

A variable is a named place for a value. Its letter is a local label: x can mean position in one formula and a data point in another.

Open the illustrated variables: a letter stands for a value guide →

See this notation across published equations →

Sources cited in the surrounding passage

These citations provide research context; check each source for the exact claim it supports.