5 papers
Reconstructing Historical Manuscripts through MSI: The Potential of Contrast in Assessing Image Quality and Legibility
Anna Breger
Digital restoration of historical manuscript images aims to improve readability while preserving the authenticity of cultural heritage documents. However, evaluating quality of res…
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 parametrized by an arbitrary symmetric non-negative real valued matrix .…
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 in the Holant framework. Due to the great expressiveness of the Holant framewor…
Vanishing Signatures, Orbit Closure, and the Converse of the Holant Theorem
Jin-Yi Cai, Ben Young
Valiant's Holant theorem is a powerful tool for algorithms and reductions for counting problems. It states that if two sets and of tensors (a.k.a. const…
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…