6 citations · 8 across the 6 of their papers we have counts for
4 papers · 1 filter
A reduction scheme for general-order Ising-like Hamiltonians in quantum heuristic solvers
Chengsi Mao, Pavel Mosharev, Yao Wang +1
The Ising model is ubiquitous in various optimization problems but notoriously difficult to solve due to combinatorial explosion. In view of this, Hamiltonian reduction is a useful…
Multi-Objective Optimization with Quantum-Annealing-Inspired Algorithms
Xian-Zhe Tao, Pavel Mosharev, Man-Hong Yung +1
Combinatorial optimization is widely regarded as a primary application for near-term quantum processors, although a definitive demonstration of a practical quantum advantage remain…
Quantum-annealing-inspired algorithms for multijet clustering
Hideki Okawa, Xian-Zhe Tao, Qing-Guo Zeng +1
Jet clustering or reconstruction is a crucial component at high energy colliders, a procedure to identify sprays of collimated particles originating from the fragmentation and hadr…
Quantum-Annealing-Inspired Algorithms for Track Reconstruction at High-Energy Colliders
Hideki Okawa, Qing-Guo Zeng, Xian-Zhe Tao +1
Charged particle reconstruction or track reconstruction is one of the most crucial components of pattern recognition in high-energy collider physics. It is known to entail enormous…