{"paper":{"title":"Query complexity for searching multiple marked states from an unsorted database","arxiv_id":"quant-ph/0604059","primary_cat":"quant-ph","submitted_at":"2006-04-10T11:39:37+00:00","version_compiled":"v1"},"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 v1","sentences":[{"i":0,"p":1.0,"id":"s0","own":false,"role":"background","text":"An important and usual problem is to search all states we want from a database with a large number of states.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.04,"main_claim_p":0.03,"quantitative":false,"quantitative_p":0.1,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":1.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":1,"p":1.0,"id":"s1","own":false,"role":"background","text":"In such, recall is vital.","hedge":{"p":0.97,"label":"asserted"},"own_p":0.04,"main_claim_p":0.02,"quantitative":false,"quantitative_p":0.03,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":1.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":2,"p":0.99,"id":"s2","own":false,"role":"gap","text":"Grover's original quantum search algorithm has been generalized to the case of multiple solutions, but no one has calculated the query complexity in this case.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.05,"main_claim_p":0.06,"quantitative":false,"quantitative_p":0.14,"role_probabilities":{"gap":0.99,"method":0.0,"result":0.0,"background":0.01,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.0}},{"i":3,"p":0.84,"id":"s3","own":true,"role":"contribution","text":"We will use a generalized algorithm with higher precision to solve such a search problem that we should find all marked states and show that the practical query complexity increases with the number of marked states.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.89,"main_claim_p":0.71,"quantitative":true,"quantitative_p":0.67,"role_probabilities":{"gap":0.0,"method":0.04,"result":0.12,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.84,"interpretation":0.0}},{"i":4,"p":0.93,"id":"s4","own":true,"role":"contribution","text":"In the end we will introduce an algorithm for the problem on a ``duality computer'' and show its advantage over other algorithms.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.88,"main_claim_p":0.16,"quantitative":true,"quantitative_p":0.66,"role_probabilities":{"gap":0.0,"method":0.06,"result":0.01,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.93,"interpretation":0.0}}]},"compiled":{"main_claim":{"p":0.97,"text":"We will use a generalized algorithm with higher precision to solve such a search problem that we should find all marked states and show that the practical query complexity increases with the number of marked states.","location":"abstract s3","hedge_strength":{"p":1.0,"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":4165,"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.58,"states_limitation":0.2,"human_participants":0.02,"controlled_comparison":0.21,"randomized_assignment":0.01,"states_quantitative_result":0.11,"compares_with_prior_results":0.81,"mentions_code_or_data_availability":0.02},"evidential_basis":{"p":0.95,"value":"proof or derivation","probabilities":{"argument":0.04,"literature":0.0,"proof_or_derivation":0.95,"analysis_of_existing_data":0.0,"observation_or_experiment":0.0,"simulation_or_computation":0.01}},"contribution_type":{"p":0.53,"value":"theoretical result","probabilities":{"review":0.0,"method_or_tool":0.47,"empirical_study":0.0,"simulation_study":0.0,"theoretical_result":0.53,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":0.9,"text":"We will use a generalized algorithm with higher precision to solve such a search problem that we should find all marked states and show that the practical query complexity increases with the number of marked states.","location":"abstract s3"}},"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 v1"],"levels_not_run":["S sections","T body sentences","C citations","R cross-paper relations"],"sentences_examined":5,"sentences_in_abstract":5},"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}}