20
collaborators
2018–2026
years active
Contributions
QIP QCrypt TQC talk poster presenter award · △program ◇steering ○organizing · filled = chair
5 Talks
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| The Complexity of NISQ | QIP 2023 | regular | ▸Sitan Chen, Hsin-Yuan Robert Huang, Jerry Li |
| Exponential separations between learning with and without quantum memory | QIP 2022 | regular ▸ presenter | Sitan Chen, Hsin-Yuan Robert Huang, Jerry Li |
| Quantum Algorithmic Measurement | QIP 2021 | regular | Dorit Aharonov, Xiao-Liang Qi |
Abstract Can quantum computational tools enhance the precision and efficiency of physical experiments? Promising examples are known, but a systematic treatment and comprehensive framework are missing. We introduce Quantum Algorithmic Measurements (QUALMs) to enable the study of quantum measurements and experiments from the perspective of computational complexity and communication complexity. The measurement process is described, in its utmost generality, by a many-round quantum interaction protocol between the experimental system and a full-fledged quantum computer. The QUALM complexity is quantified by the number of elementary operations performed by the quantum computer, including its coupling to the experimental system. We study how the QUALM complexity depends on the type of allowed access the quantum computer has to the experimental system: local-local, incoherent, coherent, adaptive, etc. We provide the first example of a measurement "task" for which the coherent QUALM complexity is exponentially better than the incoherent one, even if the latter is adaptive; this implies that using entanglement between different systems in experiments may lead to exponential savings in resources. We extend our results to derive a similar exponential advantage for a physically motivated measurement task which determines the symmetry class of the time evolution operator for a quantum many-body system. Many open questions are raised towards better understanding how quantum computational tools can be applied in experimental physics. A major question is whether an exponential advantage in QUALM complexity can be achieved in the NISQ era; an equally important one is to design new, efficient quantum algorithmic measurements based on our framework, perhaps relying on ideas from quantum algorithms. |
|||
| Rigorous free fermion entanglement renormalization from wavelet theory | QIP 2018 | regular | Jutho Haegeman, Brian Swingle, Michael Walter, Glen Evenbly, ▸Volkher Scholz |
| Approximate Operator Algebra Quantum Error Correction (Decoding the Hologram in AdS/CFT) | QIP 2018 | regular | Patrick Hayden, ▸Grant Salton, Brian Swingle, Michael Walter |
3 Posters
| Title | Conference | Co-authors |
|---|---|---|
| Local arrows of time in quantum many-body systems | TQC 2026 | Andrew G. Yates, Nishad Maskara, Mikhail Lukin |
We demonstrate that in quantum many-body systems, local arrows of time can differ from the global time $t$ induced by Hamiltonian evolution. That is, within a quantum many-body system, the flow of time can be relative to each observer or by proxy each local subsystem. We provide a definition of local arrows of time in quantum many-body systems, and explain their relation to spacetime quantum entropies. Then we give a variety of numerical and analytical examples which explore different ways in which local arrows of time can manifest in quantum many-body dynamics, including exotic arrows of time arising from quantum thermalization and quantum error correction. We find that even in standard Hamiltonian dynamics, the arrow of time is not strictly temporal; it develops spatial components that deviate from the local entropy gradient. |
||
| Locality from the spectrum | QIP 2018 | Daniel Ranard, Geoffrey Penington |
| Chaos, Complexity, and Random Matrices | QIP 2018 | Nicholas Hunter-Jones, Junyu Liu, Beni Yoshida |
Collaborators
| Co-author | Joint talks |
|---|---|
| Brian Swingle | 2 |
| Hsin-Yuan Robert Huang | 2 |
| Jerry Li | 2 |
| Michael Walter | 2 |
| Sitan Chen | 2 |
| Andrew G. Yates | 1 |
| Beni Yoshida | 1 |
| Daniel Ranard | 1 |
| Dorit Aharonov | 1 |
| Geoffrey Penington | 1 |
| Glen Evenbly | 1 |
| Grant Salton | 1 |
| Junyu Liu | 1 |
| Jutho Haegeman | 1 |
| Mikhail Lukin | 1 |
| Nicholas Hunter-Jones | 1 |
| Nishad Maskara | 1 |
| Patrick Hayden | 1 |
| Volkher Scholz | 1 |
| Xiao-Liang Qi | 1 |