Universal optimal tests of unknown unitary dynamics: determinant exponents and tensor stability

Strengths

• Lemma 3.2 (Gaussian-Schur representation) is an elegant structural identity: expressing the Schur-Weyl block acceptance probability b_lambda(E) as E[s_lambda(G^dagger G)] / (n! s_lambda(1^d)) for a standard complex Gaussian combination G of Kraus operators immediately bridges quantum channel testing and classical symmetric-function inequalities.
• Theorem 2.1 establishes a single universal parallel test—using the balanced partition lambda_* = ((a+1)^r, a^{d-r})—that is simultaneously optimal for every CPTP alternative, every query number n, and every compact alternative family, outperforming or matching all adaptive and general positive physical testers.
• Theorem 4.1 derives the exact asymptotic error exponent -log delta(E) with prefactor-free lower bound delta(E)^n and explicit polynomial upper bound via a clean reproducing-kernel / sphere-evaluation inequality on homogeneous vector-valued polynomials.
• Theorems 5.1 and 6.1 give sharp algebraic characterizations of finite-query perfect detection (n_perfect = rho(E) + 1) and its stability under arbitrary tensor partners in the global-unitary model (c(S) > 0, or ncrk(S) < d), proving that any unital channel with finite perfect detection loses it when tensored with D_{d-1}.
• Theorems 7.1, 8.1, and 8.2 provide closed-form analytical results for concrete systems, including an exact generating function for even-query qubit errors in terms of Wootters' spin-flip roots and exact determinant exponents for W_3 tensor W_3 and W_3 tensor D_2.
• Attribution of prior work in quantum channel discrimination, symmetric functions, noncommutative rank, and hyperdeterminants is unusually thorough and transparent about model limitations and AI assistance.

Weaknesses

• The optimal parallel test for n > d requires a bypass reference system of dimension m_* = dim M_{lambda_*}, which grows exponentially with n; the optimality under a fixed finite memory budget remains open (as the manuscript explicitly acknowledges).
• In Theorem 8.2 (p. 12), the polynomial identity det H = p_013 p_023 - p_012 p_123 is justified by direct 12-variable expansion and citation to the 2x2x3 hyperdeterminant; adding the brief polarization identity det H = (1/2) det(W R W^T) and Cauchy-Binet expansion (present in the supplement) would make the proof of (24) self-contained by hand.
• The polynomial prefactor in the finite-query upper bound of Theorem 4.1 scales as binom(n+k-1, k-1), which suffices for the asymptotic exponent but is not sharp for specific channels such as complete depolarization.

Potential errors

• In the proof of Lemma 3.3 (p. 5), the expansion s_lambda = sum_mu K_{lambda,mu} m_mu in infinitely many variables can have K_{lambda,mu} > 0 for partitions mu with more than d parts even when lambda has at most d rows (e.g., d=2, n=3, lambda=(2,1), mu=(1,1,1)). Because Lemma 3.3 evaluates polynomials on x in [0,infinity)^d, m_mu(x_1,...,x_d) vanishes identically whenever ell(mu) > d; explicitly noting that the d-variable expansion restricts to ell(mu) <= d avoids dividing by m_mu(1^d) = 0.

Strong novelty candidates

• The Gaussian-Schur moment formula b_lambda(E) = E[s_lambda(G^dagger G)] / (n! s_lambda(1^d)) (Lemma 3.2) and the resulting proof that the balanced partition lambda_* is universally optimal across all CPTP channels and query numbers (Theorem 2.1).
• The characterization of the asymptotic testing exponent via the maximum normalized determinant delta(E) = max_{||z||_2=1} |det K(z)|^{2/d} together with explicit finite-query polynomial sandwich bounds (Theorem 4.1).
• The operational characterization of tensor stability of finite-query perfect detection under a global-unitary null via the shrunk-subspace deficiency c(S) > 0 and the exact exponents for W_3 tensor W_3 and W_3 tensor D_2 (Theorems 6.1, 8.1, and 8.2).

