Quantum algorithm: Difference between revisions

Content deleted Content added
External links: added surveys
Citation bot (talk | contribs)
m [442]Add: author2, author3, author4, last. Tweak: last3, last2, last4, last5, last. User-activated.
Line 99:
|class=quant-ph
|eprint=quant-ph/0501056
|author2=Alexander Russell
}}</ref> and the [[dihedral group]], which would solve certain lattice problems.<ref>
{{cite arxiv
Line 118 ⟶ 119:
| class = quant-ph
| eprint = quant-ph/0207131
| author2=Gadiel Seroussi
}}</ref>
 
Line 173 ⟶ 175:
|class=quant-ph
|eprint=quant-ph/0005055
|author2=Peter Hoyer
|author3=Michele Mosca
|author4=Alain Tapp
}}</ref> More precisely, the algorithm outputs an estimate <math>k'</math> for <math>k</math>, the number of marked entries, with the following accuracy: <math>|k-k'| \leq \epsilon k</math>.
 
Line 443 ⟶ 448:
| bibcode= 2006quant.ph..3069W
| doi=
| last=Yard
}}</ref> polynomials, and the [[Turaev-Viro invariant]] of three-dimensional manifolds.<ref>
{{Cite journal
|last1=Alagic | first1=G.
|last2=Jordan | first2=S.P.
|last3=KoenigKönig | first3=R.
|last4=Reichardt | first4=B. W.
|year=2010