更改

[[Quantum counting]] solves a generalization of the search problem. It solves the problem of counting the number of marked entries in an unordered list, instead of just detecting if one exists. Specifically, it counts the number of marked entries in an <math>N</math>-element list, with error <math>\varepsilon</math> making only <math>\Theta\left(\frac{1}{\varepsilon} \sqrt{\frac{N}{k}}\right)</math> queries, where <math>k</math> is the number of marked elements in the list.<ref>

[[Quantum counting]] solves a generalization of the search problem. It solves the problem of counting the number of marked entries in an unordered list, instead of just detecting if one exists. Specifically, it counts the number of marked entries in an <math>N</math>-element list, with error <math>\varepsilon</math> making only <math>\Theta\left(\frac{1}{\varepsilon} \sqrt{\frac{N}{k}}\right)</math> queries, where <math>k</math> is the number of marked elements in the list.<ref>

[[量子计数]]解决了搜索问题的一般化。它解决了计算无序列表中标记条目数的问题，而不是仅仅检测是否存在。具体地说，它统计<math>N</math>-元素列表中标记的条目数，错误<math>\varepsilon</math>只生成<math>\Theta\left（\frac{1}{\varepsilon}\sqrt{\frac{N}{k}}\right）</math>查询，其中<math>k</math>是列表中标记的元素数。<ref>

[[量子计数]]解决了搜索问题的一般化。它解决了计算无序列表中标记条目数的问题，而不是仅仅检测是否存在。具体地说，它统计<math>N</math>-元素列表中标记的条目数，错误<math>\varepsilon</math>只生成<math>\Theta\left(\frac{1}{\varepsilon} \sqrt{\frac{N}{k}}\right)</math>查询，其中<math>k</math>是列表中标记的元素数。

{{Cite book

{{Cite book

<small>This page was moved from [[wikipedia:en:Quantum algorithm]]. Its edit history can be viewed at [[量子算法/edithistory]]</small></noinclude>

<small>This page was moved from [[wikipedia:en:Quantum algorithm]]. Its edit history can be viewed at [[量子算法/edithistory]]</small></noinclude>

[[Category:待整理页面]]

[[Category:待整理页面]]