Entanglement Barriers from Computational Complexity: MPS Approach to 3-SAT

Imaginary time propagation on matrix product states hits an extensive entanglement barrier when solving 3-SAT, traced to #P-complete counting complexity. Non-stabilizerness scales superlinearly, implying prohibitive T-gate costs on quantum hardware.

#QuantumComputing #MatrixProductStates #Research #Informaq

https://iq.fp2.dev/b6eA2