4
program roles
2
organizing roles
23
collaborators
2009–2025
years active
Contributions
QIP QCrypt TQC talk poster presenter award · △program ◇steering ○organizing · filled = chair
8 Talks
| Title | Conference | Type | Co-authors |
|---|---|---|---|
|
Parameterized Complexity of Weighted Local Hamiltonian Problems and the Quantum Exponential Time Hypothesis ↗
|
TQC 2023 | regular | Zhengfeng Ji, ▸Xingjian Li, Luke Mathieson, Mauro Morales |
We study a parameterized version of the local Hamiltonian problem, called the weighted local Hamiltonian problem, where the relevant quantum states are superpositions of computational basis states of Hamming weight latex k. The Hamming weight constraint can have a physical interpretation as a constraint on the number of excitations allowed or particle number in a system. We prove that this problem is in QW[1], the first level of the quantum weft hierarchy and that it is hard for QM[1], the quantum analogue of M[1]. Our results show that this problem cannot be fixed-parameter quantum tractable (FPQT) unless certain natural quantum analogue of the exponential time hypothesis (ETH) is false. |
|||
| The Complexity of Quantum Sampling Problems (Tutorial 3a) | QIP 2018 | tutorial ▸ presenter | — |
| The Complexity of Quantum Sampling Problems (Tutorial 3b) | QIP 2018 | tutorial ▸ presenter | — |
| Characterizing quantum supremacy in near-term devices | QIP 2017 | regular | ▸Sergio Boixo, Sergei Isakov, Vadim Smelyanskiy, Ryan Babbush, Nan Ding, Zhang Jiang, John Martinis, Hartmut Neven |
| Average-case complexity versus approximate simulation of commuting quantum computations | QIP 2016 | regular ▸ presenter | Ashley Montanaro, Daniel Shepherd |
|
Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy ↗
|
QIP 2011 | regular | Richard Jozsa, Daniel Shepherd |
| Most quantum states are useless for measurement-based quantum computation | QIP 2009 | regular | ▸Steven Flammia, David Gross, Jens Eisert, Andreas Winter, Caterina Mora |
| Instantaneous Quantum Computation | QIP 2009 | regular | ▸Daniel Shepherd |
7 Posters
| Title | Conference | Co-authors |
|---|---|---|
| The Complexity of Local Stoquastic Hamiltonians on 2D Lattices | QIP 2025 | Gabriel Waite |
| IQP-based Verification of Quantum Computational Advantage: Stabilizer Constructions and Classical Security | QIP 2023 | Bin Cheng, Zhengfeng Ji |
| Parameterized Complexity of Weighted Local Hamiltonian Problems and Quantum Exponential Time Hypothesis | QIP 2023 | Zhengfeng Ji, Luke Mathieson, Mauro Morales |
| IQP Sampling and Verifiable Quantum Advantage: Stabilizer Constructions and Classical Security | TQC 2023 | Bin Cheng, Zhengfeng Ji |
| On the Complexity of Random Quantum Computations and the Jones Polynomial | QIP 2018 | Ryan Mann |
| Achieving quantum supremacy with sparse and noisy commuting quantum computations | QIP 2017 | Ashley Montanaro, Daniel Shepherd |
| PostIQP=PP, hence classical simulations of temporally unstructured quantum computations imply a collapse of the Polynomial Hierarchy | QIP 2010 | Richard Jozsa, Daniel Shepherd |
Committee service
| Conference | Committee | Position | Title |
|---|---|---|---|
| QIP 2024 | program | member | — |
| QIP 2020 | program | member | — |
| TQC 2018 | organizing | member | — |
| TQC 2017 | program | member | — |
| QIP 2015 | organizing | member | — |
| TQC 2014 | program | member | — |
Collaborators
| Co-author | Joint talks |
|---|---|
| Daniel Shepherd | 5 |
| Zhengfeng Ji | 4 |
| Ashley Montanaro | 2 |
| Bin Cheng | 2 |
| Luke Mathieson | 2 |
| Mauro Morales | 2 |
| Richard Jozsa | 2 |
| Andreas Winter | 1 |
| Caterina Mora | 1 |
| David Gross | 1 |
| Gabriel Waite | 1 |
| Hartmut Neven | 1 |
| Jens Eisert | 1 |
| John Martinis | 1 |
| Nan Ding | 1 |
| Ryan Babbush | 1 |
| Ryan Mann | 1 |
| Sergei Isakov | 1 |
| Sergio Boixo | 1 |
| Steven Flammia | 1 |