Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2512.11457 · The European Physical Journal Special Topics

Processing through encoding: Quantum circuit approaches for point-wise multiplication and convolution

Andreas Papageorgiou, Paulo Vitor Itaborai, Kostas Blekos, Karl Jansen

quant-phcs.ETcs.SDeess.SPSubmitted Dec 12, 2025• Announced Dec 15, 2025• 1 citation
arXivHTMLPDF

Abstract

This paper introduces quantum circuit methodologies for pointwise multiplication and convolution of complex functions, conceptualized as "processing through encoding". Leveraging known techniques, we describe an approach where multiple complex functions are encoded onto auxiliary qubits. Applying the proposed scheme for two functions $f$ and $g$, their pointwise product $f(x)g(x)$ is shown to naturally form as the coefficients of part of the resulting quantum state. Adhering to the convolution theorem, we then demonstrate how the convolution $f*g$ can be constructed. Similarly to related work, this involves the encoding of the Fourier coefficients $\mathcal{F}[f]$ and $\mathcal{F}[g]$, which facilitates their pointwise multiplication, followed by the inverse Quantum Fourier Transform. We discuss the simulation of these techniques, their integration into an extended \verb|quantumaudio| package for audio signal processing, and present initial experimental validations. This work offers a promising avenue for quantum signal processing, with potential applications in areas such as quantum-enhanced audio manipulation and synthesis.

DOI
10.5281/zenodo.18203912
Comments
Presented at ISQCMC '25: 3rd International Symposium on Quantum Computing and Musical Creativity

Related papers

Quantum image representation and processing: advances and novel approaches

Artyom M. Grigoryan, Alexis A. Gomez, Sos S. Agaian

This work focuses into the emerging field of quantum image representation, which is a key for processing grayscale and color images on quantum computing platforms. We explore foundational methods like the qubit lattice model, the flexible representation for quantum images, the novel enhanced quantum representation, and the generalized quantum image representation, and categorize them into state-based, amplitude-based, and quaternion-based representations - the latter offering holistic color processing. A novel discrete signal representation mapping data on the unit circle will be introduced to simplify the Fourier transform concepts in quantum systems. We will examine crucial quantum operations, including quantum gradients, multiplication, square roots, Fourier transform, and filtering. Challenges in implementing the circular convolution on quantum hardware will be addressed with practical examples such as quantum low-pass and high-pass filters and 3-qubit convolution circuits. Additionally, we will discuss ongoing research into quantum algorithms inspired by classical transform processing, including the Fourier transforms, that leverage quantum states’ unique properties to achieve efficient encoding, transformation, and decoding of images.

Multimodal Image Exploitation and Learning•Jun 9, 2026•0 citations

Quantum Pointwise Convolution: A Flexible and Scalable Approach for Neural Network Enhancement

An Ning, Taiyong Li, Nan Yow Chen

In this study, we propose a novel architecture, the Quantum Pointwise Convolution, which incorporates pointwise convolution within a quantum neural network framework. Our approach leverages the strengths of pointwise convolution to efficiently integrate information across feature channels while adjusting channel outputs. By using quantum circuits, we map data to a higher-dimensional space, capturing more complex feature relationships. To address the current limitations of quantum machine learning in the Noisy Intermediate-Scale Quantum (NISQ) era, we implement several design optimizations. These include amplitude encoding for data embedding, allowing more information to be processed with fewer qubits, and a weight-sharing mechanism that accelerates quantum pointwise convolution operations, reducing the need to retrain for each input pixels. In our experiments, we applied the quantum pointwise convolution layer to classification tasks on the Fashion-Mnist and CIFAR10 datasets, where our model demonstrated competitive performance compared to its classical counterpart. Furthermore, these optimizations not only improve the efficiency of the quantum pointwise convolutional layer but also make it more readily deployable in various CNN-based or deep learning models, broadening its potential applications across different architectures.

arXiv:2412.01241•International Conference on Quantum Communications, Networking, and Computing (QCNC)•Mar 31, 2025•6 citations

An efficient quantum Hadamard product algorithm for functions

Xinchi Huang, Hirofumi Nishi, Tomofumi Zushi +1 more

