{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:2UQYLPTSS7W3IE45AVA3PZFJLA","short_pith_number":"pith:2UQYLPTS","schema_version":"1.0","canonical_sha256":"d52185be7297edb4139d0541b7e4a95823ae0d82d42b229a95a0a01bccefa637","source":{"kind":"arxiv","id":"2405.19302","version":1},"attestation_state":"computed","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"},"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":"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2405.19302","created_at":"2026-07-05T08:24:50.729523+00:00"},{"alias_kind":"arxiv_version","alias_value":"2405.19302v1","created_at":"2026-07-05T08:24:50.729523+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2405.19302","created_at":"2026-07-05T08:24:50.729523+00:00"},{"alias_kind":"pith_short_12","alias_value":"2UQYLPTSS7W3","created_at":"2026-07-05T08:24:50.729523+00:00"},{"alias_kind":"pith_short_16","alias_value":"2UQYLPTSS7W3IE45","created_at":"2026-07-05T08:24:50.729523+00:00"},{"alias_kind":"pith_short_8","alias_value":"2UQYLPTS","created_at":"2026-07-05T08:24:50.729523+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2604.20033","citing_title":"Direct U(2) approximation via repeat-until-success circuits","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2UQYLPTSS7W3IE45AVA3PZFJLA","json":"https://pith.science/pith/2UQYLPTSS7W3IE45AVA3PZFJLA.json","graph_json":"https://pith.science/api/pith-number/2UQYLPTSS7W3IE45AVA3PZFJLA/graph.json","events_json":"https://pith.science/api/pith-number/2UQYLPTSS7W3IE45AVA3PZFJLA/events.json","paper":"https://pith.science/paper/2UQYLPTS"},"agent_actions":{"view_html":"https://pith.science/pith/2UQYLPTSS7W3IE45AVA3PZFJLA","download_json":"https://pith.science/pith/2UQYLPTSS7W3IE45AVA3PZFJLA.json","view_paper":"https://pith.science/paper/2UQYLPTS","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2405.19302&json=true","fetch_graph":"https://pith.science/api/pith-number/2UQYLPTSS7W3IE45AVA3PZFJLA/graph.json","fetch_events":"https://pith.science/api/pith-number/2UQYLPTSS7W3IE45AVA3PZFJLA/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2UQYLPTSS7W3IE45AVA3PZFJLA/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2UQYLPTSS7W3IE45AVA3PZFJLA/action/storage_attestation","attest_author":"https://pith.science/pith/2UQYLPTSS7W3IE45AVA3PZFJLA/action/author_attestation","sign_citation":"https://pith.science/pith/2UQYLPTSS7W3IE45AVA3PZFJLA/action/citation_signature","submit_replication":"https://pith.science/pith/2UQYLPTSS7W3IE45AVA3PZFJLA/action/replication_record"}},"created_at":"2026-07-05T08:24:50.729523+00:00","updated_at":"2026-07-05T08:24:50.729523+00:00"}