2023/06/14 by Daniel Litinski, Litinski, Daniel · 1 voice · 11 citations
Computer Science · Engineering · #Algorithm #Computation #Computer engineering #Computer science #Embedded system #Gate count #Key (lock) #Neural Networks and Reservoir Computing #Optical Network Technologies #Parallel computing #Quantum #Quantum Computing Algorithms and Architecture #Quantum computer #Quantum gate #Quantum mechanics #Qubit #Theoretical computer science #Toffoli gate #quant-ph
paper · pdf · doi:10.48550/arxiv.2306.08585
published in arXiv (Cornell University) (Cornell University)
openalex publication_date 2023/06/14 · openalex created_date 2023/06/17 · openalex updated_date 2026/07/28
We use Shor's algorithm for the computation of elliptic curve private keys as a case study for resource estimates in the silicon-photonics-inspired active-volume architecture. Here, a fault-tolerant surface-code quantum computer consists of modules with a logarithmic number of non-local inter-module connections, modifying the algorithmic cost function compared to 2D-local architectures. We find that the non-local connections reduce the cost per key by a factor of 300-700 depending on the operating regime. At 10% threshold, assuming a 10-μs code cycle and non-local connections, one key can be generated every 10 minutes using 6000 modules with 1152 physical qubits each. By contrast, a device with strict 2D-local connectivity requires more qubits and produces one key every 38 hours. We also find simple architecture-independent algorithmic modifications that reduce the Toffoli count per key by up to a factor of 5. These modifications involve reusing the stored state for multiple keys and spreading the cost of the modular division operation over multiple parallel instances of the algorithm.