5
talks
2
posters
0
committee roles
0
leadership roles
2023–2025
years active
Contributions
QIP QCrypt TQC presenter award · △program ◇steering ○organising □local · filled = chair
Talks
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| Anti-Concentration for the Unitary Haar Measure and Applications to Random Quantum Circuits | QIP 2025 | regular | Bill Fefferman, ▸Wei Zhan |
| Public-key pseudoentanglement and the hardness of learning ground state entanglement structure | QIP 2024 | regular | ▸Adam Bouland, Bill Fefferman, Tony Metger, Umesh Vazirani, Chenyi Zhang, Zixin Zhou |
| Effect of non–unital noise on random circuit sampling | QIP 2024 | regular | ▸Bill Fefferman, Michael Gullans, Kohdai Kuroiwa, Kunal Sharma |
|
Noise-induced shallow circuits and absence of barren plateaus ↗
|
TQC 2024 | regular | ▸Antonio Anna Mele, Armando Angrisani, Sumeet Khatri, Jens Eisert, Daniel Stilck França, Yihui Quek |
Motivated by realistic hardware considerations of the pre-fault-tolerant era, we comprehensively study the impact of uncorrected noise on quantum circuits. We first show that any noise `truncates' most quantum circuits to effectively logarithmic depth, in the task of computing Pauli expectation values. We then prove that quantum circuits under any non-unital noise exhibit lack of barren plateaus for cost functions composed of local observables. But, by leveraging the effective shallowness, we also design a classical algorithm to estimate Pauli expectation values within inverse-polynomial additive error with high probability over the ensemble. Its runtime is independent of circuit depth and it operates in polynomial time in the number of qubits for one-dimensional architectures and quasi-polynomial time for higher-dimensional ones. Taken together, our results showcase that, unless we carefully engineer the circuits to take advantage of the noise, it is unlikely that noisy quantum circuits are preferable over shallow quantum circuits for algorithms that output Pauli expectation value estimates, like many variational quantum machine learning proposals. Moreover, we anticipate that our work could provide valuable insights into the fundamental open question about the complexity of sampling from (possibly non-unital) noisy random circuits. |
|||
| Quantum Pseudoentanglement | QIP 2023 | regular ▸ presenter | Adam Bouland, Bill Fefferman, Umesh Vazirani, Zixin Zhou |
Posters
| Title | Conference | Co-authors |
|---|---|---|
| Approximate t-design depths in generic circuit architectures | QIP 2025 | Daniel Belkin, James Allen, Christopher Kang, Sophia Lin, James Sud, Fred Chong, Bill Fefferman, Bryan K. Clark |
| Online learning of a panoply of quantum objects | QIP 2025 | Akshay Bansal, Ian George, Jamie Sikora, Alice Zheng |
Collaborators
| Co-author | Joint talks |
|---|---|
| Bill Fefferman | 5 |
| Adam Bouland | 2 |
| Umesh Vazirani | 2 |
| Zixin Zhou | 2 |
| Akshay Bansal | 1 |
| Alice Zheng | 1 |
| Antonio Anna Mele | 1 |
| Armando Angrisani | 1 |
| Bryan K. Clark | 1 |
| Chenyi Zhang | 1 |
| Christopher Kang | 1 |
| Daniel Belkin | 1 |
| Daniel Stilck França | 1 |
| Fred Chong | 1 |
| Ian George | 1 |
| James Allen | 1 |
| James Sud | 1 |
| Jamie Sikora | 1 |
| Jens Eisert | 1 |
| Kohdai Kuroiwa | 1 |