Jin-Yi Cai

activity

20242026

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

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

collaborators

Showing 2026Show all

2 papers · 1 filter

quant-ph2026

A Sharp Noise Threshold for Shor's Quantum Factoring and Discrete Log Algorithms

Jin-Yi Cai, Ben Young

We study the asymptotic behavior of Shor's quantum factoring and discrete log algorithms when noise affects the precise controlled rotation gates in their quantum Fourier transform…

cs.CC2026

Planar Graph Homomorphisms: A Dichotomy and a Barrier from Quantum Groups

Jin-Yi Cai, Ashwin Maran, Ben Young

We study the complexity of counting (weighted) planar graph homomorphism problem $Pl - GH (M)$ parametrized by an arbitrary symmetric non-negative real valued matrix $M$ .…