betaFeedback

WorksPhysics and Astronomy

Task-aligned spectral inductive biases in parameterized quantum circuits

Abstract

Parameterized quantum circuits are widely investigated in quantum machine learning, yet how their architecture can provide task-aligned inductive biases remains poorly understood. We study data reuploading quantum circuits with two distinct inputs: a signal that varies between samples and a fixed, task-defined spectral query that specifies how the signal should be probed. We show that encoding the query can change the circuit's hypothesis class over the signal by modulating how its existing signal frequencies are combined, without introducing new sample-dependent information. This mechanism matches tasks built on nonuniform Fourier transforms, whose evaluation frequencies specify the query and whose sampling positions guide its encoding. We examine this connection in a classification task inspired by synthetic aperture radar, where acquisition geometry determines a query for classifying unfocused spectral patches before image formation. Across small-scale spectral and radar-like tasks, aligned queries improve learning from limited data over parameter-matched circuits with mismatched or absent queries. These results provide a route from known spectral task structure to the design and validation of inductive biases in parameterized quantum circuits.

Introduction

In quantum machine learning, parameterized quantum circuits (PQCs) are widely studied as trainable models for data-driven tasks [1, 2, 3]. They encode classical inputs into a quantum circuit, process them with parameterized unitaries, and produce measurement outcomes used by a classical optimizer to update the parameters [4, 5, 6]. While their empirical performance has been explored across a range of tasks [7, 8, 9, 10], we still lack a principled understanding of which practically relevant learning problems are naturally matched to the functional structure of PQCs [11, 12].

This correspondence between a learning problem and the functional structure of a model constitutes a task-aligned inductive bias: the architecture emphasizes input-output relations with the structure expected of the target relation [13, 14]. Architectures in classical machine learning are often designed around such correspondences. Convolutional neural networks exploit the spatial locality and approximate translation symmetry commonly found in images, while transformers use attention to model dependencies between potentially distant elements, as commonly encountered in language [15, 16, 17, 18, 19, 20]. In this sense, when these architectural properties reflect the structure of the data and target relation, they bias learning toward compatible functions, potentially reducing the data and model capacity required to approximate the target and improving generalization [21, 22, 23, 24, 25, 26].

PQCs have been studied extensively through the lenses of universality and trainability [27, 28], whereas their task-aligned inductive biases remain comparatively less understood. Symmetry-based biases have been developed systematically within geometric quantum machine learning, which provides a framework for building known task symmetries into PQCs [29, 30, 31, 32]. Data reuploading circuits offer a complementary structure: their expectation values are generalized trigonometric polynomials (GTPs) of the input [33, 34, 35]. This structure is well characterized, but it has not yet provided a comparably principled route to task-aligned design. Because the encoding fixes the accessible frequencies while the trainable parameters set their coefficients, prior work has focused on which frequencies a circuit can access and how they are learned, including engineered, trainable, and input-conditioned spectra [36, 37, 38, 39, 40]. Many tasks, however, prescribe how measurements must be combined rather than which frequencies are present. This structure acts on the coefficients, and how to impose it through the architecture remains open.

In this work, we encode known task structure as a second, fixed circuit input. We study what we denote as double data reuploading (DDR) circuits, which encode two distinct inputs in alternating layers: a sample-dependent signal vector x\mathbf{x} and a query vector f\mathbf{f}, determined from known task structure and fixed across samples. The terminology is motivated by the spectral tasks studied below: the signal contains measured sample values, while the query specifies the Fourier frequencies at which their transform is evaluated. Changing the query selects different transform evaluations without changing the sample values. Both are classical numerical inputs; query does not denote an oracle call. The query carries no sample-specific information, yet its encoding can change which functions of x\mathbf{x} the circuit represents and the distribution over those functions induced by parameter sampling. It thus provides a way to incorporate known task structure into the model. We illustrate this approach in a task inspired by synthetic aperture radar (SAR), where acquisition geometry determines phase relations that can guide classification directly from unfocused measurements, before image formation. We develop this idea through three successive questions, each examined through theory and numerical experiments (see Figure 1).

From query-controlled circuits to geometry-aligned classification

