{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2017:DVGNJGGIU3WODEN5NMSRSQGL5C","short_pith_number":"pith:DVGNJGGI","schema_version":"1.0","canonical_sha256":"1d4cd498c8a6ece191bd6b251940cbe8a229370b193b459b89ed0457ad39087e","source":{"kind":"arxiv","id":"1708.07900","version":2},"attestation_state":"computed","paper":{"title":"Optimization and experimental realization of the quantum permutation algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"\\.I. Yal\\c{c}{\\i}nkaya, Z. Gedik","submitted_at":"2017-08-25T21:57:01Z","abstract_excerpt":"The quantum permutation algorithm provides computational speed-up over classical algorithms in determining the parity of a given cyclic permutation. For its $n$-qubit implementations, the number of required quantum gates scales quadratically with $n$ due to the quantum Fourier transforms included. We show here for the $n$-qubit case that the algorithm can be simplified so that it requires only $O(n)$ quantum gates, which theoretically reduces the complexity of the implementation. In order to test our results experimentally, we utilize IBM's $5$-qubit quantum processor to realize the algorithm "},"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":"1708.07900","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2017-08-25T21:57:01Z","cross_cats_sorted":[],"title_canon_sha256":"2b8bc47320f603abba707286b578b1754ecea5bf358752bffe41f69d5def3e5c","abstract_canon_sha256":"3c57e4a61ef2cb28d41924e150c24a478f13adf7d881d6e5e8c8e91789e09a60"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:27:04.528299Z","signature_b64":"8XPF3X43yj7iNAdyNiW9mKZd2OdCFZ2dR97dpCJnbkVhZFdtQEJvBLiWYV+o+c2xNNO2+Wb2cG9Aj4wRFLp6Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1d4cd498c8a6ece191bd6b251940cbe8a229370b193b459b89ed0457ad39087e","last_reissued_at":"2026-05-18T00:27:04.527673Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:27:04.527673Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimization and experimental realization of the quantum permutation algorithm","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"\\.I. Yal\\c{c}{\\i}nkaya, Z. Gedik","submitted_at":"2017-08-25T21:57:01Z","abstract_excerpt":"The quantum permutation algorithm provides computational speed-up over classical algorithms in determining the parity of a given cyclic permutation. For its $n$-qubit implementations, the number of required quantum gates scales quadratically with $n$ due to the quantum Fourier transforms included. We show here for the $n$-qubit case that the algorithm can be simplified so that it requires only $O(n)$ quantum gates, which theoretically reduces the complexity of the implementation. In order to test our results experimentally, we utilize IBM's $5$-qubit quantum processor to realize the algorithm "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1708.07900","kind":"arxiv","version":2},"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":"1708.07900","created_at":"2026-05-18T00:27:04.527758+00:00"},{"alias_kind":"arxiv_version","alias_value":"1708.07900v2","created_at":"2026-05-18T00:27:04.527758+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1708.07900","created_at":"2026-05-18T00:27:04.527758+00:00"},{"alias_kind":"pith_short_12","alias_value":"DVGNJGGIU3WO","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_16","alias_value":"DVGNJGGIU3WODEN5","created_at":"2026-05-18T12:31:12.930513+00:00"},{"alias_kind":"pith_short_8","alias_value":"DVGNJGGI","created_at":"2026-05-18T12:31:12.930513+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/DVGNJGGIU3WODEN5NMSRSQGL5C","json":"https://pith.science/pith/DVGNJGGIU3WODEN5NMSRSQGL5C.json","graph_json":"https://pith.science/api/pith-number/DVGNJGGIU3WODEN5NMSRSQGL5C/graph.json","events_json":"https://pith.science/api/pith-number/DVGNJGGIU3WODEN5NMSRSQGL5C/events.json","paper":"https://pith.science/paper/DVGNJGGI"},"agent_actions":{"view_html":"https://pith.science/pith/DVGNJGGIU3WODEN5NMSRSQGL5C","download_json":"https://pith.science/pith/DVGNJGGIU3WODEN5NMSRSQGL5C.json","view_paper":"https://pith.science/paper/DVGNJGGI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1708.07900&json=true","fetch_graph":"https://pith.science/api/pith-number/DVGNJGGIU3WODEN5NMSRSQGL5C/graph.json","fetch_events":"https://pith.science/api/pith-number/DVGNJGGIU3WODEN5NMSRSQGL5C/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/DVGNJGGIU3WODEN5NMSRSQGL5C/action/timestamp_anchor","attest_storage":"https://pith.science/pith/DVGNJGGIU3WODEN5NMSRSQGL5C/action/storage_attestation","attest_author":"https://pith.science/pith/DVGNJGGIU3WODEN5NMSRSQGL5C/action/author_attestation","sign_citation":"https://pith.science/pith/DVGNJGGIU3WODEN5NMSRSQGL5C/action/citation_signature","submit_replication":"https://pith.science/pith/DVGNJGGIU3WODEN5NMSRSQGL5C/action/replication_record"}},"created_at":"2026-05-18T00:27:04.527758+00:00","updated_at":"2026-05-18T00:27:04.527758+00:00"}