2 papers
quant-ph2026
Solving approximate hidden subgroup problems: quantum heuristics to detect weak entanglement
Petar Simidzija, Eugene Koskin, Elton Yechao Zhu +2
How can we use a quantum computer to detect the entanglement structure of a quantum state? Bouland et al. (2024) recently provided an algorithm that, given multiple input copies of…
cs.LG2024
Scalable iterative pruning of large language and vision models using block coordinate descent
Gili Rosenberg, J. Kyle Brubaker, Martin J. A. Schuetz +4
Pruning neural networks, which involves removing a fraction of their weights, can often maintain high accuracy while significantly reducing model complexity, at least up to a certa…