Equation 14 · From Origins to Frontier: A History of Post-CMOS, Neuromorphic, Photonic, and Quantum AI Compute
What does this equation mean?
Read the formula alongside the article passage below. Each part has a deeper page with its role in the equation, the supporting passage and nearby citations.
This equation gives an approximation: it relates the quantities while allowing an approximation. Read the equation part by part below; each part has a contextual explanation and a link to its mathematical background.
Read it piece by piece
Symbol F_circuit
ircuit is a part of this expression. Its role is fixed by the surrounding article and by the operations shown in the formula.
Symbol varepsilon
varepsilon is a part of this expression. Its role is fixed by the surrounding article and by the operations shown in the formula.
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.
subscript
The lower label selects a particular version, component, or indexed member of the quantity. For example, x₀ and xₜ can be values at different positions.
superscript
A raised number can be a power. When it is a label or bound, it selects a case or the upper limit of a sum; the formula’s structure distinguishes these uses.
See an illustrated explanation →How to interpret it
Its accuracy depends on the assumptions and range of use described in the article.
What the article says around this equation
The reason NISQ-era hardware imposes such a hard ceiling on quantum machine learning specifically is a simple compounding effect. If a device executes a circuit of N sequential gates, each with per-gate fidelity 1- , and errors accumulate independently, the probability the whole circuit runs without error falls off as . which decays exponentially in circuit depth for any fixed error rate > 0 . This is precisely the noise floor Preskill’s paper is about, and it is why serious NISQ-era quantum machine learning proposals are built around short, shallow circuits matched to a specific problem rather than long, general-purpose programs — the strategy…
Read the full surrounding passage
The reason NISQ-era hardware imposes such a hard ceiling on quantum machine learning specifically is a simple compounding effect. If a device executes a circuit of N sequential gates, each with per-gate fidelity 1- , and errors accumulate independently, the probability the whole circuit runs without error falls off as . which decays exponentially in circuit depth for any fixed error rate > 0 . This is precisely the noise floor Preskill’s paper is about, and it is why serious NISQ-era quantum machine learning proposals are built around short, shallow circuits matched to a specific problem rather than long, general-purpose programs — the strategy quantum computing borrowed, whether its practitioners framed it this way or not, from the same lesson optical computing learned two decades earlier: work within what the noisy substrate actually does well, rather than against it.
Sources cited in the article section
- [6] Quantum Algorithm for Linear Systems of Equations ↗
- [8] Quantum Machine Learning ↗
- [7] Quantum Computing in the NISQ Era and Beyond ↗
These citations give research context. Read each source to check which claims it supports.