REVIEW 3 cited by
Quantum Carry-Save Arithmetic
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
read the original abstract
This paper shows how to design efficient arithmetic elements out of quantum gates using "carry-save" techniques borrowed from classical computer design. This allows bit-parallel evaluation of all the arithmetic elements required for Shor's algorithm, including modular arithmetic, deferring all carry propagation until the end of the entire computation. This reduces the quantum gate delay from O(N^3) to O(N log N) at a cost of increasing the number of qubits required from O(N) to O(N^2).
Forward citations
Cited by 3 Pith papers
-
Efficient Depth--Ancilla Tradeoffs for Hamming Weight Computation and Symmetric Boolean Functions
New quantum circuits for Hamming weight and symmetric Boolean functions: O(log n) depth with sublinear ancillas (all-to-all), optimal Θ(√n) depth with O(log^2 n) ancillas (2D), and constant depth with O(n^{1+ε}) ancil...
-
On the practicality of quantum sieving algorithms for the shortest vector problem
Quantum sieving for SVP in dimension 400 needs ~10^13 physical qubits and ~10^31 years under optimistic assumptions, offering no practical speedup over classical methods.
-
A Quantum Genetic Algorithm Framework for the MaxCut Problem
A Grover-based quantum genetic algorithm with divide-and-conquer is applied to MaxCut, but the oracle threshold as written marks no valid solutions.
Discussion (0). Continue with ORCID to comment.