Metraipolis › archive › dc_99a5ac2eaea4
Geometric-resource bounds and permutation-averaged success probabilities for the WZP algorithm — arXiv:2610.20198
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.20198
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-15T14:47:29.084Z
- SHA-256 of the archived text
738c6ef3b5f7bf08574ca34a8b84f56d0cb877fbaa4bfe9a94f5c78a31f4126a- Stable URL of this page
https://metraipolis.com/documento/dc_99a5ac2eaea4
How to cite
Geometric-resource bounds and permutation-averaged success probabilities for the WZP algorithm — arXiv:2610.20198 — arXiv (en), https://arxiv.org/abs/2610.20198 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_99a5ac2eaea4 (Metraipolis archive dc_99a5ac2eaea4, sha256 738c6ef3b5f7bf08574ca34a8b84f56d0cb877fbaa4bfe9a94f5c78a31f4126a)
BibTeX
@misc{dc99a5ac2eaea4,
title = {Geometric-resource bounds and permutation-averaged success probabilities for the WZP algorithm — arXiv:2610.20198},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.20198},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_99a5ac2eaea4; sha256 738c6ef3b5f7bf08574ca34a8b84f56d0cb877fbaa4bfe9a94f5c78a31f4126a},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.20198. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Solving linear systems of equations is a fundamental task in machine learning and optimization. In this work, we extend the original WZP algorithm from real symmetric linear systems to complex Hermitian linear systems. We then study the success probability of the modified WZP algorithm from a resource-theoretic perspective. By expressing the postselection success probability as the expectation value of a positive operator, we derive upper and lower bounds of the maximal success probability over separable, incoherent, and real pure states. These bounds further establish connections between the maximal success probability and geometric entanglement, coherence, and imaginarity. We further show that, under permutation averaging, the averaged success probability is an affine function of the coherence fraction, with its dependence determined by the alignment between the success operator and the equal-superposition state. We also investigate the preprocessed WZP algorithm under subgroup-constrained preprocessing. For the two-level family, the optimal success probability is determined by the maximal projection weight onto the orbit of the target projector. Our results provide a unified perspective on the WZP success probability under different operational constraints. Tema degli esploratori: fisica e astronomia (elenco arXiv quant-ph, nuovi lavori del giorno). Categorie arXiv: Quantum Physics (quant-ph). Pagina del lavoro: https://arxiv.org/abs/2610.20198 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-15T14:01:23.662Z dalla pagina https://arxiv.org/list/quant-ph/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).