Is matrix elliptic curve discrete logarithm problem quantum-safe? I can't be the first one to think of this and there must be a reason nobody design cryptosystem off this problem.
Let's define MECC as matrix of elliptic curve points, and MI as matrix of non-negative integers.
Given a MECC $G$, MI $v$, and MECC $P=v\cdot G$. How would a quantum computer calculate $v$ from $P$ and $G$?
Reasoned it through just now. Given the ultimate generator of the elliptic curve group $G'$

Shor $G$ element-wise to obtain an MI $H$ such that $G=H * (G')$, where $*$ is element-wise multiplication.

Shor $P$ element-wise against $(G')$ to obtain an MI $J$

Calculate $J\over H$ using Gaussian elimination to obtain $v$


Yeah! I defeated myself in a cryptanalysis challenge.