FUNCTION DISCRIMINATION VIA QUANTUM SIGNALPROCESSING WITHANULL INPUT

Date

2026-9-4

Author

Olgun, Halil İbrahim

Metadata

Show full item record

This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Item Usage Stats

98
views

23
downloads

Cite This

This thesis applies Quantum Signal Processing (QSP) to solve a generalized Deutsch Jozsa promise problem: distinguishing whether a Boolean function has r1 or r2 so lutions in a search space of size N. Standard QSP suffers from two limitations: the measurement probability is symmetric under replacing the number of solutions with its complement, and the required number of evaluations is rarely an integer, introducing rounding errors that prevent deterministic success. To resolve these issues, we intro duce an auxiliary null input state that remains invariant under the function evaluation. This state breaks the complement symmetry and introduces an adjustable initial am plitude coefficient. By tuning this amplitude, we can force the required number of evaluations to be an exact integer, eliminating rounding errors and achieving a deter ministic algorithm with quadratic speedup.

Subject Keywords

Quantum Singular Value Transformation, Quantum Signal Processing, Function Discrimination, Quantum Algorithm Complexity, Deterministic Quantum Algorithms

URI

https://hdl.handle.net/11511/121041

Collections

Graduate School of Natural and Applied Sciences, Thesis