{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,23]],"date-time":"2025-06-23T19:01:55Z","timestamp":1750705315497,"version":"3.37.3"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2022,7,9]],"date-time":"2022-07-09T00:00:00Z","timestamp":1657324800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,7,9]],"date-time":"2022-07-09T00:00:00Z","timestamp":1657324800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Quantum Mach. Intell."],"published-print":{"date-parts":[[2022,12]]},"DOI":"10.1007\/s42484-022-00080-2","type":"journal-article","created":{"date-parts":[[2022,7,9]],"date-time":"2022-07-09T21:23:56Z","timestamp":1657401836000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Simplified quantum algorithm for the oracle identification problem"],"prefix":"10.1007","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1723-9144","authenticated-orcid":false,"given":"Leila","family":"Taghavi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,9]]},"reference":[{"issue":"9&10","key":"80_CR1","first-page":"0760","volume":"19","author":"S Beigi","year":"2019","unstructured":"Beigi S, Taghavi L (2019) Span program for non-binary functions. Quantum Information and Computation(QIC) 19(9&10):0760\u20130792","journal-title":"Quantum Information and Computation(QIC)"},{"key":"80_CR2","doi-asserted-by":"publisher","first-page":"241","DOI":"10.22331\/q-2020-03-02-241","volume":"4","author":"S Beigi","year":"2020","unstructured":"Beigi S, Taghavi L (2020) Quantum speedup based on classical decision trees. Quantum 4:241","journal-title":"Quantum"},{"key":"80_CR3","unstructured":"Childs A.M., Kothari R, Ozols M, Roetteler M (2013) Easy and hard functions for the boolean hidden shift problem. In: Leibniz International proceedings in informatics, LIPIcs, vol 22, pp 50\u201379"},{"key":"80_CR4","doi-asserted-by":"crossref","unstructured":"Heged\u00fcs T (1995) Generalized teaching dimensions and the query complexity of learning. In: Proceedings of the eighth annual conference on Computational learning theory, pp 108\u2013117","DOI":"10.1145\/225298.225311"},{"key":"80_CR5","unstructured":"Kothari R (2014a) An optimal quantum algorithm for the oracle identification problem. In: Leibniz International proceedings in informatics, LIPIcs, vol 25, pp 482\u2013493"},{"key":"80_CR6","unstructured":"Kothari R (2014b) An optimal quantum algorithm for the oracle identification problem. arXiv:1311.7685"},{"key":"80_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4086\/toc.2016.v012a018","volume":"12","author":"CY-Y Lin","year":"2016","unstructured":"Lin CY-Y, Lin H-H (2016) Upper bounds on quantum query complexity inspired by the Elitzur-Vaidman bomb tester. Theory Comput 12:1\u201335","journal-title":"Theory Comput"},{"key":"80_CR8","doi-asserted-by":"crossref","unstructured":"Reichardt BW (2009) Span programs and quantum query complexity: the general adversary bound is nearly tight for every boolean function. In: 50th Annual IEEE symposium on foundations of computer science, 2009. FOCS\u201909, pp 544\u2013551. IEEE","DOI":"10.1109\/FOCS.2009.55"}],"container-title":["Quantum Machine Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-022-00080-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42484-022-00080-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42484-022-00080-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,23]],"date-time":"2022-12-23T21:10:08Z","timestamp":1671829808000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42484-022-00080-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,9]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2022,12]]}},"alternative-id":["80"],"URL":"https:\/\/doi.org\/10.1007\/s42484-022-00080-2","relation":{},"ISSN":["2524-4906","2524-4914"],"issn-type":[{"type":"print","value":"2524-4906"},{"type":"electronic","value":"2524-4914"}],"subject":[],"published":{"date-parts":[[2022,7,9]]},"assertion":[{"value":"31 January 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 June 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 July 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The author declares no potential conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}],"article-number":"19"}}