{"id":"W2568356985","doi":"10.1145/2518131","title":"From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking","year":2013,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Office of Naval Research; Natural Sciences and Engineering Research Council of Canada; Canadian Institute for Advanced Research; Institut Périmètre de physique théorique; Fonds Québécois de la Recherche sur la Nature et les Technologies; Mitacs; Canada Research Chairs","keywords":"Mathematical proof; Uncertainty principle; Mathematics; Norm (philosophy); Discrete mathematics; Cryptography; Relation (database); Key (lock); Entropic uncertainty; Euclidean geometry; Quantum cryptography; Theoretical computer science; Quantum; Quantum information; Computer science; Algorithm; Law","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002144163,0.00006596449,0.00008983468,0.0001123621,0.0001722196,0.0002001967,0.0009381938,0.00002646218,0.000005969546],"category_scores_gemma":[0.0003727634,0.0000409466,0.0000551477,0.0002533051,0.00001069096,0.0003866532,0.0005550277,0.0001782973,0.00002111154],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006515986,"about_ca_system_score_gemma":0.00003254919,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009044018,"about_ca_topic_score_gemma":0.000001462374,"domain_scores_codex":[0.9992759,0.00002825876,0.0002774656,0.00006894533,0.0002419592,0.0001074449],"domain_scores_gemma":[0.9989773,0.0001032979,0.0002879139,0.0004179633,0.0001391605,0.00007435845],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000009147276,0.00003976051,0.001266074,0.00000921737,0.00003022391,0.000001617431,0.01990028,0.8239239,0.002148097,0.0007977709,0.01015769,0.1417162],"study_design_scores_gemma":[0.000230078,0.00006228262,0.04890963,0.000155821,0.000008178742,0.00004280272,0.0001526023,0.9364645,0.0004837307,0.01181364,0.001574114,0.0001026174],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.8119521,0.00002353768,0.1793697,0.008104609,0.0004317985,0.0000729438,7.498128e-7,0.00001252236,0.0000321233],"genre_scores_gemma":[0.9641955,0.000001083919,0.03518878,0.0004517145,0.0001443229,0.000001113678,2.750959e-7,0.000002312926,0.00001486378],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1522435,"threshold_uncertainty_score":0.1930501,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.004767707057498165,"score_gpt":0.2082507028167856,"score_spread":0.2034829957592874,"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."}}