63 citations · 63 across the 2 of their papers we have counts for
3 papers
cs.CC2019
Lower Bounds for Approximate Counting
William Kretschmer
We prove a query complexity lower bound for protocols that solve approximate counting: estimating the size of a set given a membership oracle. This gives rise to an…
quant-ph2019★ 63 cited
Simulation of Qubit Quantum Circuits via Pauli Propagation
Patrick Rall, Daniel Liang, Jeremy Cook +1
We present novel algorithms to estimate outcomes for qubit quantum circuits. Notably, these methods can simulate a Clifford circuit in linear time without ever writing down stabili…
cs.AI2016
Structured Factored Inference: A Framework for Automated Reasoning in Probabilistic Programming Languages
Avi Pfeffer, Brian Ruttenberg, William Kretschmer
Reasoning on large and complex real-world models is a computationally difficult task, yet one that is required for effective use of many AI applications. A plethora of inference al…