Figure 1. From query-controlled circuits to geometry-aligned classification. (II) In a DDR circuit, a fixed query controls how signal-dependent Fourier components are combined, modifying the represented function without providing sample-specific information (Sec. II). (III) A spectral classification task supplies a fixed query f⋆f^{\star} and, through its sampling positions and score structure, a target spectrum Ω⋆(f)\Omega^{(f)}_{\star} that guides the query encoding (Sec. III). (IV) In SAR, the acquisition geometry supplies this structure, enabling geometry-aligned classification directly from raw measurements without first reconstructing a focused image (Sec. IV).

Query-controlled inductive bias: What can the query change?— Section II derives the joint Fourier representation of DDR circuits, in which the query modulates the coefficients of a fixed signal spectrum. A rank criterion bounds this modulation, and absorption conditions distinguish whether it leaves the model unchanged, reweights its function prior, or changes its hypothesis class. Two-qubit circuits realize all three cases while preserving the accessible frequencies.

Aligning the query with spectral tasks: When is the query bias task-aligned?— Section III connects this mechanism to classification tasks defined by fixed nonuniform Fourier evaluations [41]: their frequencies supply the query value f⋆f^{\star}, while their sampling positions supply the modes that guide its encoding. We bound the approximation error by separating phase alignment from the signal-dependent coefficients the circuit must learn. In teacher–student experiments, aligned queries improve learning from limited data relative to parameter-matched circuits with mismatched or absent queries, and the advantage persists under moderate query perturbations.

Geometry-aligned classification of raw SAR-like data: Where does the query come from?— Nonuniform Fourier transforms arise when measurements are irregularly sampled or their transforms must be evaluated at nonuniform frequencies, as in synthetic aperture radar, non-Cartesian magnetic resonance imaging, and radio interferometry [42, 43, 44]. In SAR, the acquisition geometry and radar frequency band determine the nonuniform spatial-frequency relation used in image formation [45, 46]. Classifying directly from raw SAR data could avoid costly image formation, an attractive possibility when onboard processing or downlink capacity is limited [47, 48]; classical methods have begun to explore this approach [49]. Quantum approaches, meanwhile, have classified formed images [50, 51] or targeted image formation itself [52, 53]. Section IV derives a fixed query from this image-formation relation, before any data or labels are seen, and uses it to classify unfocused SAR-like phase histories. The empirically preferred query tracks the geometry-derived prediction across acquisitions, and supplying the predicted query improves classification when labeled scenes are scarce.

Section V discusses the implications and limitations of this approach.

Query-Controlled Inductive Bias

Double data reuploading function class

Data reuploading circuits as generalized trigonometric polynomials

We recall the representation of data reuploading PQCs as GTPs [2, 33, 34]. Consider an nqn_q-qubit circuit initialized in ∣0⟩:=∣0⟩⊗nq\lvert0\rangle:= \lvert0\rangle^{\otimes n_q}, with an input x=(x1,…,xM)∈RM\mathbf{x}=(x_1,\ldots,x_M)\in\mathbb{R}^M and trainable parameters θ\boldsymbol{\theta}. Its output is the expectation value of a Hermitian observable OO,

v(x;θ)=⟨0∣U†(x;θ)OU(x;θ)∣0⟩.(1)v(\mathbf{x};\boldsymbol{\theta})=\langle0|U^{\dagger}(\mathbf{x};\boldsymbol{\theta})OU(\mathbf{x};\boldsymbol{\theta})|0\rangle. \tag*{(1)}

The circuit has LL data reuploading blocks, each applying an encoding followed by a trainable unitary (Figure 2a):

Parameterized quantum circuits with data reuploading architectures

Figure 2. Parameterized quantum circuits with data reuploading architectures: (a) The nqn_q-qubit single data reuploading scheme consisting of LL layers. Classical input features xx are re-encoded at each layer via Eℓ(x)E_{\ell}(x) alongside parameterized unitaries Vℓ(θ)V_{\ell}(\theta). (b) The nqn_q-qubit double data reuploading scheme extended to two input streams, xx and ff, structured across L/2L/2 blocks. Each block alternates between encoding unitaries Eℓ(f)(f)E_{\ell}^{(f)}(f) and Eℓ(x)(x)E_{\ell}^{(x)}(x) and parameterized unitaries Vℓ(f)(θ)V_{\ell}^{(f)}(\theta) and Vℓ(x)(θ)V_{\ell}^{(x)}(\theta).

