A New Algorithm for Applying Sequences of Affine Transformations in Quantum Circuits

Anish Giri; David Hyde; Kalman Varga

arxiv: 2412.09714 · v3 · submitted 2024-12-12 · 🪐 quant-ph

A New Algorithm for Applying Sequences of Affine Transformations in Quantum Circuits

Anish Giri , David Hyde , Kalman Varga This is my paper

Pith reviewed 2026-05-23 06:58 UTC · model grok-4.3

classification 🪐 quant-ph

keywords quantum circuitsaffine transformationsblock encodingconditional initializationHadamard gatescombinatorial amplitudessignal processingfinancial modeling

0 comments

The pith

A quantum circuit framework applies sequences of affine transformations while preserving state normalization.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper introduces a method to implement nested affine transformations inside quantum circuits. It relies on Hadamard-supported conditional initialization together with block encoding to apply the transformations one after another. The construction keeps the quantum state normalized at every step. This enables the creation of combinatorial amplitude patterns and is shown in two concrete settings: computing portfolio returns via summed amplitudes and adjusting Fourier coefficients for signal reconstruction.

Core claim

Utilizing Hadamard-supported conditional initialization and block encoding, the proposed method systematically applies sequential affine transformations while preserving state normalization, thereby generating combinatorial amplitude patterns within quantum states.

What carries the argument

Hadamard-supported conditional initialization combined with block encoding, which encodes and applies each affine transformation in sequence on the quantum register.

If this is right

Portfolio returns can be computed by taking the combinatorial sum of amplitudes inside a single quantum state.
Fourier coefficients can be manipulated directly to improve discrete signal reconstruction.
Combinatorial amplitude patterns become accessible for problems in combinatorics.
The same circuit construction supports repeated linear maps while the state remains normalized.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The technique may be combined with other quantum linear-algebra routines that already rely on block encodings.
It could be tested on small qubit registers by encoding a short sequence of known affine maps and measuring the final amplitudes.
Similar conditional-initialization steps might be adapted to other families of transformations beyond affine maps.

Load-bearing premise

Block encoding and conditional initialization can be realized in a scalable way that preserves normalization for any sequence of affine transformations without further restrictions on those transformations.

What would settle it

A concrete sequence of affine transformations for which the constructed circuit either fails to apply the intended map or produces an output state whose norm deviates from one.

Figures

Figures reproduced from arXiv: 2412.09714 by Anish Giri, David Hyde, Kalman Varga.

**Figure 2.** Figure 2: Discrete signal processing using our quantum affine transformation algorithm. Following a QFT operation on an input signal, a single affine transformation modifies a signal in Fourier space, and an inverse QFT transforms the altered signal back to the time domain. Discrete signal processing techniques are pivotal in enhancing signals, suppressing noise, filtering image and audio data, and enabling efficie… view at source ↗

read the original abstract

This paper introduces a robust and scalable framework for implementing nested affine transformations in quantum circuits. Utilizing Hadamard-supported conditional initialization and block encoding, the proposed method systematically applies sequential affine transformations while preserving state normalization. This approach provides an effective method for generating combinatorial amplitude patterns within quantum states with demonstrated applications in combinatorics and signal processing. The utility of the framework is exemplified through two key applications: financial risk assessment, where it efficiently computes portfolio returns using combinatorial sum of amplitudes, and discrete signal processing, where it enables precise manipulation of Fourier coefficients for enhanced signal reconstruction.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Desk Editor's Note private letter to a colleague

The paper sketches a block-encoding plus conditional-init approach for nested affine maps but leaves the normalization guarantee for general non-contractive sequences unaddressed.

read the letter

