{"id":"W2964904559","doi":"10.1088/1367-2630/ab35fb","title":"Parallel quantum trajectories via forking for sampling without redundancy","year":2019,"lang":"en","type":"article","venue":"New Journal of Physics","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":14,"is_retracted":false,"has_abstract":true,"ca_institutions":"ProteinQure (Canada)","funders":"National Research Foundation of Korea; Department of Science and Technology, Republic of South Africa; National Research Foundation","keywords":"Quantum algorithm; Quantum computer; Quantum; Quantum entanglement; Quantum network; Quantum error correction; Redundancy (engineering); Quantum state; One-way quantum computer","routes":{"ca_aff":true,"ca_fund":false,"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.001571774,0.0004344449,0.0007607232,0.0005718267,0.0012389,0.000930328,0.001422523,0.0007557804,0.004632916],"category_scores_gemma":[0.003686662,0.0003384962,0.0004662857,0.0007416572,0.001928857,0.002151605,0.002098149,0.001224248,0.0005836386],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00113259,"about_ca_system_score_gemma":0.001243795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001842153,"about_ca_topic_score_gemma":0.002012371,"domain_scores_codex":[0.9989271,0.0002638617,0.00006423174,0.0001818519,0.0004175379,0.0001455111],"domain_scores_gemma":[0.9978451,0.0007467443,0.0001619149,0.0008413189,0.0002641104,0.0001409633],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001364168,0.0005168887,0.002781252,0.0002183437,0.00007544381,0.0004076669,0.0005674065,0.2611614,0.1182533,0.472684,0.002646618,0.1393235],"study_design_scores_gemma":[0.00005371311,0.0001445402,0.0001751379,0.00001475088,0.00001016448,0.00004698718,0.00003235553,0.897654,0.0288356,0.07044921,0.002554883,0.00002865065],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2093871,0.0002106254,0.7797499,0.0004130448,0.0001080753,0.0002928523,0.0001345394,0.001862909,0.007840986],"genre_scores_gemma":[0.7391284,0.00007699311,0.2579122,0.0000684913,0.00002437798,0.0001830177,0.0001186423,0.0001521448,0.002335754],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004632916,"threshold_uncertainty_score":0.01549864,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02582801466837918,"score_gpt":0.2762647693803045,"score_spread":0.2504367547119253,"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."}}