1 citations · 1 across the 1 of their papers we have counts for
4 papers
Parallel Spooky Pebbling Makes Regev Factoring More Practical
Gregory D. Kahanamoku-Meyer, Seyoon Ragavan, Katherine Van Kirk
Pebble games, an abstraction from classical reversible computing, have found use in the design of quantum circuits for inherently sequential tasks. Gidney showed that allowing Hada…
Learning topological states from randomized measurements using variational tensor network tomography
Yanting Teng, Rhine Samajdar, Katherine Van Kirk +5
Learning faithful representations of quantum states is crucial to fully characterizing the variety of many-body states created on quantum processors. While various tomographic meth…
Derandomized shallow shadows: Efficient Pauli learning with bounded-depth circuits
Katherine Van Kirk, Christian Kokail, Jonathan Kunjummen +7
Efficiently estimating large numbers of non-commuting observables is an important subroutine of many quantum science tasks. We present the derandomized shallow shadows (DSS) algori…
Strategies for running the QAOA at hundreds of qubits
Brandon Augustino, Madelyn Cain, Edward Farhi +5
We explore strategies aimed at reducing the amount of computation, both quantum and classical, required to run the Quantum Approximate Optimization Algorithm (QAOA). First, followi…