The core claim is a method that uses Hadamard-supported conditional initialization together with block encoding to apply sequences of affine transformations while keeping the quantum state normalized, with example uses in portfolio returns and Fourier-coefficient manipulation. That combination is the main thing on offer. Block encoding is already a standard tool for non-unitary linear maps, so the novelty sits in how the conditional initialization is supposed to handle the nesting without blowing up the norm or requiring extra ancilla overhead at each step. If the construction is explicit and works, the finance and DSP examples could be handy for people who need to embed combinatorial sums or coefficient updates inside a quantum circuit. The soft spot is the normalization step itself. Affine maps Ax + b do not preserve Euclidean norm in general, and chaining them can make the scaling factor grow or shrink arbitrarily. Standard block encoding embeds a rescaled version of the operator and projects onto a subspace; without an explicit rescaling rule or a proof that the overall operator remains isometric on the relevant subspace for arbitrary sequences, the preservation claim does not follow from the ingredients listed. The abstract gives no derivation or error bound that would close this gap. The paper is aimed at quantum-algorithm researchers who already work with block encodings and want a packaged way to handle affine sequences in applied settings. It is not yet solid enough for a strong citation, but the topic is concrete enough that a serious referee could usefully check whether the construction actually controls the norm or whether hidden contractivity assumptions are doing the work. I would send it to review rather than desk-reject.

Referee Report

2 major / 0 minor

Summary. The paper introduces a framework for implementing nested affine transformations in quantum circuits via Hadamard-supported conditional initialization and block encoding. It claims this systematically applies sequential affine maps while preserving state normalization, enabling combinatorial amplitude patterns with applications in financial risk assessment (portfolio returns via combinatorial sums) and discrete signal processing (Fourier coefficient manipulation).

Significance. If the normalization-preserving construction holds and scales without hidden assumptions on the maps, the approach could offer a practical quantum primitive for embedding affine operations in combinatorics and signal-processing tasks. The manuscript provides no derivations, error bounds, or benchmarks, so significance cannot be assessed beyond the abstract claim.

major comments (2)

[Abstract] Abstract: the central claim that block encoding plus conditional initialization preserves normalization for arbitrary sequences of affine maps Ax+b is unsupported by any derivation, rescaling step, or isometric-embedding argument. Affine maps are not norm-preserving in general, and no explicit norm-control mechanism (e.g., singular-value rescaling or ancillary projection) is described.
[Abstract] Abstract: robustness and scalability assertions are stated without supporting analysis, error bounds, or numerical verification; the reader's extracted claim therefore cannot be evaluated for correctness when ||A||>1 or when successive maps compound the norm.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments on the abstract claims. We agree that additional supporting material is required and will revise the manuscript to strengthen the presentation of the normalization argument and related analysis.

read point-by-point responses

Referee: [Abstract] Abstract: the central claim that block encoding plus conditional initialization preserves normalization for arbitrary sequences of affine maps Ax+b is unsupported by any derivation, rescaling step, or isometric-embedding argument. Affine maps are not norm-preserving in general, and no explicit norm-control mechanism (e.g., singular-value rescaling or ancillary projection) is described.

Authors: We acknowledge that the abstract statement is presented without an accompanying derivation. The manuscript body describes the construction via Hadamard-supported conditional initialization and block encoding, but we agree an explicit isometric or rescaling argument is needed to substantiate norm preservation for general Ax + b. We will add a concise derivation sketch to the abstract and a dedicated paragraph in the methods section of the revision. revision: yes
Referee: [Abstract] Abstract: robustness and scalability assertions are stated without supporting analysis, error bounds, or numerical verification; the reader's extracted claim therefore cannot be evaluated for correctness when ||A||>1 or when successive maps compound the norm.

Authors: The referee is correct that the current manuscript contains no error bounds, numerical benchmarks, or explicit treatment of the ||A|| > 1 regime. The work is primarily a conceptual framework; we therefore accept that robustness claims cannot be evaluated as written. We will add a new subsection on norm-control mechanisms, a brief error analysis for successive maps, and a short discussion of the ||A|| > 1 case in the revised version. revision: yes

Circularity Check

0 steps flagged

No circularity: no derivation chain or equations present to inspect

full rationale

The provided abstract and description introduce a framework using Hadamard-supported conditional initialization and block encoding to apply affine transformations while preserving normalization, with applications in combinatorics and signal processing. However, no equations, derivations, fitted parameters, self-citations, or load-bearing steps are visible in the text. Without any explicit mathematical chain, no reduction to inputs by construction can be identified, making this the default non-finding case.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

No details on parameters or assumptions available from the abstract alone.

pith-pipeline@v0.9.0 · 5613 in / 946 out tokens · 28530 ms · 2026-05-23T06:58:40.390641+00:00 · methodology

discussion (0)

Reference graph

Works this paper leans on

42 extracted references · 42 canonical work pages

[1]

Extreme learn- ing machine with affine transformation inputs in an activation function,

