Reduction of circuit depth by mapping qubit-based quantum gates to a qudit basis

• URL: http://arxiv.org/abs/2109.09902v2
• Date: Wed, 15 Jun 2022 05:21:58 GMT
• Title: Reduction of circuit depth by mapping qubit-based quantum gates to a qudit basis
• Abstract summary: We present a scalable set of universal gates and multiply controlled gates in a qudit basis. We identify the set of U(2) rotations required to implement each gate for any qudit of size N. We show that multiply controlled gates are the driving factor in the reduction of circuit complexity for qudit-based system scales with D.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We present a scalable set of universal gates and multiply controlled gates in a qudit basis through a bijective mapping from N qubits to qudits with D = 2^N levels via rotations in U(2). For each of the universal gates (H, CNOT, and T), as well as the NOT gate and multiply-controlled-Z gates, we describe a systematic approach to identifying the set of U(2) rotations required to implement each gate for any qudit of size N and with minimal use of an ancilla level. The qudit gates are analyzed in terms of the total rotation count and gate depth as the system scales with D. We apply the qudit-basis to Grover's Algorithm and compare the circuit depth vs. system size to a qubit-based circuit. The results show that there is a dramatic reduction in circuit depth as the size of the system increases for the qudit circuit compared to qubit circuit. In particular, multiply controlled gates are the driving factor in the reduction of circuit complexity for qudit-based system scales with D.

Related papers

• On the Experimental Determination of Nonlocal Characteristics of Two-Qubit Gates [0.3580891736370874]
  We construct two-qubit quantum circuits to measure the entangling power and gate typicality of two-qubit gates.<n>These circuits can be used to determine the nonlocal characteristics of native gates of many quantum processors.
  arXiv  Detail & Related papers  (2026-07-13T02:15:56Z)
• 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)
• Logarithmic Depth Decomposition of Approximate Multi-Controlled Single-Qubit Gates Without Ancilla Qubits [0.9576327614980397]
  We present improved decompositions of multi-controlled NOT gates with logarithmic depth using a single ancilla qubit.<n>We also reduce the constant factors in the circuit depth compared to previous work.<n>Our method is particularly suitable for both NISQ and fault-tolerant quantum architectures.
  arXiv  Detail & Related papers  (2025-07-01T03:30:39Z)
• Multilevel Circuit Optimization in Quantum Compilers: A Case Study [0.6954287924634025]
  We explore multilevel circuit optimization (MLCO), where we deploy multiple gate sets and progressively lower the source circuit through the gate sets to the target circuit.<n>We demonstrate its effectiveness, using as a case study the source circuit for Hamiltonian simulation to solve a partial differential equation.<n>MLCO makes visible higher-level circuit structures, providing us with insights about how to simplify the circuits and how to decompose the gates.
  arXiv  Detail & Related papers  (2025-05-14T12:19:17Z)
• On the Constant Depth Implementation of Pauli Exponentials [49.48516314472825]
  We decompose arbitrary exponentials into circuits of constant depth using $mathcalO(n)$ ancillae and two-body XX and ZZ interactions. We prove the correctness of our approach, after introducing novel rewrite rules for circuits which benefit from qubit recycling.
  arXiv  Detail & Related papers  (2024-08-15T17:09:08Z)
• Multi-controlled single-qubit unitary gates based on the quantum Fourier transform [0.0]
  Multi-controlled (MC) unitary (U) gates are widely employed in quantum algorithms and circuits. Few state-of-the-art decompositions of MCU gates use non-elementary $C-R_x$ and $C-U1/2m-1$ gates. Our approach is based on two generalizations of the multi-controlled X (MCX) gate.
  arXiv  Detail & Related papers  (2024-08-01T21:56:02Z)
• Low-depth Quantum Circuit Decomposition of Multi-controlled Gates [0.8520624117635328]
  Best decomposition of an n-controlled X gate with one borrowed ancilla produces circuits with degree 3 polylogarithmic depth. A proposed n-controlled X gate with one borrowed ancilla has the shortest circuit depth in the literature. One can reproduce all the results with the freely available open-source code provided in a public repository.
  arXiv  Detail & Related papers  (2024-07-06T19:42:38Z)
• Cat-qubit-inspired gate on cos($2\theta$) qubits [77.34726150561087]
  We introduce a single-qubit $Z$ gate inspired by the noise-bias preserving gate of the Kerr-cat qubit. This scheme relies on a $pi$ rotation in phase space via a beamsplitter-like transformation between a qubit and ancilla qubit.
  arXiv  Detail & Related papers  (2023-04-04T23:06:22Z)
• Decomposition of Multi-controlled Special Unitary Single-Qubit Gates [1.412197703754359]
  Multi-controlled unitary gates have been a subject of interest in quantum computing since its inception. Current state-of-the-art approach to implementing n-qubit multi-controlled gates involves the use of a quadratic number of single-qubit and CNOT gates. We present a new decomposition of n-qubit multi-controlled SU(2) gates that requires a circuit with a number of CNOT gates proportional to 20n.
  arXiv  Detail & Related papers  (2023-02-13T14:08:53Z)
• 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)
• On the role of entanglement in qudit-based circuit compression [0.0]
  Gate-based universal quantum computation is formulated in terms of two types of operations: local single-qubit gates, and two-qubit entangling gates. We show how the complexity of multi-qubit circuits can be lowered significantly by employing qudit encodings.
  arXiv  Detail & Related papers  (2022-09-29T06:48:48Z)
• Controlled Gate Networks Applied to Eigenvalue Estimation [0.28106259549258145]
  We introduce a new scheme for quantum circuit design called controlled gate networks. Rather than trying to reduce the complexity of individual unitary operations, the new strategy is to toggle between all of the unitary operations needed with the fewest number of gates.
  arXiv  Detail & Related papers  (2022-08-29T12:46:46Z)
• Fast and Robust Geometric Two-Qubit Gates for Superconducting Qubits and beyond [0.0]
  We propose a scheme to realize robust geometric two-qubit gates in multi-level qubit systems. Our scheme is substantially simpler than STIRAP-based gates that have been proposed for atomic platforms. We show how our gate can be accelerated using a shortcuts-to-adiabaticity approach.
  arXiv  Detail & Related papers  (2022-08-08T16:22:24Z)
• Robustness of a universal gate set implementation in transmon systems via Chopped Random Basis optimal control [50.591267188664666]
  We numerically study the implementation of a universal two-qubit gate set, composed of CNOT, Hadamard, phase and $pi/8$ gates, for transmon-based systems. The control signals to implement such gates are obtained using the Chopped Random Basis optimal control technique, with a target gate infidelity of $10-2$.
  arXiv  Detail & Related papers  (2022-07-27T10:55:15Z)
• Extensible circuit-QED architecture via amplitude- and frequency-variable microwaves [52.77024349608834]
  We introduce a circuit-QED architecture combining fixed-frequency qubits and microwave-driven couplers. Drive parameters appear as tunable knobs enabling selective two-qubit coupling and coherent-error suppression.
  arXiv  Detail & Related papers  (2022-04-17T22:49:56Z)
• Quantum simulation of $\phi^4$ theories in qudit systems [53.122045119395594]
  We discuss the implementation of quantum algorithms for lattice $Phi4$ theory on circuit quantum electrodynamics (cQED) system. The main advantage of qudit systems is that its multi-level characteristic allows the field interaction to be implemented only with diagonal single-qudit gates.
  arXiv  Detail & Related papers  (2021-08-30T16:30:33Z)
• On the realistic worst case analysis of quantum arithmetic circuits [69.43216268165402]
  We show that commonly held intuitions when designing quantum circuits can be misleading. We show that reducing the T-count can increase the total depth. We illustrate our method on addition and multiplication circuits using ripple-carry.
  arXiv  Detail & Related papers  (2021-01-12T21:36:16Z)
• 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)

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.