{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:GKHPV2M47446YAIURMADXGYZF7","short_pith_number":"pith:GKHPV2M4","schema_version":"1.0","canonical_sha256":"328efae99cff39ec01148b003b9b192fc6b4e1fb4c3def56d643b0e421b5f86e","source":{"kind":"arxiv","id":"2407.17563","version":1},"attestation_state":"computed","paper":{"title":"Quantum Algorithms for Realizing Symmetric, Asymmetric, and Antisymmetric Projectors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Margarite L. LaBorde, Mark M. Wilde, Soorya Rethinasamy","submitted_at":"2024-07-24T18:00:07Z","abstract_excerpt":"In quantum computing, knowing the symmetries a given system or state obeys or disobeys is often useful. For example, Hamiltonian symmetries may limit allowed state transitions or simplify learning parameters in machine learning applications, and certain asymmetric quantum states are known to be resourceful in various applications. Symmetry testing algorithms provide a means to identify and quantify these properties with respect to a representation of a group. In this paper, we present a collection of quantum algorithms that realize projections onto the symmetric subspace, as well as the asymme"},"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":"2407.17563","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-07-24T18:00:07Z","cross_cats_sorted":[],"title_canon_sha256":"6cb4bd98d63eea491a26afe9b7a35b4c2b1d47011a3d0492d0e8d07f49911045","abstract_canon_sha256":"d0039068c0c1edfe1aec4149f8283fd70ad65976b58c84b526f8ffe51749f2a7"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:48:17.908396Z","signature_b64":"minTmxyenZxPZuUpVQh8seeDdjHk64wGPSzi08VpzEO01Rl3epG8IOcWzR+UHm07SaYbovxFYqk46El2qy++CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"328efae99cff39ec01148b003b9b192fc6b4e1fb4c3def56d643b0e421b5f86e","last_reissued_at":"2026-07-05T08:48:17.907933Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:48:17.907933Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Algorithms for Realizing Symmetric, Asymmetric, and Antisymmetric Projectors","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Margarite L. LaBorde, Mark M. Wilde, Soorya Rethinasamy","submitted_at":"2024-07-24T18:00:07Z","abstract_excerpt":"In quantum computing, knowing the symmetries a given system or state obeys or disobeys is often useful. For example, Hamiltonian symmetries may limit allowed state transitions or simplify learning parameters in machine learning applications, and certain asymmetric quantum states are known to be resourceful in various applications. Symmetry testing algorithms provide a means to identify and quantify these properties with respect to a representation of a group. In this paper, we present a collection of quantum algorithms that realize projections onto the symmetric subspace, as well as the asymme"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2407.17563","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/2407.17563/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":"2407.17563","created_at":"2026-07-05T08:48:17.907982+00:00"},{"alias_kind":"arxiv_version","alias_value":"2407.17563v1","created_at":"2026-07-05T08:48:17.907982+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2407.17563","created_at":"2026-07-05T08:48:17.907982+00:00"},{"alias_kind":"pith_short_12","alias_value":"GKHPV2M47446","created_at":"2026-07-05T08:48:17.907982+00:00"},{"alias_kind":"pith_short_16","alias_value":"GKHPV2M47446YAIU","created_at":"2026-07-05T08:48:17.907982+00:00"},{"alias_kind":"pith_short_8","alias_value":"GKHPV2M4","created_at":"2026-07-05T08:48:17.907982+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.20238","citing_title":"Random Projections for Multi-Copy Quantum Algorithms","ref_index":36,"is_internal_anchor":false},{"citing_arxiv_id":"2603.26819","citing_title":"Approximate Error Correction for Quantum Simulations of SU(2) Lattice Gauge Theories","ref_index":53,"is_internal_anchor":false},{"citing_arxiv_id":"2603.26819","citing_title":"Approximate Error Correction for Quantum Simulations of SU(2) Lattice Gauge Theories","ref_index":53,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/GKHPV2M47446YAIURMADXGYZF7","json":"https://pith.science/pith/GKHPV2M47446YAIURMADXGYZF7.json","graph_json":"https://pith.science/api/pith-number/GKHPV2M47446YAIURMADXGYZF7/graph.json","events_json":"https://pith.science/api/pith-number/GKHPV2M47446YAIURMADXGYZF7/events.json","paper":"https://pith.science/paper/GKHPV2M4"},"agent_actions":{"view_html":"https://pith.science/pith/GKHPV2M47446YAIURMADXGYZF7","download_json":"https://pith.science/pith/GKHPV2M47446YAIURMADXGYZF7.json","view_paper":"https://pith.science/paper/GKHPV2M4","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2407.17563&json=true","fetch_graph":"https://pith.science/api/pith-number/GKHPV2M47446YAIURMADXGYZF7/graph.json","fetch_events":"https://pith.science/api/pith-number/GKHPV2M47446YAIURMADXGYZF7/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/GKHPV2M47446YAIURMADXGYZF7/action/timestamp_anchor","attest_storage":"https://pith.science/pith/GKHPV2M47446YAIURMADXGYZF7/action/storage_attestation","attest_author":"https://pith.science/pith/GKHPV2M47446YAIURMADXGYZF7/action/author_attestation","sign_citation":"https://pith.science/pith/GKHPV2M47446YAIURMADXGYZF7/action/citation_signature","submit_replication":"https://pith.science/pith/GKHPV2M47446YAIURMADXGYZF7/action/replication_record"}},"created_at":"2026-07-05T08:48:17.907982+00:00","updated_at":"2026-07-05T08:48:17.907982+00:00"}