Scalable improvement of the generalized Toffoli gate realization using trapped-ion-based qutrits

• URL: http://arxiv.org/abs/2407.07758v1
• Date: Wed, 10 Jul 2024 15:34:56 GMT
• Title: Scalable improvement of the generalized Toffoli gate realization using trapped-ion-based qutrits
• Authors: Anastasiia S. Nikolaeva, Ilia V. Zalivako, Alexander S. Borisenko, Nikita V. Semenin, Kristina P. Galstyan, Andrey E. Korolkov, Evgeniy O. Kiktenko, Ksenia Yu. Khabarova, Ilya A. Semerikov, Aleksey K. Fedorov, Nikolay N. Kolachevsky,
• Abstract summary: Direct realizations of the Toffoli gate require either a prohibitive growth of the number of two-qubit gates or using ancilla qubits. Here we experimentally demonstrate a scalable improvement of the realization of the Toffoli gate using trapped-ion-based dual-type optic-microwave qutrits.
• Score: 32.33017977520031
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: An efficient implementation of the Toffoli gate is of conceptual importance for running various quantum algorithms, including Grover's search and Shor's integer factorization. However, direct realizations of the Toffoli gate require either a prohibitive growth of the number of two-qubit gates or using ancilla qubits, whereas both of these resources are limited in the current generation of noisy intermediate-scale quantum devices. Here we experimentally demonstrate a scalable improvement of the realization of the Toffoli gate using $^{171}$Yb$^{+}$ trapped-ion-based dual-type optic-microwave qutrits ($d=3$) for the cases of three-, four-qubit and five-qubit versions of the Toffoli gate. With the use of the Molmer-Sorensen gate as a basic two-particle operation, we compare the standard qubit decomposition with the qutrit approach, where upper levels are used as ancillas. The presented decomposition requires only global control of the ancilla levels, which simplifies experimental implementation of the proposed approach. We present an estimation of the scalable improvement of our approach in the case of multi-qubit gates. As we expect, by combining this approach with the leveraging qudits ($d\geq4$) as a set of qubits, our approach may lead to a more efficient realization of various quantum algorithms. With qutrit-based decomposition in Grover's search with three ions, we experimentally demonstrate the 10\% increase in the average algorithm performance.

Related papers

• Direct Implementation of High-Fidelity Three-Qubit Gates for Superconducting Processor with Tunable Couplers [18.682049956714156]
  Three-qubit gates can be constructed using combinations of single-qubit and two-qubit gates, making their independent realization unnecessary. We propose and experimentally demonstrate a high-fidelity scheme for implementing a three-qubit controlled-controlled-Z (CCZ) gate in a flip-chip superconducting quantum processor with tunable couplers.
  arXiv  Detail & Related papers  (2025-01-30T12:57:57Z)
• Efficient compilation of quantum circuits using multi-qubit gates [0.0]
  We present a compilation scheme which implements a general-circuit decomposition to a sequence of Ising-type, long-range, multi-qubit entangling gates. We numerically test our compilation and show that, compared to conventional realizations with two-qubit gates, our compilations improves the logarithm of quantum volume by $20%$ to $25%$.
  arXiv  Detail & Related papers  (2025-01-28T19:08:13Z)
• Distributed Exact Generalized Grover's Algorithm [9.675088142486729]
  We propose a distributed Exactized Grover's Algorithm (DEGGA) to solve a generalized search problem. Our algorithm ensures accuracy, with a theoretical probability of identifying the target states at $100%$. Our method requires a total of $n$ qubits, eliminating the need for auxiliary qubits.
  arXiv  Detail & Related papers  (2024-05-11T09:17:11Z)
• Quantum control landscape for generation of $H$ and $T$ gates in an open qubit with both coherent and environmental drive [57.70351255180495]
  An important problem in quantum computation is generation of single-qubit quantum gates such as Hadamard ($H$) and $pi/8$ ($T$) Here we consider the problem of optimal generation of $H$ and $T$ gates using coherent control and the environment as a resource acting on the qubit via incoherent control.
  arXiv  Detail & Related papers  (2023-09-05T09:05:27Z)
• Extensive characterization of a family of efficient three-qubit gates at the coherence limit [0.4471952592011114]
  We implement a three-qubit gate by simultaneously applying two-qubit operations. We generate two classes of entangled states, the GHZ and W states, by applying the new gate only once. We analyze the experimental and statistical errors on the fidelity of the gates and of the target states.
  arXiv  Detail & Related papers  (2022-07-06T19:42:29Z)
• Decomposing the generalized Toffoli gate with qutrits [0.0]
  We propose a decomposition scheme for a generalized $N$-qubit Toffoli gate with the use of $2N-3$ two-qutrit gates for arbitrary connectivity. We present a blueprint of the realization of the proposed scheme for the Aspen-9 processor supporting quantum operations with qutrits.
  arXiv  Detail & Related papers  (2021-12-29T13:20:21Z)
• Software mitigation of coherent two-qubit gate errors [55.878249096379804]
  Two-qubit gates are important components of quantum computing. But unwanted interactions between qubits (so-called parasitic gates) can degrade the performance of quantum applications. We present two software methods to mitigate parasitic two-qubit gate errors.
  arXiv  Detail & Related papers  (2021-11-08T17:37:27Z)
• 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)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36:25Z)
• 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.