7.2k citations · 9.1k across the 86 of their papers we have counts for
8 papers · 1 filter
Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets
Kathleen E. Hamilton, Travis S. Humble
Using quantum annealing to solve an optimization problem requires minor embeddings of a logic graph into a known hardware graph. In an effort to reduce the complexity of the minor…
Superdense coding over optical fiber links with complete Bell-state measurements
Brian P. Williams, Ronald J. Sadlier, Travis S. Humble
Adopting quantum communication to modern networking requires transmitting quantum information through fiber-based infrastructure. We report the first demonstration of superdense co…
No fixed-point guarantee of Nash equilibrium in quantum games
Faisal Shah Khan, Travis S. Humble
The theory of quantum games permits players to choose strategies that prepare and measure quantum states. Whereas conventional game theory provides guarantees for fixed-point stabi…
A Computational Workflow for Designing Silicon Donor Qubits
Travis S. Humble, M. Nance Ericson, Jacek Jakowski +6
Developing devices that can reliably and accurately demonstrate the principles of superposition and entanglement is an on-going challenge for the quantum computing community. Model…
Performance Models for Split-execution Computing Systems
Travis S. Humble, Alexander J. McCaskey, Jonathan Schrock +3
Split-execution computing leverages the capabilities of multiple computational models to solve problems, but splitting program execution across different computational models incur…
Discrimination of correlated and entangling quantum channels with selective process tomography
Eugene Dumitrescu, Travis S. Humble
The accurate and reliable characterization of quantum dynamical processes underlies efforts to validate quantum technologies, where discrimination between competing models of obser…