#### Filter Results:

- Full text PDF available (6)

#### Publication Year

2014

2017

- This year (4)
- Last 5 years (11)
- Last 10 years (11)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Eleanor G. Rieffel, Davide Venturelli, Bryan O'Gorman, Minh Do, Elicia M. Prystay, Vadim Smelyanskiy
- Quantum Information Processing
- 2015

- Davide Venturelli, Minh Do, Eleanor G. Rieffel, Jeremy Frank
- ArXiv
- 2017

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 only limited means to mitigate decoherence, it is critical to minimize the duration of the circuit. We investigate the application of temporal planners to the problem of compiling… (More)

- Eleanor G. Rieffel, Davide Venturelli, Minh Do, Itay Hen, Jeremy Frank
- AAAI
- 2014

There are two complementary ways to evaluate planning algorithms: performance on benchmark problems derived from real applications and analysis of performance on parametrized families of problems with known properties. Prior to this work, few means of generating parametrized families of hard planning problems were known. We generate hard planning problems… (More)

- Vadim Smelyanskiy, Davide Venturelli, Alejandro Perdomo-Ortiz, Sergey Knysh, Mark I. Dykman
- Physical review letters
- 2017

We show that quantum diffusion near a quantum critical point can provide an efficient mechanism of quantum annealing. It is based on the diffusion-mediated recombination of excitations in open systems far from thermal equilibrium. We find that, for an Ising spin chain coupled to a bosonic bath and driven by a monotonically decreasing transverse field,… (More)

- Tony T. Tran, Minh Do, +5 authors J. Christopher Beck
- SOCS
- 2016

An effective approach to solving complex problems is to decompose them and integrate dedicated solvers for those subproblems. We introduce a hybrid decomposition that incorporates: (1) a quantum annealer that samples from the configuration space of a relaxed problem to obtain strong candidate solutions, and (2) a classical processor that maintains a global… (More)

- Tony T. Tran, Zhihui Wang, +5 authors J. Christopher Beck
- AAAI Workshop: Planning for Hybrid Systems
- 2016

One approach to solving planning problems is to compile them to another problem for which powerful off-the-shelf solvers are available; common targets include SAT, CSP, and MILP. Recently, a novel optimization technique has become available: quantum annealing (QA). QA takes as input problem instances encoded as Quadratic Unconstrained Binary Optimization… (More)

There are two common ways to evaluate algorithms: performance on benchmark problems derived from real applications and analysis of performance on parametrized families of problems. The two approaches complement each other, each having its advantages and disadvantages. The planning community has concentrated on the first approach, with few ways of generating… (More)

- Bryan O'Gorman, Eleanor G. Rieffel, Minh Do, Davide Venturelli, Jeremy Frank
- Knowledge Eng. Review
- 2016

- Davide Venturelli, Minh Do, Eleanor G. Rieffel, Jeremy Frank
- IJCAI
- 2017

We investigate the application of temporal planners to the problem of compiling quantum circuits to emerging quantum hardware. While our approach is general, we focus our initial experiments on Quantum Approximate Optimization Algorithm (QAOA) circuits that have few ordering constraints and thus allow highly parallel plans. We report on experiments using… (More)