10 citations · 45 across the 13 of their papers we have counts for
15 papers
Optimal Entanglement Distillation Policies for Quantum Switches
Vivek Kumar, Nitish K. Chandra, Kaushik P. Seshadreesan +2
In an entanglement distribution network, the function of a quantum switch is to generate elementary entanglement with its clients followed by entanglement swapping to distribute en…
Unital Qubit Queue-channels: Classical Capacity and Product Decoding
Vikesh Siddhu, Avhishek Chatterjee, Krishna Jagannathan +2
Quantum queue-channels arise naturally in the context of buffering in quantum networks, wherein the noise suffered by the quantum states depends on the time spent waiting in the bu…
Queue-Channel Capacities with Generalized Amplitude Damping
Vikesh Siddhu, Avhishek Chatterjee, Krishna Jagannathan +2
The generalized amplitude damping channel (GADC) is considered an important model for quantum communications, especially over optical networks. We make two salient contributions in…
Greedy Approximation Algorithms for Active Sequential Hypothesis Testing
Kyra Gan, Su Jia, Andrew Li
In the problem of active sequential hypothesis testing (ASHT), a learner seeks to identify the true hypothesis from among a known set of hypotheses. The learner is given a set of a…
Quantum Integer Programming (QuIP) 47-779: Lecture Notes
David E. Bernal, Sridhar Tayur, Davide Venturelli
This lecture series on Quantum Integer Programming (QuIP) -- created by Professor Sridhar Tayur, David E. Bernal, and Dr. Davide Venturelli, a collaboration between CMU and USRA, w…
Causal Inference With Selectively Deconfounded Data
Kyra Gan, Andrew A. Li, Zachary C. Lipton +1
Given only data generated by a standard confounding graph with unobserved confounder, the Average Treatment Effect (ATE) is not identifiable. To estimate the ATE, a practitioner mu…
Integer programming techniques for minor-embedding in quantum annealers
David E. Bernal, Kyle E. C. Booth, Raouf Dridi +3
A major limitation of current generations of quantum annealers is the sparse connectivity of manufactured qubits in the hardware graph. This technological limitation generated cons…
The Topology of Mutated Driver Pathways
Raouf Dridi, Hedayat Alghassi, Maen Obeidat +1
Much progress has been made, and continues to be made, towards identifying candidate mutated driver pathways in cancer. However, no systematic approach to understanding how candida…
GAMA: A Novel Algorithm for Non-Convex Integer Programs
Hedayat Alghassi, Raouf Dridi, Sridhar Tayur
Inspired by the decomposition in the hybrid quantum-classical optimization algorithm we introduced in arXiv:1902.04215, we propose here a new (fully classical) approach to solving…
Knuth-Bendix Completion Algorithm and Shuffle Algebras For Compiling NISQ Circuits
Raouf Dridi, Hedayat Alghassi, Sridhar Tayur
Compiling quantum circuits lends itself to an elegant formulation in the language of rewriting systems on non commutative polynomial algebras . The alpha…
Minimizing polynomial functions on quantum computers
Raouf Dridi, Hedayat Alghassi, Sridhar Tayur
This expository paper reviews some of the recent uses of computational algebraic geometry in classical and quantum optimization. The paper assumes an elementary background in algeb…
Enhancing the efficiency of adiabatic quantum computations
Raouf Dridi, Hedayat Alghassi, Sridhar Tayur
We describe a general methodology for enhancing the efficiency of adiabatic quantum computations (AQC). It consists of homotopically deforming the original "Hamiltonian surface" in…
Graver Bases via Quantum Annealing with Application to Non-Linear Integer Programs
Hedayat Alghassi, Raouf Dridi, Sridhar Tayur
We propose a novel hybrid quantum-classical approach to calculate Graver bases, which have the potential to solve a variety of hard linear and non-linear integer programs, as they…
Homological Description of the Quantum Adiabatic Evolution With a View Toward Quantum Computations
Raouf Dridi, Hedayat Alghassi, Sridhar Tayur
We import the tools of Morse theory to study quantum adiabatic evolution, the core mechanism in adiabatic quantum computations (AQC). AQC is computationally equivalent to the (pre-…
A Novel Algebraic Geometry Compiling Framework for Adiabatic Quantum Computations
Raouf Dridi, Hedayat Alghassi, Sridhar Tayur
Adiabatic Quantum Computing (AQC) is an attractive paradigm for solving hard integer polynomial optimization problems. Available hardware restricts the Hamiltonians to be of a stru…