activity
20242026
most citedPolynomial and analytic methods for classifying complexity of planar graph homomorphisms

1 citations · 1 across the 2 of their papers we have counts for

collaborators
Showing quant-phShow all

1 paper · 1 filter

quant-ph2024

Quantum Algorithms for Discrete Log Require Precise Rotations

Jin-Yi Cai, Ben Young

Recently, Cai showed that Shor's quantum factoring algorithm fails to factor large integers when the algorithm's quantum Fourier transform (QFT) is corrupted by a vanishing level o…