J. Cao, K. Zhang, H. Yong, X. Lai, B. Chen, and Z. Lin, “Extreme learn- ing machine with affine transformation inputs in an activation function,” IEEE Transactions on Neural Networks and Learning Systems , vol. 30, no. 7, pp. 2093–2107, 2019

work page 2093
[2]

Feature matching with affine- function transformation models,

H. Li, X. Huang, J. Huang, and S. Zhang, “Feature matching with affine- function transformation models,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 36, no. 12, pp. 2407–2422, 2014

work page 2014
[3]

Quantum image encryption based on generalized affine transform and logistic map,

H. Liang, X. Tao, and N. Zhou, “Quantum image encryption based on generalized affine transform and logistic map,” Quantum Information Processing, vol. 15, no. 7, pp. 2701–2724, 2016

work page 2016
[4]

Detecting affine equivalence of boolean functions and circuit transformation,

X. Zeng, G. Yang, X. Song, M. A. Perkowski, and G. Chen, “Detecting affine equivalence of boolean functions and circuit transformation,” The Computer Journal, vol. 66, pp. 2220–2229, 07 2022

work page 2022
[5]

On the impact of affine loop transformations in qubit allocation,

M. Kong, “On the impact of affine loop transformations in qubit allocation,” ACM Transactions on Quantum Computing , vol. 2, Sept. 2021

work page 2021
[6]

Exploring affine abstractions for qubit map- ping,

B. Gerard and M. Kong, “Exploring affine abstractions for qubit map- ping,” in 2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS) , pp. 43–54, 2021

work page 2021
[7]

A fast quantum image encryption algorithm based on affine transform and fractional-order Lorenz-like chaotic dy- namical system,

M. Khan and A. Rasheed, “A fast quantum image encryption algorithm based on affine transform and fractional-order Lorenz-like chaotic dy- namical system,” Quantum Information Processing , vol. 21, no. 134, 2022

work page 2022
[8]

Marschner and P

S. Marschner and P. Shirley, Fundamentals of Computer Graphics. CRC Press, 4th ed., 2016

work page 2016
[9]

Quantum algorithms for estimating physical quantities using block encodings,

P. Rall, “Quantum algorithms for estimating physical quantities using block encodings,” Phys. Rev. A, vol. 102, p. 022408, Aug 2020

work page 2020
[10]

Quantum resources required to block-encode a matrix of classical data,

B. D. Clader, A. M. Dalzell, N. Stamatopoulos, G. Salton, M. Berta, and W. J. Zeng, “Quantum resources required to block-encode a matrix of classical data,” IEEE Transactions on Quantum Engineering , vol. 3, pp. 1–23, 2022

work page 2022
[11]

Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics,

A. Gily ´en, Y . Su, G. H. Low, and N. Wiebe, “Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics,” in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing , STOC 2019, (New York, NY , USA), pp. 193–204, Association for Computing Machinery, 2019

work page 2019
[12]

Explicit quantum circuits for block encodings of certain sparse matrices,

D. Camps, L. Lin, R. V . Beeumen, and C. Yang, “Explicit quantum circuits for block encodings of certain sparse matrices,” 2023

work page 2023
[13]

On efficient quantum block encoding of pseudo-differential operators,

H. Li, H. Ni, and L. Ying, “On efficient quantum block encoding of pseudo-differential operators,” Quantum, vol. 7, p. 1031, June 2023

work page 2023
[14]

Approximate quantum circuit synthesis using block encodings,

D. Camps and R. Van Beeumen, “Approximate quantum circuit synthesis using block encodings,” Phys. Rev. A, vol. 102, p. 052411, Nov 2020

work page 2020
[15]

Automated synthesis of quantum algorithms via classical numerical techniques,

Y . Huang, B. E. Grossman-Ponemon, and D. A. B. Hyde, “Automated synthesis of quantum algorithms via classical numerical techniques,” 2024

work page 2024
[16]

Quantum machine learning,

J. Biamonte, P. Wittek, N. Pancotti, P. Rebentrost, N. Wiebe, and S. Lloyd, “Quantum machine learning,” Nature, vol. 549, pp. 195–202, Sep 2017

work page 2017
[17]

Quantum recommendation systems,

