13 citations · 14 across the 3 of their papers we have counts for
5 papers
The quantum smooth label cover problem is undecidable
Eric Culf, Kieran Mastel, Connor Paddock +1
We show that the quantum smooth label cover problem is undecidable and RE-hard. This sharply contrasts the quantum unique label cover problem, which can be decided efficiently by a…
Gap-preserving reductions and RE-completeness of independent set games
Laura Mančinska, Pieter Spaas, Taro Spirig +1
In complexity theory, gap-preserving reductions play a crucial role in studying hardness of approximation and in analyzing the relative complexity of multiprover interactive proof…
A Quantum Unique Games Conjecture
Hamoon Mousavi, Taro Spirig
After the NP-hardness of computational problems such as 3SAT and MaxCut was established, a natural next step was to explore whether these problems remain hard to approximate. While…
Approximation algorithms for noncommutative CSPs
Eric Culf, Hamoon Mousavi, Taro Spirig
Noncommutative constraint satisfaction problems (NC-CSPs) are higher-dimensional operator extensions of classical CSPs. Despite their significance in quantum information, their app…
Renormalization group flows in AdS and the bootstrap program
Marco Meineri, Joao Penedones, Taro Spirig
We study correlation functions of the bulk stress tensor and boundary operators in Quantum Field Theories (QFT) in Anti-de Sitter (AdS) space. In particular, we derive new sum rule…