{"paper":{"title":"From reversible computation to quantum computation by Lagrange interpolation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math.GR"],"primary_cat":"quant-ph","authors_text":"Alexis De Vos, Stijn De Baerdemacker","submitted_at":"2015-02-03T11:34:18Z","abstract_excerpt":"Classical reversible circuits, acting on $w$~bits, are represented by permutation matrices of size $2^w \\times 2^w$. Those matrices form the group P($2^w$), isomorphic to the symmetric group {\\bf S}$_{2^w}$. The permutation group P($n$), isomorphic to {\\bf S}$_n$, contains cycles with length~$p$, ranging from~1 to $L(n)$, where $L(n)$ is the so-called Landau function. By Lagrange interpolation between the $p$~matrices of the cycle, we step from a finite cyclic group of order~$p$ to a 1-dimensional Lie group, subgroup of the unitary group U($n$). As U($2^w$) is the group of all possible quantum"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1502.00819","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}