Polynomial-Time Classical Simulation of Hidden Shift Circuits via Confluent Rewriting of Symbolic Sums
Authors: Matthew Amy, Lucas Shigeru Stinchcombe
Overview: Demonstrates that a formal rewrite system for boolean path sums is
confluent in general. Applying the rewrite system results to a widely used benchmark algorithm
resolves the conjecture of its polynomial-time classical simulation.