Ungefährer Abschluss in Klassischem und Quantencomputing (Foundations and Trends®
100,31 €
Finally, they show how explicit constructions of approximating polynomials have been inspired by quantum query algorithms. The ability (or inability) to represent or approximate Boolean functions by polynomials is a central concept in complexity theory, underlying interactive and probabilistically checkable proof systems, circuit lower bounds, quantum complexity theory, and more.
Jetzt bei Ebay:
![Produktbild - Fundamentals of Quantum Computing: Theory and Practice [Paperback]](https://i.ebayimg.com/thumbs/images/g/xeoAAeSwEFRoN5rr/s-l140.jpg)