Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2608.30340

Exact quantum splitting and the structure of finite algebras

Muhammad Imran

quant-phcs.CCSubmitted Aug 31, 2026• Announced Sep 1, 2026• 0 citations• Revised Oct 16, 2026 (v2)
v1 · Aug 31, 2026v2 · Oct 16, 2026
arXivHTMLPDF

Abstract

For squarefree $f\in\F_q[x]$, Berlekamp's fixed-point algebra is $B\cong\F_q^r$, where $r$ is the number of irreducible factors. We give an exact quantum splitting procedure in a circuit model permitting efficiently computable, input-dependent single-qubit rotations. For a block with $s\ge2$ factors, a quadratic-character test (odd $q$) or absolute-trace test (characteristic $2$) is nonconstant with an exactly known probability $p_{q,s}\ge1/2$. Its value depends only on $q,s$, not on the hidden factors. An auxiliary-qubit reduction to success probability $1/4$ makes one Grover iteration exact. Thus factorization takes exactly $r-1$ splitting rounds and $O(n^3\log q)$ quantum $\F_q$-operations, with deterministic polynomial classical preprocessing and bookkeeping. The method also extracts primitive idempotents of arbitrary finite-dimensional commutative unital algebras given by structure constants in $O(n^4\log q)$ quantum $\F_q$-operations, staying over $\F_q$ throughout. Computing the radical and passing to the center extends it to the decomposition of $A/\Rad(A)$ into simple two-sided ideals, for an arbitrary finite-dimensional associative $\F_q$-algebra $A$.

Related papers

Quantum polynomial-time conjugacy in metabelian groups

Alexei Miasnikov, Alexander Ushakov

We prove that the conjugacy problem in finitely presented metabelian groups with a fixed number of generators is solvable in bounded-error quantum polynomial time, uniformly in the defining relations of the group. Both the group presentation and the words representing the elements are part of the input. The main ingredient is a quantum polynomial-time algorithm for computing all multiplicative relations among a fixed number of units in a commutative affine $\mathbb Z$-algebra presented with a fixed number of variables. The algorithm reduces the problem to computations in finite-dimensional algebras over $\mathbb Q$ and finite rings by identifying the lattice of exponent vectors whose corresponding products are algebraic over the coefficient field. An effective arithmetic splitting combines the rational and finite-ring computations. The proof uses effective bounds for polynomial equations, algorithms for finite-dimensional commutative algebras, quantum integer factorization, and finite abelian hidden-subgroup algorithms.

arXiv:2610.27250•Oct 19, 2026•0 citations

Relational Anchors for Quantum Subsystem Identification: Minimal Separation and Robust Rigidity Subtitle: Algebra rounding, synchronized separation, and finite-shot two-qubit certification

Oliver Tuma

We develop a finite-dimensional reconstruction framework for identifying tensor-product structure (TPS) from noisy relational localization data without assuming exact local algebras. A unital completely positive localizer is rounded to a nearby exact algebra using explicit idempotent spectral rounding plus finite-dimensional C*-algebra stability; a central-derivation-gap criterion certifies matrix-factor structure, and near-commuting complementary factors are rectified to an exact TPS. Relational uniqueness is formulated with a single synchronized residual gauge across all anchor coordinates, turning minimal robust experiment selection into a test-cover problem on candidate-alignment triples. For D=4 we give an explicit Pauli-specialized branch and finite-shot confidence theorems. Independent multi-context pilot data recover a rank-four Choi support and an exact candidate factor, while a three-setting validation test treats the discarded-subsystem state as a nuisance parameter and certifies proximity to the full family of UCP retractions onto that factor. The resulting split-sample theorem gives radius-valued RECOVER/ABSTAIN/REJECT guarantees for a declared localizer/anchor interface. The result does not infer a TPS from a Hilbert space, Hamiltonian and state alone, nor does it construct localizer channels from arbitrary structure-free laboratory records.

•Sep 5, 2026•0 citations

Bethe Ansatz, Galois symmetries, and finite quantum systems

Tadeusz Lulek

We demonstrate some applications of arithmetic structures in Bethe Ansatz — the famous substitution which yields an exact solution of a quantum $N$-body problem for the linear magnetic ring of $N$ spins $1/2$ within the XXX model. We point out the purely

Banach Center Publications•Jan 1, 2016•1 citation

