most citedGrover Adaptive Search for Constrained Polynomial Binary Optimization

157 citations · 187 across the 5 of their papers we have counts for

collaborators

5 papers

quant-ph2020★ 1 cited

Optimizing Quantum Search with a Binomial Version of Grover's Algorithm

Austin Gilliam, Marco Pistoia, Constantin Gonciulea

Amplitude Amplification -- a key component of Grover's Search algorithm -- uses an iterative approach to systematically increase the probability of one or multiple target states. W…

quant-ph2020★ 4 cited

Canonical Construction of Quantum Oracles

Austin Gilliam, Marco Pistoia, Constantin Gonciulea

Selecting a set of basis states is a common task in quantum computing, in order to increase and/or evaluate their probabilities. This is similar to designing WHERE clauses in class…

quant-ph2020★ 17 cited

Optimizing Quantum Search Using a Generalized Version of Grover's Algorithm

Austin Gilliam, Marco Pistoia, Constantin Gonciulea

Grover's Search algorithm was a breakthrough at the time it was introduced, and its underlying procedure of amplitude amplification has been a building block of many other algorith…

quant-ph2019★ 157 cited

Grover Adaptive Search for Constrained Polynomial Binary Optimization

Austin Gilliam, Stefan Woerner, Constantin Gonciulea

In this paper we discuss Grover Adaptive Search (GAS) for Constrained Polynomial Binary Optimization (CPBO) problems, and in particular, Quadratic Unconstrained Binary Optimization…

quant-ph2019★ 8 cited

Foundational Patterns for Efficient Quantum Computing

Austin Gilliam, Charlene Venci, Sreraman Muralidharan +4

We present a number of quantum computing patterns that build on top of fundamental algorithms, that can be applied to solving concrete, NP-hard problems. In particular, we introduc…