default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDWilliam Kretschmer
Person information
- affiliation: University of Texas at Austin, TX, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c11]Scott Aaronson, Harry Buhrman, William Kretschmer:
A Qubit, a Coin, and an Advice String Walk into a Relational Problem. ITCS 2024: 1:1-1:24- [c10]Sabee Grewal
, Vishnu Iyer, William Kretschmer, Daniel Liang:
Improved Stabilizer Estimation via Bell Difference Sampling. STOC 2024: 1352-1363 - [i21]Sabee Grewal, Vishnu Iyer, William Kretschmer, Daniel Liang:
Pseudoentanglement Ain't Cheap. CoRR abs/2404.00126 (2024) - [i20]Sabee Grewal, Vishnu Iyer, William Kretschmer, Daniel Liang:
Agnostic Tomography of Stabilizer Product States. CoRR abs/2404.03813 (2024) - 2023
- [c9]Sabee Grewal, Vishnu Iyer, William Kretschmer, Daniel Liang:
Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom. ITCS 2023: 64:1-64:20 - [c8]William Kretschmer, Luowen Qian, Makrand Sinha, Avishay Tal:
Quantum Cryptography in Algorithmica. STOC 2023: 1589-1602 - [c7]William Kretschmer:
Quantum Mass Production Theorems. TQC 2023: 10:1-10:11 - [i19]Scott Aaronson, Harry Buhrman, William Kretschmer:
A Qubit, a Coin, and an Advice String Walk Into a Relational Problem. CoRR abs/2302.10332 (2023) - [i18]Robert A. Hearn, William Kretschmer, Tomas Rokicki, Benjamin Streeter, Eric Vergo:
Two-Disk Compound Symmetry Groups. CoRR abs/2302.12950 (2023) - [i17]Sabee Grewal, Vishnu Iyer, William Kretschmer, Daniel Liang:
Improved Stabilizer Estimation via Bell Difference Sampling. CoRR abs/2304.13915 (2023) - [i16]Sabee Grewal, Vishnu Iyer, William Kretschmer, Daniel Liang:
Efficient Learning of Quantum States Prepared With Few Non-Clifford Gates. CoRR abs/2305.13409 (2023) - [i15]Scott Aaronson, Harry Buhrman, William Kretschmer:
A Qubit, a Coin, and an Advice String Walk Into a Relational Problem. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [c6]Scott Aaronson, DeVon Ingram, William Kretschmer:
The Acrobatics of BQP. CCC 2022: 20:1-20:17 - [i14]Sabee Grewal, Vishnu Iyer, William Kretschmer, Daniel Liang:
Low-Stabilizer-Complexity Quantum States Are Not Pseudorandom. CoRR abs/2209.14530 (2022) - [i13]William Kretschmer, Luowen Qian, Makrand Sinha, Avishay Tal:
Quantum Cryptography in Algorithmica. CoRR abs/2212.00879 (2022) - [i12]William Kretschmer:
Quantum Mass Production Theorems. CoRR abs/2212.14399 (2022) - 2021
- [j2]William Kretschmer:
The Quantum Supremacy Tsirelson Inequality. Quantum 5: 560 (2021) - [j1]William Kretschmer:
Lower Bounding the AND-OR Tree via Symmetrization. ACM Trans. Comput. Theory 13(1): 3:1-3:11 (2021) - [c5]William Kretschmer:
The Quantum Supremacy Tsirelson Inequality. ITCS 2021: 13:1-13:13 - [c4]William Kretschmer:
Quantum Pseudorandomness and Classical Complexity. TQC 2021: 2:1-2:20 - [i11]William Kretschmer:
Quantum Pseudorandomness and Classical Complexity. CoRR abs/2103.09320 (2021) - [i10]Scott Aaronson, DeVon Ingram, William Kretschmer:
The Acrobatics of BQP. CoRR abs/2111.10409 (2021) - [i9]Scott Aaronson, DeVon Ingram, William Kretschmer:
The Acrobatics of BQP. Electron. Colloquium Comput. Complex. TR21 (2021) - 2020
- [c3]Scott Aaronson, Robin Kothari, William Kretschmer, Justin Thaler:
Quantum Lower Bounds for Approximate Counting via Laurent Polynomials. CCC 2020: 7:1-7:47 - [c2]Shalev Ben-David, Andrew M. Childs, András Gilyén, William Kretschmer, Supartha Podder, Daochen Wang:
Symmetries, Graph Properties, and Quantum Speedups. FOCS 2020: 649-660 - [i8]Shalev Ben-David, Andrew M. Childs, András Gilyén, William Kretschmer, Supartha Podder, Daochen Wang:
Symmetries, graph properties, and quantum speedups. CoRR abs/2006.12760 (2020) - [i7]William Kretschmer:
The Quantum Supremacy Tsirelson Inequality. CoRR abs/2008.08721 (2020)
2010 – 2019
- 2019
- [i6]William Kretschmer:
$\mathsf{QMA}$ Lower Bounds for Approximate Counting. CoRR abs/1902.02398 (2019) - [i5]Scott Aaronson, Robin Kothari, William Kretschmer, Justin Thaler:
Quantum Lower Bounds for Approximate Counting via Laurent Polynomials. CoRR abs/1904.08914 (2019) - [i4]William Kretschmer:
Lower Bounding the AND-OR Tree via Symmetrization. CoRR abs/1907.06731 (2019) - [i3]Scott Aaronson, Robin Kothari, William Kretschmer, Justin Thaler:
Quantum Lower Bounds for Approximate Counting via Laurent Polynomials. Electron. Colloquium Comput. Complex. TR19 (2019) - [i2]William Kretschmer:
QMA Lower Bounds for Approximate Counting. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c1]Avi Pfeffer, Brian E. Ruttenberg, William Kretschmer, Alison O'Connor:
Structured Factored Inference for Probabilistic Programming. AISTATS 2018: 1224-1232 - 2016
- [i1]Avi Pfeffer, Brian E. Ruttenberg, William Kretschmer:
Structured Factored Inference: A Framework for Automated Reasoning in Probabilistic Programming Languages. CoRR abs/1606.03298 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
