{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0004444433,0.0003507224,0.0008111731,0.00004198234,0.0002684317,0.0002447407,0.001670799,0.0001761455,0.0002881131],"category_scores_gemma":[0.00005543036,0.000380795,0.0003492456,0.0002722376,0.0001424622,0.0001023401,0.001171363,0.0008288492,0.00007520399],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009475629,"about_ca_system_score_gemma":0.0002212263,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001269455,"about_ca_topic_score_gemma":0.000006130599,"domain_scores_codex":[0.9979453,0.0001748993,0.0008001232,0.0005396166,0.0002030171,0.0003370085],"domain_scores_gemma":[0.9944709,0.001359417,0.0003218405,0.0035451,0.0001994893,0.0001032827],"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.000007539404,0.002400258,0.0000763653,0.0003294653,0.0002230262,2.504761e-7,0.0009635901,0.0004900303,0.001061802,0.9823445,0.000541311,0.01156188],"study_design_scores_gemma":[0.0004922327,0.00000320162,0.00001492913,0.0004132281,0.00008978134,7.404582e-8,0.0002134654,0.315975,0.0008695768,0.6814941,0.0001638553,0.0002705896],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03897955,0.0001915704,0.9510002,0.0004939865,0.0001014223,0.001519688,0.0005130536,0.00007508519,0.00712549],"genre_scores_gemma":[0.9755142,0.00002239311,0.0192538,0.00004302874,0.0002169938,0.002069766,0.002738128,0.00007022383,0.00007146615],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9365346,"threshold_uncertainty_score":0.9998644,"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."}}