12 citations · 16 across the 6 of their papers we have counts for
6 papers
Instance-specific linear relaxations of semidefinite optimization problems
Daniel de Roux, Robert Carr, R. Ravi
We introduce a generic technique to obtain linear relaxations of semidefinite programs with provable guarantees based on the commutativity of the constraint and the objective matri…
A New Integer Programming Formulation of the Graphical Traveling Salesman Problem
Robert D. Carr, Neil Simonetti
In the Traveling Salesman Problem (TSP), a salesman wants to visit a set of cities and return home. There is a cost of traveling from city to city , which is the sa…
Fractional Decomposition Tree Algorithm: A tool for studying the integrality gap of Integer Programs
Robert D. Carr, Arash Haddadan, Cynthia A. Phillips
We present a new algorithm, Fractional Decomposition Tree (FDT) for finding a feasible solution for an integer program (IP) where all variables are binary. FDT runs in polynomial t…
Symmetric Linear Programming Formulations for Minimum Cut with Applications to TSP
Robert D. Carr, Jennifer Iglesias, Giuseppe Lanciac +1
We introduce multiple symmetric LP relaxations for minimum cut problems. The relaxations give optimal and approximate solutions when the input is a Hamiltonian cycle. We show that…
Implications of Electronics Constraints for Solid-State Quantum Error Correction and Quantum Circuit Failure Probability
James E. Levy, Malcolm S. Carroll, Anand Ganti +6
In this paper we present the impact of classical electronics constraints on a solid-state quantum dot logical qubit architecture. Constraints due to routing density, bandwidth allo…
The impact of classical electronics constraints on a solid-state logical qubit memory
James E. Levy, Anand Ganti, Cynthia A. Phillips +5
We describe a fault-tolerant memory for an error-corrected logical qubit based on silicon double quantum dot physical qubits. Our design accounts for constraints imposed by support…