57 citations · 116 across the 8 of their papers we have counts for
8 papers
Cosm: orchestrated collective dynamics give rise to rapid computational search at the solution frontier
Kenneth M. Zick, Nikhil Shukla, Alexander Marakov
We introduce Collective Switched Motion (Cosm), a heuristic optimization framework based on orchestrated collective dynamics. Cosm organizes the objective into conflict-minimized s…
Performance report of heuristic algorithm that cracked the largest Gset Ising problems (G81 cut=14060)
Kenneth M. Zick
For the past 25 years, the Gset benchmark problems have challenged all manner of Ising and Max-Cut solvers. The largest of these problems have remained unsolved by any heuristic al…
Improved Sparse Ising Optimization
Kenneth M. Zick
Sparse Ising problems can be found in application areas such as logistics, condensed matter physics and training of deep Boltzmann networks, but can be very difficult to tackle wit…
Dissipative Landau-Zener tunneling in the crossover regime from weak to strong environment coupling
X. Dai, R. Trappen, H. Chen +22
Landau-Zener tunneling, which describes the transition in a two-level system during a sweep through an anti-crossing, is a model applicable to a wide range of physical phenomena. R…
Fast, Lifetime-Preserving Readout for High-Coherence Quantum Annealers
Jeffrey A. Grover, James I. Basham, Alexander Marakov +15
We demonstrate, for the first time, that a quantum flux parametron (QFP) is capable of acting as both isolator and amplifier in the readout circuit of a capacitively shunted flux q…
Anneal-path correction in flux qubits
Mostafa Khezri, Jeffrey A. Grover, James I. Basham +5
Quantum annealers require accurate control and optimized operation schemes to reduce noise levels, in order to eventually demonstrate a computational advantage over classical algor…
Exploring More-Coherent Quantum Annealing
Sergey Novikov, Robert Hinkey, Steven Disseler +6
In the quest to reboot computing, quantum annealing (QA) is an interesting candidate for a new capability. While it has not demonstrated an advantage over classical computing on a…
Experimental quantum annealing: case study involving the graph isomorphism problem
Kenneth M. Zick, Omar Shehab, Matthew French
Quantum annealing is a proposed combinatorial optimization technique meant to exploit quantum mechanical effects such as tunneling and entanglement. Real-world quantum annealing-ba…