44 citations · 218 across the 42 of their papers we have counts for
13 papers · 1 filter
Linear-Time T-Gate Optimization via Random Abstraction
Aws Albarghouthi
Quantum computers promise exponential speedups for problems in cryptography, chemistry, and optimization. Realizing this promise requires fault tolerance: physical qubits are noisy…
Analyzing Decoders for Quantum Error Correction
Abtin Molavi, Feras Saad, Aws Albarghouthi
Quantum error correction (QEC) enables reliable computation on noisy hardware by encoding logical information across many physical qubits and periodically measuring parities to det…
Generating Compilers for Qubit Mapping and Routing
Abtin Molavi, Amanda Xu, Ethan Cecchetti +2
To evaluate a quantum circuit on a quantum processor, one must find a mapping from circuit qubits to processor qubits and plan the instruction execution while satisfying the proces…
Optimizing Quantum Circuits, Fast and Slow
Amanda Xu, Abtin Molavi, Swamit Tannu +1
Optimizing quantum circuits is critical: the number of quantum operations needs to be minimized for a successful evaluation of a circuit on a quantum processor. In this paper we un…
Synthesizing Quantum-Circuit Optimizers
Amanda Xu, Abtin Molavi, Lauren Pick +2
Near-term quantum computers are expected to work in an environment where each operation is noisy, with no error correction. Therefore, quantum-circuit optimizers are applied to min…
Proving Data-Poisoning Robustness in Decision Trees
Samuel Drews, Aws Albarghouthi, Loris D'Antoni
Machine learning models are brittle, and small changes in the training data can result in different predictions. We study the problem of proving that a prediction is robust to data…
Efficient Synthesis with Probabilistic Constraints
Samuel Drews, Aws Albarghouthi, Loris D'Antoni
We consider the problem of synthesizing a program given a probabilistic specification of its desired behavior. Specifically, we study the recent paradigm of distribution-guided ind…
Trace Abstraction Modulo Probability
Calvin Smith, Justin Hsu, Aws Albarghouthi
We propose trace abstraction modulo probability, a proof technique for verifying high-probability accuracy guarantees of probabilistic programs. Our proofs overapproximate the set…
Neural-Augmented Static Analysis of Android Communication
Jinman Zhao, Aws Albarghouthi, Vaibhav Rastogi +2
We address the problem of discovering communication links between applications in the popular Android mobile operating system, an important problem for security and privacy in Andr…
Constraint-Based Synthesis of Coupling Proofs
Aws Albarghouthi, Justin Hsu
Proof by coupling is a classical technique for proving properties about pairs of randomized algorithms by carefully relating (or coupling) two probabilistic executions. In this pap…
Synthesizing Coupling Proofs of Differential Privacy
Aws Albarghouthi, Justin Hsu
Differential privacy has emerged as a promising probabilistic formulation of privacy, generating intense interest within academia and industry. We present a push-button, automated…
Quantifying Program Bias
Aws Albarghouthi, Loris D'Antoni, Samuel Drews +1
With the range and sensitivity of algorithmic decisions expanding at a break-neck speed, it is imperative that we aggressively investigate whether programs are biased. We propose a…
Fairness as a Program Property
Aws Albarghouthi, Loris D'Antoni, Samuel Drews +1
We explore the following question: Is a decision-making program fair, for some useful definition of fairness? First, we describe how several algorithmic fairness questions can be p…