← 研踪 PaperTrailarXiv: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
摘要
We prove that isomorphism of integral tensors under is decidable in bounded-error quantum polynomial time. For a tensor with nonzero determinant form , 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 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 tensor isomorphism, yielding a polynomial-time reduction from real-quadratic principality to the identically singular problem.
作者备注:51 pages
观测到的版本
相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-18 02:30 · 最新观测版本
Integral Tensor Isomorphism via Cubic Rings and Lattice Methods
We prove that isomorphism of integral tensors under is decidable in bounded-error quantum polynomial time. For a tensor with nonzero determinant form , 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 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 tensor isomorphism, yielding a polynomial-time reduction from real-quadratic principality to the identically singular problem.
查看此版本解读 →查看此版本原文 ↗