Quon Classical Simulation: Unifying Clifford, Matchgates and Entanglement

2025-05-12

AI Summary

This work addresses the fundamental computational complexity of quantum circuit simulation by constructing a unified classical simulation framework. Methodologically, it introduces “magic holes”—a novel topological feature serving as a global measure of quantum non-classicality—and establishes a topological tensor network model grounded in the Quon diagrammatic language. It further defines topological entanglement entropy to quantify simulation complexity, derives new skein relations, and designs a circuit reduction algorithm. The key contributions are threefold: (i) it provides, for the first time, a unified topological explanation for the efficient classical simulability of both Clifford and matchgate circuits; (ii) it proves that bounded magic-hole number constitutes a new necessary and sufficient criterion for classical simulability of quantum circuits; and (iii) it significantly improves simulation efficiency for circuits with few magic holes, thereby establishing a geometric–topological dual framework for quantum simulability.

Technology Category

• Machine Learning: Quantum Machine Learning
• Knowledge Representation and Reasoning: Computational Complexity of Reasoning
• Search and Optimization: Sampling/Simulation-based Search

Application Category

• Graph Algorithms and Modeling for the Web: Foundation models and LLMs for Web-related graphs
• Web Mining and Content Analysis: Web data generation and simulation
• Economics, Online Markets and Human Computation: Incentives in network design for Web infrastructures and ecosystems

Abstract

We propose a unified classical simulation framework for quantum circuits, termed Quon Classical Simulation (QCS), built upon the diagrammatic formalism of the Quon language. Central to this framework is the introduction of magic holes, a topological feature that captures the global source of computational hardness in simulating quantum systems. Unlike conventional measures, the complexity of QCS is governed by the topological entanglement entropy associated with these magic holes. We show that Clifford circuits and Matchgate circuits are free of magic holes and thus efficiently simulable within our model. To capture the interaction structure of magic holes, we define a topological tensor network representation and develop novel skein relations and reduction algorithms to simplify circuit representations. This approach significantly improves the efficiency of classical simulations and provides a unified explanation for the tractability of various known quantum circuit classes. Our work offers a new topological perspective on the classical simulability of quantum systems and topological complexity.

Problem

• Unifying classical simulation of quantum circuits via Quon framework
• Introducing magic holes to capture computational hardness sources
• Explaining tractability of Clifford and Matchgate circuits topologically

Innovation

• Introduces magic holes for quantum simulation complexity
• Uses topological tensor networks for circuit representation
• Develops skein relations to simplify circuit analysis