247 citations · 830 across the 24 of their papers we have counts for
6 papers · 2 filters
NAND-Trees, Average Choice Complexity, and Effective Resistance
Stacey Jeffery, Shelby Kimmel
We show that the quantum query complexity of evaluating NAND-tree instances with average choice complexity at most is , where average choice complexity is a measure of th…
Phase Retrieval Using Unitary 2-Designs
Shelby Kimmel, Yi-Kai Liu
We consider a variant of the phase retrieval problem, where vectors are replaced by unitary matrices, i.e., the unknown signal is a unitary matrix U, and the measurements consist o…
Quantum vs Classical Proofs and Subset Verification
Bill Fefferman, Shelby Kimmel
We study the ability of efficient quantum verifiers to decide properties of exponentially large subsets given either a classical or quantum witness. We develop a general framework…
Demonstration of Robust Quantum Gate Tomography via Randomized Benchmarking
Blake R. Johnson, Marcus P. da Silva, Colm A. Ryan +3
Typical quantum gate tomography protocols struggle with a self-consistency problem: the gate operation cannot be reconstructed without knowledge of the initial state and final meas…
Robust Calibration of a Universal Single-Qubit Gate-Set via Robust Phase Estimation
Shelby Kimmel, Guang Hao Low, Theodore J. Yoder
An important step in building a quantum computer is calibrating experimentally implemented quantum gates to produce operations that are close to ideal unitaries. The calibration st…
Oracles with Costs
Shelby Kimmel, Cedric Yen-Yu Lin, Han-Hsuan Lin
While powerful tools have been developed to analyze quantum query complexity, there are still many natural problems that do not fit neatly into the black box model of oracles. We c…