New quantum codes from skew constacyclic codes

Ram Krishna Verma, Om Prakash, Ashutosh Singh +1 more

For an odd prime $ p $ and positive integers $ m $ and $ \ell $, let $ \mathbb{F}_{p^m} $ be the finite field with $ p^{m} $ elements and $ R_{\ell,m} = \mathbb{F}_{p^m}[v_1,v_2,\dots,v_{\ell}]/\langle v^{2}_{i}-1, v_{i}v_{j}-v_{j}v_{i}\rangle_{1\leq i, j\leq \ell} $. Thus $ R_{\ell,m} $ is a finite commutative non-chain ring of order $ p^{2^{\ell} m} $ with characteristic $ p $. In this paper, we aim to construct quantum codes from skew constacyclic codes over $ R_{\ell,m} $. First, we discuss the structures of skew constacyclic codes and determine their Euclidean dual codes. Then a relation between these codes and their Euclidean duals has been obtained. Finally, with the help of a duality-preserving Gray map and the CSS construction, many MDS and better non-binary quantum codes are obtained as compared to the best-known quantum codes available in the literature.

Advances in Mathematics of Communications•Aug 19, 2021•19 citations

A Quantum Algorithm for the Commutativity of Finite Dimensional Algebras

Elías F. Combarro, José Ranilla, I. F. Rúa

A quantum procedure for testing the commutativity of a finite dimensional algebra is introduced. This algorithm, based on Grover's quantum search, is shown to provide a quadratic speed-up (when the number of queries to the algebra multiplication constants is considered) over any classical algorithm (both deterministic and randomized) with equal success rate and shown to be optimal among the class of probabilistic quantum query algorithms. This algorithm can also be readily adapted to test commutativity and hermiticity of square matrices, again with quadratic speed-up. The results of the experiments carried out on a quantum computer simulator and on one of IBM's 5-qubit quantum computers are presented.

IEEE Access•Jan 1, 2019•8 citations

Toward an Optimal Quantum Algorithm for Polynomial Factorization over Finite Fields

Javad Doliskani

We present a randomized quantum algorithm for polynomial factorization over finite fields. For polynomials of degree $n$ over a finite field $\F_q$, the average-case complexity of our algorithm is an expected $O(n^{1 + o(1)} \log^{2 + o(1)}q)$ bit operations. Only for a negligible subset of polynomials of degree $n$ our algorithm has a higher complexity of $O(n^{4 / 3 + o(1)} \log^{2 + o(1)}q)$ bit operations. This breaks the classical $3/2$-exponent barrier for polynomial factorization over finite fields \cite{guo2016alg}.

