9 citations · 14 across the 7 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 the practical quantum advantage rema…
Pilot-Wave Simulator: Exact Classical Sampling from Ideal and Noisy Quantum Circuits up to Hundreds of Qubits
Gleb Kalachev, Pavel Mosharev, Zuoheng Zou +2
Quantum circuit simulators running on classical computers offer a vital platform for designing, testing, and optimizing quantum algorithms, driving innovation despite limited acces…
Combinatorial optimization enhanced by shallow quantum circuits with 104 superconducting qubits
Xuhao Zhu, Zuoheng Zou, Feitong Jin +31
A pivotal task for quantum computing is to speed up solving problems that are both classically intractable and practically valuable. Among these, combinatorial optimization problem…