Researchers Sciences, University of Electronic Science and Technology of China and the State Key Laboratory of Mathematical Sciences, Academy of Mathematics and Systems Science, Chinese Academy of Sciences have identified a counterexample that disproves a key conjecture regarding optimal quantum state transformation. The work challenges a proposition made by Coutts et al. in 2021, which stated that applying the sign function to the error matrix uniquely determines a dual certificate for every optimal solution to the trace distance based optimal state transformation problem. By constructing this counterexample within 2-dimensional Hilbert spaces, the team demonstrates a limitation in current methods for verifying optimality in quantum information theory.

Coutts et al’s Conjecture Fails for Singular Error Matrices

The conjecture, initially proposed by Coutts et al., has now been demonstrated to not be universally true, revealing a limitation in current methods for guaranteeing the efficiency of quantum processes. The team employed a symmetry reduction approach, transforming a complex optimization problem involving quantum channels into a more manageable linear programming problem, substantially reducing the computational space needed to search for a disproving example.

This allowed for the construction of a counterexample, a specific instance where an optimal solution exists but fails to meet the criteria outlined in the original conjecture. The counterexample centers on diagonal matrices σ and X, carefully constructed to violate the conditions set forth by Coutts et al. regarding the uniqueness of the dual certificate.

The researchers’ findings are formalized in Theorem 4. 1, which states the existence of a 2-dimensional optimal state transformation problem where an optimal solution does not align with the previously proposed optimality conditions. The work’s code for constructing and verifying this counterexample is publicly available on GitHub, enabling independent verification of the results. By comparing coefficients of specific terms within the mathematical framework, the team confirmed the discrepancy, demonstrating that the sign function method does not guarantee a unique dual certificate when the error matrix is singular.

This discovery leaves open the question of efficiently verifiable optimality conditions for quantum information optimization problems involving rank-deficient error matrices, an area that remains an open challenge for the field. The team’s work highlights the need for continued investigation into robust methods for confirming the optimality of quantum solutions, particularly as the complexity of quantum systems increases.

Symmetry Reduction Simplifies Quantum Channel Optimization

A reduction in dimensionality facilitated the disproof of a previously held belief regarding quantum channel optimization, allowing researchers to challenge a conjecture proposed by Coutts et al. This symmetry reduction approach narrowed the search space for potential counterexamples, ultimately enabling the identification of a specific instance where the conjecture failed. The conjecture, central to verifying optimality in quantum information theory, suggested a straightforward method for confirming optimal solutions.

However, the work demonstrates this is not universally true. An optimal solution can exist without adhering to this condition. The authors’ findings stem from the observation that, in certain cases, the subdifferential is no longer a singular set, indicating a breakdown in the previously assumed relationship. This counterexample builds on prior work; in a related study, the authors previously proved the conjecture held true when the matrix was full rank.

The current work extends this investigation to the general case, revealing a limitation in the original proposition. The team focused on diagonal matrices σ and X, using group invariance to further simplify the problem and pinpoint the discrepancy. The authors write, highlighting the core technique used to achieve this result. This dimensional reduction is key to constructing the counterexample and demonstrating the conjecture’s limitations.

Dimensional Hilbert Spaces Enable Counterexample Construction

The established link between spectral calculus of error matrices and verifiable optimality in quantum information theory has been challenged by a newly constructed counterexample. This finding directly refutes a proposition put forward by Coutts et al. in 2021, which had previously been accepted as a means of confirming optimality. This disproof stems from work focused on 2-dimensional Hilbert spaces, a deliberate simplification designed to expose limitations in existing methods.

The team used the symmetry present in density operators, specifically those corresponding to Bell states, to narrow the scope of their investigation. By defining a density operator ρ₀, and its associated completely positive map $Ψ_{}$ (ρ₀), they created a specific instance where the standard spectral calculation fails to accurately certify an optimal solution. The construction shows that the previously conjectured method is insufficient to guarantee optimality, even in a relatively simple system.

The implications extend beyond this specific instance, suggesting a need for more robust optimality conditions in quantum information optimization problems. The work highlights that current approaches may not be universally applicable, potentially leading to inaccurate assessments of quantum channel and measurement performance.

Trace Distance Optimization and Spectral Calculus of Error

The established link between error matrix rank and uniquely determined dual certificates for optimal quantum channels has been broken by a newly identified counterexample. Researchers demonstrated that, contrary to a proposition by Coutts et al., spectral calculus cannot consistently verify optimality even when simplifying the problem to two-dimensional Hilbert spaces. A reduction in the complexity of the optimization problem was key to isolating the flaw in the conjecture.

By using symmetry within the trace distance optimization problem, the team transformed a four-by-four positive semidefinite cone minimization into a more manageable two-dimensional linear programming problem. This allowed for a focused analysis of the error matrix’s properties and revealed inconsistencies in the application of the sign function.

The team’s work shows that the coefficients of specific terms, and, differ between equations 14 and 15, indicating a failure of the conjectured optimality condition. While prior research confirmed dual certificates are uniquely determined via spectral calculus when the error matrix is full-rank, this work demonstrates that approach is insufficient in all cases.

Choi Representation Defines Quantum Channel Optimality

The Choi representation of a quantum channel is important in disproving a previously held optimality conjecture concerning state transformation. This work directly addresses a conjecture put forward by Coutts et al. The team constructed a counterexample using a carefully defined operator, σ and an optimal solution, $X^{*}$ , to demonstrate the flaw in the existing framework. The conjecture, which aimed to simplify verification of optimality, does not hold true in all cases, even within the seemingly constrained space of 2-dimensional Hilbert spaces.

This finding has implications for the broader field of convex quantum channel optimization, where efficiently verifiable optimality conditions are highly sought after. The team’s approach used the mathematical properties of the trace distance optimization problem to isolate the specific conditions leading to the counterexample. As the authors state, the counterexample is defined by the equation + + +, highlighting the precise mathematical conditions that invalidate the earlier proposition.

👉 More information
🗞 A Counterexample to the Optimality Conjecture in Convex Quantum Channel Optimization
✍️ Jianting Yang
🧠 DOI: https://quantum-journal.org/papers/q-2026-10-28-2253/

More like this