U(x;θ)=VL(θ)EL(x)⋯V1(θ)E1(x).(2)U(\mathbf{x};\boldsymbol{\theta})=V_L(\boldsymbol{\theta})E_L(\mathbf{x})\cdots V_1(\boldsymbol{\theta})E_1(\mathbf{x}). \tag*{(2)}

The layerwise encodings and their collection are

Eℓ(x)=exp⁡(−i∑m=1MxmHℓ,m),E={Eℓ}ℓ=1L,(3)E_{\ell}(x)=\exp\left(-i\sum_{m=1}^{M}x_mH_{\ell,m}\right),\qquad\mathcal{E}=\{E_{\ell}\}_{\ell=1}^{L}, \tag*{(3)}

where Hℓ,mH_{\ell,m} is the Hermitian generator associated with feature xmx_m in layer ℓ\ell. We assume that the generators within each layer commute pairwise; commuting Pauli strings are a common choice. Commuting generators therefore admit a joint eigenbasis in each layer, with any input-independent basis changes entering the Fourier coefficients alongside the trainable blocks [33].

Expanding in these joint eigenbases and grouping terms with the same frequency gives [33]

v(x;θ)=∑ω∈Ωcω(θ)exp⁡(iω⋅x).(4)v(x;\theta)=\sum_{\omega\in\Omega}c_{\omega}(\theta)\exp(i\omega\cdot x). \tag*{(4)}

Thus, the output is a GTP in xx, with possible frequencies Ω\Omega determined by the eigenvalues of the chosen encodings E\mathcal{E}. The full derivation is given in Appx. A 1.

For a fixed encoding E\mathcal{E}, trainable architecture, and observable, varying θ\theta defines the hypothesis class of functions the circuit can represent:

HE={x↦∑ω∈Ωcω(θ)exp⁡(iω⋅x):θ∈Θ}.(5)\mathcal{H}_{\mathcal{E}}=\left\{x\mapsto\sum_{\omega\in\Omega}c_{\omega}(\theta)\exp(i\omega\cdot x):\theta\in\Theta\right\}. \tag*{(5)}

Here, Θ\Theta denotes the trainable parameter domain. At finite depth, the encoding fixes the possible Fourier basis functions, while the rest of the circuit constrains which coefficient vectors (cω(θ))ω∈Ω(c_{\omega}(\theta))_{\omega\in\Omega} can be realized. Together, these restrictions define a representational inductive bias: circuits with the same frequency spectrum need not have the same hypothesis class.

Under suitable conditions, increasingly expressive data reuploading PQCs can approximate arbitrary continuous functions [34, 54, 55]. Every finite circuit nevertheless retains the GTP structure of Eq. (4). This raises the question we address next: can a second, fixed input change the attainable coefficient vectors and thus the inductive bias of the model?

Double data reuploading and query-modulated coefficients

We now introduce a second input with its own encoding. We call the sample-dependent input x∈RMx\in\mathbb{R}^{M} the signal and the sample-independent, task-defined input f∈RNf\in\mathbb{R}^{N} the query, anticipating their roles in the spectral learning tasks below. Each encoding layer acts on one of these inputs, with trainable unitaries between consecutive encodings. Figure 2b shows an example of an alternating gate arrangement.

Applying the Fourier expansion to both inputs gives

v(x,f;θ)=∑ω(x)∈Ω(x)ω(f)∈Ω(f)cω(x),ω(f)(θ)exp⁡(iω(x)⋅x+iω(f)⋅f).(6)v(x,f;\theta)=\sum_{\substack{\omega^{(x)}\in\Omega^{(x)}\\\omega^{(f)}\in\Omega^{(f)}}}c_{\omega^{(x)},\omega^{(f)}}(\theta)\exp\left(i\omega^{(x)}\cdot x+i\omega^{(f)}\cdot f\right). \tag*{(6)}