arXiv:1807.09675•Jul 25, 2018•0 citations
For squarefree f∈\Fq[x]f\in\F_q[x]f∈\Fq​[x], Berlekamp's fixed-point algebra is B≅\FqrB\cong\F_q^rB≅\Fqr​, where rrr is the number of irreducible factors. We give an exact quantum splitting procedure in a circuit model permitting efficiently computable, input-dependent single-qubit rotations. For a block with s≥2s\ge2s≥2 factors, a quadratic-character test (odd qqq) or absolute-trace test (characteristic 222) is nonconstant with an exactly known probability pq,s≥1/2p_{q,s}\ge1/2pq,s​≥1/2. Its value depends only on q,sq,sq,s, not on the hidden factors. An auxiliary-qubit reduction to success probability 1/41/41/4 makes one Grover iteration exact. Thus factorization takes exactly r−1r-1r−1 splitting rounds and O(n3log⁡q)O(n^3\log q)O(n3logq) quantum \Fq\F_q\Fq​-operations, with deterministic polynomial classical preprocessing and bookkeeping. The method also extracts primitive idempotents of arbitrary finite-dimensional commutative unital algebras given by structure constants in O(n4log⁡q)O(n^4\log q)O(n4logq) quantum \Fq\F_q\Fq​-operations, staying over \Fq\F_q\Fq​ throughout. Computing the radical and passing to the center extends it to the decomposition of A/\Rad(A)A/\Rad(A)A/\Rad(A) into simple two-sided ideals, for an arbitrary finite-dimensional associative \Fq\F_q\Fq​-algebra AAA.
We prove that the conjugacy problem in finitely presented metabelian groups with a fixed number of generators is solvable in bounded-error quantum polynomial time, uniformly in the defining relations of the group. Both the group presentation and the words representing the elements are part of the input. The main ingredient is a quantum polynomial-time algorithm for computing all multiplicative relations among a fixed number of units in a commutative affine Z\mathbb ZZ-algebra presented with a fixed number of variables. The algorithm reduces the problem to computations in finite-dimensional algebras over Q\mathbb QQ and finite rings by identifying the lattice of exponent vectors whose corresponding products are algebraic over the coefficient field. An effective arithmetic splitting combines the rational and finite-ring computations. The proof uses effective bounds for polynomial equations, algorithms for finite-dimensional commutative algebras, quantum integer factorization, and finite abelian hidden-subgroup algorithms.
We develop a finite-dimensional reconstruction framework for identifying tensor-product structure (TPS) from noisy relational localization data without assuming exact local algebras. A unital completely positive localizer is rounded to a nearby exact algebra using explicit idempotent spectral rounding plus finite-dimensional C*-algebra stability; a central-derivation-gap criterion certifies matrix-factor structure, and near-commuting complementary factors are rectified to an exact TPS. Relational uniqueness is formulated with a single synchronized residual gauge across all anchor coordinates, turning minimal robust experiment selection into a test-cover problem on candidate-alignment triples. For D=4 we give an explicit Pauli-specialized branch and finite-shot confidence theorems. Independent multi-context pilot data recover a rank-four Choi support and an exact candidate factor, while a three-setting validation test treats the discarded-subsystem state as a nuisance parameter and certifies proximity to the full family of UCP retractions onto that factor. The resulting split-sample theorem gives radius-valued RECOVER/ABSTAIN/REJECT guarantees for a declared localizer/anchor interface. The result does not infer a TPS from a Hilbert space, Hamiltonian and state alone, nor does it construct localizer channels from arbitrary structure-free laboratory records.
We demonstrate some applications of arithmetic structures in Bethe Ansatz — the famous substitution which yields an exact solution of a quantum NNN-body problem for the linear magnetic ring of NNN spins 1/21/21/2 within the XXX model. We point out the purely
For an odd prime $ p $ and positive integers $ m $ and $ \ell $, let $ \mathbb{F}_{p^m} $ be the finite field with $ p^{m} $ elements and $ R_{\ell,m} = \mathbb{F}_{p^m}[v_1,v_2,\dots,v_{\ell}]/\langle v^{2}_{i}-1, v_{i}v_{j}-v_{j}v_{i}\rangle_{1\leq i, j\leq \ell} $. Thus $ R_{\ell,m} $ is a finite commutative non-chain ring of order $ p^{2^{\ell} m} $ with characteristic $ p $. In this paper, we aim to construct quantum codes from skew constacyclic codes over $ R_{\ell,m} $. First, we discuss the structures of skew constacyclic codes and determine their Euclidean dual codes. Then a relation between these codes and their Euclidean duals has been obtained. Finally, with the help of a duality-preserving Gray map and the CSS construction, many MDS and better non-binary quantum codes are obtained as compared to the best-known quantum codes available in the literature.
A quantum procedure for testing the commutativity of a finite dimensional algebra is introduced. This algorithm, based on Grover's quantum search, is shown to provide a quadratic speed-up (when the number of queries to the algebra multiplication constants is considered) over any classical algorithm (both deterministic and randomized) with equal success rate and shown to be optimal among the class of probabilistic quantum query algorithms. This algorithm can also be readily adapted to test commutativity and hermiticity of square matrices, again with quadratic speed-up. The results of the experiments carried out on a quantum computer simulator and on one of IBM's 5-qubit quantum computers are presented.
We present a randomized quantum algorithm for polynomial factorization over finite fields. For polynomials of degree nnn over a finite field $\F_q$, the average-case complexity of our algorithm is an expected O(n1+o(1)log⁡2+o(1)q)O(n^{1 + o(1)} \log^{2 + o(1)}q)O(n1+o(1)log2+o(1)q) bit operations. Only for a negligible subset of polynomials of degree nnn our algorithm has a higher complexity of O(n4/3+o(1)log⁡2+o(1)q)O(n^{4 / 3 + o(1)} \log^{2 + o(1)}q)O(n4/3+o(1)log2+o(1)q) bit operations. This breaks the classical 3/23/23/2-exponent barrier for polynomial factorization over finite fields \cite{guo2016alg}.