{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003215818,0.001245911,0.001827304,0.0008551222,0.0006889067,0.001364253,0.001959777,0.002126528,0.003078521],"category_scores_gemma":[0.01285027,0.0008072501,0.000722845,0.001180862,0.001684209,0.002169641,0.001882511,0.002565269,0.0008805559],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001441558,"about_ca_system_score_gemma":0.002507444,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005941261,"about_ca_topic_score_gemma":0.004402365,"domain_scores_codex":[0.99848,0.0008810525,0.00005271649,0.0001420523,0.0003463392,0.00009776298],"domain_scores_gemma":[0.9952118,0.003246482,0.0002161135,0.0003370057,0.000827434,0.0001610458],"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.0001272818,0.00006471094,0.0003323448,0.0001299424,0.00005569884,0.00005750057,0.00006008322,0.884477,0.000774263,0.06283651,0.003240154,0.04784447],"study_design_scores_gemma":[0.000007577537,0.000007776825,0.00002119643,0.000003971268,0.000001374713,0.000004507282,0.000002568507,0.989607,0.0001117528,0.009979298,0.0002500151,0.000002882738],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.005483995,0.0002983826,0.9917339,0.0002981511,0.00004664624,0.00004889374,0.00005945322,0.0003694366,0.001661188],"genre_scores_gemma":[0.27411,0.0004575201,0.7186547,0.0003011304,0.0001052758,0.0004321717,0.0004321639,0.0003398683,0.005167217],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005941261,"threshold_uncertainty_score":0.01700711,"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."}}