Here Ω(x)\Omega^{(x)} and Ω(f)\Omega^{(f)} are the possible frequencies set by the respective encoding families Ex\mathcal{E}_{x} and Ef\mathcal{E}_{f}. The full derivation of the path expansion is given in Appx. A 2.

To see how the query affects the function of xx, arrange the joint coefficients into a matrix and define phase vectors for the two inputs:

[C(θ)]ω(x),ω(f)=cω(x),ω(f)(θ),(7)[C(\theta)]_{\omega^{(x)},\omega^{(f)}}=c_{\omega^{(x)},\omega^{(f)}}(\theta), \tag*{(7)}
[w(f)]ω(f)=exp⁡(iω(f)⋅f),(8)[w(f)]_{\omega^{(f)}}=\exp\left(i\omega^{(f)}\cdot f\right), \tag*{(8)}
[e(x)]ω(x)=exp⁡(iω(x)⋅x).(9)[e(x)]_{\omega^{(x)}}=\exp\left(i\omega^{(x)}\cdot x\right). \tag*{(9)}

At fixed ff, the coefficient vector over the signal frequencies is

a(θ,f)=C(θ)w(f),(10)a(\theta,f)=C(\theta)w(f), \tag*{(10)}

so that

v(x,f;θ)=a(θ,f)Te(x).(11)v(x,f;\theta)=a(\theta,f)^{\mathsf{T}}e(x). \tag*{(11)}

Thus, changing the query modulates the coefficients of a fixed signal frequency set. For a fixed query encoding and query value, this defines the hypothesis class over the signal xx:

HEf(f)={x↦a(θ,f)Te(x):θ∈Θ}.(12)\mathcal{H}_{\mathcal{E}_{f}}(f)=\left\{x\mapsto a(\theta,f)^{\mathsf{T}}e(x):\theta\in\Theta\right\}. \tag*{(12)}

Here the signal encoding, trainable architecture, and observable are held fixed. The query encoding affects the family of matrices C(θ)C(\theta), the parameters select a matrix from that family, and the query value supplies the phases with which it is contracted. We next characterize when this modulation changes the hypothesis class.

When does the query change the model?

Equation (11) illustrates that the query changes the coefficients of a Fourier expansion over the signal. A change in coefficients at fixed parameters, however, need not change the functions available to the model: another parameter choice might produce the same function. In the following, we therefore distinguish three levels: the accessible signal frequencies, their modulation at fixed parameters, and changes to the hypothesis class or the function prior.

Frequency support and coefficient modulation

First, the query cannot add frequencies to the signal expansion.

Proposition 1 (Separation of encoding spectra). For disjoint signal- and query-encoding layers with commuting generators within each layer, the joint path-frequency set factorizes as

Ω=Ω(x)×Ω(f).(13)\Omega= \Omega^{(x)} \times\Omega^{(f)}. \tag*{(13)}

In particular, for any query encoding Ef\mathcal{E}_f and query value f\mathbf{f},

HEf(f)⊆Vx:=span⁡C{exp⁡(iω(x)⋅x):ω(x)∈Ω(x)},(14)\mathcal{H}_{\mathcal{E}_f}(\mathbf{f}) \subseteq\mathcal{V}_x := \operatorname{span}_{\mathbb{C}}\left\{ \exp\left(\mathrm{i}\omega^{(x)}\cdot\mathbf{x}\right) : \omega^{(x)} \in\Omega^{(x)} \right\}, \tag*{(14)}

where Vx\mathcal{V}_x is fixed by the signal encoding.

The product in Eq. (13) describes possible frequencies; the corresponding coefficients may vanish for a particular circuit. The relevant effect of the query must therefore lie in the coefficients in Eq. (10). At fixed parameters, its extent is constrained by the joint coefficient matrix. The proof is given in Appx. A 3a; Appx. A4 compares DDR with concatenated-input encoding.

Proposition 2 (Dimension of query-induced modulation). Fix Ef\mathcal{E}_f, θ\theta, and a query domain F\mathcal{F}, and define the explored phase space

