13
collaborators
2024–2026
years active
Contributions
QIP QCrypt TQC talk poster presenter award · △program ◇steering ○organizing · filled = chair
2 Talks
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| Entanglement sharing schemes | QIP 2026 | regular | Alexander May, Zahra Baghali Khanian, Dongjin Lee, Debbie Leung, ▸Zhi Li, Takato Mori, Stanley Miao, Farzin Salek, Beni Yoshida |
We ask how quantum correlations can be distributed among many subsystems. To address this, we define entanglement sharing schemes (ESS) where certain pairs of subsystems allow entanglement to be recovered via local operations, while other pairs must not. ESS schemes come in two variants, one where the partner system with which entanglement should be prepared is known, and one where it is not. In the case of known partners, we fully characterize the access structures realizable for ESS when using stabilizer states, and construct efficient schemes for threshold access structures, and give a conjecture for the access structures realizable with general states. In the unknown partner case, we again give a complete characterization in the stabilizer setting, additionally give a complete characterization of the case where there are no restrictions on unauthorized pairs, and we prove a set of necessary conditions on general schemes which we conjecture are also sufficient. Finally, we give an application of the theory of entanglement sharing to resolve an open problem related to the distribution of entanglement in response to time sensitive requests in quantum networks. |
|||
| Complexity and order in approximate quantum error-correcting codes | QIP 2024 | regular ▸ presenter | Weicheng Ye, Daniel Gottesman, Zi-Wen Liu |
1 Poster
| Title | Conference | Co-authors |
|---|---|---|
| Lovasz Meets Lieb-Schultz-Mattis: Complexity in Approximate Quantum Error Correction | TQC 2026 | Ruizhi Liu, Zhi Li |
Approximate quantum error correction (AQEC) provides a versatile framework for both quantum information processing and probing many-body entanglement. We reveal a fundamental tension between the error-correcting power of an AQEC and the hardness of code state preparation. More precisely, through a novel application of the Lov\'asz local lemma, we establish a fundamental trade-off between local indistinguishability and circuit complexity, showing that orthogonal short-range entangled states must be distinguishable via a local operator. These results offer a powerful tool for exploring quantum circuit complexity across diverse settings. As applications, we derive stronger constraints on the complexity of AQEC codes with transversal logical gates and establish strong complexity lower bounds for W state preparation. Our framework also provides a novel perspective for systems with Lieb-Schultz-Mattis type constraints. |
||
Collaborators
| Co-author | Joint talks |
|---|---|
| Zhi Li | 2 |
| Alexander May | 1 |
| Beni Yoshida | 1 |
| Daniel Gottesman | 1 |
| Debbie Leung | 1 |
| Dongjin Lee | 1 |
| Farzin Salek | 1 |
| Ruizhi Liu | 1 |
| Stanley Miao | 1 |
| Takato Mori | 1 |
| Weicheng Ye | 1 |
| Zahra Baghali Khanian | 1 |
| Zi-Wen Liu | 1 |