{"id":"W2896981111","doi":"10.1007/s00220-021-03963-w","title":"Trading Locality for Time: Certifiable Randomness from Low-Depth Circuits","year":2021,"lang":"en","type":"preprint","venue":"Communications in Mathematical Physics","topic":"Quantum Mechanics and Applications","field":"Physics and Astronomy","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Multidisciplinary University Research Initiative; U.S. Air Force; Directorate for Computer and Information Science and Engineering; Air Force Office of Scientific Research; Canadian Institute for Advanced Research; Canadian Network for Research and Innovation in Machining Technology, Natural Sciences and Engineering Research Council of Canada; National Science Foundation; Government of Canada; Institute for Quantum Information and Matter, California Institute of Technology; California Institute of Technology","keywords":"Randomness; Computer science; Quantum circuit; Qubit; Logarithm; Quantum computer; Constant (computer programming); Mathematics; Quantum; Theoretical computer science; Discrete mathematics; Algorithm; Quantum error correction; Quantum mechanics; Statistics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004716835,0.0007653871,0.001170194,0.0007656304,0.001486601,0.003814711,0.003686735,0.002952519,0.005879943],"category_scores_gemma":[0.03160185,0.0009345543,0.001494119,0.0007217,0.00768504,0.01142773,0.008308102,0.007032203,0.001095423],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002541433,"about_ca_system_score_gemma":0.001939164,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0004975973,"about_ca_topic_score_gemma":0.0005227211,"domain_scores_codex":[0.9951404,0.001524308,0.0002143127,0.001002926,0.0015446,0.0005733576],"domain_scores_gemma":[0.9754503,0.01475119,0.001479873,0.006785313,0.0008729585,0.0006603169],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0003816167,0.00009214644,0.0006976986,0.0002023215,0.00005133302,0.0002592838,0.0004174989,0.04096708,0.01359267,0.9145901,0.001977558,0.02677074],"study_design_scores_gemma":[0.0001368673,0.0001651204,0.0002156206,0.00006000397,0.00004736909,0.0002457412,0.00008359367,0.1764148,0.01925806,0.7983347,0.004967052,0.00007111568],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06937102,0.0007343857,0.9066453,0.003710984,0.0001684467,0.0002469333,0.0002195679,0.001322594,0.01758071],"genre_scores_gemma":[0.8882741,0.0003784645,0.1054142,0.0009410201,0.0001285613,0.0003036067,0.0001882006,0.0002847721,0.004087069],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005879943,"threshold_uncertainty_score":0.02494526,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07602766528913843,"score_gpt":0.3317645024715044,"score_spread":0.255736837182366,"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."}}