Libros importados con hasta 50% OFF + Envío Gratis a todo USA  Ver más

menu

0
  • argentina
  • chile
  • colombia
  • españa
  • méxico
  • perú
  • estados unidos
  • internacional
portada Approximate Degree in Classical and Quantum Computing (in English)
Type
Physical Book
Publisher
Language
Inglés
Pages
212
Format
Paperback
Dimensions
23.4 x 15.6 x 1.1 cm
Weight
0.30 kg.
ISBN13
9781638281405

Approximate Degree in Classical and Quantum Computing (in English)

Justin Thaler (Author) · Mark Bun (Author) · Now Publishers · Paperback

Approximate Degree in Classical and Quantum Computing (in English) - Bun, Mark ; Thaler, Justin

Physical Book

$ 83.37

$ 99.00

You save: $ 15.63

16% discount
  • Condition: New
It will be shipped from our warehouse between Monday, July 01 and Tuesday, July 02.
You will receive it anywhere in United States between 1 and 3 business days after shipment.

Synopsis "Approximate Degree in Classical and Quantum Computing (in English)"

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. In this book, the authors survey what is known about a particularly natural notion of approximation by polynomials, capturing pointwise approximation over the real numbers. This book covers recent progress on proving approximate degree lower and upper bounds and describes some applications of the new bounds to oracle separations, quantum query and communication complexity, and circuit complexity. The authors explain how several of these advances have been unlocked by a particularly simple and elegant technique, called dual block composition, for constructing solutions to this dual linear program. They also provide concise coverage of even more recent lower bound techniques based on a new complexity measure called spectral sensitivity. Finally, they show how explicit constructions of approximating polynomials have been inspired by quantum query algorithms. This book provides a comprehensive review of the foundational and recent developments of an important topic in both classical and quantum computing. The reader has a considerable body of knowledge condensed in an accessible form to quickly understand the principles and further their own research.

Customers reviews

More customer reviews
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)
  • 0% (0)

Frequently Asked Questions about the Book

All books in our catalog are Original.
The book is written in English.
The binding of this edition is Paperback.

Questions and Answers about the Book

Do you have a question about the book? Login to be able to add your own question.

Opinions about Bookdelivery

More customer reviews