Classical simulations of quantum systems are notoriously difficult computational problems, with conventional state vector and tensor network methods restricted to quantum systems that feature only a small number of qudits. The recently introduced Clifford Augmented Matrix Product State (CAMPS) method offer scalability and efficiency by combining both tensor network and stabilizer simulation techniques and leveraging their complementary advantages. This hybrid simulation method has indeed demonstrated significant improvements in simulation performance for qubit circuits. Our work generalises the CAMPS method to higher quantum degrees of freedom -- qudit simulation, resulting in a generalised CAMPS (GCAMPS). Benchmarking this extended simulator on quantum systems with three degrees of freedom, i.e. qutrits, we show that similar to the case of qubits, qutrit systems also benefit from a comparable speedup using these techniques. Indeed, we see a greater improvement with qutrit simulation compared to qubit simulation on the same $T$-doped random Clifford benchmarking circuit as a result of the increased difficulty of conventional qutrit simulation using tensor networks. This extension allows for the classical simulation of problems that were previously intractable without access to a quantum device and will open new avenues to study complex many-body physics and to develop efficient methods for quantum information processing.
Journal reference
SCA/HPCAsia 2026: Proceedings of the Supercomputing Asia and International Conference on High Performance Computing in Asia Pacific Region
Classical simulations of quantum systems are notoriously difficult computational problems, with conventional state vector and tensor network methods restricted to quantum systems that feature only a small number of qudits. The recently introduced Clifford Augmented Matrix Product State (CAMPS) method offer scalability and efficiency by combining both tensor network and stabilizer simulation techniques and leveraging their complementary advantages. This hybrid simulation method has indeed demonstrated significant improvements in simulation performance for qubit circuits. Our work generalises the CAMPS method to higher quantum degrees of freedom -- qudit simulation, resulting in a generalised CAMPS (GCAMPS). Benchmarking this extended simulator on quantum systems with three degrees of freedom, i.e. qutrits, we show that similar to the case of qubits, qutrit systems also benefit from a comparable speedup using these techniques. Indeed, we see a greater improvement with qutrit simulation compared to qubit simulation on the same T-doped random Clifford benchmarking circuit as a result of the increased difficulty of conventional qutrit simulation using tensor networks. This extension allows for the classical simulation of problems that were previously intractable without access to a quantum device and will open new avenues to study complex many-body physics and to develop efficient methods for quantum information processing.
The study of classical simulability is a key part of quantum information theory, providing new tools for fundamental research and the development of quantum computing. An increasingly successful framework for the study of simulability is resource theory. The best-known and best-understood quantum resource is entanglement, but in recent years nonstabilizerness, or magic, has also been gathering attention from the community. It is not yet well understood to what extent different resources play off each other in making systems hard to classically simulate. It has recently been shown that Clifford-augmented matrix product states (CAMPS) allow for efficient circuit simulation in some cases where both entanglement and magic are present. Another emerging method which has shown the ability to simulate systems with both resources is Pauli propagation (PP). Furthermore, the interplay between entanglement and magic at the level of physical phenomena is also poorly understood, in particular in the context of real-time dynamics. In this work, I implement an analytical algorithm proposed by Fux et al. (2025) which allows CAMPS to efficiently simulate essentially the first N non-Clifford Pauli exponential gates in an N-qubit quantum circuit, reproducing results obtained by greedy-search entanglement cooling in the paper. I then develop CAMPS-PP, a method for expectation value dynamics which evolves the state as a CAMPS and the observable in the Heisenberg picture using PP. I show that this method is significantly faster than pure CAMPS for slightly deep random Pauli rotation circuits at the tested system sizes, up to N=100, with improvements of up to two orders of magnitude for N=20. Finally, in order to investigate the physical relevance of magic I apply CAMPS-PP to an XXZ Heisenberg Floquet circuit with Clifford and non-Clifford angles, finding that CAMPS-PP slightly extends the simulable non-Clifford gate density and significantly reduces memory requirements compared to PP.
Determining the quantum-classical boundary between quantum circuits that can be efficiently simulated classically and those that cannot remains a fundamental question. One approach to classical simulation is to represent the output of a quantum circuit as a Clifford-augmented matrix product state (CAMPS), which, via a disentangling algorithm, decomposes the wave function into Clifford and MPS components, and from which Pauli expectation values can be computed in time polynomial in the MPS bond dimension. In this work, we develop an optimization-free disentangling (OFD) algorithm for Clifford circuits either doped with T gates or, equivalently, preceded by multiqubit gates of the form α I + β P . We give a simple and easily computed algebraic criterion that characterizes the individual quantum circuits for which OFD generates an efficient CAMPS—the bond dimension is exponential in the null space of a Galois binary field GF(2) matrix induced by a tableau of the twisted Pauli strings P . This significantly increases the number of circuits with rigorous polynomial-time classical simulations. We also give evidence that the typical N qubit random Clifford circuit doped with N uniformly distributed T gates of polylogarithmic depth or greater has a CAMPS with polynomial bond dimension. In addition, we compare OFD against disentangling by optimization. We further explore the representability of CAMPS for random Clifford circuits doped with more than N T gates. We also propose algorithms for sampling, probability, and amplitude estimation of bitstrings, and evaluation of entanglement Rényi entropy from CAMPS, which, though still having exponential complexity, are more efficient than standard MPS simulations. This work establishes a versatile framework for understanding classical simulatability of Clifford + T circuits and explores the interplay between quantum entanglement and quantum magic in quantum systems.
Tensor network methods leverage the limited entanglement of quantum states to efficiently simulate many-body systems. Alternatively, Clifford circuits provide a framework for handling highly entangled stabilizer states, which have low magic and are thus also classically tractable. Clifford tensor networks combine the benefits of both approaches, exploiting Clifford circuits to reduce the classical complexity of the tensor network description of states, with promising effects on simulation approaches. We study the disentangling power of Clifford transformations acting on tensor networks, with a particular emphasis on entanglement cooling strategies. We identify regimes where exact or heuristic Clifford disentanglers are effective, explain the link between the two approaches, and characterize their breakdown as non-Clifford resources accumulate. Additionally, we prove that, beyond stabilizer settings, no Clifford operation can universally disentangle even a single qubit from an arbitrary non-Clifford rotation. Our results clarify both the capabilities and fundamental limitations of Clifford-based simulation methods.
Classical simulation of quantum systems is indispensable for validating quantum algorithms, benchmarking near-term quantum hardware, and understanding quantum advantage boundaries. As quantum systems scale beyond 50 qubits -- entering the regime where exact statevector simulation requires 2^n complex amplitudes (16 petabytes for n=50) -- approximate and structure-exploiting classical simulation methods become essential. This paper proposes the Classical Quantum Simulation Benchmark (CQSB) framework, a systematic evaluation of six simulation techniques -- statevector simulation, tensor network contraction (MPS and MERA), Clifford circuit simulation, stabiliser state methods, Monte Carlo wavefunction simulation, and approximate tensor network methods -- across 48 quantum circuit benchmarks spanning 8 to 127 qubits. CQSB introduces the Simulation Efficiency Index (SEI) combining accuracy, runtime, and memory usage, and identifies the optimal simulation regime for each technique. Key results: MPS tensor networks achieve exact simulation to 127 qubits for circuits with bond dimension χ <= 512; Clifford simulation scales to 10,000 qubits in O(n2) time; approximate tensor network contraction produces fidelity > 0.95 for 72-qubit random circuits within 4.8 hours on a 256-GPU cluster. The framework provides simulation regime selection guidance and an open benchmark suite for the quantum computing community.
Abstract In recent years, numerous research advancements have extended the limit of classical simulation of quantum algorithms. Although, most of the state‐of‐the‐art classical simulators are only limited to binary quantum systems, which restrict the classical simulation of higher‐dimensional quantum computing systems. Through recent developments in higher‐dimensional quantum computing systems, it is realised that implementing qudits improves the overall performance of a quantum algorithm by increasing memory space and reducing the asymptotic complexity of a quantum circuit. Hence, in this article, QuDiet , a state‐of‐the‐art user‐friendly python‐based higher‐dimensional quantum computing simulator is introduced. QuDiet offers multi‐valued logic operations by utilising generalised quantum gates with an abstraction so that any naive user can simulate qudit systems with ease as compared to the existing ones. Various benchmark quantum circuits is simulated in QuDiet and show the considerable speedup in simulation time as compared to the other simulators without loss in precision. Finally, QuDiet provides a full qubit‐qudit hybrid quantum simulator package with quantum circuit templates of well‐known quantum algorithms for fast prototyping and simulation. Comprehensive simulation up to 20 qutrits circuit on depth 80 on QuDiet was successfully achieved. The complete code and packages of QuDiet is available at https://github.com/LegacYFTw/QuDiet .
This Letter augments the recently introduced stabilizer tensor network (STN) protocol with magic state injection, reporting a new framework with significantly enhanced ability to simulate circuits with an extensive number of non-Clifford operations. Specifically, for random T-doped N-qubit Clifford circuits the computational cost of circuits prepared with magic state injection scales as O[poly(N)] when the circuit has t≲N T gates compared to an exponential scaling for the STN approach, which is demonstrated in systems of up to 200 qubits. In the case of the hidden bit shift circuit, a paradigmatic benchmarking system for extended stabilizer methods with a tunable amount of magic, we report that our magic state injected STN framework can efficiently simulate 4000 qubits and 320T gates. These findings provide a promising outlook for the use of this protocol in the classical modeling of quantum circuits that are conventionally difficult to simulate efficiently.