Resolution map in quantum computing: signal representation by periodic patterns
Abstract
In this paper, a new concept of the resolution map is presented to extract periodic structures that compose the signal. The resolution map is described by using the frequency–time representation of the signal, which is known as the paired transform that provides the frequency-time representation of signals. The sequential calculation of resolution maps over the signal components of large sizes allows for calculating the small periodic structures, or patterns, which can be used for signal processing, for instance filtration, and from which the signal can be reconstructed. The length of the signal is considered to be a power of two, a case that fits well with qubit processing in quantum computing. The following new results are described: (1) the quantum scheme for the 1D discrete paired transform, (2) the quantum circuit for calculating the signal resolution map, (3) the quantum circuit for signal reconstruction from the resolution map, (4) different schemes for resolution maps for processing signals, and (5) the convolution of signals by their periodic patterns.
References
[1]
Burt PJ and Adelson EH The Laplacian pyramid as a compact image code IEEE Trans. Commun. 1983 31 4 532-540
[2]
Mallat SMultiresolution approximation and wavelet orthogonal bases of L2(R)Trans. Am. Math. Soc.1989315169-870686.42018
[3]
Myer Y Wavelets and Operations. Advanced Mathematics 1992 Cambridge Cambridge Univ. Press
[4]
Gabor D Theory of communication J. IEE 1946 93 429-457
[5]
Mallat SGA theory for multiresolution signal decomposition—The wavelet representationIEEE Trans. Pattern Anal. Mach. Intell.1989117674-6931989ITPAM.11.674M
[6]
Grigoryan AM and Grigoryan MM Brief Notes in Advanced DSP: Fourier analysis with MATLAB 2009 Boca Raton CRC Press
[7]
Grigoryan AM and Du N2-D images in frequency-time representation: direction images and resolution mapJ. Electron. Imaging20101930330122010JEI....19c3012G
[8]
Yan F, Iliyasu AM, and Venegas-Andraca SEA survey of quantum image representationsQuant. Inf. Process.20151511-352016QuIP...15....1Y3441389
[9]
Zhang Y, Lu K, Gao Y, and Wang MNEQR: a novel enhanced quantum representation of digital imagesQuant. Inf. Process.20131282833-28602013QuIP...12.2833Z3079388
[10]
Grigoryan AM New algorithms for calculating discrete Fourier transforms USSR Comput. Math. Math. Phys. 1986 26 5 84-88
[11]
Grigoryan AM An algorithm of computation of the one-dimensional discrete Fourier transform Izvestiya VUZov SSSR, Radioelectronica 1988 31 5 47-52
[12]
Grigoryan AM and Agaian SSPaired quantum Fourier transform with log2N Hadamard gatesQuant. Inf. Process.2019182172019QuIP...18.217G
[13]
Li HS, Fan P, Xia H, Song S, and He XThe quantum Fourier transform based on quantum vision representationQuant. Inf. Process.2018173332018QuIP...17.333L3869515
[14]
Perez LR and Garcia-Escartin JCQuantum arithmetic with the quantum Fourier transformQuant. Inf. Process.201716142017QuIP...16...14P3642007
[15]
Karafyllidis IGVisualization of the quantum Fourier transform using a quantum computer simulatorQuant. Inf. Process.200324271-2882063921
[16]
Grigoryan AM2-D and 1-D multi-paired transforms: frequency-time type waveletsIEEE Trans. Signal Process.2001492344-3532001ITSP...49.344G1842547
[17]
Grigoryan AMFourier transform representation by frequency-time waveletsIEEE Trans. Signal Process.20055372489-24972005ITSP...53.2489G2168963
[18]
Grigoryan AMRepresentation of the Fourier transform by Fourier seriesJ. Math. Imaging Vis.200625187-1052254443
[19]
Grigoryan AM and Agaian SSSplit manageable efficient algorithm for Fourier and Hadamard transformsIEEE Trans. Signal Process.2000481172-1832000ITSP...48.172G1736277
[20]
Grigoryan AM and Agaian SS Multidimensional discrete unitary transforms: representation, partitioning, and algorithms 2003 New York Marcel Dekker
Index Terms
- Resolution map in quantum computing: signal representation by periodic patterns
Index terms have been assigned to the content through auto-classification.
Recommendations
Quantum computing via the Bethe ansatz
We recognize quantum circuit model of computation as factorisable scattering model and propose that a quantum computer is associated with a quantum many-body system solved by the Bethe ansatz. As an typical example to support our perspectives on quantum ...
Qubit mapping of one-way quantum computation patterns onto 2D nearest-neighbor architectures
Distinct practical advantages of the one-way quantum computation (1WQC) have attracted the attention of many researchers. To physically realize a 1WQC pattern, its qubits should be mapped onto a quantum physical environment. The nearest-neighbor ...
Quantum computing and quantum simulation with group-II atoms
Recent experimental progress in controlling neutral group-II atoms for optical clocks, and in the production of degenerate gases with group-II atoms has given rise to novel opportunities to address challenges in quantum computing and quantum simulation. ...
Comments
Information & Contributors
Information
Published In
© Springer Science+Business Media, LLC, part of Springer Nature 2020.
Publisher
Kluwer Academic Publishers
United States
Publication History
Published: 27 April 2020
Accepted: 17 April 2020
Received: 19 October 2019
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 06 Jan 2025