REVIEW 2 cited by
Quantum binary field multiplication with subquadratic Toffoli gate count and low space-time cost
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
abstract
Multiplication over binary fields is a crucial operation in quantum algorithms designed to solve the discrete logarithm problem for elliptic curve defined over $GF(2^n)$. In this paper, we present an algorithm for constructing quantum circuits that perform multiplication over $GF(2^n)$ with $\mathcal{O}(n^{\log_2(3)})$ Toffoli gates. We propose a variant of our construction that achieves linear depth by using $\mathcal{O}(n\log_2(n))$ ancillary qubits. This approach provides the best known space-time trade-off for binary field multiplication with a subquadratic number of Toffoli gates. Additionally, we demonstrate that for some particular families of primitive polynomials, such as trinomials, the multiplication can be done in logarithmic depth and with $\mathcal{O}(n^{\log_2(3)})$ gates.
Forward citations
Cited by 2 Pith papers
-
Symmetry-Accelerated Classical Simulation of Clifford-Dominated Circuits
Real and diagonal gates' stabilizer extent can be computed exactly over the real or diagonal Clifford subgroups, enabling optimal decompositions up to seven qubits and exponential speedups for sum-over-Cliffords simul...
-
Ancilla-free Quantum Adder with Sublinear Depth
A new construction shows exact in-place addition of two n-bit quantum registers can be done in O(log^2 n) depth with O(n log n) classical reversible gates and zero ancilla qubits.
Discussion (0). Continue with ORCID to comment.