6 citations · 6 across the 7 of their papers we have counts for
8 papers
Scaling Local Solvers with the Many-Body Expansion
Federico Zahariev, Amr Sabry
We introduce a Many-Body Expansion framework for scaling black-box solvers for discrete optimization. The method decomposes a large problem into fragments, repeatedly improves each…
Half the Interference, Most of the Answer: Approximate Quantum Simulation via Path-Sum Pruning
Sinan Pehlivanoglu, Srinivasan Iyengar, Amr Sabry
Classical simulation of quantum circuits is expensive for two distinct reasons. The obvious one is state-space size: an n-qubit system requires exponentially many amplitudes. The l…
Qurator: Scheduling Hybrid Quantum-Classical Workflows Across Heterogeneous Cloud Providers
Sinan Pehlivanoglu, Ulrik de Muelenaere, Peter Kogge +1
We present Qurator, a quantum-classical task scheduler that jointly optimizes queue time and circuit fidelity across heterogeneous architectures. Qurator models hybrid workloads as…
Free Quantum Computing
Jacques Carette, Chris Heunen, Robin Kaarsgaard +2
Quantum computing improves substantially on known classical algorithms for various important problems, but the nature of the relationship between quantum and classical computing is…
A Verified Compiler for Quantum Simulation
Liyi Li, Fenfen An, Federico Zahariev +3
Hamiltonian simulation is a central application of quantum computing, with significant potential in modeling physical systems and solving complex optimization problems. Existing co…
Quantum Simulation Programming via Typing
Liyi Li, Federico Zahariev, Chandeepa Dissanayake +3
Quantum simulations are designed to model quantum systems, and many compilation frameworks have been developed for executing such simulations on quantum computers. Most compilers l…
Compositional Reversible Computation
Jacques Carette, Chris Heunen, Robin Kaarsgaard +1
Reversible computing is motivated by both pragmatic and foundational considerations arising from a variety of disciplines. We take a particular path through the development of reve…
With a Few Square Roots, Quantum Computing is as Easy as Π
Jacques Carette, Chris Heunen, Robin Kaarsgaard +1
Rig groupoids provide a semantic model of \PiLang, a universal classical reversible programming language over finite types. We prove that extending rig groupoids with just two maps…