Variance formula for sums of independent quantum computing errors
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.
Progress summary
The proposed rule is proved only for symmetric error distributions, while its validity for arbitrary independent quantum errors remains unresolved.
The conjecture asserts that the variance of the combined error is . The supplied literature traces this formula to earlier work and continues to treat the arbitrary-error case as conjectural.
Known results
- The identity is proved for independent isotropic quantum-computing errors.
- It is proved for arbitrary random variables on .
- For independent identically distributed normal qubit errors, the corresponding multi-error formula is verified in a specific model.
- The equal-variance -error expression follows under isotropy or as a consequence of assuming the conjecture.
2026 follow-up
A 2026 article analyzes the sum of two independent quantum-computing errors and reports a formula, but the available abstract does not state a proof of the unrestricted conjecture. No corroborated proof, counterexample, or retraction was found.
Current status (as of August 2026): The formula is settled for isotropic errors and some special models, but the case of arbitrary independent quantum-computing errors remains open.
Sources & referencesView supporting material
Primary source
Jesús Lacalle and Luis Miguel Pozo Coronado, “Variance of the sum of independent quantum computing errors”, arXiv:2412.15800 (2024).
Solutions 1
Sign in to submit a 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 .