Bill Fefferman

Orcid: 0000-0002-9627-0210

According to our database1, Bill Fefferman authored at least 32 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Anti-Concentration for the Unitary Haar Measure and Applications to Random Quantum Circuits.
Electron. Colloquium Comput. Complex., 2024

Quantum Merlin-Arthur with an internally separable proof.
CoRR, 2024

Quantum Merlin-Arthur and Proofs Without Relative Phase.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Quantum Pseudoentanglement.
Proceedings of the 15th Innovations in Theoretical Computer Science Conference, 2024

Public-Key Pseudoentanglement and the Hardness of Learning Ground State Entanglement Structure.
Proceedings of the 39th Computational Complexity Conference, 2024

2023
Complexity-theoretic foundations of BosonSampling with a linear number of modes.
CoRR, 2023

Effect of non-unital noise on random circuit sampling.
CoRR, 2023

On the Power of Nonstandard Quantum Oracles.
Proceedings of the 18th Conference on the Theory of Quantum Computation, 2023

2022
Sharp complexity phase transitions generated by entanglement.
CoRR, 2022

Quantum Pseudoentanglement.
CoRR, 2022

The Importance of the Spectral Gap in Estimating Ground-State Energies.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021
Quantum Complexity: Theory and Application (Dagstuhl Seminar 21261).
Dagstuhl Reports, 2021

Electronic Structure in a Fixed Basis is QMA-complete.
CoRR, 2021

Noise and the Frontier of Quantum Supremacy.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020
Efficient classical simulation of noisy random quantum circuits in one dimension.
Quantum, 2020

Eliminating Intermediate Measurements in Space-Bounded Quantum Computation.
Electron. Colloquium Comput. Complex., 2020

Computational Pseudorandomness, the Wormhole Growth Paradox, and Constraints on the AdS/CFT Duality (Abstract).
Proceedings of the 11th Innovations in Theoretical Computer Science Conference, 2020

2019
Computational pseudorandomness, the wormhole growth paradox, and constraints on the AdS/CFT duality.
CoRR, 2019

Complexity phase diagram for interacting and long-range bosonic Hamiltonians.
CoRR, 2019

"Quantum Supremacy" and the Complexity of Random Circuit Sampling.
Proceedings of the 10th Innovations in Theoretical Computer Science Conference, 2019

2018
Quantum vs. Classical Proofs and Subset Verification.
Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

A Complete Characterization of Unitary Quantum Space.
Proceedings of the 9th Innovations in Theoretical Computer Science Conference, 2018

2017
Complexity of sampling as an order parameter.
CoRR, 2017

2016
Computational Security of Quantum Encryption.
IACR Cryptol. ePrint Arch., 2016

Quantum Merlin Arthur with Exponentially Small Gap.
CoRR, 2016

On Quantum Obfuscation.
CoRR, 2016

On the Power of Quantum Fourier Sampling.
Proceedings of the 11th Conference on the Theory of Quantum Computation, 2016

Space-Efficient Error Reduction for Unitary Quantum Computations.
Proceedings of the 43rd International Colloquium on Automata, Languages, and Programming, 2016

2014
The Power of Quantum Fourier Sampling.
PhD thesis, 2014

2010
On beating the hybrid argument.
Electron. Colloquium Comput. Complex., 2010

Pseudorandom generators and the BQP vs. PH problem
CoRR, 2010

2008
The Power of Unentanglement.
Electron. Colloquium Comput. Complex., 2008


  Loading...