W=span⁡C{w(f):f∈F}.(15)\mathcal{W} = \operatorname{span}_{\mathbb{C}}\{\mathbf{w}(f) : f \in\mathcal{F}\}. \tag*{(15)}

As ff varies, the signal coefficient vectors span C(θ)WC(\theta)\mathcal{W}, with

dim⁡CC(θ)W≤min⁡{rank⁡C(θ),dim⁡CW}.(16)\dim_{\mathbb{C}} C(\theta)\mathcal{W} \le\min\{\operatorname{rank} C(\theta), \dim_{\mathbb{C}}\mathcal{W}\}. \tag*{(16)}

The rank bound is saturated if W\mathcal{W} is the full query-frequency space.

Thus, the rank limits how many independent signal coefficient vectors the query can explore at fixed parameters. A one-dimensional image makes these vectors proportional, although their overall scale may still change. Even a higher-dimensional image does not establish a change in the hypothesis class: varying the trainable parameters might absorb the effect of the query. The proof is given in Appx. A 3b.

Query absorption and three possible effects

To test for a model-level effect, we compare the hypothesis classes HEf(f)\mathcal{H}_{\mathcal{E}_f}(f) at different query values. We also fix a parameter distribution μ\mu; drawing θ∼μ\theta\sim\mu induces a distribution PEf,f\mathbb{P}_{\mathcal{E}_f,f} on HEf(f)\mathcal{H}_{\mathcal{E}_f}(f), which we call the function prior. For any measurable A⊆HEf(f)\mathcal{A} \subseteq\mathcal{H}_{\mathcal{E}_f}(f),

PEf,f(A)=μ{θ:v(⋅;f,θ)∈A}.(17)\mathbb{P}_{\mathcal{E}_f,f}(\mathcal{A}) = \mu\{\theta: v(\cdot;f,\theta) \in\mathcal{A}\}. \tag*{(17)}

Thus, the class specifies which functions are realizable, while the prior specifies how parameter sampling weights them. We call a query absorbable when its effect can be removed by reparameterizing the trainable blocks. The following condition establishes absorption into adjacent blocks.