We propose an efficient quantum algorithm for preparing the Hadamard product state of two quantum states whose amplitudes are generated by functions on a uniform grid with grid number $N$. As the Hadamard product operation is non-unitary, the conventional approach generally suffer from a success probability that scales as $O(1/N)$, leading to an $O(\sqrt{N})$ query complexity even with quantum amplitude amplification. Our method exploits the Fourier-space representation of the input functions, where the Hadamard product can be treated through a convolution structure and approximated using localized Fourier coefficients. The resulting quantum circuit has complexity governed by the Fourier regularity of the underlying functions rather than directly by the grid number. In particular, when either of the input functions has finitely many non-zero Fourier coefficients, the algorithm prepares the exact quantum Hadamard product state under $N$-independent query complexity. Moreover, we also propose a novel quantum circuit for the partial inner product as one of its applications.

quant-pharXiv:2606.03612•Jun 3, 2026•1 citation

Fundamentals of Quantum Fourier Optics

Mohammad Rezai, Jawad A. Salehi

All-quantum signal processing techniques are at the core of the successful advancement of most information-based quantum technologies. This article develops coherent and comprehensive methodologies and mathematical models to describe Fourier optical signal processing in full quantum terms for any input quantum state of light. We begin this article by introducing a spatially 2-D quantum state of a photon, associated with its wavefront and expressible as a 2-D creation operator. Then, by breaking down the Fourier optical processing apparatus into its key components, we strive to acquire the quantum unitary transformation or the input/output quantum relation of the 2-D creation operators. Subsequently, we take advantage of the above results to develop and obtain the quantum analogous of a few essential Fourier optical apparatuses, such as quantum convolution via a 4f-processing system and a quantum 4f-processing system with periodic pupils. Moreover, due to the importance and widespread use of optical pulse shaping in various optical communications and optical sciences fields, we also present an analogous system in full quantum terms, namely quantum pulse shaping with an 8f-processing system. Finally, we apply our results to two extreme examples of the quantum state of light. One is based on a coherent (Glauber) state and the other on a single-photon number (Fock) state for each of the above optical systems. We believe the schemes and mathematical models developed in this article can impact many areas of quantum optical signal processing, quantum holography, quantum communications, quantum radars and multiple-input/multiple-output antennas, and many more applications in quantum imaging, quantum computations, and quantum machine learning algorithms.

arXiv:2201.09627•IEEE Transactions on Quantum Engineering•Nov 25, 2022•21 citations

From Block-encoding to Generalized Quantum Signal Processing: Principles, Algorithms and Applications

Tal Gurfinkel, Kaushika De Silva, Anuradha Mahasinghe +9 more

Modern quantum algorithms are increasingly formulated as coherent procedures for implementing polynomial transformations of operators and singular values. This perspective provides a powerful and unifying language for quantum algorithm design, connecting a wide range of distinct problems through five closely related key tools: block-encoding, qubitization, QSP, QSVT and GQSP. Block-encoding embeds non-unitary matrices into larger unitaries; qubitization converts block-encodings into structured operators; QSP, QSVT and GQSP enable polynomial transformations with near-optimal query complexity. Together, these techniques form a general toolkit for transforming matrix functions into implementable quantum circuits. This paper develops these techniques from first principles as a unified framework for constructing quantum algorithms. We apply this framework to representative applications to highlight design principles and demonstrate how distinct algorithms can be constructed from a unified sequence of operator transformations. A central contribution is a systematic decision workflow for selecting the appropriate approach according to the operator structure and the desired transformation polynomial. This perspective clarifies when direct GQSP or through qubitization, or Laurent expansion, or QSVT is most appropriate. We organize algorithmic design into an end-to-end pipeline: identifying the target matrix function, constructing an appropriate block-encoding, determining the relevant spectral domain, designing a polynomial or Laurent-polynomial approximation, synthesizing the phase factors, and translating the transformation into an executable quantum circuit. By applying this unified framework to example applications, we showcase a practical methodology for reasoning, designing, and implementing quantum algorithms based on polynomial transformations.

quant-pharXiv:2609.09977•Sep 10, 2026•0 citations

THE MATHEMATICAL FOUNDATION OF IMAGE PROCESSING USES THE QUANTUM QUATERNION FOURIER INVERSION TRANSFORM

Sandeep Bagul, Dr. Aarti Sharma