Unresolved material objections

None reported.

Strengths

• Lemma 3.1 gives a channel-independent positive decomposition of the twirled alternative and an explicitly realizable parallel tester. The converse requires positivity and physical normalization without incorrectly identifying all positive matrices with experiments or assuming adaptive testers can be physically twirled.
• The Gaussian moment normalization and Schur-block multiplicity factors are consistent. The direct Kostka/Muirhead argument establishes the required balanced minimum without depending on an uninspected general Schur inequality. Pointwise optimality justifies the compact-family result without an unsupported minimax interchange.
• Theorem 4.1 supplies both sides of the exponent estimate, including nonzero query remainders. The homogeneous-polynomial evaluation bound and Maclaurin inequality support the lower bound, while trace preservation supplies contraction and the upper bound. The continuity argument also handles changing Choi rank.
• Theorem 5.1 derives an exact, strategy-independent threshold from nonvanishing minors, rather than merely exhibiting a successful antisymmetric test. The alpha<1 condition and the absence of a bypass reference at the threshold are correctly specified.
• The tensor-stability argument correctly distinguishes ordinary matrix-space rank from noncommutative rank. Its elementary shrunk-subspace bound applies to every partner, and the converse uses the depolarizing channel's full matrix Kraus span. The enlarged global-unitary null is repeatedly made explicit.
• The qubit formulas have consistent Choi and spin-flip normalizations. Both tensor examples optimize over complex coefficient spaces, not merely real witnesses; the congruence reduction and signed-minor bound support the stated sharp constants.

Weaknesses

• Equation (24) is the least transparent self-contained algebraic step: the manuscript asserts a twelve-variable determinant expansion and provides supporting scripts. A short Schur-complement or polarized-determinant derivation would make the exact six-dimensional maximum easier to audit without symbolic execution.
• The universal result is specific to a strong nuisance-symmetry model and unrestricted reference size. Exponentially growing multiplicity references and difficult determinant optimization limit immediate implementation value. These limitations are acknowledged, but should remain prominent when describing broader applications.
• The supplied environment.json does not record CVXPY/Clarabel versions used by standalone schur_checks.py, and review/verify_independent.py inserts an author-specific Windows package path. A portable full-suite dependency specification would improve executable reproducibility; these issues do not affect the analytic proofs.
• The search audit largely documents a company/author manuscript corpus and indexing activity, not an exhaustive specialist literature comparison. The proposed novelty is plausible and carefully delimited, but comparisons with the closest cited quantum-testing and matrix-space works were not independently verified here.
• Review-control limitation, not a mathematical objection: the supplement includes development/informe-candidato-tensorial.txt, an earlier developmental assessment. Report isolation therefore cannot be claimed for this packet. Participation remains unknown as instructed; prior verdicts are not treated as verification of the mathematics.

Potential errors

• The abstract says a depolarizing partner 'destroys perfect detection whenever this condition fails.' Failure of the shrunk-subspace condition also includes unitary channels, which never admitted perfect detection. Qualify this statement by initial perfect detectability, or say the partner precludes finite perfect detection. Theorem 6.1 itself states the correct conclusion.
• verification/verify_universal.py records seed 45151026, but its local generator is unused. Random channels come from the imported schur_checks.random_channel, whose generator is seeded with 20261015. Report the effective seed or pass the declared generator explicitly. This is a reproducibility-metadata error, not a counterexample to the mathematical results.
• Following Equation (14), the evaluation functional has norm sqrt(N_{n,k}); its squared norm is N_{n,k}. The displayed inequality uses the correct constant. Adjust the prose 'evaluation norm N_{n,k}' to distinguish the norm from its square.

Strong novelty candidates

