Tootfinder

Verifiable blind observable estimation: A composably secure protocol for near-term quantum advantage tasks
Bo Yang, Elham Kashefi, Harold Ollivier
https://arxiv.org/abs/2510.08548

Verifiable blind observable estimation: A composably secure protocol for near-term quantum advantage tasks
The rapid advance of quantum hardware is spotlighting pre-fault-tolerant tasks that may no longer be efficiently validated by classical means and are likely to run on potentially untrusted remote quantum servers. This motivates problem-independent verification protocols with rigorous guarantees. The Verifiable Blind Quantum Computation (VBQC) protocol provides delegated computation where the composable security spans the confidentiality and integrity of the computation. However, the success o…

Self-replication and Computational Universality
Jordan Cotler, Cl\'ement Hongler, Barbora Hudcov\'a
https://arxiv.org/abs/2510.08342 https://arxiv.…

A Note on the Theoretical Support to Compute Dimension in Abelian Codes
J. J. Bernal, J. J. Sim\'on
https://arxiv.org/abs/2509.17597 https://arxiv.org/…

A Note on the Theoretical Support to Compute Dimension in Abelian Codes
In this note we give a theoretical support by means of quotient polynomial rings for the computation formulas of the dimension of abelian codes.