{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:ETH4MMOGZHJICKDZSLUDCSZX4F","short_pith_number":"pith:ETH4MMOG","schema_version":"1.0","canonical_sha256":"24cfc631c6c9d281287992e8314b37e14ba21018df6560feab414d0d779680bd","source":{"kind":"arxiv","id":"2305.04069","version":3},"attestation_state":"computed","paper":{"title":"Generalised Coupling and An Elementary Algorithm for the Quantum Schur Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adam Wills, Sergii Strelchuk","submitted_at":"2023-05-06T15:19:52Z","abstract_excerpt":"The quantum Schur transform is a fundamental building block that maps the computational basis to a coupled basis consisting of irreducible representations of the unitary and symmetric groups. Equivalently, it may be regarded as a change of basis from the computational basis to a simultaneous spin eigenbasis of Permutational Quantum Computing (PQC) [Quantum Inf. Comput., 10, 470-497 (2010)]. By adopting the latter perspective, we present a transparent algorithm for implementing the qubit quantum Schur transform which uses $O(\\log(n))$ ancillas and can be decomposed into a sequence of $O(n^3\\log"},"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":"2305.04069","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2023-05-06T15:19:52Z","cross_cats_sorted":[],"title_canon_sha256":"4ec22ec1fafba9f847a5cf12cf6a95acefe3a05e815ee60ac2d71ee89e1d521b","abstract_canon_sha256":"140fc789feb2daacab1c77daf2dd44967d85a19db5040f38e2db5b20abd3bd24"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:43:52.482516Z","signature_b64":"lu5qmS7d8XRTia101+dju0rvjDXMSxHvKpfcKifgxRhC8rDAi2Z6dkwII5zPE3eWHcltlqJYwIFlHxrBZkyXCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"24cfc631c6c9d281287992e8314b37e14ba21018df6560feab414d0d779680bd","last_reissued_at":"2026-07-05T07:43:52.482076Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:43:52.482076Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Generalised Coupling and An Elementary Algorithm for the Quantum Schur Transform","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Adam Wills, Sergii Strelchuk","submitted_at":"2023-05-06T15:19:52Z","abstract_excerpt":"The quantum Schur transform is a fundamental building block that maps the computational basis to a coupled basis consisting of irreducible representations of the unitary and symmetric groups. Equivalently, it may be regarded as a change of basis from the computational basis to a simultaneous spin eigenbasis of Permutational Quantum Computing (PQC) [Quantum Inf. Comput., 10, 470-497 (2010)]. By adopting the latter perspective, we present a transparent algorithm for implementing the qubit quantum Schur transform which uses $O(\\log(n))$ ancillas and can be decomposed into a sequence of $O(n^3\\log"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2305.04069","kind":"arxiv","version":3},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2305.04069/integrity.json","findings":[],"available":true,"detectors_run":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938"},"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":"2305.04069","created_at":"2026-07-05T07:43:52.482132+00:00"},{"alias_kind":"arxiv_version","alias_value":"2305.04069v3","created_at":"2026-07-05T07:43:52.482132+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2305.04069","created_at":"2026-07-05T07:43:52.482132+00:00"},{"alias_kind":"pith_short_12","alias_value":"ETH4MMOGZHJI","created_at":"2026-07-05T07:43:52.482132+00:00"},{"alias_kind":"pith_short_16","alias_value":"ETH4MMOGZHJICKDZ","created_at":"2026-07-05T07:43:52.482132+00:00"},{"alias_kind":"pith_short_8","alias_value":"ETH4MMOG","created_at":"2026-07-05T07:43:52.482132+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/ETH4MMOGZHJICKDZSLUDCSZX4F","json":"https://pith.science/pith/ETH4MMOGZHJICKDZSLUDCSZX4F.json","graph_json":"https://pith.science/api/pith-number/ETH4MMOGZHJICKDZSLUDCSZX4F/graph.json","events_json":"https://pith.science/api/pith-number/ETH4MMOGZHJICKDZSLUDCSZX4F/events.json","paper":"https://pith.science/paper/ETH4MMOG"},"agent_actions":{"view_html":"https://pith.science/pith/ETH4MMOGZHJICKDZSLUDCSZX4F","download_json":"https://pith.science/pith/ETH4MMOGZHJICKDZSLUDCSZX4F.json","view_paper":"https://pith.science/paper/ETH4MMOG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2305.04069&json=true","fetch_graph":"https://pith.science/api/pith-number/ETH4MMOGZHJICKDZSLUDCSZX4F/graph.json","fetch_events":"https://pith.science/api/pith-number/ETH4MMOGZHJICKDZSLUDCSZX4F/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ETH4MMOGZHJICKDZSLUDCSZX4F/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ETH4MMOGZHJICKDZSLUDCSZX4F/action/storage_attestation","attest_author":"https://pith.science/pith/ETH4MMOGZHJICKDZSLUDCSZX4F/action/author_attestation","sign_citation":"https://pith.science/pith/ETH4MMOGZHJICKDZSLUDCSZX4F/action/citation_signature","submit_replication":"https://pith.science/pith/ETH4MMOGZHJICKDZSLUDCSZX4F/action/replication_record"}},"created_at":"2026-07-05T07:43:52.482132+00:00","updated_at":"2026-07-05T07:43:52.482132+00:00"}