9
talks
11
committee roles
1
leadership roles
2013–2026
years active
Contributions
QIP QCrypt TQC presenter award · △program ◇steering ○organising □local · filled = chair
Talks
| Title | Conference | Type | Co-authors |
|---|---|---|---|
| The nonequilibrium cost of accurate information processing | TQC 2023 | regular | ▸Fei Meng, Renato Renner, Man-hong Yung |
Accurate information processing is crucial both in technology and in nature. To achieve it, any information processing system needs an initial supply of resources away from thermal equilibrium. Here we establish a fundamental limit on the accuracy achievable with a given amount of nonequilibrium resources. The limit applies to arbitrary information processing tasks and arbitrary information processing systems subject to the laws of quantum mechanics. It is easily computable and is expressed in terms of an entropic quantity, which we name the reverse entropy, associated to a time reversal of the information processing task under consideration. The limit is achievable for all deterministic classical computations and for all their quantum extensions. As an application, we establish the optimal tradeoff between nonequilibrium and accuracy for the fundamental tasks of storing, transmitting, cloning, and erasing information. Our results set a target for the design of new devices approaching the ultimate efficiency limit, and provide a framework for demonstrating thermodynamical advantages of quantum devices over their classical counterparts. This also implies a thermodynamic benchmark to certify genuine quantum devices from their classical simulation. |
|||
| Witnessing latent time correlations with a single quantum particle | QIP 2022 | regular | ▸Hlér Kristjánsson, Wenxu Mao |
| Optimal universal programming of unitary gates | QIP 2021 | regular | Yuxiang Yang, Renato Renner |
Abstract A universal quantum processor is a device that takes as input a (quantum) program, containing an encoding of an arbitrary unitary gate, and a (quantum) data register, on which the encoded gate is applied. While no perfect universal quantum processor can exist, approximate processors have been proposed in the past two decades. A fundamental open question is how the size of the smallest quantum program scales with the approximation error. Here we answer the question, by proving a bound on the size of the program and designing a concrete protocol that attains the bound in the asymptotic limit. Our result is based on a connection between optimal programming and the Heisenberg limit of quantum metrology, and establishes an asymptotic equivalence between the tasks of programming, learning, and estimating unitary gates. |
|||
| Covariant Quantum Error Correcting Codes via Reference Frames | TQC 2021 | regular | Yuxiang Yang, Mo Yin, Joseph M. Renes, Mischa Woods |
| The energy requirement of quantum processors | QIP 2020 | regular | Yuxiang Yang, Renato Renner |
| Compression for identically prepared qudit states | QIP 2018 | regular | ▸Yuxiang Yang, Ge Bai, Masahito Hayashi |
| Optimal compression for identically prepared qubit states | QIP 2017 | regular ▸ presenter | Yuxiang Yang, Masahito Hayashi |
| On the Query Complexity of Perfect Gate Discrimination | TQC 2013 | regular | Giacomo Mauro D'Ariano, Martin Roetteler |
| Is Global Asymptotic Cloning State Estimation? | TQC 2013 | regular | Yuxiang Yang |
Committee service
| Conference | Committee | Position | Title |
|---|---|---|---|
| QIP 2026 | SC | member | — |
| QIP 2025 | PC | member | — |
| QIP 2025 | SC | member | — |
| QIP 2022 | PC | member | — |
| TQC 2021 | PC | member | — |
| QIP 2020 | PC | member | — |
| QIP 2019 | PC | member | — |
| TQC 2016 | PC | member | — |
| QIP 2014 | PC | member | — |
| TQC 2014 | PC | member | — |
| QIP 2013 | Local | chair | — |
Collaborators
| Co-author | Joint talks |
|---|---|
| Yuxiang Yang | 6 |
| Renato Renner | 3 |
| Masahito Hayashi | 2 |
| Fei Meng | 1 |
| Ge Bai | 1 |
| Giacomo Mauro D'Ariano | 1 |
| Hlér Kristjánsson | 1 |
| Joseph M. Renes | 1 |
| Man-hong Yung | 1 |
| Martin Roetteler | 1 |
| Mischa Woods | 1 |
| Mo Yin | 1 |
| Wenxu Mao | 1 |