The SpinPulse library for transpilation and noise-accurate simulation of spin qubit quantum computers

• URL: http://arxiv.org/abs/2601.10435v1
• Date: Thu, 15 Jan 2026 14:29:24 GMT
• Title: The SpinPulse library for transpilation and noise-accurate simulation of spin qubit quantum computers
• Authors: Benoît Vermersch, Oscar Gravier, Nathan Miscopein, Julia Guignon, Carlos Ramos Marimón, Jonathan Durandau, Matthieu Dartiailh, Tristan Meunier, Valentin Savin,
• Abstract summary: SpinPulse is an open-source package for simulating spin qubit-based quantum computers at the pulse-level.<n>SpinPulse models the specific physics of spin qubits, particularly through the inclusion of classical non-Markovian noise.
• Score: 0.9306445148411
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We introduce SpinPulse, an open-source python package for simulating spin qubit-based quantum computers at the pulse-level. SpinPulse models the specific physics of spin qubits, particularly through the inclusion of classical non-Markovian noise. This enables realistic simulations of native gates and quantum circuits, in order to support hardware development. In SpinPulse, a quantum circuit is first transpiled into the native gate set of our model and then converted to a pulse sequence. This pulse sequence is subsequently integrated numerically in the presence of a simulated noisy experimental environment. We showcase workflows including transpilation, pulse-level compilation, hardware benchmarking, quantum error mitigation, and large-scale simulations via integration with the tensor-network library quimb. We expect SpinPulse to be a valuable open-source tool for the quantum computing community, fostering efforts to devise high-fidelity quantum circuits and improved strategies for quantum error mitigation and correction.

Related papers

• Digital Quantum Simulation of the Holstein-Primakoff Transformation on Noisy Qubits [40.8066152850216]
  We study the digital quantum simulation of bosonic modes on a cloud-based superconducting quantum processor.<n>We examine the interplay between algorithmic and hardware-induced errors to identify optimal simulation parameters.
  arXiv  Detail & Related papers  (2026-02-19T20:14:04Z)
• Pilot-Wave Simulator: Exact Classical Sampling from Ideal and Noisy Quantum Circuits up to Hundreds of Qubits [1.9573380763700712]
  We propose an exact sampling algorithm that integrates tensor network contraction techniques with a Markov process.<n>As a demonstration, we target the challenge of generating samples from ideal and noisy QAOA circuits with up to 476 qubits.
  arXiv  Detail & Related papers  (2025-10-28T09:33:11Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [50.95799256262098]
  Variational quantum circuits (VQCs) hold promise for quantum machine learning but face challenges in expressivity, trainability, and noise resilience.<n>We propose VQC-MLPNet, a hybrid architecture where a VQC generates the first-layer weights of a classical multilayer perceptron during training, while inference is performed entirely classically.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• Universal quantum processors in spin systems via robust local pulse sequences [0.0]
  We propose a protocol to realize quantum simulation and computation in spin systems with long-range interactions. Our approach relies on the local addressing of single spins with external fields parametrized by Walsh functions. We demonstrate and numerically benchmark our protocol with examples from the dynamics of spin models, quantum error correction and quantum optimization algorithms.
  arXiv  Detail & Related papers  (2023-11-17T15:55:04Z)
• High-fidelity dimer excitations using quantum hardware [1.3977204802483425]
  We simulate the dynamics of a quantum spin dimer, the basic quantum unit of emergent many-body spin systems. Results pave an important avenue to benchmark, or even predict, the outputs of the costly INS experiments.
  arXiv  Detail & Related papers  (2023-04-12T20:12:28Z)
• Adaptively partitioned analog quantum simulation on near-term quantum computers: The nonclassical free-induction decay of NV centers in diamond [0.24475591916185496]
  We propose an alternative analog simulation approach on near-term quantum devices. Our approach circumvents the limitations by adaptively partitioning the bath into several groups. This work sheds light on a flexible approach to simulate large-scale materials on noisy near-term quantum computers.
  arXiv  Detail & Related papers  (2023-03-03T14:39:48Z)
• Simulating spin dynamics with quantum computers [0.0]
  IBM quantum computers are used to simulate the dynamics of small systems of interacting quantum spins. We compute the exact time evolution at arbitrary times and measure spin expectation values and energy.
  arXiv  Detail & Related papers  (2022-06-29T16:46:04Z)
• Recompilation-enhanced simulation of electron-phonon dynamics on IBM Quantum computers [62.997667081978825]
  We consider the absolute resource cost for gate-based quantum simulation of small electron-phonon systems. We perform experiments on IBM quantum hardware for both weak and strong electron-phonon coupling. Despite significant device noise, through the use of approximate circuit recompilation we obtain electron-phonon dynamics on current quantum computers comparable to exact diagonalisation.
  arXiv  Detail & Related papers  (2022-02-16T19:00:00Z)
• 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)
• An Algebraic Quantum Circuit Compression Algorithm for Hamiltonian Simulation [55.41644538483948]
  Current generation noisy intermediate-scale quantum (NISQ) computers are severely limited in chip size and error rates. We derive localized circuit transformations to efficiently compress quantum circuits for simulation of certain spin Hamiltonians known as free fermions. The proposed numerical circuit compression algorithm behaves backward stable and scales cubically in the number of spins enabling circuit synthesis beyond $mathcalO(103)$ spins.
  arXiv  Detail & Related papers  (2021-08-06T19:38:03Z)
• Pulse-level noisy quantum circuits with QuTiP [53.356579534933765]
  We introduce new tools in qutip-qip, QuTiP's quantum information processing package. These tools simulate quantum circuits at the pulse level, leveraging QuTiP's quantum dynamics solvers and control optimization features. We show how quantum circuits can be compiled on simulated processors, with control pulses acting on a target Hamiltonian.
  arXiv  Detail & Related papers  (2021-05-20T17:06:52Z)
• Tensor Network Quantum Virtual Machine for Simulating Quantum Circuits at Exascale [57.84751206630535]
  We present a modernized version of the Quantum Virtual Machine (TNQVM) which serves as a quantum circuit simulation backend in the e-scale ACCelerator (XACC) framework. The new version is based on the general purpose, scalable network processing library, ExaTN, and provides multiple quantum circuit simulators. By combining the portable XACC quantum processors and the scalable ExaTN backend we introduce an end-to-end virtual development environment which can scale from laptops to future exascale platforms.
  arXiv  Detail & Related papers  (2021-04-21T13:26:42Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)

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.