On Quantum Algorithm for Binary Search and Its Computational Complexity

DOI10.1142/S1230161215500195zbMath1328.81080arXiv1306.5039OpenAlexW2963191833MaRDI QIDQ3459353

Masanori Ohya, Satoshi Iriyama, Igor V. Volovich

Publication date: 22 December 2015

Published in: Open Systems & Information Dynamics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1306.5039

Mathematics Subject Classification ID

Searching and sorting (68P10) Quantum computation (81P68)

Related Items (1)

New quantum algorithm solving the NP complete problem

Cites Work

• New quantum algorithm for studying NP-complete problems
• Language Classes Defined by Generalized Quantum Turing Machine
• Randomness conservation inequalities; information and independence in mathematical theories
• A Stochastic Limit Approach to the SAT Problem
• The Complexity of the Local Hamiltonian Problem

This page was built for publication: On Quantum Algorithm for Binary Search and Its Computational Complexity