{"id":"W3106278932","doi":"10.1145/3055399.3055468","title":"A quantum linearity test for robustly verifying entanglement","year":2017,"lang":"en","type":"preprint","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Army Research Office; Air Force Office of Scientific Research; Institute for Quantum Information and Matter, California Institute of Technology; California Institute of Technology; Institut Périmètre de physique théorique; Gordon and Betty Moore Foundation; National Science Foundation","keywords":"Quantum entanglement; Robustness (evolution); Soundness; Tensor product; Linearity; Discrete mathematics; Mathematics; Quantum computer; Qubit; Quantum; Computer science; Quantum mechanics; Pure mathematics; Physics","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","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0006528135,0.000417206,0.0004692666,0.00009183343,0.0006151323,0.001237467,0.003184099,0.0002560218,0.000009118715],"category_scores_gemma":[0.0002798175,0.0003606746,0.0003423712,0.00006177734,0.00005618055,0.000113916,0.004265198,0.0007472585,0.00001666223],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008644786,"about_ca_system_score_gemma":0.0003234822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000235216,"about_ca_topic_score_gemma":0.0000260053,"domain_scores_codex":[0.9975012,0.00004126669,0.0004118365,0.001105477,0.0003718929,0.0005683111],"domain_scores_gemma":[0.9968858,0.0003364667,0.0003965553,0.002043395,0.0001770415,0.0001607418],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00004757579,0.001799103,0.006174955,0.002793991,0.000574951,0.0002205824,0.003594608,0.1129313,0.0006591315,0.1520554,0.0317828,0.6873657],"study_design_scores_gemma":[0.0003459599,0.0001407295,0.001076187,0.0002070093,0.00001709327,0.00001160925,0.000005968046,0.9662686,0.0003302952,0.02182101,0.009298446,0.0004770643],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0124766,0.0002492559,0.9782267,0.003326077,0.003657209,0.0008000908,0.00005724964,0.0005496032,0.0006572666],"genre_scores_gemma":[0.3999637,0.00002694735,0.5978134,0.0003952986,0.00109486,0.0001242844,0.00003316275,0.00003989682,0.0005083545],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8533373,"threshold_uncertainty_score":0.9998845,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04292458632307306,"score_gpt":0.3006470624074634,"score_spread":0.2577224760843903,"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."}}