default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBill Fefferman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c16]Adam Bouland
, Bill Fefferman, Soumik Ghosh, Tony Metger, Umesh V. Vazirani, Chenyi Zhang, Zixin Zhou:
Public-Key Pseudoentanglement and the Hardness of Learning Ground State Entanglement Structure. CCC 2024: 21:1-21:23- [c15]Scott Aaronson, Adam Bouland, Bill Fefferman, Soumik Ghosh, Umesh V. Vazirani, Chenyi Zhang, Zixin Zhou:
Quantum Pseudoentanglement. ITCS 2024: 2:1-2:21 - [c14]Roozbeh Bassirian, Bill Fefferman, Kunal Marwaha:
Quantum Merlin-Arthur and Proofs Without Relative Phase. ITCS 2024: 9:1-9:19 - [i30]Bill Fefferman, Soumik Ghosh, Wei Zhan:
Anti-Concentration for the Unitary Haar Measure and Applications to Random Quantum Circuits. CoRR abs/2407.19561 (2024) - [i29]Bill Fefferman, Soumik Ghosh, Wei Zhan:
Anti-Concentration for the Unitary Haar Measure and Applications to Random Quantum Circuits. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c13]Roozbeh Bassirian, Bill Fefferman, Kunal Marwaha:
On the Power of Nonstandard Quantum Oracles. TQC 2023: 11:1-11:25 - [i28]Roozbeh Bassirian, Bill Fefferman, Kunal Marwaha:
Quantum Merlin-Arthur and proofs without relative phase. CoRR abs/2306.13247 (2023) - [i27]Bill Fefferman, Soumik Ghosh, Michael J. Gullans, Kohdai Kuroiwa, Kunal Sharma:
Effect of non-unital noise on random circuit sampling. CoRR abs/2306.16659 (2023) - [i26]Adam Bouland, Bill Fefferman, Soumik Ghosh, Tony Metger, Umesh V. Vazirani, Chenyi Zhang, Zixin Zhou:
Public-key pseudoentanglement and the hardness of learning ground state entanglement structure. CoRR abs/2311.12017 (2023) - [i25]Adam Bouland, Daniel Jost Brod, Ishaun Datta, Bill Fefferman, Daniel Grier, Felipe Hernandez, Michal Oszmaniec:
Complexity-theoretic foundations of BosonSampling with a linear number of modes. CoRR abs/2312.00286 (2023) - 2022
- [c12]Abhinav Deshpande, Alexey V. Gorshkov, Bill Fefferman:
The Importance of the Spectral Gap in Estimating Ground-State Energies. ITCS 2022: 54:1-54:6 - [i24]Adam Bouland, Bill Fefferman, Soumik Ghosh, Umesh V. Vazirani, Zixin Zhou:
Quantum Pseudoentanglement. CoRR abs/2211.00747 (2022) - [i23]Roozbeh Bassirian, Bill Fefferman, Kunal Marwaha:
On the power of nonstandard quantum oracles. CoRR abs/2212.00098 (2022) - [i22]Soumik Ghosh, Abhinav Deshpande, Dominik Hangleiter, Alexey V. Gorshkov, Bill Fefferman:
Sharp complexity phase transitions generated by entanglement. CoRR abs/2212.10582 (2022) - 2021
- [c11]Adam Bouland, Bill Fefferman, Zeph Landau, Yunchao Liu:
Noise and the Frontier of Quantum Supremacy. FOCS 2021: 1308-1317 - [c10]Bill Fefferman, Zachary Remscrim:
Eliminating intermediate measurements in space-bounded Quantum computation. STOC 2021: 1343-1356 - [i21]Adam Bouland, Bill Fefferman, Zeph Landau, Yunchao Liu:
Noise and the frontier of quantum supremacy. CoRR abs/2102.01738 (2021) - [i20]Bryan O'Gorman, Sandy Irani, James Whitfield, Bill Fefferman:
Electronic Structure in a Fixed Basis is QMA-complete. CoRR abs/2103.08215 (2021) - [i19]Bill Fefferman, Sevag Gharibian, Norbert Schuch, Barbara M. Terhal:
Quantum Complexity: Theory and Application (Dagstuhl Seminar 21261). Dagstuhl Reports 11(5): 76-88 (2021) - 2020
- [j3]Kyungjoo Noh, Liang Jiang, Bill Fefferman:
Efficient classical simulation of noisy random quantum circuits in one dimension. Quantum 4: 318 (2020) - [c9]Adam Bouland, Bill Fefferman, Umesh V. Vazirani:
Computational Pseudorandomness, the Wormhole Growth Paradox, and Constraints on the AdS/CFT Duality (Abstract). ITCS 2020: 63:1-63:2 - [i18]Bill Fefferman, Zachary Remscrim:
Eliminating Intermediate Measurements in Space-Bounded Quantum Computation. CoRR abs/2006.03530 (2020) - [i17]Abhinav Deshpande, Alexey V. Gorshkov, Bill Fefferman:
The importance of the spectral gap in estimating ground-state energies. CoRR abs/2007.11582 (2020) - [i16]Bill Fefferman, Zachary Remscrim:
Eliminating Intermediate Measurements in Space-Bounded Quantum Computation. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [c8]Adam Bouland, Bill Fefferman, Chinmay Nirkhe, Umesh V. Vazirani:
"Quantum Supremacy" and the Complexity of Random Circuit Sampling. ITCS 2019: 15:1-15:2 - [i15]Nishad Maskara, Abhinav Deshpande, Minh C. Tran, Adam Ehrenberg, Bill Fefferman, Alexey V. Gorshkov:
Complexity phase diagram for interacting and long-range bosonic Hamiltonians. CoRR abs/1906.04178 (2019) - [i14]Adam Bouland, Bill Fefferman, Umesh V. Vazirani:
Computational pseudorandomness, the wormhole growth paradox, and constraints on the AdS/CFT duality. CoRR abs/1910.14646 (2019) - 2018
- [c7]Bill Fefferman, Cedric Yen-Yu Lin:
A Complete Characterization of Unitary Quantum Space. ITCS 2018: 4:1-4:21 - [c6]Bill Fefferman, Shelby Kimmel:
Quantum vs. Classical Proofs and Subset Verification. MFCS 2018: 22:1-22:23 - [i13]Adam Bouland, Bill Fefferman, Chinmay Nirkhe, Umesh V. Vazirani:
Quantum Supremacy and the Complexity of Random Circuit Sampling. CoRR abs/1803.04402 (2018) - 2017
- [i12]Abhinav Deshpande, Bill Fefferman, Michael Foss-Feig, Alexey V. Gorshkov:
Complexity of sampling as an order parameter. CoRR abs/1703.05332 (2017) - 2016
- [c5]Bill Fefferman, Hirotada Kobayashi, Cedric Yen-Yu Lin, Tomoyuki Morimae, Harumichi Nishimura:
Space-Efficient Error Reduction for Unitary Quantum Computations. ICALP 2016: 14:1-14:14 - [c4]Gorjan Alagic, Anne Broadbent, Bill Fefferman, Tommaso Gagliardoni, Christian Schaffner, Michael St. Jules:
Computational Security of Quantum Encryption. ICITS 2016: 47-71 - [c3]Bill Fefferman, Christopher Umans:
On the Power of Quantum Fourier Sampling. TQC 2016: 1:1-1:19 - [i11]Bill Fefferman, Cedric Yen-Yu Lin:
Quantum Merlin Arthur with Exponentially Small Gap. CoRR abs/1601.01975 (2016) - [i10]Gorjan Alagic, Anne Broadbent, Bill Fefferman, Tommaso Gagliardoni, Christian Schaffner, Michael St. Jules:
Computational Security of Quantum Encryption. CoRR abs/1602.01441 (2016) - [i9]Gorjan Alagic, Bill Fefferman:
On Quantum Obfuscation. CoRR abs/1602.01771 (2016) - [i8]Bill Fefferman, Cedric Yen-Yu Lin:
A Complete Characterization of Unitary Quantum Space. CoRR abs/1604.01384 (2016) - [i7]Bill Fefferman, Hirotada Kobayashi, Cedric Yen-Yu Lin, Tomoyuki Morimae, Harumichi Nishimura:
Space-Efficient Error Reduction for Unitary Quantum Computations. CoRR abs/1604.08192 (2016) - [i6]Gorjan Alagic, Anne Broadbent, Bill Fefferman, Tommaso Gagliardoni, Christian Schaffner, Michael St. Jules:
Computational Security of Quantum Encryption. IACR Cryptol. ePrint Arch. 2016: 424 (2016) - 2015
- [i5]Bill Fefferman, Chris Umans:
The Power of Quantum Fourier Sampling. CoRR abs/1507.05592 (2015) - [i4]Bill Fefferman, Shelby Kimmel:
Quantum vs Classical Proofs and Subset Verification. CoRR abs/1510.06750 (2015) - 2014
- [b1]Bill Fefferman:
The Power of Quantum Fourier Sampling. California Institute of Technology, USA, 2014 - 2013
- [j2]Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola:
On Beating the Hybrid Argument. Theory Comput. 9: 809-843 (2013) - 2012
- [c2]Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola:
On beating the hybrid argument. ITCS 2012: 468-483 - 2010
- [i3]Bill Fefferman, Christopher Umans:
Pseudorandom generators and the BQP vs. PH problem. CoRR abs/1007.0305 (2010) - [i2]Bill Fefferman, Ronen Shaltiel, Christopher Umans, Emanuele Viola:
On beating the hybrid argument. Electron. Colloquium Comput. Complex. TR10 (2010)
2000 – 2009
- 2009
- [j1]Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor:
The Power of Unentanglement. Theory Comput. 5(1): 1-42 (2009) - 2008
- [c1]Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor:
The Power of Unentanglement. CCC 2008: 223-236 - [i1]Scott Aaronson, Salman Beigi, Andrew Drucker, Bill Fefferman, Peter W. Shor:
The Power of Unentanglement. Electron. Colloquium Comput. Complex. TR08 (2008)
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-09-15 00:42 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:
