Reduced constant-cost implementations of Clifford operations using global interactions

• URL: http://arxiv.org/abs/2510.13761v1
• Date: Wed, 15 Oct 2025 17:10:45 GMT
• Title: Reduced constant-cost implementations of Clifford operations using global interactions
• Authors: Jonathan Nemirovsky, Lee Peleg, Amit Ben Kish, Yotam Shapira,
• Abstract summary: We report a constant-cost of no more than 6 application of such Clifford entangling multiqubit gates to realize any sequence of Clifford operations of any length, without ancillae.<n>We show that any sequence of CNOT gates of any length, can be replaced with 5 applications of such Clifford entangling multiqubit gates, without ancillae.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We investigate quantum circuits built from arbitrary single-qubit operations combined with programmable all-to-all multiqubit entangling gates that are native to, among other systems, trapped-ion quantum computing platforms. We report a constant-cost of no more than 6 application of such Clifford entangling multiqubit gates to realize any sequence of Clifford operations of any length, without ancillae. Furthermore, we show that any sequence of CNOT gates of any length, can be replaced with 5 applications of such Clifford entangling multiqubit gates, without ancillae. We investigate the required qubit drive power that is associated with these implementations. Our work introduces a practical and computationally efficient algorithm to realize these compilations.

Related papers

• A Complete Equational Theory for Real-Clifford+CH Quantum Circuits [51.56484100374058]
  We give a simple set of equalities between circuits of this fragment, and prove that any other true equation can be derived from these.<n>This is the first such completeness result for a finitely-generated, universal fragment of quantum circuits, with no parameterized gates and no need for ancillas.
  arXiv  Detail & Related papers  (2026-02-06T12:11:39Z)
• Optimal constant-cost implementations of Clifford operations using global interactions [0.0]
  We investigate quantum circuits built from arbitrary single-qubit operations combined with programmable all-to-all multiqubit entangling gates.<n>Our work introduces a practical and computationally efficient algorithm to realize these compilations.
  arXiv  Detail & Related papers  (2025-10-23T16:45:59Z)
• Accelerating Transpilation in Quantum Machine Learning with Haiqu's Rivet-transpiler [45.88028371034407]
  We develop the Rivet transpiler, which accelerates transpilation by reusing previously transpiled circuits.<n>We demonstrate up to 600% improvement in transpilation time for quantum layerwise learning.
  arXiv  Detail & Related papers  (2025-08-29T06:00:29Z)
• Clifford and Non-Clifford Splitting in Quantum Circuits: Applications and ZX-Calculus Detection Procedure [49.1574468325115]
  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.
  arXiv  Detail & Related papers  (2025-04-22T16:10:34Z)
• A Superconducting Qubit-Resonator Quantum Processor with Effective All-to-All Connectivity [44.72199649564072]
  This architecture can be used as a test-bed for algorithms that benefit from high connectivity.<n>We show that the central resonator can be used as a computational element.<n>We achieve a genuinely multi-qubit entangled Greenberger-Horne-Zeilinger (GHZ) state over all six qubits with a readout-error mitigated fidelity of $0.86$.
  arXiv  Detail & Related papers  (2025-03-13T21:36:18Z)
• Unitary Synthesis of Clifford+T Circuits with Reinforcement Learning [2.4646794072984477]
  Unitary synthesis aims to identify a quantum circuit that represents a given unitary. We apply the tree-search method Gumbel AlphaZero to solve the problem for a subset of exactly synthesizable Clifford+T unitaries. Our method effectively synthesizes circuits for up to five qubits generated from randomized circuits with up to 60 gates.
  arXiv  Detail & Related papers  (2024-04-23T09:37:52Z)
• Constant-cost implementations of Clifford operations and multiply controlled gates using global interactions [7.165608198928042]
  We consider quantum circuits composed of single-qubit operations and global entangling gates generated by Ising-type Hamiltonians. It is shown that such circuits can implement a large class of unitary operators at a very low cost -- using a constant or effectively constant number of global entangling gates.
  arXiv  Detail & Related papers  (2022-07-18T15:42:04Z)
• Synthesis of and compilation with time-optimal multi-qubit gates [0.46180371154032884]
  We develop a class of entangling multi-qubit gates for a quantum computing platform with fixed Ising-type interaction with all-to-all connectivity. We numerically demonstrate that the total multi-qubit gate time scales approximately linear in the number of qubits.
  arXiv  Detail & Related papers  (2022-06-13T18:00:04Z)
• Finding the disjointness of stabilizer codes is NP-complete [77.34726150561087]
  We show that the problem of calculating the $c-disjointness, or even approximating it to within a constant multiplicative factor, is NP-complete. We provide bounds on the disjointness for various code families, including the CSS codes,$d codes and hypergraph codes. Our results indicate that finding fault-tolerant logical gates for generic quantum error-correcting codes is a computationally challenging task.
  arXiv  Detail & Related papers  (2021-08-10T15:00:20Z)
• Efficient quantum programming using EASE gates on a trapped-ion quantum computer [1.9610635155358869]
  We focus on the recently invented efficient, arbitrary, simultaneously entangling (EASE) gates, available on a trapped-ion quantum computer. We show an $n$-qubit Clifford circuit can be implemented using $6log(n)$ EASE gates, an $n$-qubit multiply-controlled NOT gate can be implemented using $3n/2$ EASE gates, and an $n$-qubit permutation can be implemented using six EASE gates.
  arXiv  Detail & Related papers  (2021-07-15T20:03:23Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)
• Optimal Two-Qubit Circuits for Universal Fault-Tolerant Quantum Computation [0.0]
  We study two-qubit circuits over the Clifford+CS gate set. We introduce an efficient and optimal synthesis algorithm for two-qubit Clifford+CS operators.
  arXiv  Detail & Related papers  (2020-01-16T18:55:38Z)

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.