GCAMPS: A Scalable Classical Simulator for Qudit Systems

• URL: http://arxiv.org/abs/2511.06672v1
• Date: Mon, 10 Nov 2025 03:39:23 GMT
• Title: GCAMPS: A Scalable Classical Simulator for Qudit Systems
• Authors: Ben Harper, Azar C. Nakhl, Thomas Quella, Martin Sevior, Muhammad Usman,
• Abstract summary: We introduce a new hybrid simulation method for classical quantum systems.<n>We benchmark this method on quantum systems with three degrees of freedom, i.e. qutrits.<n>We see a greater improvement with qutrit simulation compared to qubit simulation on the same $T$-doped random benchmarking circuit.<n>This extension allows for the classical simulation of problems that were previously intractable without access to a quantum device.
• Score: 1.126030751694434
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Boundaries for quantum advantage with single photons and loop-based time-bin interferometers [37.28808413070634]
  Loop-based boson samplers interfere photons in the time degree of freedom using a sequence of delay lines.<n>We propose a method to exploit this loop-based structure to more efficiently classically sample from such systems.
  arXiv  Detail & Related papers  (2024-11-25T19:13:20Z)
• Fast classical simulation of qubit-qudit hybrid systems [6.116156387681214]
  Simulating quantum circuits is a computationally intensive task that relies heavily on tensor products and matrix multiplications. Recent advancements, eliminate the need for tensor products and matrix multiplications, offering significant improvements in efficiency and parallelization. We propose a block-simulation methodology applicable to qubit-qudit hybrid systems.
  arXiv  Detail & Related papers  (2024-10-23T13:49:25Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Hybrid Stabilizer Matrix Product Operator [44.99833362998488]
  We introduce a novel hybrid approach combining tensor network methods with the stabilizer formalism to address the challenges of simulating many-body quantum systems. We demonstrate the effectiveness of our method through applications to random Clifford T-doped circuits and Random Clifford Floquet Dynamics.
  arXiv  Detail & Related papers  (2024-05-09T18:32:10Z)
• TANQ-Sim: Tensorcore Accelerated Noisy Quantum System Simulation via QIR on Perlmutter HPC [16.27167995786167]
  TANQ-Sim is a full-scale density matrix based simulator designed to simulate practical deep circuits with both coherent and non-coherent noise. To address the significant computational cost associated with such simulations, we propose a new density-matrix simulation approach. To optimize performance, we also propose specific gate fusion techniques for density matrix simulation.
  arXiv  Detail & Related papers  (2024-04-19T21:16:29Z)
• Quantum Tunneling: From Theory to Error-Mitigated Quantum Simulation [49.1574468325115]
  This study presents the theoretical background and the hardware aware circuit implementation of a quantum tunneling simulation. We use error mitigation techniques (ZNE and REM) and multiprogramming of the quantum chip for solving the hardware under-utilization problem.
  arXiv  Detail & Related papers  (2024-04-10T14:27:07Z)
• Quantum Simulation of Dissipative Energy Transfer via Noisy Quantum Computer [0.40964539027092917]
  We propose a practical approach to simulate the dynamics of an open quantum system on a noisy computer. Our method leverages gate noises on the IBM-Q real device, enabling us to perform calculations using only two qubits. In the last, to deal with the increasing depth of quantum circuits when doing Trotter expansion, we introduced the transfer tensor method(TTM) to extend our short-term dynamics simulation.
  arXiv  Detail & Related papers  (2023-12-03T13:56:41Z)
• Classical Chaos in Quantum Computers [39.58317527488534]
  Current-day quantum processors, comprising 50-100 qubits, operate outside the range of quantum simulation on classical computers. We demonstrate that the simulation of classical limits can be a potent diagnostic tool potentially mitigating this problem. We find that classical and quantum simulations lead to similar stability metrics in systems with $mathcalO$ transmons.
  arXiv  Detail & Related papers  (2023-04-27T18:00:04Z)
• Tensor Networks or Decision Diagrams? Guidelines for Classical Quantum Circuit Simulation [65.93830818469833]
  tensor networks and decision diagrams have independently been developed with differing perspectives, terminologies, and backgrounds in mind. We consider how these techniques approach classical quantum circuit simulation, and examine their (dis)similarities with regard to their most applicable abstraction level. We provide guidelines for when to better use tensor networks and when to better use decision diagrams in classical quantum circuit simulation.
  arXiv  Detail & Related papers  (2023-02-13T19:00:00Z)
• QuDiet: A Classical Simulation Platform for Qubit-Qudit Hybrid Quantum Systems [7.416447177941264]
  textbfQuDiet is a python-based higher-dimensional quantum computing simulator. textbfQuDiet offers multi-valued logic operations by utilizing generalized quantum gates. textbfQuDiet provides a full qubit-qudit hybrid quantum simulator package.
  arXiv  Detail & Related papers  (2022-11-15T06:07:04Z)
• A Reorder Trick for Decision Diagram Based Quantum Circuit Simulation [0.4358626952482686]
  We study two classes of quantum circuits on which the state-of-the-art decision diagram based simulators failed to perform well in terms of simulation time. We propose a simple and powerful reorder trick to boost the simulation of such quantum circuits.
  arXiv  Detail & Related papers  (2022-11-14T04:55:25Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.