7.2k citations · 9.1k across the 86 of their papers we have counts for
11 papers · 1 filter
Quantum annealing for systems of polynomial equations
Chia Cheng Chang, Arjun Gambhir, Travis S. Humble +1
Numerous scientific and engineering applications require numerically solving systems of equations. Classically solving a general set of polynomial equations requires iterative solv…
Quantum Circuit Designs of Integer Division Optimizing T-count and T-depth
Himanshu Thapliyal, Edgard Muñoz-Coreas, T. S. S. Varun +1
Quantum circuits for mathematical functions such as division are necessary to use quantum computers for scientific computing. Quantum circuits based on Clifford+T gates can easily…
Compiling Adiabatic Quantum Programs
Faisal Shah Khan, Nada Elsokkary, Travis S. Humble
We develop a non-cooperative game-theoretic model for the problem of graph minor-embedding to show that optimal compiling of adiabatic quantum programs in the sense of Nash equilib…
Validating Quantum-Classical Programming Models with Tensor Network Simulations
Alexander McCaskey, Eugene Dumitrescu, Mengsu Chen +2
The exploration of hybrid quantum-classical algorithms and programming models on noisy near-term quantum hardware has begun. As hybrid programs scale towards classical intractabili…
Benchmarking treewidth as a practical component of tensor-network--based quantum simulation
Eugene F. Dumitrescu, Allison L. Fisher, Timothy D. Goodrich +3
Tensor networks are powerful factorization techniques which reduce resource requirements for numerically simulating principal quantum many-body systems and algorithms. The computat…
Hybrid Programming for Near-term Quantum Computing Systems
Alexander McCaskey, Eugene Dumitrescu, Dmitry Liakh +1
Recent computations involving quantum processing units (QPUs) have demonstrated a series of challenges inherent to hybrid classical-quantum programming, compilation, execution, and…