{"id":"W4235140742","doi":"10.26421/qic14.5-6-8","title":"Hardness of approximation for quantum problems","year":2014,"lang":"en","type":"article","venue":"Quantum Information and Computation","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Wolfson Family Charitable Trust; University of Waterloo; Agence Nationale de la Recherche","keywords":"Hierarchy; Mathematics; Hardness of approximation; Polynomial hierarchy; Quantum; Hamiltonian (control theory); Generalization; Quantum complexity theory; Set cover problem; Quantum algorithm; Polynomial; Discrete mathematics; Approximation algorithm; Combinatorics; Time complexity; Set (abstract data type); Quantum mechanics; Computer science; Mathematical optimization; Physics; Mathematical analysis","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005521812,0.0001261342,0.0001851152,0.0001974382,0.0001636034,0.0001668937,0.0002121048,0.00005896582,5.855251e-7],"category_scores_gemma":[0.00007724298,0.0001135923,0.00005196159,0.0002500511,0.00003658257,0.00100631,0.00006392682,0.00006983817,0.00000598702],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001132298,"about_ca_system_score_gemma":0.00003152162,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000122743,"about_ca_topic_score_gemma":7.386576e-7,"domain_scores_codex":[0.9989279,0.00005241247,0.0004847162,0.0001530459,0.0002165589,0.0001653764],"domain_scores_gemma":[0.9990364,0.0001344364,0.0003653736,0.0001595928,0.0002479297,0.00005632489],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001117795,0.00003247211,0.00004897948,0.0003531316,0.00001053777,1.710431e-8,0.00269016,0.05179928,0.0001188291,0.559005,0.000267282,0.3856632],"study_design_scores_gemma":[0.0005592615,0.0002126963,0.001197043,0.00004351869,0.000004430085,0.000007179565,0.00005338909,0.9361616,0.00021414,0.05844665,0.002965046,0.00013507],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05754204,0.00001914741,0.9409035,0.0004085313,0.0003508256,0.0003421949,0.000004233892,0.0001441028,0.0002854515],"genre_scores_gemma":[0.9360566,0.000004526088,0.06365862,0.000153628,0.00003796421,0.00002559798,0.0000535741,0.000005080696,0.00000443444],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8843623,"threshold_uncertainty_score":0.4632159,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01172081841731086,"score_gpt":0.2361089318281895,"score_spread":0.2243881134108786,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}