Showing quant-phShow all
2 papers · 1 filter
quant-ph2026
Classical simulability of quantum circuits followed by sparse classical post-processing
Yasuhiro Takahashi, Masayuki Miyamoto, Noboru Kunihiro
We study the classical simulability of a polynomial-size quantum circuit on qubits followed by sparse classical post-processing (SCP) on bits, where $m \leq n \leq {\…
quant-ph2025
Simulation of Shor algorithm for discrete logarithm problems with comprehensive pairs of modulo p and order q
Kaito Kishi, Junpei Yamaguchi, Tetsuya Izu +1
The discrete logarithm problem (DLP) over finite fields, commonly used in classical cryptography, has no known polynomial-time algorithm on classical computers. However, Shor has p…