QuantumDB is a work in progress — we're still collecting conference data, so some talks, authors, and committees may be missing or incomplete. Learn more & how to help →

researcher

Shelby Kimmel

Middlebury College · active 2011–2026 · QIP, TQC


7
program roles
2
steering roles
30
collaborators
2011–2026
years active

Contributions

2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 QIP 2011 — poster: Super-polynomial quantum speed-ups for Boolean evaluation trees with hidden stru… QIP 2012 — poster: The quantum query complexity of read-many formulas. QIP 2012 — poster: The quantum query complexity of read-many formulas QIP 2013 — poster: Robust Quantum Process Characterization Beyond Fidelity to Clifford Unitaries QIP 2015 — poster: Oracles with Costs QIP 2016 — poster: Quantum vs Classical Proofs and Subset State Verification QIP 2016 — poster: Approximate Span Programs, Effective Resistance, and NAND Trees QIP 2016 — poster: Quantum Compressed Sensing Using 2-Designs QIP 2017 — poster: Span Programs, Formula Evaluation, and Graph Connectivity QIP 2017 — poster: Hamiltonian Simulation with Optimal Sample Complexity QIP 2018 — poster: Span Programs, Capacitance and Connectivity QIP 2019 — regular: Recovering quantum gates from few average gate fidelities QIP 2019 — poster: Quantum Algorithms for Connectivity and Related Problems Piedrafita QIP 2019 — poster: Quantum Algorithms for Path-Based Graph Structures TQC 2019 — regular: Applications of the quantum algorithm for st-connectivity QIP 2021 — poster: Leveraging Unknown Structure in Quantum Query Algorithms TQC 2021 — regular: Leveraging Unknown Structure in Quantum Query Algorithms ▸ presenter TQC 2021 — regular: Leveraging Unknown Structure in Quantum Query Algorithms ▸ presenter QIP 2023 — poster: Quantum Algorithm for Path-Edge Sampling QIP 2024 — poster: Robust and Space-Efficient Dual Adversary Quantum Query Algorithms QIP 2026 — poster: Glitchy Period Finding ▸ presenter TQC 2017 — program · member QIP 2018 — program · member TQC 2019 — program · member TQC 2020 — program · member QIP 2022 — program · member TQC 2024 — program · member QIP 2025 — program · member TQC 2025 — steering · member TQC 2026 — steering · member

QIP   QCrypt   TQC   talk   poster   presenter   award   ·   program  steering  organizing  ·  filled = chair

3 Talks

Title Conference Type Co-authors
Leveraging Unknown Structure in Quantum Query Algorithms TQC 2021 regular ▸ presenter Noel Anderson, Jay-U Chung
Recovering quantum gates from few average gate fidelities QIP 2019 regular Ingo Roth, Richard Kueng, Yi-Kai Liu, David Gross, Jens Eisert, Martin Kliesch
Applications of the quantum algorithm for st-connectivity TQC 2019 regular Kai DeLorenzo, Raylen Witter

17 Posters

Title Conference Co-authors
Glitchy Period Finding QIP 2026 Shingo Kodama, Alex Laakmann
Robust and Space-Efficient Dual Adversary Quantum Query Algorithms QIP 2024 Michael Czekanski, Raylen Witter
Quantum Algorithm for Path-Edge Sampling QIP 2023 Stacey Jeffery, Alvaro Piedrafita
Leveraging Unknown Structure in Quantum Query Algorithms QIP 2021 Noel Anderson, Jay-U Chung
Quantum Algorithms for Connectivity and Related Problems Piedrafita QIP 2019 Michael Jarret, Stacey Jeffery, Alvaro
Quantum Algorithms for Path-Based Graph Structures QIP 2019 Kai DeLorenzo, Teal Witter
Span Programs, Capacitance and Connectivity QIP 2018 Michael Jarret, Stacey Jeffery, Alvaro Piedrafita
Span Programs, Formula Evaluation, and Graph Connectivity QIP 2017 Stacey Jeffery
Hamiltonian Simulation with Optimal Sample Complexity QIP 2017 Cedric Yen-Yu Lin, Guang Hao Low, Maris Ozols, Theodore Yoder
Quantum vs Classical Proofs and Subset State Verification QIP 2016 Bill Fefferman
Approximate Span Programs, Effective Resistance, and NAND Trees
QIP 2016 Tsuyoshi Ito, Stacey Jeffery
Quantum Compressed Sensing Using 2-Designs
QIP 2016 Yi-Kai Liu
Oracles with Costs QIP 2015 Cedric Yen-Yu Lin, Han-Hsuan Lin
Robust Quantum Process Characterization Beyond Fidelity to Clifford Unitaries QIP 2013 Marcus P. Da Silva
The quantum query complexity of read-many formulas. QIP 2012 Andrew Childs, Robin Kothari
The quantum query complexity of read-many formulas QIP 2012 Andrew Childs, Robin Kothari
Super-polynomial quantum speed-ups for Boolean evaluation trees with hidden structure QIP 2011 Bohua Zhan, Avinatan Hassidim

Committee service

Conference Committee Position Title
TQC 2026 steering member
QIP 2025 program member
TQC 2025 steering member
TQC 2024 program member
QIP 2022 program member
TQC 2020 program member
TQC 2019 program member
QIP 2018 program member
TQC 2017 program member

Collaborators

Co-author Joint talks
Stacey Jeffery 5
Alvaro Piedrafita 2
Andrew Childs 2
Cedric Yen-Yu Lin 2
Jay-U Chung 2
Kai DeLorenzo 2
Michael Jarret 2
Noel Anderson 2
Raylen Witter 2
Robin Kothari 2
Yi-Kai Liu 2
Alex Laakmann 1
Alvaro 1
Avinatan Hassidim 1
Bill Fefferman 1
Bohua Zhan 1
David Gross 1
Guang Hao Low 1
Han-Hsuan Lin 1
Ingo Roth 1