{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:D53OK7BB5U3M5CHV7R7E5E3TQP","short_pith_number":"pith:D53OK7BB","schema_version":"1.0","canonical_sha256":"1f76e57c21ed36ce88f5fc7e4e937383c136efa7d44f7f3198652b92c3189c82","source":{"kind":"arxiv","id":"2504.17965","version":1},"attestation_state":"computed","paper":{"title":"Quantum Fisher-Yates shuffle: Unifying methods for generating uniform superpositions of permutations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Lennart Binkowski, Marvin Schwiering","submitted_at":"2025-04-24T22:24:39Z","abstract_excerpt":"Uniform superpositions over permutations play a central role in quantum error correction, cryptography, and combinatorial optimisation. We introduce a simple yet powerful quantisation of the classical Fisher-Yates shuffle, yielding a suite of efficient quantum algorithms for preparing such superpositions on composite registers. Our method replaces classical randomness with coherent control, enabling five variants that differ in their output structure and entanglement with ancillary systems. We demonstrate that this construction achieves the best known combination of asymptotic resources among "},"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":"2504.17965","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-04-24T22:24:39Z","cross_cats_sorted":[],"title_canon_sha256":"9f46a166de02b99fdb53577e3a71ef6140d10a02d967b4aa071613931ccb9913","abstract_canon_sha256":"cb6d5109585218f0de3ce5949a12c4315a0193d25d5e9145a7876d6268400ecb"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:53:59.502431Z","signature_b64":"47kBOVwwbg5Ircit/TuwCWX8D5uuLKXmtjfzu57leTrT8QnXYZ7jWHlltr0lBfG+xeuSqOW6bK6qZ3U2VHSECQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1f76e57c21ed36ce88f5fc7e4e937383c136efa7d44f7f3198652b92c3189c82","last_reissued_at":"2026-07-05T10:53:59.501950Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:53:59.501950Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Fisher-Yates shuffle: Unifying methods for generating uniform superpositions of permutations","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Lennart Binkowski, Marvin Schwiering","submitted_at":"2025-04-24T22:24:39Z","abstract_excerpt":"Uniform superpositions over permutations play a central role in quantum error correction, cryptography, and combinatorial optimisation. We introduce a simple yet powerful quantisation of the classical Fisher-Yates shuffle, yielding a suite of efficient quantum algorithms for preparing such superpositions on composite registers. Our method replaces classical randomness with coherent control, enabling five variants that differ in their output structure and entanglement with ancillary systems. We demonstrate that this construction achieves the best known combination of asymptotic resources among "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2504.17965","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2504.17965/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":"2504.17965","created_at":"2026-07-05T10:53:59.502001+00:00"},{"alias_kind":"arxiv_version","alias_value":"2504.17965v1","created_at":"2026-07-05T10:53:59.502001+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2504.17965","created_at":"2026-07-05T10:53:59.502001+00:00"},{"alias_kind":"pith_short_12","alias_value":"D53OK7BB5U3M","created_at":"2026-07-05T10:53:59.502001+00:00"},{"alias_kind":"pith_short_16","alias_value":"D53OK7BB5U3M5CHV","created_at":"2026-07-05T10:53:59.502001+00:00"},{"alias_kind":"pith_short_8","alias_value":"D53OK7BB","created_at":"2026-07-05T10:53:59.502001+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.12856","citing_title":"Quantum walk-based optimisation for capacitated vehicle routing with homogeneous and heterogeneous fleets","ref_index":29,"is_internal_anchor":false},{"citing_arxiv_id":"2606.07322","citing_title":"Quantum Divide-and-Conquer for the Traveling Salesman Problem: Surpassing the $2^n$ Barrier","ref_index":28,"is_internal_anchor":false},{"citing_arxiv_id":"2604.24297","citing_title":"Exhaustive and feasible parametrisation with applications to the travelling salesperson problem","ref_index":36,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/D53OK7BB5U3M5CHV7R7E5E3TQP","json":"https://pith.science/pith/D53OK7BB5U3M5CHV7R7E5E3TQP.json","graph_json":"https://pith.science/api/pith-number/D53OK7BB5U3M5CHV7R7E5E3TQP/graph.json","events_json":"https://pith.science/api/pith-number/D53OK7BB5U3M5CHV7R7E5E3TQP/events.json","paper":"https://pith.science/paper/D53OK7BB"},"agent_actions":{"view_html":"https://pith.science/pith/D53OK7BB5U3M5CHV7R7E5E3TQP","download_json":"https://pith.science/pith/D53OK7BB5U3M5CHV7R7E5E3TQP.json","view_paper":"https://pith.science/paper/D53OK7BB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2504.17965&json=true","fetch_graph":"https://pith.science/api/pith-number/D53OK7BB5U3M5CHV7R7E5E3TQP/graph.json","fetch_events":"https://pith.science/api/pith-number/D53OK7BB5U3M5CHV7R7E5E3TQP/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/D53OK7BB5U3M5CHV7R7E5E3TQP/action/timestamp_anchor","attest_storage":"https://pith.science/pith/D53OK7BB5U3M5CHV7R7E5E3TQP/action/storage_attestation","attest_author":"https://pith.science/pith/D53OK7BB5U3M5CHV7R7E5E3TQP/action/author_attestation","sign_citation":"https://pith.science/pith/D53OK7BB5U3M5CHV7R7E5E3TQP/action/citation_signature","submit_replication":"https://pith.science/pith/D53OK7BB5U3M5CHV7R7E5E3TQP/action/replication_record"}},"created_at":"2026-07-05T10:53:59.502001+00:00","updated_at":"2026-07-05T10:53:59.502001+00:00"}