Quadratic Advantage with Quantum Randomized Smoothing Applied to Time-Series Analysis
<|reference_start|>Quadratic Advantage with Quantum Randomized Smoothing Applied to Time-Series Analysis: As quantum machine learning continues to develop at a rapid pace, the importance of ensuring the robustness and efficiency of quantum algorithms cannot be overstated. Our research presents an analysis of quantum randomized smoothing, how data encoding and perturbation modeling approaches can be matched to achieve meaningful robustness certificates. By utilizing an innovative approach integrating Grover's algorithm, a quadratic sampling advantage over classical randomized smoothing is achieved. This strategy necessitates a basis state encoding, thus restricting the space of meaningful perturbations. We show how constrained $k$-distant Hamming weight perturbations are a suitable noise distribution here, and elucidate how they can be constructed on a quantum computer. The efficacy of the proposed framework is demonstrated on a time series classification task employing a Bag-of-Words pre-processing solution. The advantage of quadratic sample reduction is recovered especially in the regime with large number of samples. This may allow quantum computers to efficiently scale randomized smoothing to more complex tasks beyond the reach of classical methods.<|reference_end|>
@article{franco2024quadratic,
    title={Quadratic Advantage with Quantum Randomized Smoothing Applied to
  Time-Series Analysis},
    author={Nicola Franco, Marie Kempkes, Jakob Spiegelberg, Jeanette Miriam
  Lorenz},
    journal={arXiv preprint arXiv:2407.18021},
    year={2024},
    archivePrefix={arXiv},
    eprint={2407.18021},
    primaryClass={quant-ph cs.AI cs.LG}
}