{"id":"W2568562894","doi":"10.1038/s41534-017-0043-1","title":"Projected gradient descent algorithms for quantum state tomography","year":2017,"lang":"en","type":"preprint","venue":"npj Quantum Information","topic":"Scientific Research and Discoveries","field":"Physics and Astronomy","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Fonds Québécois de la Recherche sur la Nature et les Technologies; Royal Commission for the Exhibition of 1851; Royal Society; Royal Society of Edinburgh; Scottish Government","keywords":"Quantum tomography; Gradient descent; Curse of dimensionality; Algorithm; Computer science; Quantum state; Quantum; Stochastic gradient descent; State (computer science); Tomography; Quantum computer; Mathematical optimization; Mathematics; Artificial intelligence; Physics; Artificial neural network; Quantum mechanics; Optics","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.0006272657,0.0003538824,0.0003601853,0.0003974859,0.0005909989,0.001673748,0.0006621645,0.0001119462,0.00007182535],"category_scores_gemma":[0.00006565056,0.0003088012,0.0003767291,0.0001388607,0.0001641646,0.001517838,0.0003885044,0.0003938502,0.00008969724],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007299657,"about_ca_system_score_gemma":0.0005143266,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008357037,"about_ca_topic_score_gemma":0.00001399012,"domain_scores_codex":[0.9976897,0.00004432175,0.0006576932,0.0003481028,0.0006187947,0.0006414301],"domain_scores_gemma":[0.9975682,0.00004983595,0.0007549442,0.0008569227,0.0005724622,0.0001976123],"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.002093378,0.001245322,0.02783134,0.003673311,0.001581055,0.000006197451,0.02361256,0.003166497,0.0002942257,0.2541761,0.1810713,0.5012487],"study_design_scores_gemma":[0.003703319,0.0005574016,0.0180209,0.0007786499,0.0001550215,0.000002823037,0.00378989,0.4508178,0.004789996,0.3278975,0.1873875,0.002099201],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.5933545,0.0001693096,0.3773645,0.0005537312,0.00599155,0.006329505,0.006165666,0.0002731677,0.009798141],"genre_scores_gemma":[0.9906986,0.00003900645,0.001064679,0.00003035735,0.0003130475,0.001014668,0.006500321,0.0000241903,0.0003151559],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.4991495,"threshold_uncertainty_score":0.9999364,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04285935028927707,"score_gpt":0.3206573357513167,"score_spread":0.2777979854620396,"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."}}