On the Computational Complexity of Geometrically Local QAC0 circuits

Researchers have begun investigating the computational complexity of geometrically local QAC0 circuits, a specific type of constant-depth, polynomial-size quantum circuit family. These circuits consist of arbitrary single-qubit unitaries and n-qubit generalized Toffoli gates, with the added constraint that all gates are geometrically local. This constraint limits the interaction between qubits, making the circuits more realistic for near-term quantum devices. The study of QAC0 circuits has gained significant attention recently due to their potential applications in quantum computing¹. By analyzing the computational complexity of these circuits, researchers can better understand their capabilities and limitations. The results of this study can inform the design of more efficient quantum algorithms and provide insights into the fundamental limits of quantum computation. This matters to quantum computing practitioners because understanding the computational complexity of geometrically local QAC0 circuits can help them develop more practical and efficient quantum computing architectures.