3 papers
quant-ph2026
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…
cs.DS2026
Spectral recovery of a planted triangle-dense subgraph
Sam van der Poel, Cheng Mao, Benjamin McKenna
Given a simple graph on vertices and a parameter , the triangle-densest--subgraph problem is known to be computationally hard in the worst case. To circumvent the computa…
quant-ph2025
Qudit Shadow Estimation Based on the Clifford Group and the Power of a Single Magic Gate
Chengsi Mao, Changhao Yi, Huangjun Zhu
Shadow estimation is a sample-efficient protocol for learning the properties of a quantum system using randomized measurements, but the current understanding of qudit shadow estima…