Quantitative equational reasoning, as introduced by Mardare, Panangaden, and Plotkin (2016), provides a framework that extends the equality predicate on terms to a notion of proximity. It allows to consider "indexed equations" s ≈ε t between terms with the idea of expressing that "s is within ε from t". In this work-in-progress paper, we discuss matching in the setting of quantitative equational reasoning. We outline a matching algorithm for a special case and suggest possible generalizations.