{"id":"W4389157230","doi":"10.48550/arxiv.2311.17047","title":"Tight bounds for antidistinguishability and circulant sets of pure quantum states","year":2023,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Quantum Information and Cryptography","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Circulant matrix; Semidefinite programming; Connection (principal bundle); Mathematics; Quantum; Matrix (chemical analysis); Set (abstract data type); Gramian matrix; Quantum state; Combinatorics; Upper and lower bounds; State (computer science); Discrete mathematics; Pure mathematics; Quantum mechanics; Computer science; Eigenvalues and eigenvectors; Physics; Algorithm; Mathematical optimization; 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.006668679,0.001400904,0.001588066,0.002420876,0.002837285,0.005555191,0.003876261,0.002043901,0.006173376],"category_scores_gemma":[0.04217416,0.001336206,0.001364767,0.001883438,0.007162659,0.009718586,0.006053966,0.006071321,0.000775517],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002941724,"about_ca_system_score_gemma":0.001613214,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001061734,"about_ca_topic_score_gemma":0.001203437,"domain_scores_codex":[0.9887701,0.002664923,0.0006320892,0.002063811,0.004260731,0.001608251],"domain_scores_gemma":[0.9377853,0.04377826,0.00342279,0.009749944,0.002839759,0.002423943],"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.0004068186,0.0002183832,0.001248891,0.0001471373,0.00005262909,0.0001952922,0.0003721807,0.03332997,0.0120683,0.9313321,0.001724377,0.01890387],"study_design_scores_gemma":[0.0000420078,0.000115379,0.0006720581,0.00005129536,0.00002953662,0.00016251,0.0000756488,0.190768,0.01171787,0.794401,0.001902006,0.00006275813],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.341447,0.001030521,0.6158434,0.001604544,0.0001386537,0.0001595334,0.0008639105,0.0009290061,0.03798341],"genre_scores_gemma":[0.9074764,0.0004093799,0.08736972,0.0004271448,0.0001709357,0.0002521726,0.0005209958,0.0003102632,0.003062979],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006668679,"threshold_uncertainty_score":0.03526771,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07779464080244165,"score_gpt":0.2101558706920662,"score_spread":0.1323612298896245,"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."}}