I. Kerenidis and A. Prakash, “Quantum recommendation systems,” 2016

work page 2016
[18]

Schuld and F

M. Schuld and F. Petruccione, Supervised Learning with Quantum Computers. Quantum Science and Technology, Springer International Publishing, 2018

work page 2018
[19]

Quantum algorithm and circuit design solving the poisson equation,

Y . Cao, A. Papageorgiou, I. Petras, J. Traub, and S. Kais, “Quantum algorithm and circuit design solving the poisson equation,” New Journal of Physics, vol. 15, p. 013021, jan 2013

work page 2013
[20]

High-precision quantum algorithms for partial differential equations,

A. M. Childs, J.-P. Liu, and A. Ostrander, “High-precision quantum algorithms for partial differential equations,” Quantum, vol. 5, p. 574, Nov. 2021

work page 2021
[21]

Quantum vs. classical algo- rithms for solving the heat equation,

N. Linden, A. Montanaro, and C. Shao, “Quantum vs. classical algo- rithms for solving the heat equation,” 2020

work page 2020
[22]

Iterative quantum algorithm for combinatorial optimization based on quantum gradient descent,

X. Yi, J.-C. Huo, Y .-P. Gao, L. Fan, R. Zhang, and C. Cao, “Iterative quantum algorithm for combinatorial optimization based on quantum gradient descent,” Results in Physics , vol. 56, p. 107204, 2024

work page 2024
[23]

Towards quantum computational mechanics,

B. Liu, M. Ortiz, and F. Cirak, “Towards quantum computational mechanics,” Computer Methods in Applied Mechanics and Engineering , vol. 432, p. 117403, Dec. 2024

work page 2024
[24]

On applications of quantum computing to plasma simulations,

I. Y . Dodin and E. A. Startsev, “On applications of quantum computing to plasma simulations,” Physics of Plasmas, vol. 28, p. 092101, 09 2021

work page 2021
[25]

Quantum arithmetic with the quantum Fourier transform,

L. Ruiz-Perez and J. C. Garcia-Escartin, “Quantum arithmetic with the quantum Fourier transform,” Quantum Information Processing , vol. 16, no. 6, p. 152, 2017

work page 2017
[26]

Optimizing quantum circuits for arithmetic,

T. H ¨aner, M. Roetteler, and K. M. Svore, “Optimizing quantum circuits for arithmetic,” 2018

work page 2018
[27]

Reversible arithmetic logic unit for quantum arithmetic,

M. K. Thomsen, R. Gl ¨uck, and H. B. Axelsen, “Reversible arithmetic logic unit for quantum arithmetic,” Journal of Physics A: Mathematical and Theoretical, vol. 43, no. 38, p. 382002, 2010

work page 2010
[28]

Efficient floating point arithmetic for quantum computers,

R. Seidel, N. Tcholtchev, S. Bock, C. K.-U. Becker, and M. Hauswirth, “Efficient floating point arithmetic for quantum computers,” IEEE Ac- cess, vol. 10, pp. 72400–72415, 2022

work page 2022
[29]

Wittek, Quantum Machine Learning: What Quantum Computing Means to Data Mining

P. Wittek, Quantum Machine Learning: What Quantum Computing Means to Data Mining . Academic Press, 2014

work page 2014
[30]

A divide-and-conquer algorithm for quantum state preparation,

I. F. Araujo, D. K. Park, F. Petruccione, et al. , “A divide-and-conquer algorithm for quantum state preparation,” Scientific Reports , vol. 11, p. 6329, 2021

work page 2021
[31]

Initializing the amplitude distribution of a quantum state,

D. Ventura and T. Martinez, “Initializing the amplitude distribution of a quantum state,” Foundations of Physics Letters, vol. 12, pp. 547–559, 1999

work page 1999
[32]

Configurable sublinear circuits for quantum state preparation,

I. F. Araujo, D. K. Park, T. B. Ludermir, et al., “Configurable sublinear circuits for quantum state preparation,” Quantum Information Process- ing, vol. 22, p. 123, 2023

work page 2023
[33]

Quantum risk analysis,

S. Woerner and D. J. Egger, “Quantum risk analysis,” npj Quantum Information, vol. 5, p. 15, 2019

work page 2019
[34]

Quantum computational finance: Pricing derivatives,

