{"paper":{"title":"Quantum Advantage has Few Complexity Implications","arxiv_id":"2611.05303","primary_cat":"quant-ph","submitted_at":"2026-11-03T18:14:46+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":0.8,"id":"s0","own":false,"role":"background","text":"We consider the complexity implications of proofs of quantumness and (quantum verifier) oblivious state preparation.","hedge":{"p":0.88,"label":"unclear"},"own_p":0.26,"main_claim_p":0.05,"quantitative":false,"quantitative_p":0.04,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.0,"background":0.8,"limitation":0.0,"future_work":0.0,"contribution":0.2,"interpretation":0.0}},{"i":1,"p":0.98,"id":"s1","own":true,"role":"result","text":"We show that both of these objects can coexist with the easiness of nondeterministic computation.","hedge":{"p":0.97,"label":"asserted"},"own_p":0.92,"main_claim_p":0.72,"quantitative":false,"quantitative_p":0.12,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.98,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.02,"interpretation":0.0}},{"i":2,"p":0.85,"id":"s2","own":true,"role":"result","text":"That is, we give evidence that proofs of quantumness can exist when $\\mathsf{P} = \\mathsf{NP}$ and that (quantum verifier) oblivious state preparation can exist when $\\mathsf{BQP} = \\mathsf{QCMA}$.","hedge":{"p":0.73,"label":"hedged_possibility"},"own_p":0.89,"main_claim_p":0.65,"quantitative":false,"quantitative_p":0.33,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.85,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.01,"interpretation":0.14}},{"i":3,"p":0.9,"id":"s3","own":true,"role":"result","text":"In particular, we give a classical oracle relative to which (1) $\\mathsf{P}^\\mathcal{O} = \\mathsf{NP}^\\mathcal{O}$ (2) $\\mathsf{BQP}^\\mathcal{O} = \\mathsf{PSPACE}^\\mathcal{O}$ (3) Proofs of quantumness exist.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.93,"main_claim_p":0.23,"quantitative":true,"quantitative_p":0.7,"role_probabilities":{"gap":0.0,"method":0.01,"result":0.9,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.09,"interpretation":0.0}},{"i":4,"p":0.98,"id":"s4","own":true,"role":"result","text":"In particular, there exists a language in $\\mathsf{IP}^\\mathcal{O} \\subseteq \\mathsf{BQP}^\\mathcal{O}$ which is hard on average against $\\mathsf{P}^\\mathcal{O}/poly$.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.87,"main_claim_p":0.07,"quantitative":false,"quantitative_p":0.25,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.98,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.01,"interpretation":0.01}},{"i":5,"p":0.88,"id":"s5","own":true,"role":"result","text":"We give a unitary oracle such that (1) $\\mathsf{BQP}^\\mathcal{O} = \\mathsf{QCMA}^\\mathcal{O}$ (2) Quantum verifier oblivious state preparation exists.","hedge":{"p":1.0,"label":"asserted"},"own_p":0.95,"main_claim_p":0.14,"quantitative":true,"quantitative_p":0.68,"role_probabilities":{"gap":0.0,"method":0.01,"result":0.88,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.11,"interpretation":0.0}},{"i":6,"p":0.93,"id":"s6","own":true,"role":"interpretation","text":"These oracle separations directly imply a number of related consequences.","hedge":{"p":0.97,"label":"asserted"},"own_p":0.71,"main_claim_p":0.06,"quantitative":false,"quantitative_p":0.16,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.06,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.01,"interpretation":0.93}},{"i":7,"p":0.99,"id":"s7","own":true,"role":"interpretation","text":"For example, our first result implies that proofs of quantumness cannot be used to construct classical or quantum cryptography with a relativizing proof.","hedge":{"p":0.98,"label":"asserted"},"own_p":0.86,"main_claim_p":0.22,"quantitative":false,"quantitative_p":0.08,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.01,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.99}},{"i":8,"p":0.98,"id":"s8","own":true,"role":"interpretation","text":"Our second result implies that quantum computation/classical communication oblivious transfer cannot be used to construct post-quantum one-way functions with a relativizing proof.","hedge":{"p":0.99,"label":"asserted"},"own_p":0.87,"main_claim_p":0.13,"quantitative":false,"quantitative_p":0.08,"role_probabilities":{"gap":0.0,"method":0.0,"result":0.02,"background":0.0,"limitation":0.0,"future_work":0.0,"contribution":0.0,"interpretation":0.98}}]},"compiled":{"main_claim":{"p":0.92,"text":"We show that both of these objects can coexist with the easiness of nondeterministic computation.","location":"abstract s1","hedge_strength":{"p":0.97,"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":7207,"cost_usd_reported":0.0},"compiled_at":"2026-11-04","bank_version":"abstract-p1-20260923","model_version":"classifier-1.13.0","abstract_states":{"claims_first":0.04,"states_limitation":0.59,"human_participants":0.01,"controlled_comparison":0.02,"randomized_assignment":0.01,"states_quantitative_result":0.09,"compares_with_prior_results":0.16,"mentions_code_or_data_availability":0.02},"evidential_basis":{"p":1.0,"value":"proof or derivation","probabilities":{"argument":0.0,"literature":0.0,"proof_or_derivation":1.0,"analysis_of_existing_data":0.0,"observation_or_experiment":0.0,"simulation_or_computation":0.0}},"contribution_type":{"p":1.0,"value":"theoretical result","probabilities":{"review":0.0,"method_or_tool":0.0,"empirical_study":0.0,"simulation_study":0.0,"theoretical_result":1.0,"dataset_or_benchmark":0.0,"position_or_commentary":0.0}},"contribution_statement":{"p":0.45,"text":"We show that both of these objects can coexist with the easiness of nondeterministic computation.","location":"abstract s1"}},"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":9,"sentences_in_abstract":9},"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}}