Fefferman, Bill
University of Chicago
3 papers on CoChatORCID 0000-0002-9627-0210
Most cited papers
- Verified
On the complexity and verification of quantum random circuit sampling
Bouland, A., Fefferman, B., Nirkhe, C., & Vazirani, U. (2019) · Nature Physics
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 287
- Verified
Quantum computational advantage via high-dimensional Gaussian boson sampling
Deshpande, A., Mehta, A., Vincent, T., Quesada, N., Hinsche, M., Ioannou, M., Madsen, L., Lavoie, J., Qi, H., Eisert, J., et al. (2022) · Science Advances
Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography
Cited by 106
- Verified
A sharp phase transition in linear cross-entropy benchmarking
Ware, B., Deshpande, A., Hangleiter, D., Niroula, P., Fefferman, B., Gorshkov, A. V., & Gullans, M. J. (2023) · arXiv
Quantum Computing Algorithms and ArchitectureQuantum many-body systems
Cited by 4
Go further with a free account
Verify every reference, keep papers in a library, and ask questions across them.
Sign up - it is free