On the Computational Power of Geometrically Local QAC circuits
The research investigates geometrically local Quantum Approximate Circuits (QAC0), where gates only act on nearest neighbors. It finds that these circuits are as powerful as general QAC0 circuits but establishes strong lower bounds for computing functions like Parity in restricted models, showing limitations in 1D-QAC and suggesting structural limits in 2D-QAC.