Polynomial-Time Classical Simulation of Hidden Shift Circuits via Confluent Rewriting of Symbolic Sums

Documenti analoghi

• Fast Classical Simulation of Quantum Circuits via Parametric Rewriting in the ZX-Calculus
  di: Sutcliffe, Matthew, et al.
  Pubblicazione: (2024)
• Polynomial-Time Classical Simulation of Noisy IQP Circuits with Constant Depth
  di: Rajakumar, Joel, et al.
  Pubblicazione: (2024)
• Polynomial-Time Classical Simulation of Noisy Quantum Circuits with Naturally Fault-Tolerant Gates
  di: Nelson, Jon, et al.
  Pubblicazione: (2024)
• Polynomial Resource Classification of Quantum Circuit Familes via Classical Shadows
  di: Maciejunes, Andrew, et al.
  Pubblicazione: (2026)
• Classically Sampling Noisy Quantum Circuits in Quasi-Polynomial Time under Approximate Markovianity
  di: Zhang, Yifan F., et al.
  Pubblicazione: (2025)