8 citations · 8 across the 1 of their papers we have counts for
8 papers · 1 filter
Leveraging Unknown Structure in Quantum Query Algorithms
Noel T. Anderson, Jay-U Chung, Shelby Kimmel
Quantum span program algorithms for function evaluation commonly have reduced query complexity when promised that the input has a certain structure. We design a modified span progr…
Consistency testing for robust phase estimation
Antonio E. Russo, William M. Kirby, Kenneth M. Rudinger +2
We present an extension to the robust phase estimation protocol, which can identify incorrect results that would otherwise lie outside the expected statistical range. Robust phase…
Quantum Computer Systems for Scientific Discovery
Yuri Alexeev, Dave Bacon, Kenneth R. Brown +21
The great promise of quantum computers comes with the dual challenges of building them and finding their useful applications. We argue that these two challenges should be considere…
Applications of the quantum algorithm for st-connectivity
Kai DeLorenzo, Shelby Kimmel, R. Teal Witter
We present quantum algorithms for various problems related to graph connectivity. We give simple and query-optimal algorithms for cycle detection and odd-length cycle detection (bi…
Quantum Algorithms for Connectivity and Related Problems
Michael Jarret, Stacey Jeffery, Shelby Kimmel +1
An important family of span programs, st-connectivity span programs, have been used to design quantum algorithms in various contexts, including a number of graph problems and formu…
Recovering quantum gates from few average gate fidelities
Ingo Roth, Richard Kueng, Shelby Kimmel +4
Characterising quantum processes is a key task in and constitutes a challenge for the development of quantum technologies, especially at the noisy intermediate scale of today's dev…