3-Qubit Circular Quantum Convolution Computation using Fourier Transform with Illustrative Examples

• URL: http://arxiv.org/abs/2205.05727v1
• Date: Wed, 11 May 2022 18:53:43 GMT
• Title: 3-Qubit Circular Quantum Convolution Computation using Fourier Transform with Illustrative Examples
• Authors: Artyom M. Grigoryan and Sos S. Agaian
• Abstract summary: We describe examples for calculating the 1-D circular convolution of signals represented by 3-qubit superpositions. The frequency characteristics of many linear time-invariant systems and filters are well known. The considered method of convolution can be used for these systems in quantum computation.
• Score: 3.6296396308298795
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this work, we describe examples for calculating the 1-D circular convolution of signals represented by 3-qubit superpositions. The case is considered, when the discrete Fourier transform of one of the signals is known and calculated in advance and only the QFT of another signal is calculated. The frequency characteristics of many linear time-invariant systems and filters are well known. Therefore, the considered method of convolution can be used for these systems in quantum computation. The ideal low pass and high pass filters are considered and quantum schemes for convolution are presented. The method of the Fourier transform is used with one addition qubit to prepare the quantum superposition for the inverse quantum Fourier transform.

Related papers

• Quantum Inverse Fast Fourier Transform [0.0]
  An algorithm for Quantum Inverse Fast Fourier Transform (QIFFT) is developed to work for quantum data. We have included the complete formulation of QIFFT algorithm from the classical model and have included butterfly diagram.
  arXiv  Detail & Related papers  (2024-09-12T12:27:47Z)
• Quantum state preparation for multivariate functions [2.344936782036958]
  We develop protocols for preparing quantum states whose amplitudes encode multivariate functions. We analyze requirements both pragmatically and in terms of near/medium-term resources. We use 24 qubits and up to 237 two-qubit gates on the Quantinuum H2-1 trapped-ion quantum processor.
  arXiv  Detail & Related papers  (2024-05-31T17:49:27Z)
• Characterization of a Transmon Qubit in a 3D Cavity for Quantum Machine Learning and Photon Counting [28.32051890758564]
  We first describe the realization and characterization of a transmon qubit coupled to a 3D resonator. We then report on a Quantum Machine Learning application implemented on the single-qubit device. In the final section of the manuscript we present a new microwave photon detection scheme based on two qubits coupled to the same 3D resonator.
  arXiv  Detail & Related papers  (2024-02-06T19:07:19Z)
• Efficient Quantum Algorithm for All Quantum Wavelet Transforms [0.08968838300743379]
  We develop a simple yet efficient quantum algorithm for executing any wavelet transform on a quantum computer. Our proposed quantum wavelet transforms could be used in quantum computing algorithms in a similar manner to their well-established counterpart, the quantum Fourier transform.
  arXiv  Detail & Related papers  (2023-09-17T19:02:08Z)
• Eliminating the Second-Order Time Dependence from the Time Dependent Schrödinger Equation Using Recursive Fourier Transforms [0.0]
  A strategy is developed for writing the time-dependent Schr"odinger Equation. The energy distribution is calculated for a number of standard theory examples at first- and second-order.
  arXiv  Detail & Related papers  (2023-06-04T17:47:34Z)
• Defects of Convolutional Decoder Networks in Frequency Representation [34.70224140460288]
  We prove the representation defects of a cascaded convolutional decoder network. We conduct the discrete Fourier transform on each channel of the feature map in an intermediate layer of the decoder network.
  arXiv  Detail & Related papers  (2022-10-17T12:42:29Z)
• Deep Fourier Up-Sampling [100.59885545206744]
  Up-sampling in the Fourier domain is more challenging as it does not follow such a local property. We propose a theoretically sound Deep Fourier Up-Sampling (FourierUp) to solve these issues.
  arXiv  Detail & Related papers  (2022-10-11T06:17:31Z)
• Quantum Fourier Addition, Simplified to Toffoli Addition [92.18777020401484]
  We present the first systematic translation of the QFT-addition circuit into a Toffoli-based adder. Instead of using approximate decompositions of the gates from the QFT circuit, it is more efficient to merge gates.
  arXiv  Detail & Related papers  (2022-09-30T02:36:42Z)
• LOv-Calculus: A Graphical Language for Linear Optical Quantum Circuits [58.720142291102135]
  We introduce the LOv-calculus, a graphical language for reasoning about linear optical quantum circuits. Two LOv-circuits represent the same quantum process if and only if one can be transformed into the other with the rules of the LOv-calculus.
  arXiv  Detail & Related papers  (2022-04-25T16:59:26Z)
• A quantum Fourier transform (QFT) based note detection algorithm [0.0]
  In quantum information processing, the quantum transform (QFT) has a plethora of applications. We create a quantum music note detection algorithm both on a simulated and a real quantum computer.
  arXiv  Detail & Related papers  (2022-04-25T16:45:56Z)
• Learning Set Functions that are Sparse in Non-Orthogonal Fourier Bases [73.53227696624306]
  We present a new family of algorithms for learning Fourier-sparse set functions. In contrast to other work that focused on the Walsh-Hadamard transform, our novel algorithms operate with recently introduced non-orthogonal Fourier transforms. We demonstrate effectiveness on several real-world applications.
  arXiv  Detail & Related papers  (2020-10-01T14:31:59Z)

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.