768 citations · 3.1k across the 44 of their papers we have counts for
23 papers · 1 filter
Design and execution of quantum circuits using tens of superconducting qubits and thousands of gates for dense Ising optimization problems
Filip B. Maciejewski, Stuart Hadfield, Benjamin Hall +13
We develop a hardware-efficient ansatz for variational optimization, derived from existing ansatze in the literature, that parametrizes subsets of all interactions in the Cost Hami…
Quantum-Enhanced Greedy Combinatorial Optimization Solver
Maxime Dupont, Bram Evert, Mark J. Hodson +13
Combinatorial optimization is a broadly attractive area for potential quantum advantage, but no quantum algorithm has yet made the leap. Noise in quantum hardware remains a challen…
Quantum computing hardware for HEP algorithms and sensing
M. Sohaib Alam, Sergey Belomestnykh, Nicholas Bornman +37
Quantum information science harnesses the principles of quantum mechanics to realize computational algorithms with complexities vastly intractable by current computer platforms. Ty…
Numerical Gate Synthesis for Quantum Heuristics on Bosonic Quantum Processors
A. Barış Özgüler, Davide Venturelli
There is a recent surge of interest and insights regarding the interplay of quantum optimal control and variational quantum algorithms. We study the framework in the context of qud…
Mixer-Phaser Ansätze for Quantum Optimization with Hard Constraints
Ryan LaRose, Eleanor Rieffel, Davide Venturelli
We introduce multiple parametrized circuit ansätze and present the results of a numerical study comparing their performance with a standard Quantum Alternating Operator Ansatz appr…
Practical Verification of Quantum Properties in Quantum Approximate Optimization Runs
M. Sohaib Alam, Filip A. Wudarski, Matthew J. Reagor +7
In order to assess whether quantum resources can provide an advantage over classical computation, it is necessary to characterize and benchmark the non-classical properties of quan…
Entanglement Across Separate Silicon Dies in a Modular Superconducting Qubit Device
Alysson Gold, JP Paquette, Anna Stockklauser +15
Assembling future large-scale quantum computers out of smaller, specialized modules promises to simplify a number of formidable science and engineering challenges. One of the prima…
Quantum Integer Programming (QuIP) 47-779: Lecture Notes
David E. Bernal, Sridhar Tayur, Davide Venturelli
This lecture series on Quantum Integer Programming (QuIP) -- created by Professor Sridhar Tayur, David E. Bernal, and Dr. Davide Venturelli, a collaboration between CMU and USRA, w…
Quantum annealing speedup of embedded problems via suppression of Griffiths singularities
Sergey Knysh, Eugeniu Plamadeala, Davide Venturelli
Optimal parameter setting for applications problems embedded into hardware graphs is key to practical quantum annealers (QA). Embedding chains typically crop up as harmful Griffith…
Planning for Compilation of a Quantum Algorithm for Graph Coloring
Minh Do, Zhihui Wang, Bryan O'Gorman +3
The problem of compiling general quantum algorithms for implementation on near-term quantum processors has been introduced to the AI community. Previous work demonstrated that temp…
Integer programming techniques for minor-embedding in quantum annealers
David E. Bernal, Kyle E. C. Booth, Raouf Dridi +3
A major limitation of current generations of quantum annealers is the sparse connectivity of manufactured qubits in the hardware graph. This technological limitation generated cons…
From Ansätze to Z-gates: a NASA View of Quantum Computing
Eleanor G. Rieffel, Stuart Hadfield, Tad Hogg +12
For the last few years, the NASA Quantum Artificial Intelligence Laboratory (QuAIL) has been performing research to assess the potential impact of quantum computers on challenging…
Reverse Quantum Annealing Approach to Portfolio Optimization Problems
Davide Venturelli, Alexei Kondratyev
We investigate a hybrid quantum-classical solution method to the mean-variance portfolio optimization problems. Starting from real financial data statistics and following the princ…
Power of Pausing: Advancing Understanding of Thermalization in Experimental Quantum Annealers
Jeffrey Marshall, Davide Venturelli, Itay Hen +1
We investigate alternative annealing schedules on the current generation of quantum annealing hardware (the D-Wave 2000Q), which includes the use of forward and reverse annealing w…
Experimental investigation of performance differences between Coherent Ising Machines and a quantum annealer
Ryan Hamerly, Takahiro Inagaki, Peter L. McMahon +20
Physical annealing systems provide heuristic approaches to solving NP-hard Ising optimization problems. Here, we study the performance of two types of annealing machines--a commerc…
Comparing and Integrating Constraint Programming and Temporal Planning for Quantum Circuit Compilation
Kyle E. C. Booth, Minh Do, J. Christopher Beck +3
Recently, the makespan-minimization problem of compiling a general class of quantum algorithms into near-term quantum processors has been introduced to the AI community. The resear…
Quantum Annealing Applied to De-Conflicting Optimal Trajectories for Air Traffic Management
Tobias Stollenwerk, Bryan O'Gorman, Davide Venturelli +6
We present the mapping of a class of simplified air traffic management (ATM) problems (strategic conflict resolution) to quadratic unconstrained boolean optimization (QUBO) problem…
From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz
Stuart Hadfield, Zhihui Wang, Bryan O'Gorman +3
The next few years will be exciting as prototype universal quantum processors emerge, enabling implementation of a wider variety of algorithms. Of particular interest are quantum h…
Compiling quantum circuits to realistic hardware architectures using temporal planners
Davide Venturelli, Minh Do, Eleanor Rieffel +1
To run quantum algorithms on emerging gate-model quantum hardware, quantum circuits must be compiled to take into account constraints on the hardware. For near-term hardware, with…
A NASA Perspective on Quantum Computing: Opportunities and Challenges
Rupak Biswas, Zhang Jiang, Kostya Kechezhi +10
In the last couple of decades, the world has seen several stunning instances of quantum algorithms that provably outperform the best classical algorithms. For most problems, howeve…
Quantum annealing via environment-mediated quantum diffusion
Vadim N. Smelyanskiy, Davide Venturelli, Alejandro Perdomo-Ortiz +2
We show that quantum diffusion near the quantum critical point can provide a highly very efficient mechanism of open-system quantum annealing. It is based on the diffusion-mediated…
Quantum Annealing Implementation of Job-Shop Scheduling
Davide Venturelli, Dominic J. J. Marchand, Galo Rojo
A quantum annealing solver for the renowned job-shop scheduling problem (JSP) is presented in detail. After formulating the problem as a time-indexed quadratic unconstrained binary…
A case study in programming a quantum annealer for hard operational planning problems
Eleanor G. Rieffel, Davide Venturelli, Bryan O'Gorman +3
We report on a case study in programming an early quantum annealer to attack optimization problems related to operational planning. While a number of studies have looked at the per…