The Fourier transform is a popular tool in many areas of practical mathematics, including data compression and signal processing. The underlying principle of the Fourier transform is that functions with the right characteristics may be expressed as a linear combination of trigonometric functions. Decomposing a signal using trigonometric functions is like taking a time-domain signal and separating its frequency-domain components; this opens up new and more efficient avenues for signal analysis and manipulation. An increasing number of people are looking at quantum image processing (QIP) as a way to enhance the efficiency of conventional methods and their applications by taking use of quantum computing's characteristics. Filtering and rectifying the frequency domain to get important picture information is the goal of both image design and interactive processing in this procedure. We demonstrate the operation of quantum operators and states in the context of quaternions and demonstrate how it may be used to expand the quantum complex Fourier transform (QCFT) to the quantum quaternion Fourier transform (QQFT). We demonstrate why convolution cannot be used to quantum image processing, and we create space-domain and quaternion-Fourier spectrum filters, including an edge detector and a quantum median filter. An enhanced method is used to provide the groundwork for the realization of picture design and interactive technology, drawing on the knowledge of FT and inverse transform.

Utilitas Mathematica•May 10, 2025•0 citations
This paper introduces quantum circuit methodologies for pointwise multiplication and convolution of complex functions, conceptualized as "processing through encoding". Leveraging known techniques, we describe an approach where multiple complex functions are encoded onto auxiliary qubits. Applying the proposed scheme for two functions fff and ggg, their pointwise product f(x)g(x)f(x)g(x)f(x)g(x) is shown to naturally form as the coefficients of part of the resulting quantum state. Adhering to the convolution theorem, we then demonstrate how the convolution f∗gf*gf∗g can be constructed. Similarly to related work, this involves the encoding of the Fourier coefficients F[f]\mathcal{F}[f]F[f] and F[g]\mathcal{F}[g]F[g], which facilitates their pointwise multiplication, followed by the inverse Quantum Fourier Transform. We discuss the simulation of these techniques, their integration into an extended \verb|quantumaudio| package for audio signal processing, and present initial experimental validations. This work offers a promising avenue for quantum signal processing, with potential applications in areas such as quantum-enhanced audio manipulation and synthesis.
This work focuses into the emerging field of quantum image representation, which is a key for processing grayscale and color images on quantum computing platforms. We explore foundational methods like the qubit lattice model, the flexible representation for quantum images, the novel enhanced quantum representation, and the generalized quantum image representation, and categorize them into state-based, amplitude-based, and quaternion-based representations - the latter offering holistic color processing. A novel discrete signal representation mapping data on the unit circle will be introduced to simplify the Fourier transform concepts in quantum systems. We will examine crucial quantum operations, including quantum gradients, multiplication, square roots, Fourier transform, and filtering. Challenges in implementing the circular convolution on quantum hardware will be addressed with practical examples such as quantum low-pass and high-pass filters and 3-qubit convolution circuits. Additionally, we will discuss ongoing research into quantum algorithms inspired by classical transform processing, including the Fourier transforms, that leverage quantum states’ unique properties to achieve efficient encoding, transformation, and decoding of images.
In this study, we propose a novel architecture, the Quantum Pointwise Convolution, which incorporates pointwise convolution within a quantum neural network framework. Our approach leverages the strengths of pointwise convolution to efficiently integrate information across feature channels while adjusting channel outputs. By using quantum circuits, we map data to a higher-dimensional space, capturing more complex feature relationships. To address the current limitations of quantum machine learning in the Noisy Intermediate-Scale Quantum (NISQ) era, we implement several design optimizations. These include amplitude encoding for data embedding, allowing more information to be processed with fewer qubits, and a weight-sharing mechanism that accelerates quantum pointwise convolution operations, reducing the need to retrain for each input pixels. In our experiments, we applied the quantum pointwise convolution layer to classification tasks on the Fashion-Mnist and CIFAR10 datasets, where our model demonstrated competitive performance compared to its classical counterpart. Furthermore, these optimizations not only improve the efficiency of the quantum pointwise convolutional layer but also make it more readily deployable in various CNN-based or deep learning models, broadening its potential applications across different architectures.
We propose an efficient quantum algorithm for preparing the Hadamard product state of two quantum states whose amplitudes are generated by functions on a uniform grid with grid number NNN. As the Hadamard product operation is non-unitary, the conventional approach generally suffer from a success probability that scales as O(1/N)O(1/N)O(1/N), leading to an O(N)O(\sqrt{N})O(N​) query complexity even with quantum amplitude amplification. Our method exploits the Fourier-space representation of the input functions, where the Hadamard product can be treated through a convolution structure and approximated using localized Fourier coefficients. The resulting quantum circuit has complexity governed by the Fourier regularity of the underlying functions rather than directly by the grid number. In particular, when either of the input functions has finitely many non-zero Fourier coefficients, the algorithm prepares the exact quantum Hadamard product state under NNN-independent query complexity. Moreover, we also propose a novel quantum circuit for the partial inner product as one of its applications.
All-quantum signal processing techniques are at the core of the successful advancement of most information-based quantum technologies. This article develops coherent and comprehensive methodologies and mathematical models to describe Fourier optical signal processing in full quantum terms for any input quantum state of light. We begin this article by introducing a spatially 2-D quantum state of a photon, associated with its wavefront and expressible as a 2-D creation operator. Then, by breaking down the Fourier optical processing apparatus into its key components, we strive to acquire the quantum unitary transformation or the input/output quantum relation of the 2-D creation operators. Subsequently, we take advantage of the above results to develop and obtain the quantum analogous of a few essential Fourier optical apparatuses, such as quantum convolution via a 4f-processing system and a quantum 4f-processing system with periodic pupils. Moreover, due to the importance and widespread use of optical pulse shaping in various optical communications and optical sciences fields, we also present an analogous system in full quantum terms, namely quantum pulse shaping with an 8f-processing system. Finally, we apply our results to two extreme examples of the quantum state of light. One is based on a coherent (Glauber) state and the other on a single-photon number (Fock) state for each of the above optical systems. We believe the schemes and mathematical models developed in this article can impact many areas of quantum optical signal processing, quantum holography, quantum communications, quantum radars and multiple-input/multiple-output antennas, and many more applications in quantum imaging, quantum computations, and quantum machine learning algorithms.
Modern quantum algorithms are increasingly formulated as coherent procedures for implementing polynomial transformations of operators and singular values. This perspective provides a powerful and unifying language for quantum algorithm design, connecting a wide range of distinct problems through five closely related key tools: block-encoding, qubitization, QSP, QSVT and GQSP. Block-encoding embeds non-unitary matrices into larger unitaries; qubitization converts block-encodings into structured operators; QSP, QSVT and GQSP enable polynomial transformations with near-optimal query complexity. Together, these techniques form a general toolkit for transforming matrix functions into implementable quantum circuits. This paper develops these techniques from first principles as a unified framework for constructing quantum algorithms. We apply this framework to representative applications to highlight design principles and demonstrate how distinct algorithms can be constructed from a unified sequence of operator transformations. A central contribution is a systematic decision workflow for selecting the appropriate approach according to the operator structure and the desired transformation polynomial. This perspective clarifies when direct GQSP or through qubitization, or Laurent expansion, or QSVT is most appropriate. We organize algorithmic design into an end-to-end pipeline: identifying the target matrix function, constructing an appropriate block-encoding, determining the relevant spectral domain, designing a polynomial or Laurent-polynomial approximation, synthesizing the phase factors, and translating the transformation into an executable quantum circuit. By applying this unified framework to example applications, we showcase a practical methodology for reasoning, designing, and implementing quantum algorithms based on polynomial transformations.
The Fourier transform is a popular tool in many areas of practical mathematics, including data compression and signal processing. The underlying principle of the Fourier transform is that functions with the right characteristics may be expressed as a linear combination of trigonometric functions. Decomposing a signal using trigonometric functions is like taking a time-domain signal and separating its frequency-domain components; this opens up new and more efficient avenues for signal analysis and manipulation. An increasing number of people are looking at quantum image processing (QIP) as a way to enhance the efficiency of conventional methods and their applications by taking use of quantum computing's characteristics. Filtering and rectifying the frequency domain to get important picture information is the goal of both image design and interactive processing in this procedure. We demonstrate the operation of quantum operators and states in the context of quaternions and demonstrate how it may be used to expand the quantum complex Fourier transform (QCFT) to the quantum quaternion Fourier transform (QQFT). We demonstrate why convolution cannot be used to quantum image processing, and we create space-domain and quaternion-Fourier spectrum filters, including an edge detector and a quantum median filter. An enhanced method is used to provide the groundwork for the realization of picture design and interactive technology, drawing on the knowledge of FT and inverse transform.