1.3k citations · 2.1k across the 35 of their papers we have counts for
4 papers · 2 filters
The T-Complexity Costs of Error Correction for Control Flow in Quantum Computation
Charles Yuan, Michael Carbin
Numerous quantum algorithms require the use of quantum error correction to overcome the intrinsic unreliability of physical qubits. However, error correction imposes a unique perfo…
Turaco: Complexity-Guided Data Sampling for Training Neural Surrogates of Programs
Alex Renda, Yi Ding, Michael Carbin
Programmers and researchers are increasingly developing surrogates of programs, models of a subset of the observable behavior of a given program, to solve a variety of software dev…
Verifying Performance Properties of Probabilistic Inference
Eric Atkinson, Ellie Y. Cheng, Guillaume Baudart +2
In this extended abstract, we discuss the opportunity to formally verify that inference systems for probabilistic programming guarantee good performance. In particular, we focus on…
Quantum Control Machine: The Limits of Control Flow in Quantum Programming
Charles Yuan, Agnes Villanyi, Michael Carbin
Quantum algorithms for tasks such as factorization, search, and simulation rely on control flow such as branching and iteration that depends on the value of data in superposition.…