{"id":"W3147898783","doi":"10.1109/date.2008.4484814","title":"Quantified Synthesis of Reversible Logic","year":2008,"lang":"en","type":"article","venue":"2008 Design, Automation and Test in Europe","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"","keywords":"Toffoli gate; Boolean function; Boolean satisfiability problem; Reversible computing; Computer science; Satisfiability; And-inverter graph; Binary decision diagram; Generalization; Logic synthesis; Logic gate; Boolean circuit; Boolean algebra; True quantified Boolean formula; Quantum computer; Theoretical computer science; Quantum; Algorithm; Mathematics; Quantum gate","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003133107,0.0001024552,0.0001624562,0.0001753881,0.0001046977,0.00002689931,0.0002731031,0.00003622921,0.000007018246],"category_scores_gemma":[0.0005691934,0.00008874827,0.00002136712,0.0007209526,0.00006455554,0.0001399204,0.00007743409,0.00008513343,0.00002553058],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000007354608,"about_ca_system_score_gemma":0.0000550341,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001787048,"about_ca_topic_score_gemma":7.187297e-7,"domain_scores_codex":[0.999069,0.0001475648,0.0002424445,0.0002375096,0.0001513485,0.0001520887],"domain_scores_gemma":[0.9988256,0.0007056692,0.0001088147,0.0002382189,0.00007764586,0.00004407195],"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.00008986821,0.00333001,0.0579687,0.0007229433,0.00009767892,0.001927586,0.02042452,0.09357469,0.05634716,0.08493327,0.03104914,0.6495345],"study_design_scores_gemma":[0.0002382287,0.0001168844,0.08041419,0.00007413269,0.000002900721,0.0001529344,0.000004798329,0.912142,0.005212877,0.0005009009,0.0009726047,0.0001675479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3131057,0.0003930934,0.6820236,0.001117469,0.0002306878,0.0003057127,0.000003744941,0.000448973,0.002371079],"genre_scores_gemma":[0.8446455,0.0001251238,0.1548822,0.0001589794,0.00001752312,0.000003143653,7.196537e-7,0.000007822106,0.0001589699],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8185673,"threshold_uncertainty_score":0.361905,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02966612485944461,"score_gpt":0.2310510608777906,"score_spread":0.201384936018346,"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."}}