1
program role
32
collaborators
2017–2026
years active
Contributions
QIP QCrypt TQC talk poster presenter award · △program ◇steering ○organizing · filled = chair
2 Talks
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| Classically simulating noisy quantum circuits via exponential decay of conditional correlation | TQC 2026 | regular | Yifan (Frank) Zhang, Su-un Lee, Sarang Gopalakrishnan, Soumik Ghosh, Kyungjoo Noh, Bill Fefferman, Liang Jiang |
While quantum computing can accomplish tasks that are classically intractable, the presence of noise may destroy this advantage in the absence of fault tolerance. In this work, we present a quasi-polynomial-time classical algorithm for simulating quantum circuits under local depolarization noise, thereby ruling out their quantum advantage in these settings. Our algorithm leverages a property called approximate Markov property to sequentially sample from the measurement outcome distribution of noisy circuits. We establish approximate Markov property in a broad range of circuits: (1) we prove that it holds for any circuit when the noise rate exceeds a constant threshold, and (2) we provide strong analytical and numerical evidence that it holds for random quantum circuits subject to any constant noise rate, including non-unital noises. These regimes include previously known classically simulable cases as well as new ones, such as shallow random circuits and random circuits under non-unital noise, where anticoncentration does not hold and prior algorithms fail. Taken together, our results significantly extend the boundary of classical simulability and suggest that noise generically enforces approximate Markov property and classical simulability, thereby highlighting the limitation of noisy quantum circuits in demonstrating quantum advantage. |
|||
| Higher moment theory and learnability of bosonic states | TQC 2026 | regular | Joseph Iosue, Yu-Xin Wang, Ishaun Datta, Soumik Ghosh, Bill Fefferman, Alexey Gorshkov |
We present a sample- and time-efficient algorithm to learn any bosonic Fock state acted upon by an arbitrary Gaussian unitary. As a special case, this algorithm efficiently learns states produced in Fock state BosonSampling, thus resolving an open question put forth by Aaronson and Grewal (Aaronson, Grewal 2023). We further study a hierarchy of classes of states beyond Gaussian states that are specified by a finite number of their higher moments. Using the higher moments, we find a full spectrum of invariants under Gaussian unitaries, thereby providing necessary conditions for two states to be related by an arbitrary (including active, e.g.~beyond linear optics) Gaussian unitary. |
|||
15 Posters
| Title | Conference | Co-authors |
|---|---|---|
| Classical algorithms for quantum mean-value problems in bosonic circuits | QIP 2026 | Youngrong Lim |
| On the query complexity of unitary channel certification | QIP 2026 | ▸Sangwoo Jeon |
| On the Fundamental Resource for Exponential Advantage in Quantum Channel Learning | QIP 2026 | ▸Minsoo Kim |
| Classical simulation of quantum circuits with noisy magic inputs | QIP 2026 | Jiwon Heo, Sojeong Park |
| Classical simulation of lossy boson sampling and noisy IQP circuit sampling using matrix product state | QIP 2026 | ▸Sojeong Park |
| Exponential advantage in continuous-variable quantum state learning | QIP 2026 | ▸Eugen Coroi |
| Exponential entanglement advantage in sensing correlated noise | QIP 2025 | Yuxin Wang, Jacob Bringewatt, Alireza Seif, Anthony J. Brady, Alexey Gorshkov |
| Universal Spreading of Conditional Mutual Information in Noisy Random Circuits | QIP 2025 | Su-un Lee, Yat Wong, Senrui Chen, Liang Jiang |
| Efficacy of Virtual Purification in Quantum Metrology | QIP 2024 | Hyukgun Kwon, Youngrong Lim, Hyunseok Jeong, Liang Jiang |
| Tight bounds on Pauli channel learning without entanglement | QIP 2024 | Senrui Chen, Sisi Zhou, Hsin-Yuan Robert Huang, Liang Jiang |
| Classical algorithm for simulating experimental Gaussian boson sampling | QIP 2024 | Minzhao Liu, Yuri Alexeev, Bill Fefferman, Liang Jiang |
| Exploring shallow-depth boson sampling for scalable quantum supremacy | QIP 2024 | Byeongseon Go, Hyunseok Jeong, Liang Jiang |
| Classical algorithm for simulating experimental Gaussian boson sampling | TQC 2024 | Minzhao Liu, Yuri Alexeev, Bill Fefferman, Liang Jiang |
| Efficient classical algorithm of molecular vibronic spectra problem | QIP 2023 | Youngrong Lim, Bill Fefferman, Liang Jiang |
| Minimal control power of the controlled dense coding | QIP 2017 | Hoyong Kim, Kabgyun Jeong, Hyunseok Jeong |
Committee service
| Conference | Committee | Position | Title |
|---|---|---|---|
| TQC 2025 | program | member | — |
Collaborators
| Co-author | Joint talks |
|---|---|
| Liang Jiang | 8 |
| Bill Fefferman | 5 |
| Hyunseok Jeong | 3 |
| Youngrong Lim | 3 |
| Alexey Gorshkov | 2 |
| Minzhao Liu | 2 |
| Senrui Chen | 2 |
| Sojeong Park | 2 |
| Soumik Ghosh | 2 |
| Su-un Lee | 2 |
| Yuri Alexeev | 2 |
| Alireza Seif | 1 |
| Anthony J. Brady | 1 |
| Byeongseon Go | 1 |
| Eugen Coroi | 1 |
| Hoyong Kim | 1 |
| Hsin-Yuan Robert Huang | 1 |
| Hyukgun Kwon | 1 |
| Ishaun Datta | 1 |
| Jacob Bringewatt | 1 |