Quantum Lower Bounds for Approximate Counting via Laurent Polynomials
- Award ID(s):
- 1845125
- NSF-PAR ID:
- 10230488
- Date Published:
- Journal Name:
- Leibniz international proceedings in informatics
- ISSN:
- 1868-8969
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
No document suggestions found
- Free Publicly Accessible Full Text
-
Accepted Manuscript1.0
- Conference Paper:
- https://doi.org/10.4230/LIPIcs.CCC.2020.7