• The operational Gaussian–Schur identity combined with balanced-partition minimality, yielding a single finite-query minimax test simultaneously for all CPTP alternatives in the stated two-sided rotation model.
• The exact determinant-controlled error exponent with polynomial finite-query bounds, together with the sharp ordinary-rank-plus-one threshold for finite perfect detection.
• The operational characterization of perfect-detection stability under every tensor partner by shrunk subspaces, including the explicit depolarizing partner bound. The underlying algebraic characterization is classical, not a novelty candidate.
• The exact operational determinant constants for W3 tensor W3 and W3 tensor D2, with the latter demonstrating the smallest possible partner dimension. The underlying skew-space phenomenon and hyperdeterminant are not new.

Unresolved material objections

None reported.

Strengths

• Optimizador paralelo único, dependiente sólo de d, n y alpha, para todos los canales CPTP y familias compactas del modelo; incluye ancilla arbitraria y converse para testers físicos positivos.
• La representación b_lambda=E[s_lambda(G†G)]/[n!s_lambda(1^d)] identifica la partición balanceada mediante una desigualdad clásica punto a punto, y evita intercambios injustificados de minimización y supremo.
• Las cotas delta^n <= b_n <= binomial(n+k-1,k-1) delta^(n-r) dan el exponente exacto general. La continuidad de delta y su caracterización delta=1 sólo para unitarias justifican el resultado robusto.
• Detección perfecta equivalente a singularidad del espacio de Kraus, con primer número de consultas rho+1. La estabilidad bajo todo compañero se liga correctamente a subespacios contraídos; Derksen–Makam Theorem 1.8 sustenta cada tamaño de ampliación m>=d-1.
• Los valores delta(W3 tensor W3)=2^(2/9)/12 y delta(W3 tensor D2)=2^(2/3)/24 están correctamente normalizados. El segundo ejemplo satura una cota por menores y usa el menor compañero no trivial.
• Atribuciones claras a resultados clásicos y al artículo anterior; distingue rango ordinario/no conmutativo, canal de acompañamiento/ancilla libre, nulo global/local, y spin flip/concurrencia.

Weaknesses

• La optimalidad universal requiere rotaciones independientes desconocidas de entrada y salida, constantes durante las consultas, y ruido sin memoria. No se extiende a ruido calibrado, correlacionado o a memoria acotada.
• La referencia de multiplicidad puede crecer exponencialmente. La fórmula de delta es una optimización polinómica potencialmente difícil; no se proporciona un algoritmo eficiente general ni una implementación experimental eficiente.
• La estabilidad tensorial es una traducción operacional de teoría clásica. El fenómeno de rango de la matriz antisimétrica al cuadrado ya está en Li et al.; el polinomio de grado seis es el hiper determinante 2x2x3 clásico. Las constantes explícitas no deben presentarse como nuevos invariantes fundamentales.
• La novedad de la conexión operacional parece defendible en las fuentes examinadas, pero no está certificada exhaustivamente. Los resultados no justifican por sí solos una etiqueta de avance de impacto amplio.
• La inspección proviene de IA del mismo proveedor y de un modelo implicado en desarrollo en otro contexto; no constituye revisión humana ni evidencia estadísticamente independiente.

Potential errors

None reported.

Strong novelty candidates

• En relación con el artículo previo y las fuentes examinadas: la conexión entre su reducción a bloques y los momentos gaussianos de Schur que demuestra un mismo optimizador para todos los canales y consultas. No se reclama novedad de la desigualdad de Schur.
• El exponente minimax exacto determinado por el máximo determinante de una combinación de Kraus, junto con las cotas finitas y el umbral rho+1, constituye una ampliación sustantiva del problema resuelto previamente.
• La interpretación de la estabilidad de tests perfectos mediante subespacios contraídos y las dos evaluaciones exactas para Werner–Holevo son aplicaciones específicas; su novedad operacional no implica novedad algebraica ni prioridad universal verificada.

Unresolved material objections

None reported.