Automated framework synthesizes logical CNOT gates between arbitrary CSS codes via chain maps, recovering known constructions and finding new low-depth solutions for heterogeneous quantum architectures.
arXiv preprint arXiv:2111.06257 , year=
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Introduces soft Tuy-completeness with greedy (1-1/e approx) and MILP solvers for projection selection in cone-beam CT, reports 0.998 median greedy-to-MILP ratio on benchmarks, and defines ESR as a trajectory diagnostic for feature size.
citing papers explorer
-
Automated logical Clifford gadgets for heterogeneous architectures via chain maps
Automated framework synthesizes logical CNOT gates between arbitrary CSS codes via chain maps, recovering known constructions and finding new low-depth solutions for heterogeneous quantum architectures.
-
Soft Tuy-Completeness for Robust Projection Selection in Cone-Beam CT
Introduces soft Tuy-completeness with greedy (1-1/e approx) and MILP solvers for projection selection in cone-beam CT, reports 0.998 median greedy-to-MILP ratio on benchmarks, and defines ESR as a trajectory diagnostic for feature size.