跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.23186 · v1

Integral Tensor Isomorphism via Cubic Rings and Lattice Methods

首次提交 2026-11-18 02:30
版本更新 2026-11-18 02:30
雷达观测 2026-11-18 12:34
arXiv ↗PDF ↗

摘要

We prove that isomorphism of integral 2×3×32\times3\times3 tensors under GL2(Z)×GL3(Z)×GL3(Z)\mathrm{GL}_2(\mathbb{Z})\times\mathrm{GL}_3(\mathbb{Z})\times\mathrm{GL}_3(\mathbb{Z}) is decidable in bounded-error quantum polynomial time. For a tensor T=(A,B)T=(A,B) with nonzero determinant form det⁡(xA−yB)\det(xA-yB), we use the parametrization of Wood by balanced modules to reduce the isomorphism problem to principality tests for compatible lattices, and use the algorithms of Bley, Hofmann, and Johnston to solve this in BQP. When the determinant form vanishes identically, we get either an integral 2×2×22\times2\times2 core, or a polynomial kernel vector of degree one or two. The linear-kernel case yields another compatible lattice problem, while the quadratic-kernel case reduces to a fixed system of polynomial congruences and unimodular lifting. A quantifier-elimination argument decides these congruences in deterministic polynomial time given the prime factorization of the modulus, which quantum integer factorization supplies. Finally, we show that zero padding preserves integral 2×2×22\times2\times2 tensor isomorphism, yielding a polynomial-time reduction from real-quadratic principality to the identically singular 2×3×32\times3\times3 problem.

作者备注:51 pages

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-18 02:30 · 最新观测版本

Integral Tensor Isomorphism via Cubic Rings and Lattice Methods

We prove that isomorphism of integral 2×3×32\times3\times3 tensors under GL2(Z)×GL3(Z)×GL3(Z)\mathrm{GL}_2(\mathbb{Z})\times\mathrm{GL}_3(\mathbb{Z})\times\mathrm{GL}_3(\mathbb{Z}) is decidable in bounded-error quantum polynomial time. For a tensor T=(A,B)T=(A,B) with nonzero determinant form det⁡(xA−yB)\det(xA-yB), we use the parametrization of Wood by balanced modules to reduce the isomorphism problem to principality tests for compatible lattices, and use the algorithms of Bley, Hofmann, and Johnston to solve this in BQP. When the determinant form vanishes identically, we get either an integral 2×2×22\times2\times2 core, or a polynomial kernel vector of degree one or two. The linear-kernel case yields another compatible lattice problem, while the quadratic-kernel case reduces to a fixed system of polynomial congruences and unimodular lifting. A quantifier-elimination argument decides these congruences in deterministic polynomial time given the prime factorization of the modulus, which quantum integer factorization supplies. Finally, we show that zero padding preserves integral 2×2×22\times2\times2 tensor isomorphism, yielding a polynomial-time reduction from real-quadratic principality to the identically singular 2×3×32\times3\times3 problem.

查看此版本解读 →查看此版本原文 ↗