7.2k citations · 9.1k across the 86 of their papers we have counts for
8 papers · 2 filters
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…
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…
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…
Quantum Computing Circuits and Devices
Travis S. Humble, Himanshu Thapliyal, Edgard Munoz-Coreas +2
The development of quantum computing technologies builds on the unique features of quantum physics while borrowing familiar principles from the design of conventional devices. We i…
Quantum Annealing for Prime Factorization
Shuxian Jiang, Keith A. Britt, Alexander J. McCaskey +2
We have developed a framework to convert an arbitrary integer factorization problem to an executable Ising model by first writing it as an optimization function and then transformi…