Bill Fefferman

Bill Fefferman

Auto-generated profile, based on publicly available information

Bill Fefferman

University of Chicago

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
29 October 2018 in Nature Physics
Verified
Journal Article
Closed access
PDF file
ABAdam Bouland
Adam Bouland
BFBill Fefferman
Bill Fefferman
CNChinmay Nirkhe
Chinmay Nirkhe
UVUmesh Vazirani
Umesh Vazirani

24 February 2021 in PRX Quantum
Verified
Journal Article
Open access
PDF file
YAYuri Alexeev
Yuri Alexeev
DBDave Bacon
Dave Bacon
KBKenneth R. Brown
Kenneth R. Brown
RCRobert Calderbank
Robert Calderbank
LCLincoln D. Carr
Lincoln D. Carr
JTJeff Thompson
Jeff Thompson
The great promise of quantum computers comes with the dual challenges of building them and finding their useful applications. We argue that these two challenges should be considered together, by codesigning full-stack quantum computer systems along with their applications in order to hasten their development and potential for scientific discovery. In this context, we identify scientific and community needs, opportunities, a sampling of a few use case studies, and significant challenges for the development of quantum computers for science over the next 2–10 years. This document is written by a community of university, national laboratory, and industrial researchers in the field of Quantum Information Science and Technology, and is based on a summary from a U.S. National Science Foundation workshop on Quantum Computing held on October 21–22, 2019 in Alexandria, VA.

11 September 2020 in Quantum
Verified
Journal Article
Open access
PDF file
KNKyungjoo Noh
Kyungjoo Noh
LJLiang Jiang
Liang Jiang
BFBill Fefferman
Bill Fefferman
Understanding the computational power of noisy intermediate-scale quantum (NISQ) devices is of both fundamental and practical importance to quantum information science. Here, we address the question of whether error-uncorrected noisy quantum computers can provide computational advantage over classical computers. Specifically, we study noisy random circuit sampling in one dimension (or 1D noisy RCS) as a simple model for exploring the effects of noise on the computational power of a noisy quantum device. In particular, we simulate the real-time dynamics of 1D noisy random quantum circuits via matrix product operators (MPOs) and characterize the computational power of the 1D noisy quantum system by using a metric we call MPO entanglement entropy. The latter metric is chosen because it determines the cost of classical MPO simulation. We numerically demonstrate that for the two-qubit gate error rates we considered, there exists a characteristic system size above which adding more qubits does not bring about an exponential growth of the cost of classical MPO simulation of 1D noisy systems. Specifically, we show that above the characteristic system size, there is an optimal circuit depth, independent of the system size, where the MPO entanglement entropy is maximized. Most importantly, the maximum achievable MPO entanglement entropy is bounded by a constant that depends only on the gate error rate, not on the system size. We also provide a heuristic analysis to get the scaling of the maximum achievable MPO entanglement entropy as a function of the gate error rate. The obtained scaling suggests that although the cost of MPO simulation does not increase exponentially in the system size above a certain characteristic system size, it does increase exponentially as the gate error rate decreases, possibly making classical simulation practically not feasible even with state-of-the-art supercomputers.

7 January 2022 in Science Advances
Verified
Journal Article
Open access
ADAbhinav Deshpande
Abhinav Deshpande
AMArthur Mehta
Arthur Mehta
TVTrevor Vincent
Trevor Vincent
NQNicolás Quesada
Nicolás Quesada
MHMarcel Hinsche
Marcel Hinsche
IDIsh Dhand
Ish Dhand
A programmable quantum computer based on fiber optics outperforms classical computers with a high level of confidence.

25 June 2024 in Nature Physics
Verified
Journal Article
Closed access
PDF file
COChanghun Oh
Changhun Oh
MLMinzhao Liu
Minzhao Liu
YAYuri Alexeev
Yuri Alexeev
BFBill Fefferman
Bill Fefferman
LJLiang Jiang
Liang Jiang

4 January 2023 in Nature Communications
Verified
Journal Article
Open access
PDF file
SCSenrui Chen
Senrui Chen
YLYunchao Liu
Yunchao Liu
MOMatthew Otten
Matthew Otten
ASAlireza Seif
Alireza Seif
BFBill Fefferman
Bill Fefferman
LJLiang Jiang
Liang Jiang
Recently, several quantum benchmarking algorithms have been developed to characterize noisy quantum gates on today’s quantum devices. A fundamental issue in benchmarking is that not everything about quantum noise is learnable due to the existence of gauge freedom, leaving open the question what information is learnable and what is not, which is unclear even for a single CNOT gate. Here we give a precise characterization of the learnability of Pauli noise channels attached to Clifford gates using graph theoretical tools. Our results reveal the optimality of cycle benchmarking in the sense that it can extract all learnable information about Pauli noise. We experimentally demonstrate noise characterization of IBM’s CNOT gate up to 2 unlearnable degrees of freedom, for which we obtain bounds using physical constraints. In addition, we show that an attempt to extract unlearnable information by ignoring state preparation noise yields unphysical estimates, which is used to lower bound the state preparation noise.