7 papers
Faster Algorithms for Multimarginal Optimal Transport
Brandon Augustino, Yue Sun, Atithi Acharya +4
We study algorithms for approximating the multimarginal optimal transport (MOT) distance, a generalization of the classic optimal transport distance, between discrete probabili…
qReduMIS: A Quantum-Informed Reduction Algorithm for the Maximum Independent Set Problem
Martin J. A. Schuetz, Romina Yalovetzky, Ruben S. Andrist +8
We propose and implement a quantum-informed reduction algorithm for the maximum independent set problem that integrates classical kernelization techniques with information extracte…
Reading Qubits with Sequential Weak Measurements: Limits of Information Extraction
Cesar Lema, Aleix Bou-Comas, Atithi Acharya +2
Quantum information processing and computation requires high accuracy qubit configuration readout. In many practical schemes, the initial qubit configuration has to be inferred fro…
Quantum Speedups for Group Relaxations of Integer Linear Programs
Brandon Augustino, Dylan Herman, Guneykan Ozgul +5
Integer Linear Programs (ILPs) are a flexible and ubiquitous model for discrete optimization problems. Solving ILPs is \textsf{NP-Hard} yet of great practical importance. Super-qua…
Tensor networks for quantum computing
Aleksandr Berezutskii, Minzhao Liu, Atithi Acharya +25
In the rapidly evolving field of quantum computing, tensor networks serve as an important tool due to their multifaceted utility. In this paper, we review the diverse applications…
Certified randomness using a trapped-ion quantum processor
Minzhao Liu, Ruslan Shaydulin, Pradeep Niroula +29
While quantum computers have the potential to perform a wide range of practically important tasks beyond the capabilities of classical computers, realizing this potential remains a…