Cover Image

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

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Amy, Matthew, Stinchcombe, Lucas Shigeru
Format:	Preprint
Published:	2024
Subjects:	Quantum Physics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Fast Classical Simulation of Quantum Circuits via Parametric Rewriting in the ZX-Calculus
by: Sutcliffe, Matthew, et al.
Published: (2024)

Polynomial-Time Classical Simulation of Noisy IQP Circuits with Constant Depth
by: Rajakumar, Joel, et al.
Published: (2024)

Polynomial-Time Classical Simulation of Noisy Quantum Circuits with Naturally Fault-Tolerant Gates
by: Nelson, Jon, et al.
Published: (2024)

Polynomial Resource Classification of Quantum Circuit Familes via Classical Shadows
by: Maciejunes, Andrew, et al.
Published: (2026)

Classically Sampling Noisy Quantum Circuits in Quasi-Polynomial Time under Approximate Markovianity
by: Zhang, Yifan F., et al.
Published: (2025)

On Classical Simulation of Quantum Circuits Composed of Clifford Gates
by: Biswas, George
Published: (2024)

Efficient Classical Simulation of Heuristic Peaked Quantum Circuits
by: Kremer, David, et al.
Published: (2026)

Fast Scrambling in Classically Simulable Quantum Circuits
by: Blake, Mike, et al.
Published: (2024)

Efficient Classical Simulation of the DQC1 Circuit with Zero Discord
by: Jose, Shalin, et al.
Published: (2024)

Confluent supersymmetric algorithm for bilayer graphene
by: de la Cruz-Hernandez, Jonathan, et al.
Published: (2025)

Classical Simulability of Quantum Circuits with Shallow Magic Depth
by: Zhang, Yifan, et al.
Published: (2024)

Applicability and Limitations of Quantum Circuit Cutting in Classical State-Vector Simulation
by: Matsumoto, Mitsuhiro, et al.
Published: (2026)

SSR: A Swapping-Sweeping-and-Rewriting Optimizer for Quantum Circuit Transformation
by: Huang, Yunqi, et al.
Published: (2025)

ZX-DB: A Graph Database for Quantum Circuit Simplification and Rewriting via the ZX-Calculus
by: Uotila, Valter, et al.
Published: (2025)

Rewriting and Completeness of Sum-Over-Paths in Dyadic Fragments of Quantum Computing
by: Vilmart, Renaud
Published: (2023)

Classical Obfuscation of Quantum Circuits via Publicly-Verifiable QFHE
by: Bartusek, James, et al.
Published: (2025)

Classically Simulating Quantum Supremacy IQP Circuits through a Random Graph Approach
by: Codsi, Julien, et al.
Published: (2022)

Time-Dynamic Circuits for Fault-Tolerant Shift Automorphisms in Quantum LDPC Codes
by: Kim, Younghun, et al.
Published: (2026)

Quantum Circuit Cutting for Classical Shadows
by: Chen, Daniel T., et al.
Published: (2022)

Procedurally Optimised ZX-Diagram Cutting for Efficient T-Decomposition in Classical Simulation
by: Sutcliffe, Matthew, et al.
Published: (2024)

Practical Quantum Circuit Implementation for Simulating Coupled Classical Oscillators
by: Luangsirapornchai, Natt, et al.
Published: (2025)

Polynomial Reduction Methods and their Impact on QAOA Circuits
by: Schmidbauer, Lukas, et al.
Published: (2024)

A Sound and Complete Equational Theory for 3-Qubit Toffoli-Hadamard Circuits
by: Amy, Matthew, et al.
Published: (2024)

Instantaneous Quantum Polynomial-Time Sampling and Verifiable Quantum Advantage: Stabilizer Scheme and Classical Security
by: Bremner, Michael J., et al.
Published: (2023)

Quadratic Sums-of-Powers for Fixed-Parameter Tractable Quantum-Circuit Simulation
by: de Colnet, Alexis, et al.
Published: (2026)

Pilot-Wave Simulator: Exact Classical Sampling from Ideal and Noisy Quantum Circuits up to Hundreds of Qubits
by: Kalachev, Gleb, et al.
Published: (2025)

Test-Time Training with Quantum Auto-Encoder: From Distribution Shift to Noisy Quantum Circuits
by: Jian, Damien, et al.
Published: (2024)

A Polynomial Time Quantum Algorithm for Exponentially Large Scale Nonlinear Differential Equations via Hamiltonian Simulation
by: Tanaka, Yu, et al.
Published: (2023)

Efficient Classical Processing of Constant-Depth Time Evolution Circuits in Control Hardware
by: Francis, Akhil, et al.
Published: (2025)

Simulating Time Dependent and Nonlinear Classical Oscillators through Nonlinear Schrödingerization
by: Muraleedharan, Abhinav, et al.
Published: (2025)

Oracle Separations for the Quantum-Classical Polynomial Hierarchy
by: Agarwal, Avantika, et al.
Published: (2024)

Nonstabilizerness without Magic: Classically Simulatable Quantum States That Are Indistinguishable by Classically Simulatable Quantum Circuits
by: Kwon, Hyukjoon
Published: (2025)

Smarter k-Partitioning of ZX-Diagrams for Improved Quantum Circuit Simulation
by: Sutcliffe, Matthew
Published: (2024)

Quantum Circuit Encodings of Polynomial Chaos Expansions
by: Aftab, Junaid, et al.
Published: (2025)

Extending Classically Simulatable Bounds of Clifford Circuits with Nonstabilizer States via Framed Wigner Functions
by: Park, Guedong, et al.
Published: (2023)

Exact Synthesis of Multiqubit Clifford-Cyclotomic Circuits
by: Amy, Matthew, et al.
Published: (2023)

Unifying Graph Measures and Stabilizer Decompositions for the Classical Simulation of Quantum Circuits
by: Codsi, Julien, et al.
Published: (2026)

Preparation Circuits for Matrix Product States by Classical Variational Disentanglement
by: Mansuroglu, Refik, et al.
Published: (2025)

Half the Interference, Most of the Answer: Approximate Quantum Simulation via Path-Sum Pruning
by: Pehlivanoglu, Sinan, et al.
Published: (2026)

Symbolic Pauli Propagation for Gradient-Enabled Pre-Training of Quantum Circuits
by: Monaco, Saverio, et al.
Published: (2025)