Impact of the malicious input data modification on the efficiency of quantum algorithms

02/27/2018
by   Adam Glos, et al.
0

In this paper we demonstrate that the efficiency of quantum algorithms can be significantly altered by malicious manipulation of the input data. We exemplify the possibility of attacks on quantum spatial search based on Szegedy walk. We achieve this by proposing a framework suitable for analysing efficiency of attacks on quantum search algorithms. We provide the analysis of proposed attacks for different models of random graphs.

READ FULL TEXT
research
03/23/2021

Quantum walk-based search algorithms with multiple marked vertices

The quantum walk is a powerful tool to develop quantum algorithms, which...
research
08/02/2018

Improved Quantum Information Set Decoding

In this paper we present quantum information set decoding (ISD) algorith...
research
08/17/2017

Determining the Efficiency of Quantum Search Algorithms with the Renormalization Group

Quantum walks provide a powerful demonstration of the effectiveness of t...
research
04/28/2022

BEINIT: Avoiding Barren Plateaus in Variational Quantum Algorithms

Barren plateaus are a notorious problem in the optimization of variation...
research
10/11/2017

Playing a true Parrondo's game with a three state coin on a quantum walk

A coin with three states is not necessarily an anomaly. A coin falls on ...
research
09/23/2021

Quantum algorithms for group convolution, cross-correlation, and equivariant transformations

Group convolutions and cross-correlations, which are equivariant to the ...
research
01/25/2023

Don't Lie to Me: Avoiding Malicious Explanations with STEALTH

STEALTH is a method for using some AI-generated model, without suffering...

Please sign up or login with your details

Forgot password? Click here to reset