Success rate versus finite run time in local adiabatic quantum search algorithm

DOI10.1088/0253-6102/67/4/355zbMATH Open1364.81113OpenAlexW2605825236MaRDI QIDQ5266504FDOQ5266504

Authors: Feng-Guang Li, Xiang Wang, Shuo Zhang, Yu-Tao du, Tan Li, Bowen Ma, Wan-Su Bao, Xiang-Qun Fu 

Publication date: 7 June 2017

Published in: Communications in Theoretical Physics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1088/0253-6102/67/4/355

Recommendations

• Nonadiabatic quantum search algorithm with analytical success rate
• Bounding Run-Times of Local Adiabatic Algorithms
• Energy and efficiency of adiabatic quantum search algorithms
• Partial adiabatic quantum search algorithm and its extensions
• Role of coherence in adiabatic search algorithms

zbMATH Keywords

success rateadiabatic parameterlocal adiabatic quantum search

Mathematics Subject Classification ID

Search theory (90B40) Quantum computation (81P68) Closed and approximate solutions to the Schrödinger, Dirac, Klein-Gordon and other equations of quantum mechanics (81Q05)

Cited In (2)

• Relationship between minimum gap and success probability in adiabatic quantum computing
• Bounding Run-Times of Local Adiabatic Algorithms

This page was built for publication: Success rate versus finite run time in local adiabatic quantum search algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5266504)