Travis S. Humble

Available identifiers

Publication	Date of Publication	Type
Solving MaxCut with quantum imaginary time evolution	2023-08-11	Paper
Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms	2023-06-01	Paper
Lower bounds on circuit depth of the quantum approximate optimization algorithm	2023-03-01	Paper
Impact of graph structures for QAOA on maxcut	2023-02-22	Paper
Empirical performance bounds for quantum approximate optimization	2022-11-24	Paper
Lower Bounds on Circuit Depth of the Quantum Approximate Optimization Algorithm	2020-08-04	Paper
Quantum games: a review of the history, current state, and interpretation	2018-11-01	Paper
Optimizing adiabatic quantum program compilation using a graph-theoretic framework	2018-08-07	Paper
Nash embedding and equilibrium in pure quantum states	2018-01-06	Paper
Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets	2017-10-24	Paper
No fixed-point guarantee of Nash equilibrium in quantum games	2016-09-27	Paper
Adiabatic quantum programming: minor embedding with hard faults	2014-06-13	Paper
Simultaneous teleportation of multiple single-photon degrees of freedom	2011-07-28	Paper

This page was built for person: Travis S. Humble