{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2024:OKXQT6OF5WUI7WZUWW3BKWYMJN","short_pith_number":"pith:OKXQT6OF","schema_version":"1.0","canonical_sha256":"72af09f9c5eda88fdb34b5b6155b0c4b424953cb6820a571ff16cfa0a4043d07","source":{"kind":"arxiv","id":"2404.18226","version":1},"attestation_state":"computed","paper":{"title":"A quantum compiler design method by using linear combinations of permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"quant-ph","authors_text":"Ammar Daskin","submitted_at":"2024-04-28T15:42:37Z","abstract_excerpt":"A matrix can be converted into a doubly stochastic matrix by using two diagonal matrices. And a doubly stochastic matrix can be written as a sum of permutation matrices. In this paper, we describe a method to write a given generic matrix in terms of quantum gates based on the block encoding.\n  In particular, we first show how to convert a matrix into doubly stochastic matrices and by using Birkhoff's algorithm, we express that matrix in terms of a linear combination of permutations which can be mapped to quantum circuits. We then discuss a few optimization techniques that can be applied in a p"},"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":"2404.18226","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-04-28T15:42:37Z","cross_cats_sorted":["cs.PL"],"title_canon_sha256":"69034555239cd50869fe6f32319e70c3674e673f382e7a6c5670f2d40cce8ab6","abstract_canon_sha256":"59b3de285510f06a5791d0f9682fc7445ef3269c807b2fa30f6bf85b35cedafe"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:13:00.164663Z","signature_b64":"f94dMhQX/iGEZ2VjpvISCUFHFAAKW/OA6cZvbR0Mc/UhrPfrFMj6i/zpImTcoo5bTTl6Uk95ELD0TBvIbWPLBg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"72af09f9c5eda88fdb34b5b6155b0c4b424953cb6820a571ff16cfa0a4043d07","last_reissued_at":"2026-07-05T08:13:00.164194Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:13:00.164194Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"A quantum compiler design method by using linear combinations of permutations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.PL"],"primary_cat":"quant-ph","authors_text":"Ammar Daskin","submitted_at":"2024-04-28T15:42:37Z","abstract_excerpt":"A matrix can be converted into a doubly stochastic matrix by using two diagonal matrices. And a doubly stochastic matrix can be written as a sum of permutation matrices. In this paper, we describe a method to write a given generic matrix in terms of quantum gates based on the block encoding.\n  In particular, we first show how to convert a matrix into doubly stochastic matrices and by using Birkhoff's algorithm, we express that matrix in terms of a linear combination of permutations which can be mapped to quantum circuits. We then discuss a few optimization techniques that can be applied in a p"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2404.18226","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/2404.18226/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":"2404.18226","created_at":"2026-07-05T08:13:00.164250+00:00"},{"alias_kind":"arxiv_version","alias_value":"2404.18226v1","created_at":"2026-07-05T08:13:00.164250+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2404.18226","created_at":"2026-07-05T08:13:00.164250+00:00"},{"alias_kind":"pith_short_12","alias_value":"OKXQT6OF5WUI","created_at":"2026-07-05T08:13:00.164250+00:00"},{"alias_kind":"pith_short_16","alias_value":"OKXQT6OF5WUI7WZU","created_at":"2026-07-05T08:13:00.164250+00:00"},{"alias_kind":"pith_short_8","alias_value":"OKXQT6OF","created_at":"2026-07-05T08:13:00.164250+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":4,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2605.27430","citing_title":"Lowering LCU Circuit Width through Maximum-Weight Birkhoff-von Neumann Decomposition","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2605.27430","citing_title":"Lowering LCU Circuit Width through Maximum-Weight Birkhoff-von Neumann Decomposition","ref_index":19,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02986","citing_title":"Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions","ref_index":6,"is_internal_anchor":false},{"citing_arxiv_id":"2605.02986","citing_title":"Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions","ref_index":6,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/OKXQT6OF5WUI7WZUWW3BKWYMJN","json":"https://pith.science/pith/OKXQT6OF5WUI7WZUWW3BKWYMJN.json","graph_json":"https://pith.science/api/pith-number/OKXQT6OF5WUI7WZUWW3BKWYMJN/graph.json","events_json":"https://pith.science/api/pith-number/OKXQT6OF5WUI7WZUWW3BKWYMJN/events.json","paper":"https://pith.science/paper/OKXQT6OF"},"agent_actions":{"view_html":"https://pith.science/pith/OKXQT6OF5WUI7WZUWW3BKWYMJN","download_json":"https://pith.science/pith/OKXQT6OF5WUI7WZUWW3BKWYMJN.json","view_paper":"https://pith.science/paper/OKXQT6OF","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2404.18226&json=true","fetch_graph":"https://pith.science/api/pith-number/OKXQT6OF5WUI7WZUWW3BKWYMJN/graph.json","fetch_events":"https://pith.science/api/pith-number/OKXQT6OF5WUI7WZUWW3BKWYMJN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/OKXQT6OF5WUI7WZUWW3BKWYMJN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/OKXQT6OF5WUI7WZUWW3BKWYMJN/action/storage_attestation","attest_author":"https://pith.science/pith/OKXQT6OF5WUI7WZUWW3BKWYMJN/action/author_attestation","sign_citation":"https://pith.science/pith/OKXQT6OF5WUI7WZUWW3BKWYMJN/action/citation_signature","submit_replication":"https://pith.science/pith/OKXQT6OF5WUI7WZUWW3BKWYMJN/action/replication_record"}},"created_at":"2026-07-05T08:13:00.164250+00:00","updated_at":"2026-07-05T08:13:00.164250+00:00"}