I am a PhD student in the Theory of Computing Group at the University of Wisconsin-Madison, advised by Professor Jin-Yi Cai. I am interested in the theory of counting problems on graphs, including Holant, #CSP, and counting graph homomorphisms. In particular, I study counting indistinguishability: if two (sets of) tensors are indistinguishable parameters to a counting problem, what is the algebraic relationship between them? I am also interested in quantum computing, especially as it relates to counting problems and tensor networks.

I completed a B.S. and M.S. in Computer Science and B.A. in Mathematics at Case Western Reserve University in 2021, advised by Professor Harold Connamacher. My M.S. thesis studied the connections between totally symmetric and medial quasigroups and Abelian groups.

Publications ¹

1. Vanishing Signatures, Orbit Closure, and the Converse of the Holant Theorem
   Jin-Yi Cai and Ben Young
   arXiv: 2509.10991 [cs.DM], 2025
   Submitted to ITCS 2026
2. The Converse of the Real Orthogonal Holant Theorem
   Ben Young
   ICALP 2025
   Best Student Paper, Track A
3. Quantum Algorithms for Discrete Log Require Precise Rotations
   Jin-Yi Cai and Ben Young
   ACM Transactions on Quantum Computing, 2025.
4. Equality on all #CSP Instances Yields Constraint Function Isomorphism via Interpolation and Intertwiners
   Ben Young
   arXiv: 2211.13688 [cs.DM], 2022
   Accepted to The Electronic Journal of Combinatorics.
5. Planar #CSP Equality Corresponds to Quantum Isomorphism - A Holant Viewpoint
   Jin-Yi Cai and Ben Young
   ICALP 2023
   ACM Transactions on Computation Theory 16.3 (Sept. 2024).
6. The Number of Labeled n-ary Abelian Groups and Totally Symmetric Medial Quasigroups
   Ben Young, Austin Hacker, and Harold Connamacher
   Journal of Algebraic Combinatorics, 2023.