{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:D2SZ4D664QHSVQV3NQOQBLJW5S","short_pith_number":"pith:D2SZ4D66","canonical_record":{"source":{"id":"2403.11644","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-03-18T10:38:06Z","cross_cats_sorted":[],"title_canon_sha256":"cea2d75bb63516244af158c646068dee66e667cda28b38622ec916e7ce8bc9ab","abstract_canon_sha256":"73ade77caa8d822b44feb2eaf6bacee5a11f60b226c6884e50ad190eaa29169a"},"schema_version":"1.0"},"canonical_sha256":"1ea59e0fdee40f2ac2bb6c1d00ad36ec9113f86d4043b698e3ef1d099a273e79","source":{"kind":"arxiv","id":"2403.11644","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.11644","created_at":"2026-07-05T07:57:19Z"},{"alias_kind":"arxiv_version","alias_value":"2403.11644v1","created_at":"2026-07-05T07:57:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.11644","created_at":"2026-07-05T07:57:19Z"},{"alias_kind":"pith_short_12","alias_value":"D2SZ4D664QHS","created_at":"2026-07-05T07:57:19Z"},{"alias_kind":"pith_short_16","alias_value":"D2SZ4D664QHSVQV3","created_at":"2026-07-05T07:57:19Z"},{"alias_kind":"pith_short_8","alias_value":"D2SZ4D66","created_at":"2026-07-05T07:57:19Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:D2SZ4D664QHSVQV3NQOQBLJW5S","target":"record","payload":{"canonical_record":{"source":{"id":"2403.11644","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-03-18T10:38:06Z","cross_cats_sorted":[],"title_canon_sha256":"cea2d75bb63516244af158c646068dee66e667cda28b38622ec916e7ce8bc9ab","abstract_canon_sha256":"73ade77caa8d822b44feb2eaf6bacee5a11f60b226c6884e50ad190eaa29169a"},"schema_version":"1.0"},"canonical_sha256":"1ea59e0fdee40f2ac2bb6c1d00ad36ec9113f86d4043b698e3ef1d099a273e79","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T07:57:19.439728Z","signature_b64":"ybE8BfUEh0efck0zTZKRPoLYiZQYSXicQ2gSH/+KXiTFD2t83q/MrEAtsK9OzyQlyvLhNAb8S46qPR5OMCVwBA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"1ea59e0fdee40f2ac2bb6c1d00ad36ec9113f86d4043b698e3ef1d099a273e79","last_reissued_at":"2026-07-05T07:57:19.439300Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T07:57:19.439300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.11644","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-05T07:57:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y/0ElmVga+LX/WBtR7Cmzy75ZxxA5eQOiIqq/9D4XT/KG/kfQIrnBe8I8I8GVmZnO1uBy6u2HXM/R+8j5CnnCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T09:57:49.810779Z"},"content_sha256":"f98655b82bc6b4cd95a3e6fbcb7c9389d4a96c50a3bfd43c1c171b429f48aa50","schema_version":"1.0","event_id":"sha256:f98655b82bc6b4cd95a3e6fbcb7c9389d4a96c50a3bfd43c1c171b429f48aa50"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:D2SZ4D664QHSVQV3NQOQBLJW5S","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A tree-approach Pauli decomposition algorithm with application to quantum computing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Arnaud Gazda, Marc Baboulin, Oc\\'eane Koska","submitted_at":"2024-03-18T10:38:06Z","abstract_excerpt":"The Pauli matrices are 2-by-2 matrices that are very useful in quantum computing. They can be used as elementary gates in quantum circuits but also to decompose any matrix of $\\mathbb{C}^{2^n \\times 2^n}$ as a linear combination of tensor products of the Pauli matrices. However, the computational cost of this decomposition is potentially very expensive since it can be exponential in $n$. In this paper, we propose an algorithm with a parallel implementation that optimizes this decomposition using a tree approach to avoid redundancy in the computation while using a limited memory footprint. We a"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.11644","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/2403.11644/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-05T07:57:19Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OHr566LquGR5CcGA3up9bltO8nq+er/PB1SfeiT/eAT2fD6gtIXV+oHy1SCB+aFQ1Rm3YYk4blW4U7J0lwjpDQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T09:57:49.811312Z"},"content_sha256":"0ba373726766484a4f53d020b63d7596e2f76f57a79a344ba927f2f0da65262c","schema_version":"1.0","event_id":"sha256:0ba373726766484a4f53d020b63d7596e2f76f57a79a344ba927f2f0da65262c"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/D2SZ4D664QHSVQV3NQOQBLJW5S/bundle.json","state_url":"https://pith.science/pith/D2SZ4D664QHSVQV3NQOQBLJW5S/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/D2SZ4D664QHSVQV3NQOQBLJW5S/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-18T09:57:49Z","links":{"resolver":"https://pith.science/pith/D2SZ4D664QHSVQV3NQOQBLJW5S","bundle":"https://pith.science/pith/D2SZ4D664QHSVQV3NQOQBLJW5S/bundle.json","state":"https://pith.science/pith/D2SZ4D664QHSVQV3NQOQBLJW5S/state.json","well_known_bundle":"https://pith.science/.well-known/pith/D2SZ4D664QHSVQV3NQOQBLJW5S/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:D2SZ4D664QHSVQV3NQOQBLJW5S","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":"73ade77caa8d822b44feb2eaf6bacee5a11f60b226c6884e50ad190eaa29169a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-03-18T10:38:06Z","title_canon_sha256":"cea2d75bb63516244af158c646068dee66e667cda28b38622ec916e7ce8bc9ab"},"schema_version":"1.0","source":{"id":"2403.11644","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.11644","created_at":"2026-07-05T07:57:19Z"},{"alias_kind":"arxiv_version","alias_value":"2403.11644v1","created_at":"2026-07-05T07:57:19Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.11644","created_at":"2026-07-05T07:57:19Z"},{"alias_kind":"pith_short_12","alias_value":"D2SZ4D664QHS","created_at":"2026-07-05T07:57:19Z"},{"alias_kind":"pith_short_16","alias_value":"D2SZ4D664QHSVQV3","created_at":"2026-07-05T07:57:19Z"},{"alias_kind":"pith_short_8","alias_value":"D2SZ4D66","created_at":"2026-07-05T07:57:19Z"}],"graph_snapshots":[{"event_id":"sha256:0ba373726766484a4f53d020b63d7596e2f76f57a79a344ba927f2f0da65262c","target":"graph","created_at":"2026-07-05T07:57:19Z","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/2403.11644/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The Pauli matrices are 2-by-2 matrices that are very useful in quantum computing. They can be used as elementary gates in quantum circuits but also to decompose any matrix of $\\mathbb{C}^{2^n \\times 2^n}$ as a linear combination of tensor products of the Pauli matrices. However, the computational cost of this decomposition is potentially very expensive since it can be exponential in $n$. In this paper, we propose an algorithm with a parallel implementation that optimizes this decomposition using a tree approach to avoid redundancy in the computation while using a limited memory footprint. We a","authors_text":"Arnaud Gazda, Marc Baboulin, Oc\\'eane Koska","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-03-18T10:38:06Z","title":"A tree-approach Pauli decomposition algorithm with application to quantum computing"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.11644","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:f98655b82bc6b4cd95a3e6fbcb7c9389d4a96c50a3bfd43c1c171b429f48aa50","target":"record","created_at":"2026-07-05T07:57:19Z","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":"73ade77caa8d822b44feb2eaf6bacee5a11f60b226c6884e50ad190eaa29169a","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-03-18T10:38:06Z","title_canon_sha256":"cea2d75bb63516244af158c646068dee66e667cda28b38622ec916e7ce8bc9ab"},"schema_version":"1.0","source":{"id":"2403.11644","kind":"arxiv","version":1}},"canonical_sha256":"1ea59e0fdee40f2ac2bb6c1d00ad36ec9113f86d4043b698e3ef1d099a273e79","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"1ea59e0fdee40f2ac2bb6c1d00ad36ec9113f86d4043b698e3ef1d099a273e79","first_computed_at":"2026-07-05T07:57:19.439300Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T07:57:19.439300Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ybE8BfUEh0efck0zTZKRPoLYiZQYSXicQ2gSH/+KXiTFD2t83q/MrEAtsK9OzyQlyvLhNAb8S46qPR5OMCVwBA==","signature_status":"signed_v1","signed_at":"2026-07-05T07:57:19.439728Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.11644","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:f98655b82bc6b4cd95a3e6fbcb7c9389d4a96c50a3bfd43c1c171b429f48aa50","sha256:0ba373726766484a4f53d020b63d7596e2f76f57a79a344ba927f2f0da65262c"],"state_sha256":"8757dd68f0e8d053b2a5747c222535f75036e9e18a57e0227bb3a5ea5b0698f7"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"h0eiXQELml5wDLCVYrgxYTmPimI1yhi+AaFpcy+VZhizFtlJF0ydqRAshd04uqbDmV90rII72ebjLncck2BJCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T09:57:49.818426Z","bundle_sha256":"3c40f9675993a8e0ac0682d4e2c9b9de146f8eea580066f7c5079ef6ef8b5437"}}