{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:2UQYLPTSS7W3IE45AVA3PZFJLA","short_pith_number":"pith:2UQYLPTS","canonical_record":{"source":{"id":"2405.19302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-05-29T17:27:50Z","cross_cats_sorted":[],"title_canon_sha256":"06d8c0ab301caff024eaf27139b34184fcd45eae5a628d834c6e483021123ca2","abstract_canon_sha256":"5e5931c39722b2fbfe4685769fe6679bd5f54c05f344b3bc7cdb5cd1292cf301"},"schema_version":"1.0"},"canonical_sha256":"d52185be7297edb4139d0541b7e4a95823ae0d82d42b229a95a0a01bccefa637","source":{"kind":"arxiv","id":"2405.19302","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.19302","created_at":"2026-07-05T08:24:50Z"},{"alias_kind":"arxiv_version","alias_value":"2405.19302v1","created_at":"2026-07-05T08:24:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.19302","created_at":"2026-07-05T08:24:50Z"},{"alias_kind":"pith_short_12","alias_value":"2UQYLPTSS7W3","created_at":"2026-07-05T08:24:50Z"},{"alias_kind":"pith_short_16","alias_value":"2UQYLPTSS7W3IE45","created_at":"2026-07-05T08:24:50Z"},{"alias_kind":"pith_short_8","alias_value":"2UQYLPTS","created_at":"2026-07-05T08:24:50Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:2UQYLPTSS7W3IE45AVA3PZFJLA","target":"record","payload":{"canonical_record":{"source":{"id":"2405.19302","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-05-29T17:27:50Z","cross_cats_sorted":[],"title_canon_sha256":"06d8c0ab301caff024eaf27139b34184fcd45eae5a628d834c6e483021123ca2","abstract_canon_sha256":"5e5931c39722b2fbfe4685769fe6679bd5f54c05f344b3bc7cdb5cd1292cf301"},"schema_version":"1.0"},"canonical_sha256":"d52185be7297edb4139d0541b7e4a95823ae0d82d42b229a95a0a01bccefa637","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:24:50.729943Z","signature_b64":"C52nYkPklFTq4ix+aYcT+cAu/DszzCqORwwxyGJcfUqFovDYssLJnn8tEwJI6dQgOnhHxhBtqgG1r5Ix2NhaAw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d52185be7297edb4139d0541b7e4a95823ae0d82d42b229a95a0a01bccefa637","last_reissued_at":"2026-07-05T08:24:50.729452Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:24:50.729452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2405.19302","source_version":1,"attestation_state":"computed"},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:24:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"u+HdswtyuNpDMtPvorjeZ7jQb1B/0X0WTZpKRii5Nw9gATeX8t4cqzMKiX/uOA8kfXWAy5rp8bRtyvNQIEdmCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T17:54:36.086896Z"},"content_sha256":"cf3889cb6d045e5d1583a3bf7d9ea2d8815e74dac8168dcfb633d62920104ea2","schema_version":"1.0","event_id":"sha256:cf3889cb6d045e5d1583a3bf7d9ea2d8815e74dac8168dcfb633d62920104ea2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:2UQYLPTSS7W3IE45AVA3PZFJLA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Multi-qubit circuit synthesis and Hermitian lattices","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Sebastian Sch\\\"onnenbeck, Vadym Kliuchnikov","submitted_at":"2024-05-29T17:27:50Z","abstract_excerpt":"We present new optimal and heuristic algorithms for exact synthesis of multi-qubit unitaries and isometries. For example, our algorithms find Clifford and T circuits for unitaries with entries in $\\mathbb{Z}[i,1/\\sqrt{2}]$. The optimal algorithms are the A* search instantiated with a new data structure for graph vertices and new consistent heuristic functions. We also prove that for some gate sets, best-first search synthesis relying on the same heuristic is efficient. For example, for two-qubit Clifford and T circuits, our best-first search runtime is proportional to the T-count of the unitar"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.19302","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/2405.19302/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"},"verdict_id":null},"signer":{"signer_id":"pith.science","signer_type":"pith_registry","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"created_at":"2026-07-05T08:24:50Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"CbF8B5gDQ4yUg+NNSR3KNW1aAKxxkdwAwMMt6vk5CPP7gUk7FevQLPhevhTHVd8HtpysbTvQ4l0Ui9xDATthCA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-04T17:54:36.087395Z"},"content_sha256":"c5238b4a410278233009ccfe84fbe53f939d39d1865ae344889fe1537049661b","schema_version":"1.0","event_id":"sha256:c5238b4a410278233009ccfe84fbe53f939d39d1865ae344889fe1537049661b"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2UQYLPTSS7W3IE45AVA3PZFJLA/bundle.json","state_url":"https://pith.science/pith/2UQYLPTSS7W3IE45AVA3PZFJLA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2UQYLPTSS7W3IE45AVA3PZFJLA/bundle.json","status":"primary"}],"public_keys":[{"key_id":"pith-v1-2026-05","algorithm":"ed25519","format":"raw","public_key_b64":"stVStoiQhXFxp4s2pdzPNoqVNBMojDU/fJ2db5S3CbM=","public_key_hex":"b2d552b68890857171a78b36a5dccf368a953413288c353f7c9d9d6f94b709b3","fingerprint_sha256_b32_first128bits":"RVFV5Z2OI2J3ZUO7ERDEBCYNKS","fingerprint_sha256_hex":"8d4b5ee74e4693bcd1df2446408b0d54","rotates_at":null,"url":"https://pith.science/pith-signing-key.json","notes":"Pith uses this Ed25519 key to sign canonical record SHA-256 digests. Verify with: ed25519_verify(public_key, message=canonical_sha256_bytes, signature=base64decode(signature_b64))."}],"merge_version":"pith-open-graph-merge-v1","built_at":"2026-08-04T17:54:36Z","links":{"resolver":"https://pith.science/pith/2UQYLPTSS7W3IE45AVA3PZFJLA","bundle":"https://pith.science/pith/2UQYLPTSS7W3IE45AVA3PZFJLA/bundle.json","state":"https://pith.science/pith/2UQYLPTSS7W3IE45AVA3PZFJLA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2UQYLPTSS7W3IE45AVA3PZFJLA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:2UQYLPTSS7W3IE45AVA3PZFJLA","merge_version":"pith-open-graph-merge-v1","event_count":2,"valid_event_count":2,"invalid_event_count":0,"equivocation_count":0,"current":{"canonical_record":{"metadata":{"abstract_canon_sha256":"5e5931c39722b2fbfe4685769fe6679bd5f54c05f344b3bc7cdb5cd1292cf301","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-05-29T17:27:50Z","title_canon_sha256":"06d8c0ab301caff024eaf27139b34184fcd45eae5a628d834c6e483021123ca2"},"schema_version":"1.0","source":{"id":"2405.19302","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2405.19302","created_at":"2026-07-05T08:24:50Z"},{"alias_kind":"arxiv_version","alias_value":"2405.19302v1","created_at":"2026-07-05T08:24:50Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.19302","created_at":"2026-07-05T08:24:50Z"},{"alias_kind":"pith_short_12","alias_value":"2UQYLPTSS7W3","created_at":"2026-07-05T08:24:50Z"},{"alias_kind":"pith_short_16","alias_value":"2UQYLPTSS7W3IE45","created_at":"2026-07-05T08:24:50Z"},{"alias_kind":"pith_short_8","alias_value":"2UQYLPTS","created_at":"2026-07-05T08:24:50Z"}],"graph_snapshots":[{"event_id":"sha256:c5238b4a410278233009ccfe84fbe53f939d39d1865ae344889fe1537049661b","target":"graph","created_at":"2026-07-05T08:24:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"graph_snapshot":{"author_claims":{"count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","strong_count":0},"builder_version":"pith-number-builder-2026-05-17-v1","claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"integrity":{"available":true,"clean":true,"detectors_run":[],"endpoint":"/pith/2405.19302/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We present new optimal and heuristic algorithms for exact synthesis of multi-qubit unitaries and isometries. For example, our algorithms find Clifford and T circuits for unitaries with entries in $\\mathbb{Z}[i,1/\\sqrt{2}]$. The optimal algorithms are the A* search instantiated with a new data structure for graph vertices and new consistent heuristic functions. We also prove that for some gate sets, best-first search synthesis relying on the same heuristic is efficient. For example, for two-qubit Clifford and T circuits, our best-first search runtime is proportional to the T-count of the unitar","authors_text":"Sebastian Sch\\\"onnenbeck, Vadym Kliuchnikov","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-05-29T17:27:50Z","title":"Multi-qubit circuit synthesis and Hermitian lattices"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2405.19302","kind":"arxiv","version":1},"verdict":{"created_at":null,"id":null,"model_set":{},"one_line_summary":"","pipeline_version":null,"pith_extraction_headline":"","strongest_claim":"","weakest_assumption":""}},"verdict_id":null}}],"author_attestations":[],"timestamp_anchors":[],"storage_attestations":[],"citation_signatures":[],"replication_records":[],"corrections":[],"mirror_hints":[],"record_created":{"event_id":"sha256:cf3889cb6d045e5d1583a3bf7d9ea2d8815e74dac8168dcfb633d62920104ea2","target":"record","created_at":"2026-07-05T08:24:50Z","signer":{"key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signer_id":"pith.science","signer_type":"pith_registry"},"payload":{"attestation_state":"computed","canonical_record":{"metadata":{"abstract_canon_sha256":"5e5931c39722b2fbfe4685769fe6679bd5f54c05f344b3bc7cdb5cd1292cf301","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-05-29T17:27:50Z","title_canon_sha256":"06d8c0ab301caff024eaf27139b34184fcd45eae5a628d834c6e483021123ca2"},"schema_version":"1.0","source":{"id":"2405.19302","kind":"arxiv","version":1}},"canonical_sha256":"d52185be7297edb4139d0541b7e4a95823ae0d82d42b229a95a0a01bccefa637","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d52185be7297edb4139d0541b7e4a95823ae0d82d42b229a95a0a01bccefa637","first_computed_at":"2026-07-05T08:24:50.729452Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:24:50.729452Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"C52nYkPklFTq4ix+aYcT+cAu/DszzCqORwwxyGJcfUqFovDYssLJnn8tEwJI6dQgOnhHxhBtqgG1r5Ix2NhaAw==","signature_status":"signed_v1","signed_at":"2026-07-05T08:24:50.729943Z","signed_message":"canonical_sha256_bytes"},"source_id":"2405.19302","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:cf3889cb6d045e5d1583a3bf7d9ea2d8815e74dac8168dcfb633d62920104ea2","sha256:c5238b4a410278233009ccfe84fbe53f939d39d1865ae344889fe1537049661b"],"state_sha256":"570f33653ea1b4214c74213f9fe8dd9332354e8d7099d7f3cc107d0758ab7faf"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"k4tqfhwYId4BmZEC5L4Pyz765hng1REiZ4aQUkWcSYSDdHQ55XZ2Im+jnGzgqCDRcknnLJ0344MVmq94WhcsDg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-04T17:54:36.092247Z","bundle_sha256":"7534127d639284b14a308ebce069dadbf61f659abf2bf985204813eff27e424b"}}