The following pages link to Travis S. Humble (Q1654154):
Displaying 13 items.
- Optimizing adiabatic quantum program compilation using a graph-theoretic framework (Q1654155) (← links)
- Quantum games: a review of the history, current state, and interpretation (Q1994770) (← links)
- Empirical performance bounds for quantum approximate optimization (Q2099650) (← links)
- Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets (Q2412632) (← links)
- Adiabatic quantum programming: minor embedding with hard faults (Q2454228) (← links)
- Impact of graph structures for QAOA on maxcut (Q2685581) (← links)
- Lower bounds on circuit depth of the quantum approximate optimization algorithm (Q2687096) (← links)
- Simultaneous teleportation of multiple single-photon degrees of freedom (Q3019662) (← links)
- Solving MaxCut with quantum imaginary time evolution (Q6171442) (← links)
- No fixed-point guarantee of Nash equilibrium in quantum games (Q6277967) (← links)
- Nash embedding and equilibrium in pure quantum states (Q6296091) (← links)
- Lower Bounds on Circuit Depth of the Quantum Approximate Optimization Algorithm (Q6346500) (← links)
- Graph decomposition techniques for solving combinatorial optimization problems with variational quantum algorithms (Q6438813) (← links)
