Application of the Diamond Gate in Quantum Fourier Transformations and Quantum Machine Learning

• URL: http://arxiv.org/abs/2103.08605v2
• Date: Wed, 9 Mar 2022 08:40:09 GMT
• Title: Application of the Diamond Gate in Quantum Fourier Transformations and Quantum Machine Learning
• Authors: E. Bahnsen, S. E. Rasmussen, N. J. S. Loft, and N. T. Zinner
• Abstract summary: We show how the diamond gate can be decomposed into standard gates. We then show how this CNS gate can create a controlled phase gate. We also show how to use the diamond gate in quantum machine learning.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: As we are approaching actual application of quantum technology, it is essential to exploit the current quantum resources in the best possible way. With this in mind, it might not be beneficial to use the usual standard gate sets, inspired from classical logic gates, when compiling quantum algorithms when other less standardized gates currently perform better. We, therefore, consider a promising native gate, which occurs naturally in superconducting circuits, known as the diamond gate. We show how the diamond gate can be decomposed into standard gates and, using single-qubit gates, can work as a controlled-not-swap (CNS) gate. We then show how this CNS gate can create a controlled phase gate. Controlled phase gates are the backbone of the quantum Fourier transform algorithm, and we, therefore, show how to use the diamond gate to perform this algorithm. We also show how to use the diamond gate in quantum machine learning; namely, we use it to approximate non-linear functions and classify two-dimensional data.

Related papers

• Discovery of an exchange-only gate sequence for CNOT with record-low gate time using reinforcement learning [0.0]
  Exchange-only quantum computation is a version of spin-based quantum computation that entirely avoids the difficulty of controlling individual spins by a magnetic field. The challenge for exchange-only quantum computation is to find short sequences that generate the required logical quantum gates. We apply reinforcement learning to the optimization of exchange-gate sequences realizing the CNOT and CZ two-qubit gates.
  arXiv  Detail & Related papers  (2024-02-16T10:42:25Z)
• One Gate Scheme to Rule Them All: Introducing a Complex Yet Reduced Instruction Set for Quantum Computing [8.478982715648547]
  Scheme for qubits with $XX+YY$ coupling realizes any two-qubit gate up to single-qubit gates. We observe marked improvements across various applications, including generic $n$-qubit gate synthesis, quantum volume, and qubit routing.
  arXiv  Detail & Related papers  (2023-12-09T19:30:31Z)
• Decomposition Algorithm of an Arbitrary Pauli Exponential through a Quantum Circuit [5.800032532382661]
  We review the staircase algorithm to decompose the exponential of a generalized Pauli matrix. We propose two alternative methods which offer more efficient quantum circuits.
  arXiv  Detail & Related papers  (2023-05-08T16:05:27Z)
• High-fidelity parallel entangling gates on a neutral atom quantum computer [41.74498230885008]
  We report the realization of two-qubit entangling gates with 99.5% fidelity on up to 60 atoms in parallel. These advances lay the groundwork for large-scale implementation of quantum algorithms, error-corrected circuits, and digital simulations.
  arXiv  Detail & Related papers  (2023-04-11T18:00:04Z)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• 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)
• Let Each Quantum Bit Choose Its Basis Gates [3.6690675649846396]
  Near-term quantum computers are primarily limited by errors in quantum operations (or gates) between two quantum bits (or qubits) In superconducting technologies, the current state of the art is to implement the same 2Q gate between every pair of qubits. This work aims to give quantum scientists the ability to run meaningful algorithms with qubit systems that are not perfectly uniform.
  arXiv  Detail & Related papers  (2022-08-29T05:55:55Z)
• Efficient Quantum Circuit Design with a Standard Cell Approach, with an Application to Neutral Atom Quantum Computers [45.66259474547513]
  We design quantum circuits by using the standard cell approach borrowed from classical circuit design. We present evidence that, when compared with automatic routing methods, our layout-aware routers are significantly faster and achieve shallower 3D circuits.
  arXiv  Detail & Related papers  (2022-06-10T10:54:46Z)
• 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)
• 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)
• Simple implementation of high fidelity controlled-$i$SWAP gates and quantum circuit exponentiation of non-Hermitian gates [0.0]
  The $i$swap gate is an entangling swapping gate where the qubits obtain a phase of $i$ if the state of the qubits is swapped. We present a simple implementation of the controlled-$i$swap gate.
  arXiv  Detail & Related papers  (2020-02-26T19:00:01Z)

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.