1 citations · 2 across the 2 of their papers we have counts for
2 papers
quant-ph2023★ 1 cited
Faster-than-Clifford Simulations of Entanglement Purification Circuits and Their Full-stack Optimization
Vaishnavi L. Addala, Shu Ge, Stefan Krastanov
Quantum Entanglement is a fundamentally important resource in Quantum Information Science; however, generating it in practice is plagued by noise and decoherence, limiting its util…
cs.LG2023★ 1 cited
Model-agnostic Measure of Generalization Difficulty
Akhilan Boopathy, Kevin Liu, Jaedong Hwang +3
The measure of a machine learning algorithm is the difficulty of the tasks it can perform, and sufficiently difficult tasks are critical drivers of strong machine learning models.…