P. Rebentrost and S. Lloyd, “Quantum computational finance: Pricing derivatives,” Physical Review A , vol. 98, no. 2, p. 022321, 2018

work page 2018
[35]

Quantum computing for finance: State-of-the-art and future prospects,

D. J. Egger, S. Woerner, and I. Tavernelli, “Quantum computing for finance: State-of-the-art and future prospects,”npj Quantum Information, vol. 6, p. 1, 2020

work page 2020
[36]

Quantum approaches to portfolio optimization,

R. Orus, S. Mugel, and E. Lizaso, “Quantum approaches to portfolio optimization,” arXiv preprint arXiv:1811.12344 , 2018

work page arXiv 2018
[37]

Quantum machine learning for credit scoring and risk management,

G. Rosenberg and et al., “Quantum machine learning for credit scoring and risk management,” PLOS One, vol. 14, no. 8, p. e0221304, 2019

work page 2019
[38]

On the complexity and applications of quantum portfolio optimization,

A. Bouland and S. Gharibian, “On the complexity and applications of quantum portfolio optimization,” Quantum, vol. 4, p. 334, 2020

work page 2020
[39]

A. V . Oppenheim and R. W. Schafer, Discrete-Time Signal Processing. Pearson Education, 2009

work page 2009
[40]

Applications of discrete signal processing in modern technology,

A. Papoulis, “Applications of discrete signal processing in modern technology,” Journal of Applied Signal Processing , vol. 10, no. 3, pp. 210–223, 2012

work page 2012
[41]

A tutorial on Fourier transform, discrete Fourier transform, and fast Fourier transform,

R. N. Bracewell, “A tutorial on Fourier transform, discrete Fourier transform, and fast Fourier transform,” Proceedings of the IEEE, vol. 82, no. 3, pp. 414–428, 1994

work page 1994
[42]

M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information. Cambridge University Press, 10th anniversary edition ed., 2010

work page 2010

[1] [1]

Extreme learn- ing machine with affine transformation inputs in an activation function,

J. Cao, K. Zhang, H. Yong, X. Lai, B. Chen, and Z. Lin, “Extreme learn- ing machine with affine transformation inputs in an activation function,” IEEE Transactions on Neural Networks and Learning Systems , vol. 30, no. 7, pp. 2093–2107, 2019

work page 2093

[2] [2]

Feature matching with affine- function transformation models,

H. Li, X. Huang, J. Huang, and S. Zhang, “Feature matching with affine- function transformation models,” IEEE Transactions on Pattern Analysis and Machine Intelligence , vol. 36, no. 12, pp. 2407–2422, 2014

work page 2014

[3] [3]

Quantum image encryption based on generalized affine transform and logistic map,

H. Liang, X. Tao, and N. Zhou, “Quantum image encryption based on generalized affine transform and logistic map,” Quantum Information Processing, vol. 15, no. 7, pp. 2701–2724, 2016

work page 2016

[4] [4]

Detecting affine equivalence of boolean functions and circuit transformation,

X. Zeng, G. Yang, X. Song, M. A. Perkowski, and G. Chen, “Detecting affine equivalence of boolean functions and circuit transformation,” The Computer Journal, vol. 66, pp. 2220–2229, 07 2022

work page 2022

[5] [5]

On the impact of affine loop transformations in qubit allocation,

M. Kong, “On the impact of affine loop transformations in qubit allocation,” ACM Transactions on Quantum Computing , vol. 2, Sept. 2021

work page 2021

[6] [6]

Exploring affine abstractions for qubit map- ping,

B. Gerard and M. Kong, “Exploring affine abstractions for qubit map- ping,” in 2021 IEEE/ACM Second International Workshop on Quantum Computing Software (QCS) , pp. 43–54, 2021

work page 2021

[7] [7]

A fast quantum image encryption algorithm based on affine transform and fractional-order Lorenz-like chaotic dy- namical system,

M. Khan and A. Rasheed, “A fast quantum image encryption algorithm based on affine transform and fractional-order Lorenz-like chaotic dy- namical system,” Quantum Information Processing , vol. 21, no. 134, 2022

work page 2022

[8] [8]

Marschner and P

S. Marschner and P. Shirley, Fundamentals of Computer Graphics. CRC Press, 4th ed., 2016

work page 2016

[9] [9]

