{"paper":{"title":"A summary on two new algorithms for Grover's unsorted database search problem","arxiv_id":"quant-ph/0603210","primary_cat":"quant-ph","submitted_at":"2006-03-23T15:59:02+00:00","version_compiled":"v2"},"notice":"Every quoted sentence is the authors' text from the arXiv listing abstract. Labels and probabilities are the outputs of classifier-1.13.0 on the question bank abstract-p1-20260923, exactly as returned. No sentence in this record was written by a language model.","schema":"pith.compiled-record/v0","status":"compiled","abstract":{"source":"arXiv listing abstract v2","sentences":[{"i":0,"p":0.84,"id":"s0","own":false,"role":"contribution","text":"In this summary we discuss two new algorithms for Grover's unsorted database search problem that claimed to have reached exponential speedup over Grover's original algorithm.","hedge":{"p":0.71,"label":"asserted"},"own_p":0.13,"main_claim_p":0.15,"quantitative":true,"quantitative_p":0.87,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":0.16,"limitation":0.0,"future_work":0.0,"contribution":0.84,"interpretation":0.0}},{"i":1,"p":0.65,"id":"s1","own":false,"role":"contribution","text":"One is in the quantum setting with \"power queries\" that allow for exponential reduction in the number of queries over Grover's original algorithm with \"bit queries\".","hedge":{"p":0.94,"label":"asserted"},"own_p":0.1,"main_claim_p":0.1,"quantitative":true,"quantitative_p":0.9,"role_probabilities":{"gap":0.0,"method":0.31,"result":0.02,"background":0.02,"limitation":0.0,"future_work":0.0,"contribution":0.65,"interpretation":0.0}},{"i":2,"p":0.53,"id":"s2","own":false,"role":"method","text":"The other is to use \"dubit queries\" on a duality computer - a new computing model uses a quantum system's wave-particle duality, which is able to achieve even greater computing power and better capability than existent quantum computers we have been discussing.","hedge":{"p":0.99,"label":"asserted"},"own_p":0.12,"main_claim_p":0.09,"quantitative":true,"quantitative_p":0.87,"role_probabilities":{"gap":0.0,"method":0.53,"result":0.01,"background":0.03,"limitation":0.0,"future_work":0.0,"contribution":0.42,"interpretation":0.01}},{"i":3,"p":0.6,"id":"s3","own":true,"role":"contribution","text":"We discuss the shortages and difficulties of both schemes as well.","hedge":{"p":0.76,"label":"asserted"},"own_p":0.72,"main_claim_p":0.11,"quantitative":false,"quantitative_p":0.04,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.01,"background":0.0,"limitation":0.39,"future_work":0.0,"contribution":0.6,"interpretation":0.0}}]},"compiled":{"main_claim":{"p":0.89,"text":"We discuss the shortages and difficulties of both schemes as well.","location":"abstract s3","hedge_strength":{"p":0.76,"label":"asserted"}},"provenance":{"route":{"via":"TypeSafe API","model":"classifier-1.13.0","endpoint":"https://api.typesafe.ai/v1/systemone","provider":"TypeSafe"},"packing":"one request per paper","requests":1,"input_tokens":3625,"cost_usd_reported":0.0},"compiled_at":"2026-09-23","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.07,"states_limitation":0.7,"human_participants":0.02,"controlled_comparison":0.52,"randomized_assignment":0.01,"states_quantitative_result":0.11,"compares_with_prior_results":0.89,"mentions_code_or_data_availability":0.02},"evidential_basis":{"p":0.51,"value":"argument","probabilities":{"argument":0.51,"literature":0.46,"proof_or_derivation":0.03,"analysis_of_existing_data":0.0,"observation_or_experiment":0.0,"simulation_or_computation":0.0}},"contribution_type":{"p":0.83,"value":"review","probabilities":{"review":0.83,"method_or_tool":0.03,"empirical_study":0.0,"simulation_study":0.0,"theoretical_result":0.0,"dataset_or_benchmark":0.0,"position_or_commentary":0.14}},"contribution_statement":{"p":0.75,"text":"In this summary we discuss two new algorithms for Grover's unsorted database search problem that claimed to have reached exponential speedup over Grover's original algorithm.","location":"abstract s0"}},"coverage":{"tier":"abstract","levels_run":["P abstract"],"not_examined":["full text","figures and tables","references and citing sentences","relations to other papers"],"sources_read":["arXiv listing abstract v2"],"levels_not_run":["S sections","T body sentences","C citations","R cross-paper relations"],"sentences_examined":4,"sentences_in_abstract":4},"measured_accuracy":{"url":"https://pith.science/accuracy","measured_on":"2026-10-02","method":"two independent model families labelled a fresh random sample blind; the figure is how often the published label matches their consensus","sentence_role_agreement":0.92,"main_claim_agreement":0.908,"typed_citation_agreement":0.933,"typed_citation_agreement_95_interval":[0.917,0.945],"review_comments_accurate":0.758,"review_comments_accurate_95_interval":[0.684,0.82],"review_caught_admitted_error_found_or_related":0.448}}