Imagen de Portada

Fast Classical Simulation of Quantum Circuits via Parametric Rewriting in the ZX-Calculus

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Sutcliffe, Matthew, Kissinger, Aleks
Formato:	Preprint
Publicado:	2024
Materias:	Quantum Physics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Efficient Classical Simulation of Low-Rank-Width Quantum Circuits Using ZX-Calculus
por: Kuyanov, Fedor, et al.
Publicado: (2026)

ZX-Flow: A Flexible Criterion for Deterministic Computation with ZX-Diagrams
por: Kissinger, Aleks, et al.
Publicado: (2026)

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

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

Completeness for Fault Equivalence of Clifford ZX Diagrams
por: Rüsch, Maximilian, et al.
Publicado: (2025)

Hybrid Quantum-Classical Machine Learning with String Diagrams
por: Koziell-Pipe, Alexander, et al.
Publicado: (2024)

Equivariant Reinforcement Learning for Clifford Quantum Circuit Synthesis
por: Yeung, Richie, et al.
Publicado: (2026)

Reinforcement Learning Based Quantum Circuit Optimization via ZX-Calculus
por: Riu, Jordi, et al.
Publicado: (2023)

Preserving MWPM-Decodability in Fault-Equivalent Rewrites
por: Schweikart, Maximilian, et al.
Publicado: (2026)

Exhaustive Search for Quantum Circuit Optimization using ZX Calculus
por: Fischbach, Tobias, et al.
Publicado: (2025)

A Review on Quantum Circuit Optimization using ZX-Calculus
por: Fischbach, Tobias, et al.
Publicado: (2025)

Quantum Supermaps are Characterized by Locality
por: Wilson, Matt, et al.
Publicado: (2022)

Clifford and Non-Clifford Splitting in Quantum Circuits: Applications and ZX-Calculus Detection Procedure
por: Lima, Fernando, et al.
Publicado: (2025)

Polynomial-Time Classical Simulation of Hidden Shift Circuits via Confluent Rewriting of Symbolic Sums
por: Amy, Matthew, et al.
Publicado: (2024)

ZX Graphical Calculus for Continuous-Variable Quantum Processes
por: Nagayoshi, Hironari, et al.
Publicado: (2024)

Finite-Dimensional ZX-Calculus for Loop Quantum Gravity
por: Priestley, Ben
Publicado: (2025)

Quantum Circuit Optimization Based on Dynamic Grouping and ZX-Calculus for Reducing 2-Qubit Gate Count
por: Chen, Kai, et al.
Publicado: (2025)

Chutes and Ladders: Dynamical Automorphisms via the ZX-Calculus
por: Frei, Alexander, et al.
Publicado: (2026)

Floquetifying stabiliser codes with distance-preserving rewrites
por: Rodatz, Benjamin, et al.
Publicado: (2024)

Scalable Spider Nests (...Or How to Graphically Grok Transversal Non-Clifford Gates)
por: Kissinger, Aleks, et al.
Publicado: (2024)

Ultra Low Overhead Syndrome Extraction for the Steane code
por: Poór, Boldizsár, et al.
Publicado: (2025)

Fault Tolerance by Construction
por: Rodatz, Benjamin, et al.
Publicado: (2025)

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

The Focked-up ZX Calculus: Picturing Continuous-Variable Quantum Computation
por: Shaikh, Razin A., et al.
Publicado: (2024)

A complete logic for causal consistency
por: Simmons, Will, et al.
Publicado: (2024)

Graphical Algebraic Geometry: From Ideals and Varieties to Quantum Calculi
por: Gao, Dichuan, et al.
Publicado: (2026)

Finding trail covers: near-optimal decompositions of graph states as linear fusion networks
por: Cashman, William, et al.
Publicado: (2025)

Weighted Projective Line ZX Calculus: Quantized Orbifold Geometry for Quantum Compilation
por: Cho, Gunhee, et al.
Publicado: (2025)

A ZX-Calculus Approach for the Construction of Graph Codes
por: Wu, Zipeng, et al.
Publicado: (2023)

From Fermions to Qubits: A ZX-Calculus Perspective
por: McDowall-Rose, Haytham, et al.
Publicado: (2025)

Automated quantum circuit optimization with randomized replacements
por: Szyniszewski, Marcin, et al.
Publicado: (2026)

Catalysing Completeness and Universality
por: Kissinger, Aleks, et al.
Publicado: (2024)

Unveiling a Hidden Percolation Transition in Monitored Clifford Circuits: Inroads from ZX-Calculus
por: Buznach, Einat, et al.
Publicado: (2025)

Optimal compilation of parametrised quantum circuits
por: van de Wetering, John, et al.
Publicado: (2024)

Alternating ZX Circuit Extraction for Hardware-Adaptive Compilation
por: Schmid, Ludwig, et al.
Publicado: (2026)

Optimizing Quantum Circuits via ZX Diagrams using Reinforcement Learning and Graph Neural Networks
por: Mattick, Alexander, et al.
Publicado: (2025)

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

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

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