Pinnacle Architecture using QLDPC codes reduces physical qubits needed to factor RSA-2048 to under 100,000 at 10^{-3} error rate.
Shorter quantum cir- cuits via single-qubit gate approximation.arXiv preprint arXiv:2203.10064, 2022
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
quant-ph 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
T-count minimization is cast as a binary search over continuous minimization problems, demonstrated numerically solvable for small-qubit circuits with reproduction of known results and extended via partitioning to larger circuits.
citing papers explorer
-
The Pinnacle Architecture: Reducing the cost of breaking RSA-2048 to 100 000 physical qubits using quantum LDPC codes
Pinnacle Architecture using QLDPC codes reduces physical qubits needed to factor RSA-2048 to under 100,000 at 10^{-3} error rate.
-
T Count as a Numerically Solvable Minimization Problem
T-count minimization is cast as a binary search over continuous minimization problems, demonstrated numerically solvable for small-qubit circuits with reproduction of known results and extended via partitioning to larger circuits.