Optimal constant-cost implementations of Clifford operations using global interactions

• URL: http://arxiv.org/abs/2510.20730v1
• Date: Thu, 23 Oct 2025 16:45:59 GMT
• Title: Optimal constant-cost implementations of Clifford operations using global interactions
• Authors: Jonathan Nemirovsky, Lee Peleg, Amit Ben Kish, Yotam Shapira,
• Abstract summary: 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.
• 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 four applications of such Clifford entangling multiqubit gates to realize any sequence of Clifford operations of any length, without ancillae, which is the theoretically optimal gate count cost. We do this by implementing any sequence of CNOT gates of any length with four applications of such gates, without ancillae, and show that the extension to general Clifford operations incurs no additional cost. We investigate the required qubit drive power that is associated with our implementation and show that it is lower than that of a standard approach. Our work introduces a practical and computationally efficient algorithm to realize these compilations.

Related papers

• Reduced constant-cost implementations of Clifford operations using global interactions [0.0]
  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.
  arXiv  Detail & Related papers  (2025-10-15T17:10:45Z)
• Optimization and Synthesis of Quantum Circuits with Global Gates [41.99844472131922]
  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)
• Realizing a Continuous Set of Two-Qubit Gates Parameterized by an Idle Time [34.99747682571461]
  Continuous gate sets are a key ingredient for near-term quantum algorithms.<n>We demonstrate a hardware-efficient, continuous set of controlled arbitrary-phase gates acting on transmon qubits.<n>This native gate set has the potential to reduce the depth and improve the performance of near-term quantum algorithms.
  arXiv  Detail & Related papers  (2025-03-14T08:49:47Z)
• Efficient Implementation of Multi-Controlled Quantum Gates [0.0]
  We present an implementation of multi-controlled quantum gates which provides significant reductions of cost compared to state-of-the-art methods.<n>We generalize our methods for any number of target qubits, and provide further cost reductions if additional ancilla qubits are available.
  arXiv  Detail & Related papers  (2024-04-02T20:13:18Z)
• 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)
• Realization of Scalable Cirac-Zoller Multi-Qubit Gates [5.309268373861329]
  The universality in quantum computing states that any quantum computational task can be decomposed into a finite set of logic gates operating on one and two qubits. Practical processor designs benefit greatly from availability of multi-qubit gates that operate on more than two qubits. Here, we take advantage of novel performance benefits of long ion chains to realize fully programmable and scalable high-fidelity Cirac-Zoller gates.
  arXiv  Detail & Related papers  (2023-01-18T14:34:24Z)
• Universal qudit gate synthesis for transmons [44.22241766275732]
  We design a superconducting qudit-based quantum processor. We propose a universal gate set featuring a two-qudit cross-resonance entangling gate. We numerically demonstrate the synthesis of $rm SU(16)$ gates for noisy quantum hardware.
  arXiv  Detail & Related papers  (2022-12-08T18:59:53Z)
• 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)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• 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)
• Scalable quantum computation with fast gates in two-dimensional microtrap arrays of trapped ions [68.8204255655161]
  We investigate the use of fast pulsed two-qubit gates for trapped ion quantum computing in a two-dimensional microtrap architecture. We demonstrate that fast pulsed gates are capable of implementing high-fidelity entangling operations between ions in neighbouring traps faster than the trapping period.
  arXiv  Detail & Related papers  (2020-05-01T13:18:22Z)

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.