{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2022:5FYKQYVIGIBDJQ4D34FNVBKCXC","short_pith_number":"pith:5FYKQYVI","schema_version":"1.0","canonical_sha256":"e970a862a8320234c383df0ada8542b8980cf9a387b609b6cb7ba1dec1204c5b","source":{"kind":"arxiv","id":"2207.09998","version":1},"attestation_state":"computed","paper":{"title":"Short-Depth Circuits for Dicke State Preparation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Andreas B\\\"artschi, Stephan Eidenbenz","submitted_at":"2022-07-20T16:01:03Z","abstract_excerpt":"We present short-depth circuits to deterministically prepare any Dicke state |Dn,k>, which is the equal-amplitude superposition of all n-qubit computational basis states with Hamming Weight k. Dicke states are an important class of entangled quantum states with a large variety of applications, and a long history of experimental creation in physical systems. On the other hand, not much is known regarding efficient scalable quantum circuits for Dicke state preparation on realistic quantum computing hardware connectivities.\n  Here we present preparation circuits for Dicke states |Dn,k> with (i) a"},"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":"2207.09998","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-07-20T16:01:03Z","cross_cats_sorted":["cs.DS"],"title_canon_sha256":"1d22b45f8326fbdc9a5ec74878331baa5fa0a5c5b2aa9bf3a0a781674a1847c0","abstract_canon_sha256":"9124366947ab0ec45879d8949efa0c9c6c55f8c088e683717341d3aef0a213b2"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:08:38.026508Z","signature_b64":"rWcBwtBF6YMsJbh5ImTRiztIoOY8dXpQWxO5aCWAal+GwAB09YxwKKtkBQUsAp4x7prz+34dX3YwZjecB+gOCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e970a862a8320234c383df0ada8542b8980cf9a387b609b6cb7ba1dec1204c5b","last_reissued_at":"2026-07-05T06:08:38.026089Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:08:38.026089Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Short-Depth Circuits for Dicke State Preparation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DS"],"primary_cat":"quant-ph","authors_text":"Andreas B\\\"artschi, Stephan Eidenbenz","submitted_at":"2022-07-20T16:01:03Z","abstract_excerpt":"We present short-depth circuits to deterministically prepare any Dicke state |Dn,k>, which is the equal-amplitude superposition of all n-qubit computational basis states with Hamming Weight k. Dicke states are an important class of entangled quantum states with a large variety of applications, and a long history of experimental creation in physical systems. On the other hand, not much is known regarding efficient scalable quantum circuits for Dicke state preparation on realistic quantum computing hardware connectivities.\n  Here we present preparation circuits for Dicke states |Dn,k> with (i) a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2207.09998","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/2207.09998/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":"2207.09998","created_at":"2026-07-05T06:08:38.026145+00:00"},{"alias_kind":"arxiv_version","alias_value":"2207.09998v1","created_at":"2026-07-05T06:08:38.026145+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2207.09998","created_at":"2026-07-05T06:08:38.026145+00:00"},{"alias_kind":"pith_short_12","alias_value":"5FYKQYVIGIBD","created_at":"2026-07-05T06:08:38.026145+00:00"},{"alias_kind":"pith_short_16","alias_value":"5FYKQYVIGIBDJQ4D","created_at":"2026-07-05T06:08:38.026145+00:00"},{"alias_kind":"pith_short_8","alias_value":"5FYKQYVI","created_at":"2026-07-05T06:08:38.026145+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.11530","citing_title":"Locally Acting Grover Mixers for Constraint-Preserving QAOA","ref_index":24,"is_internal_anchor":false},{"citing_arxiv_id":"2605.00312","citing_title":"Quantum Decoding Algorithms: Quantum Speedups in Optimization","ref_index":45,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5FYKQYVIGIBDJQ4D34FNVBKCXC","json":"https://pith.science/pith/5FYKQYVIGIBDJQ4D34FNVBKCXC.json","graph_json":"https://pith.science/api/pith-number/5FYKQYVIGIBDJQ4D34FNVBKCXC/graph.json","events_json":"https://pith.science/api/pith-number/5FYKQYVIGIBDJQ4D34FNVBKCXC/events.json","paper":"https://pith.science/paper/5FYKQYVI"},"agent_actions":{"view_html":"https://pith.science/pith/5FYKQYVIGIBDJQ4D34FNVBKCXC","download_json":"https://pith.science/pith/5FYKQYVIGIBDJQ4D34FNVBKCXC.json","view_paper":"https://pith.science/paper/5FYKQYVI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2207.09998&json=true","fetch_graph":"https://pith.science/api/pith-number/5FYKQYVIGIBDJQ4D34FNVBKCXC/graph.json","fetch_events":"https://pith.science/api/pith-number/5FYKQYVIGIBDJQ4D34FNVBKCXC/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5FYKQYVIGIBDJQ4D34FNVBKCXC/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5FYKQYVIGIBDJQ4D34FNVBKCXC/action/storage_attestation","attest_author":"https://pith.science/pith/5FYKQYVIGIBDJQ4D34FNVBKCXC/action/author_attestation","sign_citation":"https://pith.science/pith/5FYKQYVIGIBDJQ4D34FNVBKCXC/action/citation_signature","submit_replication":"https://pith.science/pith/5FYKQYVIGIBDJQ4D34FNVBKCXC/action/replication_record"}},"created_at":"2026-07-05T06:08:38.026145+00:00","updated_at":"2026-07-05T06:08:38.026145+00:00"}