Content deleted Content added
Citation bot (talk | contribs) |
Bibcode Bot (talk | contribs) m Adding 0 arxiv eprint(s), 3 bibcode(s) and 0 doi(s). Did it miss something? Report bugs, errors, and suggestions at User talk:Bibcode Bot |
||
Line 42:
| volume = 82 |issue= | pages = 1–52
| arxiv = 0812.0380
| bibcode = 2010RvMP...82....1C
| doi = 10.1103/RevModPhys.82.1
}}</ref>
Line 72:
| volume = 26 | page = 1484
| arxiv = quant-ph/9508027
| bibcode= 1995quant.ph..8027S
| doi=
}}</ref> whereas the best known classical algorithms take super-polynomial time. These problems are not known to be in [[P (complexity)|P]] or [[NP-complete]]. It is also one of the few quantum algorithms that solves a non–black-box problem in polynomial time where the best-known classical algorithms run in super-polynomial time.
Line 441:
| volume=8 | issue=1 | pages=147–180
| arxiv=quant-ph/0603069
| bibcode= 2006quant.ph..3069W
| doi=
}}</ref> polynomials, and the Turaev-Viro invariant of three-dimensional manifolds.<ref>
| |||