Clifford and Non-Clifford Splitting in Quantum Circuits: Applications and ZX-Calculus Detection Procedure

• URL: http://arxiv.org/abs/2504.16004v1
• Date: Tue, 22 Apr 2025 16:10:34 GMT
• Title: Clifford and Non-Clifford Splitting in Quantum Circuits: Applications and ZX-Calculus Detection Procedure
• Authors: Fernando Lima, Arcesio Castañeda Medina,
• Abstract summary: We propose and analyze use cases that come from quantum circuits that can be written as product between a Clifford and a Non-Clifford unitary.<n>We make use of ZX-Calculus and its assets to detect a limiting border of these circuits that would allow for a separation between a Clifford section and a Non-Clifford section.
• Score: 49.1574468325115
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Classical simulation of quantum circuits is a pivotal part of the quantum computing landscape, specially within the NISQ era, where the constraints imposed by available hardware are unavoidable. The Gottesman-Knill theorem further motivates this argument by accentuating the importance of Clifford circuits and their role on this topic of simulation. In this work, we propose and analyze use cases that come from quantum circuits that can be written as product between a Clifford and a Non-Clifford unitary, these ranging from fully classical emulation, hybrid quantum-classical execution or even quantum algorithm simplification. To further complement this analysis, we make use of ZX-Calculus and its assets to detect a limiting border of these circuits that would allow for a separation between a Clifford section and a Non-Clifford section. To achieve this, we present a novel procedure for parsing ZX diagrams, that not only allows for the detection of this border but also simplifies the circuit extraction process.

Related papers

• When Clifford benchmarks are sufficient; estimating application performance with scalable proxy circuits [0.0]
  We show that for a broad class of error models these concerns are unwarranted. We show that for error models that admit noise tailoring by Pauli twirling, the diamond norm and fidelity of any generic circuit is well approximated by the fidelities of proxy circuits composed only of Clifford gates.
  arXiv  Detail & Related papers  (2025-03-07T21:18:59Z)
• A Case for Quantum Circuit Cutting for NISQ Applications: Impact of topology, determinism, and sparsity [15.339699314849]
  We show that variational algorithm ansatzes for near-term quantum computing are well-suited for the quantum circuit cutting strategy. Previous demonstrations of circuit cutting focused on the exponential execution and postprocessing costs. We scale the feasible ansatzes to over 200 qubits with six ansatz layers, beyond the capability of prior work.
  arXiv  Detail & Related papers  (2024-12-23T19:39:48Z)
• QuCLEAR: Clifford Extraction and Absorption for Quantum Circuit Optimization [8.043057448895343]
  Currently available quantum devices suffer from noisy quantum gates, which degrade the fidelity of executed quantum circuits.<n>We present QuCLEAR, a compilation framework designed to optimize quantum circuits.
  arXiv  Detail & Related papers  (2024-08-23T18:03:57Z)
• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• Circuit Cutting with Non-Maximally Entangled States [59.11160990637615]
  Distributed quantum computing combines the computational power of multiple devices to overcome the limitations of individual devices. circuit cutting techniques enable the distribution of quantum computations through classical communication. Quantum teleportation allows the distribution of quantum computations without an exponential increase in shots. We propose a novel circuit cutting technique that leverages non-maximally entangled qubit pairs.
  arXiv  Detail & Related papers  (2023-06-21T08:03:34Z)
• Scalable noisy quantum circuits for biased-noise qubits [37.69303106863453]
  We consider biased-noise qubits affected only by bit-flip errors, which is motivated by existing systems of stabilized cat qubits. For realistic noise models, phase-flip will not be negligible, but in the Pauli-Twirling approximation, we show that our benchmark could check the correctness of circuits containing up to $106$ gates.
  arXiv  Detail & Related papers  (2023-05-03T11:27:50Z)
• Clifford-based Circuit Cutting for Quantum Simulation [2.964626695457492]
  We debut Super.tech's SuperSim framework, a new approach for high fidelity and scalable quantum circuit simulation. SuperSim employs two key techniques for accelerated quantum circuit simulation: Clifford-based simulation and circuit cutting. Our results show that Clifford-based circuit cutting accelerates the simulation of near-Clifford circuits, allowing 100s of qubits to be evaluated with modest runtimes.
  arXiv  Detail & Related papers  (2023-03-19T22:56:02Z)
• Partitioning Quantum Chemistry Simulations with Clifford Circuits [1.0286890995028481]
  Current quantum computing hardware is restricted by the availability of only few, noisy qubits. We investigate the limits of their classical and near-classical treatment while staying within the framework of quantum circuits.
  arXiv  Detail & Related papers  (2023-03-02T13:05:19Z)
• Iterative Qubit Coupled Cluster using only Clifford circuits [36.136619420474766]
  An ideal state preparation protocol can be characterized by being easily generated classically. We propose a method that meets these requirements by introducing a variant of the iterative qubit coupled cluster (iQCC) We demonstrate the algorithm's correctness in ground-state simulations and extend our study to complex systems like the titanium-based compound Ti(C5H5)(CH3)3 with a (20, 20) active space.
  arXiv  Detail & Related papers  (2022-11-18T20:31:10Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
  Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task. Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate. The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
  arXiv  Detail & Related papers  (2021-06-06T13:15:25Z)
• 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.