Quantum algorithms for estimating physical quantities using block encodings,

P. Rall, “Quantum algorithms for estimating physical quantities using block encodings,” Phys. Rev. A, vol. 102, p. 022408, Aug 2020

work page 2020

[10] [10]

Quantum resources required to block-encode a matrix of classical data,

B. D. Clader, A. M. Dalzell, N. Stamatopoulos, G. Salton, M. Berta, and W. J. Zeng, “Quantum resources required to block-encode a matrix of classical data,” IEEE Transactions on Quantum Engineering , vol. 3, pp. 1–23, 2022

work page 2022

[11] [11]

Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics,

A. Gily ´en, Y . Su, G. H. Low, and N. Wiebe, “Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics,” in Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing , STOC 2019, (New York, NY , USA), pp. 193–204, Association for Computing Machinery, 2019

work page 2019

[12] [12]

Explicit quantum circuits for block encodings of certain sparse matrices,

D. Camps, L. Lin, R. V . Beeumen, and C. Yang, “Explicit quantum circuits for block encodings of certain sparse matrices,” 2023

work page 2023

[13] [13]

On efficient quantum block encoding of pseudo-differential operators,

H. Li, H. Ni, and L. Ying, “On efficient quantum block encoding of pseudo-differential operators,” Quantum, vol. 7, p. 1031, June 2023

work page 2023

[14] [14]

Approximate quantum circuit synthesis using block encodings,

D. Camps and R. Van Beeumen, “Approximate quantum circuit synthesis using block encodings,” Phys. Rev. A, vol. 102, p. 052411, Nov 2020

work page 2020

[15] [15]

Automated synthesis of quantum algorithms via classical numerical techniques,

Y . Huang, B. E. Grossman-Ponemon, and D. A. B. Hyde, “Automated synthesis of quantum algorithms via classical numerical techniques,” 2024

work page 2024

[16] [16]

Quantum machine learning,

J. Biamonte, P. Wittek, N. Pancotti, P. Rebentrost, N. Wiebe, and S. Lloyd, “Quantum machine learning,” Nature, vol. 549, pp. 195–202, Sep 2017

work page 2017

[17] [17]

Quantum recommendation systems,

I. Kerenidis and A. Prakash, “Quantum recommendation systems,” 2016

work page 2016

[18] [18]

Schuld and F

M. Schuld and F. Petruccione, Supervised Learning with Quantum Computers. Quantum Science and Technology, Springer International Publishing, 2018

work page 2018

[19] [19]

Quantum algorithm and circuit design solving the poisson equation,

Y . Cao, A. Papageorgiou, I. Petras, J. Traub, and S. Kais, “Quantum algorithm and circuit design solving the poisson equation,” New Journal of Physics, vol. 15, p. 013021, jan 2013

work page 2013

[20] [20]

High-precision quantum algorithms for partial differential equations,

A. M. Childs, J.-P. Liu, and A. Ostrander, “High-precision quantum algorithms for partial differential equations,” Quantum, vol. 5, p. 574, Nov. 2021

work page 2021

[21] [21]

Quantum vs. classical algo- rithms for solving the heat equation,

N. Linden, A. Montanaro, and C. Shao, “Quantum vs. classical algo- rithms for solving the heat equation,” 2020

work page 2020

[22] [22]

Iterative quantum algorithm for combinatorial optimization based on quantum gradient descent,

X. Yi, J.-C. Huo, Y .-P. Gao, L. Fan, R. Zhang, and C. Cao, “Iterative quantum algorithm for combinatorial optimization based on quantum gradient descent,” Results in Physics , vol. 56, p. 107204, 2024

work page 2024

[23] [23]

Towards quantum computational mechanics,

B. Liu, M. Ortiz, and F. Cirak, “Towards quantum computational mechanics,” Computer Methods in Applied Mechanics and Engineering , vol. 432, p. 117403, Dec. 2024

work page 2024

[24] [24]

On applications of quantum computing to plasma simulations,

I. Y . Dodin and E. A. Startsev, “On applications of quantum computing to plasma simulations,” Physics of Plasmas, vol. 28, p. 092101, 09 2021

work page 2021

[25] [25]

Quantum arithmetic with the quantum Fourier transform,

