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

@article{Glos2019ImpactOT,
  title={Impact of the malicious input data modification on the efficiency of quantum algorithms},
  author={Adam Glos and Jaroslaw Adam Miszczak},
  journal={ArXiv},
  year={2019},
  volume={abs/1802.10041}
}
In this paper, we demonstrate that the efficiency of quantum spatial search can be significantly altered by malicious manipulation of the input data in the client–server model. We achieve this by exploiting exceptional configuration effect on Szegedy spatial search and 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. The obtained results demonstrate that quantum… Expand
Leveraging the power of quantum computing for breaking RSA encryption
TLDR
A novel approach is provided to highlight the importance of developing Post-Quantum cryptography techniques for providing a secure channel of communication. Expand
On the Probability of Finding Marked Connected Components Using Quantum Walks
TLDR
Two upper bounds on the probability of finding a marked vertex for a set of connected components of marked vertices are proved and sketched to sketch further research directions. Expand
Impact of global and local interaction on quantum spatial search on chimera graph
TLDR
Numerically chimera graph is analyzed and it is suggested that relatively large number of local interactions with the marked vertex is necessary for optimal search, which in turn would imply that poorly connected vertices are hard to be found. Expand
Spectral similarity for Barabási–Albert and Chung–Lu models
  • A. Glos
  • Mathematics
  • Physica A: Statistical Mechanics and its Applications
  • 2019
Abstract In the paper we have analyzed spectral similarity between Barabasi–Albert and Chung-Lu models. We have shown the similarity of spectral distribution for sufficiently large Barabasi–AlbertExpand
Upperbounds on the probability of finding marked connected components using quantum walks
TLDR
The upperbounds for various sets of marked vertices are applied to large collection of graphs and it is shown that the quantum search may be slow even when taking real-world networks. Expand

References

SHOWING 1-10 OF 40 REFERENCES
Post-quantum cryptography
TLDR
The central challenge in post-quantum cryptography is to meet demands for cryptographic usability and flexibility without sacrificing confidence. Expand
Quantum computational supremacy
TLDR
This work presents the leading proposals to achieve quantum supremacy, and discusses how to reliably compare the power of a classical computer to thePower of a quantum computer. Expand
Exceptional Configurations of Quantum Walks with Grover's Coin
TLDR
It is shown what the most natural coin transformation -- Grover's diffusion transformation -- has a wide class of exceptional configurations of marked locations, for which the probability of finding any of the marked locations does not grow over time. Expand
Universal Blind Quantum Computation
TLDR
The protocol is the first universal scheme which detects a cheating server, as well as the first protocol which does not require any quantum computation whatsoever on the client's side. Expand
Hacking commercial quantum cryptography systems by tailored bright illumination
By using bright pulses of light to ‘blind’ the avalanche photodiode detectors used in quantum cryptography equipment, scientists in Europe have shown that it is possible to tracelessly steal theExpand
Quantum speed-up of Markov chain based algorithms
  • M. Szegedy
  • Mathematics, Computer Science
  • 45th Annual IEEE Symposium on Foundations of Computer Science
  • 2004
TLDR
It is shown that under certain conditions, the quantum version of the Markov chain gives rise to a quadratic speed-up, and that the quantum escape time, just like its classical version, depends on the spectral properties of the transition matrix with the marked rows and columns deleted. Expand
On the Probability of Finding Marked Connected Components Using Quantum Walks
TLDR
Two upper bounds on the probability of finding a marked vertex for a set of connected components of marked vertices are proved and sketched to sketch further research directions. Expand
Spatial Search by Quantum Walk is Optimal for Almost all Graphs.
TLDR
It is proved that for Erdös-Renyi random graphs, i.e., graphs of n vertices where each edge exists with probability p, search by CTQW is almost surely optimal as long as p≥log^{3/2}(n)/n, and that quantum spatial search is in fact optimal for almost all graphs. Expand
Adjacent Vertices Can Be Hard to Find by Quantum Walks
TLDR
It is shown that if the search space contains more than one marked element, their placement may drastically affect the performance of the search, and search by quantum walk on general graphs has no speed-up over the classical exhaustive search. Expand
Synthesis of quantum circuits for linear nearest neighbor architectures
TLDR
Extensions of the existing synthesis flow aimed to realize circuits for quantum architectures with linear nearest neighbor interaction are suggested, a template matching optimization, an exact synthesis approach, and two reordering strategies are introduced. Expand
...
1
2
3
4
...