The state-of-the-art quantum elliptic curve point addition circuit from Litinski fails to uncompute ancillas in four rare edge cases; this paper identifies and fixes them with only O(n) extra Toffoli gates.
Performance analysis of a repetition cat code architecture: Computing 256-bit elliptic curve logarithm in 9 hours with 126133 cat qubits
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
method 1
citation-polarity summary
fields
quant-ph 1years
2025 1verdicts
CONDITIONAL 1roles
method 1polarities
use method 1representative citing papers
citing papers explorer
-
Validation of Quantum Elliptic Curve Point Addition Circuits
The state-of-the-art quantum elliptic curve point addition circuit from Litinski fails to uncompute ancillas in four rare edge cases; this paper identifies and fixes them with only O(n) extra Toffoli gates.