References

  1. [1]J. Biamonte, P. Wittek, N. Pancotti, P. Rebentrost, N. Wiebe, and S. Lloyd, Quantum machine learning, Nature 549, 195 (2017).DOI
  2. [2]M. Benedetti, E. Lloyd, S. Sack, and M. Fiorentini, Parameterized quantum circuits as machine learning models, Quantum Science and Technology 4, 043001 (2019).DOI
  3. [3]M. Cerezo, A. Arrasmith, R. Babbush, S. Benjamin, S. Endo, K. Fujii, J. R. McClean, K. Mitarai, X. Yuan, L. Cincio, and P. J. Coles, Variational quantum algorithms, Nature Reviews Physics 3, 625 (2021).DOI
  4. [4]J. Preskill, Quantum Computing in the NISQ era and beyond, Quantum 2, 79 (2018).DOI
  5. [5]K. Bharti, A. Cervera-Lierta, T. H. Kyaw, T. Haug, S. Alperin-Lea, A. Anand, M. Degroote, H. Heimonen, J. S. Kottmann, T. Menke, W.-K. Mok, S. Sim, L.-C. Kwek, and A. Aspuru-Guzik, Noisy intermediate-scale quantum algorithms, Reviews of Modern Physics 94, 015004 (2022).DOI
  6. [6]M. Cerezo, G. Verdon, H.-Y. Huang, L. Cincio, and P. J. Coles, Challenges and opportunities in quantum machine learning, Nature Computational Science 2, 567 (2022).DOI
  7. [7]J. Bowles, S. Ahmed, and M. Schuld, Better than classical? The subtle art of benchmarking quantum machine learning models (2024), arXiv:2403.07059 [quant-ph].arxiv.org/abs/2403.07059
  8. [8]H.-Y. Huang, M. Broughton, M. Mohseni, R. Babbush, S. Boixo, H. Neven, and J. R. McClean, Power of data in quantum machine learning, Nature Communications 12, 2631 (2021).
  9. [9]J. Kübler, S. Buchholz, and B. Schölkopf, The inductive bias of quantum kernels, Advances in neural information processing systems 34, 12661 (2021).arxiv.org/abs/2106.03747
  10. [10]M. Schuld and N. Killoran, Is quantum advantage the right goal for quantum machine learning?, PRX Quantum 3, 030101 (2022).DOI
  11. [11]J. Bowles, V. J. Wright, M. Farkas, N. Killoran, and M. Schuld, Contextuality and inductive bias in quantum machine learning (2023), arXiv:2302.01365 [quant-ph].arxiv.org/abs/2302.01365
  12. [12]K. Gili, G. Alonso, and M. Schuld, An inductive bias from quantum mechanics: learning order effects with non-commuting measurements, Quantum Machine Intelligence 6, 67 (2024).arxiv.org/abs/2312.03862
  13. [13]T. M. Mitchell, The need for biases in learning generalizations, Tech. Rep. CBM-TR-117 (Rutgers University, 1980).
  14. [14]P. W. Battaglia, J. B. Hamrick, V. Bapst, et al., Relational inductive biases, deep learning, and graph networks (2018), arXiv:1806.01261 [cs.LG].arxiv.org/abs/1806.01261
  15. [15]Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner, Gradient-based learning applied to document recognition, Proceedings of the IEEE 86, 2278 (1998).
  16. [16]T. Cohen and M. Welling, Group equivariant convolutional networks, in Proceedings of the 33rd International Conference on Machine Learning, Proceedings of Machine Learning Research, Vol. 48 (2016) pp. 2990–2999.arxiv.org/abs/1602.07576
  17. [17]M. D. Zeiler and R. Fergus, Visualizing and understanding convolutional networks, in European conference on computer vision (2014) pp. 818–833.arxiv.org/abs/1311.2901
  18. [18]A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, Ł. Kaiser, and I. Polosukhin, Attention is all you need, Advances in neural information processing systems 30 (2017).arxiv.org/abs/1706.03762
  19. [19]J. Maurício, I. Domingues, and J. Bernardino, Comparing Vision Transformers and Convolutional Neural Networks for Image Classification: A Literature Review, Applied Sciences 13, 5521 (2023).DOI
  20. [20]A. Dosovitskiy, L. Beyer, A. Kolesnikov, D. Weissenborn, X. Zhai, T. Unterthiner, M. Dehghani, M. Minderer, G. Heigold, S. Gelly, J. Uszkoreit, and N. Houlsby, An image is worth 16x16 words: Transformers for image recognition at scale, in International Conference on Learning Representations (ICLR) (2021).
  21. [21]S. J. Prince, Understanding Deep Learning (MIT Press, 2023).
  22. [22]B. Elesedy and S. Zaidi, Probably strict generalisation benefit for equivariant models, in Proceedings of the 38th International Conference on Machine Learning, Proceedings of Machine Learning Research, Vol. 139 (2021) pp. 2959–2969.arxiv.org/abs/2102.10333
  23. [23]M. M. Bronstein, J. Bruna, T. Cohen, and P. Velicković, Geometric deep learning: Grids, groups, graphs, geodesics, and gauges (2021), arXiv:2104.13478 [cs.LG].arxiv.org/abs/2104.13478
  24. [24]A. K. Maier, C. Syben, B. Stimpel, T. Würfl, M. Hoffmann, F. Schebesch, W. Fu, L. Mill, L. Kling, and S. Christiansen, Learning with known operators reduces maximum error bounds, Nature Machine Intelligence 1, 373 (2019).DOI
  25. [25]V. Monga, Y. Li, and Y. C. Eldar, Algorithm unrolling: Interpretable, efficient deep learning for signal and image processing, IEEE Signal Processing Magazine 38, 18 (2021).arxiv.org/abs/1912.10557
  26. [26]G. E. Karniadakis, I. G. Kevrekidis, L. Lu, P. Perdikaris, S. Wang, and L. Yang, Physics-informed machine learning, Nature Reviews Physics 3, 422 (2021).DOI
  27. [27]J. R. McClean, S. Boixo, V. N. Smelyansky, R. Babbush, and H. Neven, Barren plateaus in quantum neural network training landscapes, Nature communications 9, 4812 (2018).DOI
  28. [28]M. Larocca, S. Thanasilp, S. Wang, K. Sharma, J. Biamonte, P. J. Coles, L. Cincio, J. R. McClean, Z. Holmes, and M. Cerezo, Barren plateaus in variational quantum computing, Nature Reviews Physics 7, 174 (2025).DOI
  29. [29]M. Larocca, F. Sauvage, F. M. Sbahi, G. Verdon, P. J. Coles, and M. Cerezo, Group-invariant quantum machine learning, PRX Quantum 3, 030341 (2022).DOI
  30. [30]J. J. Meyer, M. Mularski, E. Gil-Fuster, A. A. Mele, F. Arzani, A. Wilms, and J. Eisert, Exploiting symmetry in variational quantum machine learning, PRX Quantum 4, 010328 (2023).DOI
  31. [31]Q. T. Nguyen, L. Schatzki, P. Braccia, M. Ragone, P. J. Coles, F. Sauvage, M. Larocca, and M. Cerezo, Theory for equivariant quantum neural networks, PRX Quantum 5, 020328 (2024).DOI
  32. [32]L. Schatzki, M. Larocca, Q. T. Nguyen, F. Sauvage, and M. Cerezo, Theoretical guarantees for permutation-equivariant quantum neural networks, npj Quantum Information 10, 12 (2024).DOI
  33. [33]M. Schuld, R. Sweke, and J. J. Meyer, The effect of data encoding on the expressive power of variational quantum machine learning models, Physical Review A 103, 032430 (2021).DOI
  34. [34]A. Pérez-Salinas, A. Cervera-Lierta, E. Gil-Fuster, and J. I. Latorre, Data re-uploading for a universal quantum classifier. Quantum 4, 226 (2020).
  35. [35]M. C. Caro, E. Gil-Fuster, J. J. Meyer, J. Eisert, and R. Sweke, Encoding-dependent generalization bounds for parametrized quantum circuits, Quantum 5, 582 (2021).
  36. [36]S. Shin, Y. S. Teo, and H. Jeong, Experimental data encoding for quantum supervised learning, Physical Review A 107, 012422 (2023).DOI
  37. [37]B. Jaderberg, A. A. Gentile, Y. A. Berrada, E. Shishenina, and V. E. Elfving, Let quantum neural networks choose their own frequencies, Physical Review A 109, 042421 (2024).DOI
  38. [38]A. Barthe and A. Pérez-Salinas, Gradients and frequency profiles of quantum re-uploading models, Quantum 8, 1523 (2024).DOI
  39. [39]C. Duffy and M. Jastrzebski, Spectral bias in variational quantum machine learning (2025), arXiv:2506.22555 [quant-ph].arxiv.org/abs/2506.22555
  40. [40]P. Wang, U. Parampalli, and C. R. Myers, Quantum spectral model: Data reuploading with input-conditioned frequency support (2026), arXiv:2607.20516 [quant-ph].
  41. [41]S. Bagchi and S. K. Mitra, The nonuniform discrete Fourier transform and its applications in signal processing, Vol. 463 (Springer Science & Business Media, 2012).
  42. [42]J. A. Fleischer and B. P. Sutton, Nonuniform fast Fourier transforms using min-max interpolation, IEEE transactions on signal processing 51, 560 (2003).
  43. [43]L. Greengard and J.-Y. Lee, Accelerating the nonuniform fast Fourier transform, SIAM Review 46, 443 (2004).DOI
  44. [44]A. R. Thompson, J. M. Moran, and G. W. Swenson, Jr., Interferometry and Synthesis in Radio Astronomy, 3rd ed. (Springer, Cham, 2017).
  45. [45]A. Moreira, P. Prats-Iraola, M. Younis, G. Krieger, I. Hajnsek, and K. P. Papathanassiou, A tutorial on synthetic aperture radar, IEEE Geoscience and Remote Sensing Magazine 1, 6 (2013).DOI
  46. [46]I. G. Cumming and F. H. Wong, Digital Processing of Synthetic Aperture Radar Data: Algorithms and Implementation (Artech House, 2005).
  47. [47]A. Flores, K. Herndon, R. Thapa, and E. Cherrington, Synthetic Aperture Radar (SAR) Handbook: Comprehensive Methodologies for Forest Monitoring and Biomass Estimation (NASA, 2019).DOI
  48. [48]L. P. García, G. Furano, M. Ghiglione, V. Zancan, E. Imbembo, C. Illoudis, C. Clemente, and P. Trucco, Advancements in Onboard Processing of Synthetic Aperture Radar (SAR) Data: Enhancing Efficiency and Real-Time Capabilities, IEEE Journal of Selected Topics in Applied Earth Observations and Remote Sensing 17, 16625 (2024).
  49. [49]R. Gaburro, P. Healy, S. Naidu, and C. Nolan, A machine learning approach for image classification in synthetic aperture RADAR, IMA Journal of Applied Mathematics 91, 15 (2026), arXiv:2508.04234.arxiv.org/abs/2508.04234
  50. [50]S. Naik, N. Vaughn, G. Uehara, A. Spanias, and K. Jaskie, Quantum classification for synthetic aperture radar, in Automatic Target Recognition XXXIV, Proceedings of SPIE, Vol. 13039, edited by K. Chen, R. I. Hammond, and T. L. Overman (2024), p. 130390H.DOI
  51. [51]J. Tanner, N. Davies, P. J. Elahi, C. R. Myers, D. Huynh, W. Liu, M. Reynolds, and J. Wang, Maritime object classification with SAR imagery using quantum kernel methods (2025), arXiv:2512.11367 [quant-ph].arxiv.org/abs/2512.11367
  52. [52]A. Giovagnoli, S. Huber, and G. Krieger, A quantum range-Doppler algorithm for synthetic aperture radar im-arxiv.org/abs/2504.20811
  53. [53]K. Al Salahat, M. El Moussawi, and A. J. Ghandour, Quantum meets SAR: A novel range-Doppler algorithm for next-gen earth observation (2025), arXiv:2504.01832 [quant-ph].
  54. [54]A. Pérez-Salinas, M. Yaghibu Rad, A. Barthe, and V. Dunjiko, Universal approximation of continuous functions with minimal quantum circuits, Physical Review Research 7, 043282 (2025).
  55. [55]A. Manzano, D. Dechant, J. Tura, and V. Dunjko, Approximation and Generalization Capacities of Parametrized Quantum Circuits for Functions in Sobolev Spaces, Quantum 9, 1658 (2025).DOI
  56. [56]C. L. Nikias and J. M. Mendel, Signal processing with higher-order spectra, IEEE Signal processing magazine 10, 10 (1993).DOI
  57. [57]B. Boashash, N. A. Khan, and T. Ben-Jabeur, Time-frequency features for pattern recognition using high-resolution TFDs: A tutorial review, Digital Signal Processing 40, 1 (2015).DOI
  58. [58]J. C. Curlander and R. N. McDonough, Synthetic Aperture Radar: Systems and Signal Processing (Wiley, 1991).
  59. [59]R. Bamler and P. Hartl, Synthetic aperture radar interferometry, Inverse Problems 14, R1 (1998).
  60. [60]R. Cossu, E. Schoepfer, P. Bally, and L. Fusco, Near real-time SAR-based processing to support flood monitoring, Journal of Real-Time Image Processing 4, 205 (2009).DOI
  61. [61]W. Rudin, Principles of Mathematical Analysis, 3rd ed. (McGraw–Hill, 1976).
  62. [62]A. V. Oppenheim and R. W. Schafer, Discrete-Time Signal Processing, 3rd ed. (Pearson, 2010).
  63. [63]J. W. Cooley and J. W. Tukey, An algorithm for the machine calculation of complex Fourier series, Mathematics of computation 19, 297 (1965).DOI
  64. [64]W. L. Briggs and V. E. Henson, The DFT: An owner’s manual for the discrete Fourier transform (SIAM, 1995).
  65. [65]A. Dutt and V. Rokhlin, Fast Fourier transforms for nonequispaced data, SIAM Journal on Scientific computing 14, 1368 (1993).DOI

Paper details

vlnc:W_ywzk644q
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Physics and Astronomy

Not recorded for this paper

View statement
Looking for related papers…
Contents