Efficient Simulation of High-Level Quantum Gates

• URL: http://arxiv.org/abs/2507.04337v1
• Date: Sun, 06 Jul 2025 10:48:42 GMT
• Title: Efficient Simulation of High-Level Quantum Gates
• Authors: Adam Husted Kjelstrøm, Andreas Pavlogiannis, Jaco van de Pol,
• Abstract summary: Existing simulation methods require compilation to a low-level gate-set before simulation.<n>This increases circuit size and incurs a considerable (typically exponential) overhead, even when the number of high-level gates is small.<n>Here we present a gadget-based simulator which simulates high-level gates directly, thereby allowing to avoid or reduce the blowup of compilation.
• Score: 3.0928226965455154
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum circuit simulation is paramount to the verification and optimization of quantum algorithms, and considerable research efforts have been made towards efficient simulators. While circuits often contain high-level gates such as oracles and multi-controlled X (CkX) gates, existing simulation methods require compilation to a low-level gate-set before simulation. This, however, increases circuit size and incurs a considerable (typically exponential) overhead, even when the number of high-level gates is small. Here we present a gadget-based simulator which simulates high-level gates directly, thereby allowing to avoid or reduce the blowup of compilation. Our simulator uses a stabilizer decomposition of the magic state of non-stabilizer gates, with improvements in the rank of the magic state directly improving performance. We then proceed to establish a small stabilizer rank for a range of high-level gates that are common in various quantum algorithms. Using these bounds in our simulator, we improve both the theoretical complexity of simulating circuits containing such gates, and the practical running time compared to standard simulators found in IBM's Qiskit Aer library. We also derive exponential lower-bounds for the stabilizer rank of some gates under common complexity-theoretic hypotheses. In certain cases, our lower-bounds are asymptotically tight on the exponent.

Related papers

• Optimization and Synthesis of Quantum Circuits with Global Gates [44.99833362998488]
  We use global interactions, such as the Global Molmer-Sorensen gate present in ion trap hardware, to optimize and synthesize quantum circuits.<n>The algorithm is based on the ZX-calculus and uses a specialized circuit extraction routine that groups entangling gates into Global MolmerSorensen gates.<n>We benchmark the algorithm in a variety of circuits, and show how it improves their performance under state-of-the-art hardware considerations.
  arXiv  Detail & Related papers  (2025-07-28T10:25:31Z)
• STABSim: A Parallelized Clifford Simulator with Features Beyond Direct Simulation [14.727423336101864]
  We present a GPU-accelerated tableau stabilizer simulator that scales efficiently in direct circuit simulation.<n>We show how the simulator is used to quickly calculate Pauli commutation groupings between Pauli strings to reduce the number of circuit runs in quantum chemistry problems.<n>We also present a Clifford+T circuit transpiler based on STABSim, which uses the simulator framework to track relations in non-Clifford rotations.
  arXiv  Detail & Related papers  (2025-07-03T18:05:19Z)
• TQml Simulator: Optimized Simulation of Quantum Machine Learning [0.0]
  We benchmark universal and gate-specific techniques for simulating the action of layers of gates on quantum state vectors.<n>We develop a numerical simulator, named TQml Simulator, that employs the most efficient simulation method for each layer in a given circuit.
  arXiv  Detail & Related papers  (2025-06-05T11:19:05Z)
• Optimising Iteration Scheduling for Full-State Vector Simulation of Quantum Circuits on FPGAs [1.221089353510972]
  We present a memory access pattern to optimise the number of iterations that need to be scheduled to execute a quantum gate.<n>We show that this approach results in a significant reduction in the time required to simulate a gate for each added control qubit.
  arXiv  Detail & Related papers  (2024-11-27T13:57:29Z)
• Boundaries for quantum advantage with single photons and loop-based time-bin interferometers [40.908112113947475]
  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 simulate such systems.
  arXiv  Detail & Related papers  (2024-11-25T19:13:20Z)
• AdaLog: Post-Training Quantization for Vision Transformers with Adaptive Logarithm Quantizer [54.713778961605115]
  Vision Transformer (ViT) has become one of the most prevailing fundamental backbone networks in the computer vision community. We propose a novel non-uniform quantizer, dubbed the Adaptive Logarithm AdaLog (AdaLog) quantizer.
  arXiv  Detail & Related papers  (2024-07-17T18:38:48Z)
• Improved simulation of quantum circuits dominated by free fermionic operations [1.024113475677323]
  We present an algorithm for simulating universal quantum circuits composed of "free" nearest-neighbour matchgates or equivalently fermionic-linear-optical (FLO) gates, and "resourceful" non-Gaussian gates.<n>Our key contribution is the development of a novel phase-sensitive algorithm for simulating FLO circuits.<n>For a quantum circuit containing arbitrary FLO unitaries and $k$ controlled-Z gates, we obtain an exponential improvement $k$O(4.5k)$O over the prior state-of-the-art.
  arXiv  Detail & Related papers  (2023-07-24T11:36:28Z)
• Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits [36.30869856057226]
  We demonstrate any arbitrary qubit and qutrit gate can be realized with high-fidelity, which can significantly reduce the length of a gate sequence. We show that optimal control gates are robust to drift for at least three hours and that the same calibration parameters can be used for all implemented gates.
  arXiv  Detail & Related papers  (2023-03-07T22:15:43Z)
• Simulating the Mott transition on a noisy digital quantum computer via Cartan-based fast-forwarding circuits [62.73367618671969]
  Dynamical mean-field theory (DMFT) maps the local Green's function of the Hubbard model to that of the Anderson impurity model. Quantum and hybrid quantum-classical algorithms have been proposed to efficiently solve impurity models. This work presents the first computation of the Mott phase transition using noisy digital quantum hardware.
  arXiv  Detail & Related papers  (2021-12-10T17:32:15Z)
• Accurate methods for the analysis of strong-drive effects in parametric gates [94.70553167084388]
  We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach. We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
  arXiv  Detail & Related papers  (2021-07-06T02:02:54Z)
• Efficient calculation of gradients in classical simulations of variational quantum algorithms [0.0]
  We present a novel derivation of an emulation strategy to precisely calculate the gradient in O(P) time. Our strategy is very simple, uses only 'apply gate', 'clone state' and 'inner product' primitives. It is compatible with gate parallelisation schemes, and hardware accelerated and distributed simulators.
  arXiv  Detail & Related papers  (2020-09-06T21:39:44Z)
• Simulating nonnative cubic interactions on noisy quantum machines [65.38483184536494]
  We show that quantum processors can be programmed to efficiently simulate dynamics that are not native to the hardware. On noisy devices without error correction, we show that simulation results are significantly improved when the quantum program is compiled using modular gates.
  arXiv  Detail & Related papers  (2020-04-15T05:16:24Z)
• Efficient classical simulation of random shallow 2D quantum circuits [104.50546079040298]
  Random quantum circuits are commonly viewed as hard to simulate classically. We show that approximate simulation of typical instances is almost as hard as exact simulation. We also conjecture that sufficiently shallow random circuits are efficiently simulable more generally.
  arXiv  Detail & Related papers  (2019-12-31T19:00:00Z)

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.