Compare Papers
Paper 1
Polylogarithmic-depth controlled-NOT gates without ancilla qubits.
Claudon B, Zylberman J, Feniou C, Debbasch F, Peruzzo A, Piquemal JP.
- Year
- 2024
- Journal
- Nat Commun
- DOI
- 10.1038/s41467-024-50065-x
- arXiv
- -
No abstract.
Open paperPaper 2
Semantics-Based Verification of an Implemented Shor Oracle for ECDLP in Qrisp
Lei Zhang, Zhiyuan Chen
- Year
- 2026
- Journal
- arXiv preprint
- DOI
- arXiv:2605.01008
- arXiv
- 2605.01008
Shor-style quantum algorithms for the elliptic-curve discrete logarithm problem (ECDLP) are highly sensitive to the exact semantics of their group-operation oracles. Consequently, minor implementation choices can invalidate the intended mathematical model and lead to misleading conclusions. This paper introduces a semantics-first verification perspective for an end-to-end, compilable ECDLP implementation built on Qrisp. We specify the implemented oracle at the level of program semantics, derive refinement-style verification obligations for its key components, and provide a high-level complexity argument for the resulting oracle family. A small case study highlights that (i) the core point-update primitive agrees with a classical reference on well-formed inputs, yet (ii) controlled execution may violate the expected control law under the evaluated toolchain, despite a passing trivial control sanity check. These results position semantic auditing as a practical prerequisite for trustworthy ECDLP-oriented quantum software.
Open paper