{"id":"W2936032794","doi":"10.22331/q-2019-08-12-173","title":"A polar decomposition for quantum channels (with applications to bounding error propagation in quantum circuits)","year":2019,"lang":"en","type":"article","venue":"Quantum","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"Canadian Institute for Advanced Research; University of Waterloo","funders":"Army Research Office; Natural Sciences and Engineering Research Council of Canada; Government of Ontario; Canada First Research Excellence Fund; Industry Canada; Government of Canada; Canadian Institute for Advanced Research","keywords":"Quantum; Unitary state; Bounding overwatch; Fidelity; Factorization; Polar; Leverage (statistics); Quantum error correction; Quantum circuit; Process (computing)","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002775349,0.00116837,0.000675292,0.001732759,0.001202214,0.002743803,0.001023186,0.00135936,0.005413222],"category_scores_gemma":[0.008774181,0.0005207587,0.0008442453,0.0009969923,0.006796215,0.006396265,0.003405838,0.004099288,0.001197557],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001428667,"about_ca_system_score_gemma":0.0007465659,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0007610875,"about_ca_topic_score_gemma":0.0005021598,"domain_scores_codex":[0.9988698,0.0004385765,0.00003793307,0.0001960745,0.0003169655,0.0001405399],"domain_scores_gemma":[0.995703,0.002861334,0.0002833725,0.000560862,0.0003663604,0.0002249778],"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.00001735973,0.000009051694,0.00009631835,0.00002961097,0.000002695455,0.00001761882,0.00005498217,0.01414241,0.001445977,0.9798148,0.0005766304,0.003792598],"study_design_scores_gemma":[0.000003281883,0.00002729479,0.00007634744,0.000026401,0.000003923418,0.00003534402,0.00002931477,0.1309956,0.001335761,0.8655212,0.001933417,0.0000119377],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0120237,0.0005799881,0.97413,0.0006266981,0.00009134013,0.0000382502,0.00007987687,0.00009109915,0.01233905],"genre_scores_gemma":[0.6226124,0.002819798,0.3632716,0.0007006821,0.0005877858,0.0002468159,0.0002057514,0.0003132138,0.009241997],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.005413222,"threshold_uncertainty_score":0.01810908,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01628289357350219,"score_gpt":0.2811181849416891,"score_spread":0.2648352913681869,"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."}}