Solving the Detection Problem

Günther Ludwig

Dinesh Kumar, Srivastava, Pankaj

Detection of symmetry is vital to problem solving. Most of the problems of computer vision and computer graphics and machine intelligence in general, can be reduced to symmetry detection problem. Unstructured search problem can also be looked upon from symmetry detection point of view. Unstructured search can be thought as searching a binary string satisfying some search condition in an unsorted list of binary strings. In this paper unstructured search problem is reduced to function bilateral symmetry detection problem with polynomial overhead in terms of the size of the input. Keywords: Unstructured Search, Quantum algorithm, Function bilateral symmetry detection, Decision Problem, Quantum Black Box, Solving NP complete problems.

Péter Wittek

Adán Cabello

A method for solving the Byzantine agreement problem [M. Fitzi, N. Gisin, and U. Maurer, Phys. Rev. Lett. 87, 217901 (2001)] and the liar detection problem [A. Cabello, Phys. Rev. Lett. 89, 100402 (2002)] is introduced. The main advantages of this protocol are that it is simpler and is based on a four-qubit singlet state already prepared in the laboratory.

Travis Norsen

Xiaojun Wen, Yongzhi Chen, Zhi-Jia Lu +4 more

In distributed computing systems such as blockchain, Byzantine protocol is a practical method to solve its fault-tolerance problem. The Byzantine question has a variant called the “detectable Byzantine protocol.” This type of protocol is unsolvable in the classical field, but it can be solved using quantum physics properties in quantum systems. Based on the wonderful characteristics of quantum entanglement, a method of quantum channel detection, generation and safe distribution of digital lists is designed by using two quantum entangled states of three photons as quantum channels, so as to solve the tripartite Byzantine problem of detection more simply. Finally, the correctness and security of the scheme are analyzed.