{"id":"W2132833274","doi":"10.1109/ismvl.2009.19","title":"Equivalence Checking of Reversible Circuits","year":2009,"lang":"en","type":"article","venue":"","topic":"Quantum Computing Algorithms and Architecture","field":"Computer Science","cited_by":76,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"Universität Bremen; Deutscher Akademischer Austauschdienst","keywords":"Formal equivalence checking; Electronic circuit; Equivalence (formal languages); Computer science; Boolean function; Boolean satisfiability problem; Logical equivalence; Boolean circuit; Logic gate; Adder; Sequential logic; Algorithm; Arithmetic; Theoretical computer science; Mathematics; Formal verification; Discrete mathematics; Electrical engineering; Engineering","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.003471093,0.000553622,0.000986902,0.001676008,0.0008714595,0.001834876,0.002685858,0.001391483,0.003944373],"category_scores_gemma":[0.02679296,0.0006055053,0.001805584,0.001436756,0.002692991,0.004752889,0.002202752,0.00190397,0.0003474972],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001634364,"about_ca_system_score_gemma":0.001722623,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002105558,"about_ca_topic_score_gemma":0.001989709,"domain_scores_codex":[0.992407,0.002767742,0.0004214534,0.001175481,0.002518737,0.0007096722],"domain_scores_gemma":[0.9802391,0.01466493,0.001178018,0.002354215,0.00138314,0.000180492],"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.0008184454,0.0003621547,0.003993059,0.0005222973,0.0002076922,0.0008231251,0.0005445729,0.1697369,0.03638366,0.5792716,0.002484268,0.2048523],"study_design_scores_gemma":[0.0002021758,0.0002516088,0.000959509,0.00004643889,0.00008840094,0.0002565129,0.0001310859,0.4097364,0.06691514,0.5171807,0.004178488,0.00005342627],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1523417,0.0003111042,0.8386253,0.0003657358,0.00008446497,0.0001639009,0.0003499353,0.001848177,0.005909827],"genre_scores_gemma":[0.8716973,0.0002374056,0.12481,0.0001882431,0.00005401023,0.0001342254,0.0007333908,0.0002020423,0.001943319],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003944373,"threshold_uncertainty_score":0.0183571,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01622098803924106,"score_gpt":0.2457504481682966,"score_spread":0.2295294601290556,"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."}}