Variance formula for sums of independent quantum computing errors
Let and be independent quantum computing errors in an -qubit computation, with variances and , respectively. Variance formula conjecture. The variance of their sum verifies
The paper presents this as a conjectural extension of the formula derived for the analyzed error model and says that it will be proved for isotropic quantum computing errors. Its status for arbitrary independent quantum computing errors is not established in the supplied text.
References
Primary source
Jesús Lacalle and Luis Miguel Pozo Coronado, “Variance of the sum of independent quantum computing errors”, arXiv:2412.15800 (2024).
Progress summary
A reader-written calculation claims the rule is false for general errors, but this counterexample has not been independently verified.
Lacalle and Pozo Coronado proposed the formula for sums of independent quantum-computing errors in December 2024, proving it for isotropic errors while leaving the unrestricted case conjectural: .
Known results
- Independent isotropic errors in (Lacalle and Pozo Coronado, 2024).
- Arbitrary independent errors on (Lacalle and Pozo Coronado, 2024).
- Specific nonisotropic examples, including one on , satisfy the formula but do not establish the general case (2024).
- A 2026 paper studies fidelity of sums but its available abstract does not claim a proof of this variance conjecture.
Posted attempt
A reader-written quaternion calculation claims a full-support one-qubit counterexample: it gives , , while the conjectured value is , and proposes a correction term . The attempt has not been independently verified.
Current status (as of August 2026): The formula is proved for isotropic errors and certain special cases, while the arbitrary independent case is now challenged by an unverified counterexample and is not settled.
Sources
Solutions 1
CounterexampleThis solution needs a summarySee full solution
Counterexample, exact correction, and clarification of the centering assumption. Identify one-qubit unitary errors with unit quaternions , with normalized Haar measure . Let be independent with the same smooth probability density
It is strictly positive everywhere since . Coordinate symmetry and give
For the source's variance , both errors have . Sequential application is quaternion multiplication, and independence gives
Consequently , whereas the conjectured expression equals
The exact discrepancy is .
More generally, write , with . Independence gives the sharp corrected identity
Thus the proposed identity holds exactly when the transverse first moments are orthogonal.
There is a significant ambiguity in the original paper: it informally calls the error-free point the center, but its own expressly admitted nonisotropic Example 1 has nonzero transverse mean. Indeed its displayed density on satisfies
Therefore the source's actual general class does not impose vanishing transverse first moments, and the full-support example above refutes its unrestricted conjecture.
If, instead, “centered at ” is strengthened to the genuine mathematical assumption , for independent orthogonal or unitary errors , there is a complete positive theorem in every dimension:
and hence
Thus true first-moment centering repairs the statement, while the nonisotropic generality actually used in the source admits the explicit counterexample.
Source: Lacalle and Pozo Coronado, Variance of the sum of independent quantum computing errors, Conjecture 1, https://arxiv.org/abs/2412.15800 . The general variance claim is also described as conjectural in the subsequent peer-reviewed paper https://doi.org/10.1007/s11128-025-05037-5 .