471 citations · 1.3k across the 58 of their papers we have counts for
24 papers · 1 filter
Quantum Alternating Operator Ansatz (QAOA) beyond low depth with gradually changing unitaries
Vladimir Kremenetski, Anuj Apte, Tad Hogg +2
The Quantum Approximate Optimization Algorithm and its generalization to Quantum Alternating Operator Ansatz (QAOA) is a promising approach for applying quantum computers to challe…
A Parameter Setting Heuristic for the Quantum Alternating Operator Ansatz
James Sud, Stuart Hadfield, Eleanor Rieffel +2
Parameterized quantum circuits are widely studied approaches for tackling optimization problems. A prominent example is the Quantum Alternating Operator Ansatz (QAOA), an approach…
Quantum Alternating Operator Ansatz (QAOA) Phase Diagrams and Applications for Quantum Chemistry
Vladimir Kremenetski, Tad Hogg, Stuart Hadfield +2
Determining Hamiltonian ground states and energies is a challenging task with many possible approaches on quantum computers. While variational quantum eigensolvers are popular appr…
Analytical Framework for Quantum Alternating Operator Ansätze
Stuart Hadfield, Tad Hogg, Eleanor G. Rieffel
We develop a framework for analyzing layered quantum algorithms such as quantum alternating operator ansätze. Our framework relates quantum cost gradient operators, derived from th…
Classical symmetries and the Quantum Approximate Optimization Algorithm
Ruslan Shaydulin, Stuart Hadfield, Tad Hogg +1
We study the relationship between the Quantum Approximate Optimization Algorithm (QAOA) and the underlying symmetries of the objective function to be optimized. Our approach formal…
Characterizing local noise in QAOA circuits
Jeffrey Marshall, Filip Wudarski, Stuart Hadfield +1
Recently Xue et al. [arXiv:1909.02196] demonstrated numerically that QAOA performance varies as a power law in the amount of noise under certain physical noise models. In this shor…
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…
Private Database Queries Using Quantum States with Limited Coherence Times
Tad Hogg, Li Zhang
We describe a method for private database queries using exchange of quantum states with bits encoded in mutually incompatible bases. For technology with limited coherence time, the…
Experiments with Probabilistic Quantum Auctions
Kay-Yut Chen, Tad Hogg
We describe human-subject laboratory experiments on probabilistic auctions based on previously proposed auction protocols involving the simulated manipulation and communication of…
Quantum Auctions using Adiabatic Evolution: The Corrupt Auctioneer and Circuit Implementations
Saikat Guha, Tad Hogg, David Fattal +2
We examine a proposed auction using quantum states to represent bids and distributed adiabatic search to find the winner. When the auctioneer follows the protocol, the final measur…
Quantum Auctions
Tad Hogg, Pavithra Harsha, Kay-Yut Chen
We present a quantum auction protocol using superpositions to represent bids and distributed search to identify the winner(s). Measuring the final quantum state gives the auction o…
Quantum Solution of Coordination Problems
Bernardo A. Huberman, Tad Hogg
We present a quantum solution to coordination problems that can be implemented with present technologies. It provides an alternative to existing approaches, which rely on explicit…
Experimental implementation of an adiabatic quantum optimization algorithm
Matthias Steffen, Wim van Dam, Tad Hogg +2
We report the realization of a nuclear magnetic resonance computer with three quantum bits that simulates an adiabatic quantum optimization algorithm. Adiabatic quantum algorithms…
A Practical Quantum Mechanism for the Public Goods Game
Kay-Yut Chen, Tad Hogg, Raymond Beausoleil
Quantum generalizations of conventional games broaden the range of available strategies, which can help improve outcomes for the participants. With many players, such quantum games…
Adiabatic Quantum Computing for Random Satisfiability Problems
Tad Hogg
The discrete formulation of adiabatic quantum computing is compared with other search methods, classical and quantum, for random satisfiability (SAT) problems. With the number of s…
Solving Random Satisfiability Problems with Quantum Computers
Tad Hogg
Quantum computer algorithms can exploit the structure of random satisfiability problems. This paper extends a previous empirical evaluation of such an algorithm and gives an approx…
Quantum Optimization
Tad Hogg, Dmitriy Portnov
We present a quantum algorithm for combinatorial optimization using the cost structure of the search states. Its behavior is illustrated for overconstrained satisfiability and asym…
Tools for Quantum Algorithms
Tad Hogg, Carlos Mochon, Wolfgang Polak +1
We present efficient implementations of a number of operations for quantum computers. These include controlled phase adjustments of the amplitudes in a superposition, permutations,…
Single-Step Quantum Search Using Problem Structure
Tad Hogg
The structure of satisfiability problems is used to improve search algorithms for quantum computers and reduce their required coherence times by using only a single coherent evalua…
Local Search Methods for Quantum Computers
Tad Hogg, Mehmet Yanik
Local search algorithms use the neighborhood relations among search states and often perform well for a variety of NP-hard combinatorial search problems. This paper shows how quant…
A Framework for Structured Quantum Search
Tad Hogg
A quantum algorithm for general combinatorial search that uses the underlying structure of the search space to increase the probability of finding a solution is presented. This alg…
Quantum Smart Matter
Tad Hogg, J. Geoffrey Chase
The development of small-scale sensors and actuators enables the construction of smart matter in which physical properties of materials are controlled in a distributed manner. In t…
A Framework for Quantum Search Heuristics
Tad Hogg
A quantum algorithm for combinatorial search is presented that provides a simple framework for utilizing search heuristics. The algorithm is evaluated in a new case that is an unst…
Quantum Computing and Phase Transitions in Combinatorial Search
Tad Hogg
We introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on aver…