{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2014:YGTRI6R5PDKMSQRBF6NN4MMWTR","short_pith_number":"pith:YGTRI6R5","schema_version":"1.0","canonical_sha256":"c1a7147a3d78d4c942212f9ade31969c4a95f2c5bd393524684d5650c638d76a","source":{"kind":"arxiv","id":"1405.5205","version":1},"attestation_state":"computed","paper":{"title":"Quantum Circuits for the Unitary Permutation Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Simon Perdrix, Stefano Facchini","submitted_at":"2014-05-20T19:52:33Z","abstract_excerpt":"We consider the Unitary Permutation problem which consists, given $n$ unitary gates $U_1, \\ldots, U_n$ and a permutation $\\sigma$ of $\\{1,\\ldots, n\\}$, in applying the unitary gates in the order specified by $\\sigma$, i.e. in performing $U_{\\sigma(n)}\\ldots U_{\\sigma(1)}$. This problem has been introduced and investigated by Colnaghi et al. where two models of computations are considered. This first is the (standard) model of query complexity: the complexity measure is the number of calls to any of the unitary gates $U_i$ in a quantum circuit which solves the problem. The second model provides"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1405.5205","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2014-05-20T19:52:33Z","cross_cats_sorted":[],"title_canon_sha256":"a07ce21fe42f0f22d25609f4bc38685e8d8b6e1b544aa6455f6cd6eb10e314e1","abstract_canon_sha256":"5e142b2b5109b66ebac657e7d57916eea9a65be9d8b2e13cb5ef1a2200592cba"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T01:02:57.210952Z","signature_b64":"L5JETi+n4fbg+L5/DvMh2Azv6UkdCUzIpbNYr+RsLnjtH+QXdTP/dCXACpspcbf1YsDyIS7kXj8lCHgMFMyRDQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"c1a7147a3d78d4c942212f9ade31969c4a95f2c5bd393524684d5650c638d76a","last_reissued_at":"2026-05-18T01:02:57.210205Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T01:02:57.210205Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Circuits for the Unitary Permutation Problem","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Simon Perdrix, Stefano Facchini","submitted_at":"2014-05-20T19:52:33Z","abstract_excerpt":"We consider the Unitary Permutation problem which consists, given $n$ unitary gates $U_1, \\ldots, U_n$ and a permutation $\\sigma$ of $\\{1,\\ldots, n\\}$, in applying the unitary gates in the order specified by $\\sigma$, i.e. in performing $U_{\\sigma(n)}\\ldots U_{\\sigma(1)}$. This problem has been introduced and investigated by Colnaghi et al. where two models of computations are considered. This first is the (standard) model of query complexity: the complexity measure is the number of calls to any of the unitary gates $U_i$ in a quantum circuit which solves the problem. The second model provides"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1405.5205","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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1405.5205","created_at":"2026-05-18T01:02:57.210308+00:00"},{"alias_kind":"arxiv_version","alias_value":"1405.5205v1","created_at":"2026-05-18T01:02:57.210308+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1405.5205","created_at":"2026-05-18T01:02:57.210308+00:00"},{"alias_kind":"pith_short_12","alias_value":"YGTRI6R5PDKM","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_16","alias_value":"YGTRI6R5PDKMSQRB","created_at":"2026-05-18T12:28:57.508820+00:00"},{"alias_kind":"pith_short_8","alias_value":"YGTRI6R5","created_at":"2026-05-18T12:28:57.508820+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2507.08781","citing_title":"Routing Quantum Control of Causal Order","ref_index":29,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/YGTRI6R5PDKMSQRBF6NN4MMWTR","json":"https://pith.science/pith/YGTRI6R5PDKMSQRBF6NN4MMWTR.json","graph_json":"https://pith.science/api/pith-number/YGTRI6R5PDKMSQRBF6NN4MMWTR/graph.json","events_json":"https://pith.science/api/pith-number/YGTRI6R5PDKMSQRBF6NN4MMWTR/events.json","paper":"https://pith.science/paper/YGTRI6R5"},"agent_actions":{"view_html":"https://pith.science/pith/YGTRI6R5PDKMSQRBF6NN4MMWTR","download_json":"https://pith.science/pith/YGTRI6R5PDKMSQRBF6NN4MMWTR.json","view_paper":"https://pith.science/paper/YGTRI6R5","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1405.5205&json=true","fetch_graph":"https://pith.science/api/pith-number/YGTRI6R5PDKMSQRBF6NN4MMWTR/graph.json","fetch_events":"https://pith.science/api/pith-number/YGTRI6R5PDKMSQRBF6NN4MMWTR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/YGTRI6R5PDKMSQRBF6NN4MMWTR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/YGTRI6R5PDKMSQRBF6NN4MMWTR/action/storage_attestation","attest_author":"https://pith.science/pith/YGTRI6R5PDKMSQRBF6NN4MMWTR/action/author_attestation","sign_citation":"https://pith.science/pith/YGTRI6R5PDKMSQRBF6NN4MMWTR/action/citation_signature","submit_replication":"https://pith.science/pith/YGTRI6R5PDKMSQRBF6NN4MMWTR/action/replication_record"}},"created_at":"2026-05-18T01:02:57.210308+00:00","updated_at":"2026-05-18T01:02:57.210308+00:00"}