Evaluation of exact quantum query complexities by semidefinite programming
Crossref DOI link: https://doi.org/10.1007/s11128-019-2297-3
Published Online: 2019-04-26
Published Print: 2019-06
Update policy: https://doi.org/10.1007/springer_crossmark_policy
Uyanık, Kıvanç http://orcid.org/0000-0003-4328-3680
Funding for this research was provided by:
Türkiye Bilimsel ve Teknolojik Araştirma Kurumu (2218)
Text and Data Mining valid from 2019-04-26
Article History
Received: 22 December 2018
Accepted: 20 April 2019
First Online: 26 April 2019