4 citations · 9 across the 7 of their papers we have counts for
8 papers
Lee-Yang theorem for fermions
Chaithanya Rayudu, Takahiro Misawa, Andrew Zhao +1
Lee-Yang theorems are a powerful tool for studying many-body systems, with applications ranging from analyzing phase transitions to proving the efficiency of certain classical and…
Modular-Annihilator Parent Hamiltonians for Purified Gibbs States: Spectral Design and Controlled Approximation
Changhao Yi, Jun Takahashi, Cunlu Zhou
Purified Gibbs states provide a bridge between finite-temperature physics, dissipative dynamics, and ground-state methods. In this work, we study the exact finite sum-of-squares (S…
Spectral gap of Lee-Yang Hamiltonians
Chaithanya Rayudu, Jun Takahashi
The Lee-Yang theorem and its quantum extensions state that, for a broad class of Hamiltonians on any graph, the partition function's zeros in the complex magnetic field plane lie o…
An SU(2)-symmetric Semidefinite Programming Hierarchy for Quantum Max Cut
Jun Takahashi, Chaithanya Rayudu, Cunlu Zhou +3
Understanding and approximating extremal energy states of local Hamiltonians is a central problem in quantum physics and complexity theory. Recent work has focused on developing ap…
Quantum Phase Estimation by Compressed Sensing
Changhao Yi, Cunlu Zhou, Jun Takahashi
As a signal recovery algorithm, compressed sensing is particularly useful when the data has low-complexity and samples are rare, which matches perfectly with the task of quantum ph…
Constructing Concrete Hard Instances of the Maximum Independent Set Problem
Naoto Shiraishi, Jun Takahashi
We provide a deterministic construction of hard instances for the maximum independent set problem (MIS). The constructed hard instances form an infinite graph sequence with increas…
An exact algorithm exhibiting RS-RSB/easy-hard correspondence for the maximum independent set problem
Jun Takahashi, Satoshi Takabe, Koji Hukushima
A recently proposed exact algorithm for the maximum independent set problem is analyzed. The typical running time is improved exponentially in some parameter regions compared to si…
A Fidelity Susceptibility Approach to Quantum Annealing of NP-hard problems
Jun Takahashi, Koji Hukushima
The computational complexity conjecture of NP BQP implies that there should be an exponentially small energy gap for Quantum Annealing (QA) of NP-hard problems. We aim…