L. Ruiz-Perez and J. C. Garcia-Escartin, “Quantum arithmetic with the quantum Fourier transform,” Quantum Information Processing , vol. 16, no. 6, p. 152, 2017

work page 2017

[26] [26]

Optimizing quantum circuits for arithmetic,

T. H ¨aner, M. Roetteler, and K. M. Svore, “Optimizing quantum circuits for arithmetic,” 2018

work page 2018

[27] [27]

Reversible arithmetic logic unit for quantum arithmetic,

M. K. Thomsen, R. Gl ¨uck, and H. B. Axelsen, “Reversible arithmetic logic unit for quantum arithmetic,” Journal of Physics A: Mathematical and Theoretical, vol. 43, no. 38, p. 382002, 2010

work page 2010

[28] [28]

Efficient floating point arithmetic for quantum computers,

R. Seidel, N. Tcholtchev, S. Bock, C. K.-U. Becker, and M. Hauswirth, “Efficient floating point arithmetic for quantum computers,” IEEE Ac- cess, vol. 10, pp. 72400–72415, 2022

work page 2022

[29] [29]

Wittek, Quantum Machine Learning: What Quantum Computing Means to Data Mining

P. Wittek, Quantum Machine Learning: What Quantum Computing Means to Data Mining . Academic Press, 2014

work page 2014

[30] [30]

A divide-and-conquer algorithm for quantum state preparation,

I. F. Araujo, D. K. Park, F. Petruccione, et al. , “A divide-and-conquer algorithm for quantum state preparation,” Scientific Reports , vol. 11, p. 6329, 2021

work page 2021

[31] [31]

Initializing the amplitude distribution of a quantum state,

D. Ventura and T. Martinez, “Initializing the amplitude distribution of a quantum state,” Foundations of Physics Letters, vol. 12, pp. 547–559, 1999

work page 1999

[32] [32]

Configurable sublinear circuits for quantum state preparation,

I. F. Araujo, D. K. Park, T. B. Ludermir, et al., “Configurable sublinear circuits for quantum state preparation,” Quantum Information Process- ing, vol. 22, p. 123, 2023

work page 2023

[33] [33]

Quantum risk analysis,

S. Woerner and D. J. Egger, “Quantum risk analysis,” npj Quantum Information, vol. 5, p. 15, 2019

work page 2019

[34] [34]

Quantum computational finance: Pricing derivatives,

P. Rebentrost and S. Lloyd, “Quantum computational finance: Pricing derivatives,” Physical Review A , vol. 98, no. 2, p. 022321, 2018

work page 2018

[35] [35]

Quantum computing for finance: State-of-the-art and future prospects,

D. J. Egger, S. Woerner, and I. Tavernelli, “Quantum computing for finance: State-of-the-art and future prospects,”npj Quantum Information, vol. 6, p. 1, 2020

work page 2020

[36] [36]

Quantum approaches to portfolio optimization,

R. Orus, S. Mugel, and E. Lizaso, “Quantum approaches to portfolio optimization,” arXiv preprint arXiv:1811.12344 , 2018

work page arXiv 2018

[37] [37]

Quantum machine learning for credit scoring and risk management,

G. Rosenberg and et al., “Quantum machine learning for credit scoring and risk management,” PLOS One, vol. 14, no. 8, p. e0221304, 2019

work page 2019

[38] [38]

On the complexity and applications of quantum portfolio optimization,

A. Bouland and S. Gharibian, “On the complexity and applications of quantum portfolio optimization,” Quantum, vol. 4, p. 334, 2020

work page 2020

[39] [39]

A. V . Oppenheim and R. W. Schafer, Discrete-Time Signal Processing. Pearson Education, 2009

work page 2009

[40] [40]

Applications of discrete signal processing in modern technology,

A. Papoulis, “Applications of discrete signal processing in modern technology,” Journal of Applied Signal Processing , vol. 10, no. 3, pp. 210–223, 2012

work page 2012

[41] [41]

A tutorial on Fourier transform, discrete Fourier transform, and fast Fourier transform,

R. N. Bracewell, “A tutorial on Fourier transform, discrete Fourier transform, and fast Fourier transform,” Proceedings of the IEEE, vol. 82, no. 3, pp. 414–428, 1994

work page 1994

[42] [42]

M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information. Cambridge University Press, 10th anniversary edition ed., 2010

work page 2010