Showing 2024Show all
3 papers · 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…
math.CO2024
Jack combinatorics of the equivariant edge measure
Kyla Pohl, Ben Young
We study the equivariant edge measure: a measure on partitions which arises implicitly in the edge term in the localization computation of the Donaldson-Thomas invariants of a tori…
cs.DM2024
The Converse of the Real Orthogonal Holant Theorem
Ben Young
The Holant theorem is a powerful tool for studying the computational complexity of counting problems. Due to the great expressiveness of the Holant framework, a converse to the Hol…