{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:XO7YPMXXLT3PR4VVWAUS3T7LIK","short_pith_number":"pith:XO7YPMXX","canonical_record":{"source":{"id":"2411.15332","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-22T20:07:31Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"c718837eb3309b5f792e6bb1662ebd80f047055a7f6d8e25614959bc59057737","abstract_canon_sha256":"d7b38af21af461e6c9d9557286bbd44518fd8082b6d822b5182077368d6b2a14"},"schema_version":"1.0"},"canonical_sha256":"bbbf87b2f75cf6f8f2b5b0292dcfeb42b348963d9a3f7fddc5a9d97d36d55ac1","source":{"kind":"arxiv","id":"2411.15332","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.15332","created_at":"2026-07-05T09:39:33Z"},{"alias_kind":"arxiv_version","alias_value":"2411.15332v1","created_at":"2026-07-05T09:39:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.15332","created_at":"2026-07-05T09:39:33Z"},{"alias_kind":"pith_short_12","alias_value":"XO7YPMXXLT3P","created_at":"2026-07-05T09:39:33Z"},{"alias_kind":"pith_short_16","alias_value":"XO7YPMXXLT3PR4VV","created_at":"2026-07-05T09:39:33Z"},{"alias_kind":"pith_short_8","alias_value":"XO7YPMXX","created_at":"2026-07-05T09:39:33Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:XO7YPMXXLT3PR4VVWAUS3T7LIK","target":"record","payload":{"canonical_record":{"source":{"id":"2411.15332","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-22T20:07:31Z","cross_cats_sorted":["cs.ET"],"title_canon_sha256":"c718837eb3309b5f792e6bb1662ebd80f047055a7f6d8e25614959bc59057737","abstract_canon_sha256":"d7b38af21af461e6c9d9557286bbd44518fd8082b6d822b5182077368d6b2a14"},"schema_version":"1.0"},"canonical_sha256":"bbbf87b2f75cf6f8f2b5b0292dcfeb42b348963d9a3f7fddc5a9d97d36d55ac1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:39:33.365788Z","signature_b64":"nVY8BD76XXwYTGvOaT8+Q8Bj9nkYyc8xBkSZHoL5LZw/JAHt1BofjE0MG73SqzF6ERTppZVDxVfmlptM0ELnAg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"bbbf87b2f75cf6f8f2b5b0292dcfeb42b348963d9a3f7fddc5a9d97d36d55ac1","last_reissued_at":"2026-07-05T09:39:33.365364Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:39:33.365364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2411.15332","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-05T09:39:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"rppwx8pTYRp42brQolSMDMufIKf4/7EOLwp3eZ2rBaQHfHzGUPPkYRNTRU/83nCQPVkE1sH4Sy1uY+vD1BosCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T23:35:31.152709Z"},"content_sha256":"b47d60cc78cbfb8df2e31342b51771b75bcfe4433b6af1799491a4c51df39638","schema_version":"1.0","event_id":"sha256:b47d60cc78cbfb8df2e31342b51771b75bcfe4433b6af1799491a4c51df39638"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:XO7YPMXXLT3PR4VVWAUS3T7LIK","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Mera: Memory Reduction and Acceleration for Quantum Circuit Simulation via Redundancy Exploration","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.ET"],"primary_cat":"quant-ph","authors_text":"Edwin Hsing-Mean Sha, Longshan Xu, Qingfeng Zhuge, Yuhong Song, Zili Shao","submitted_at":"2024-11-22T20:07:31Z","abstract_excerpt":"With the development of quantum computing, quantum processor demonstrates the potential supremacy in specific applications, such as Grovers database search and popular quantum neural networks (QNNs). For better calibrating the quantum algorithms and machines, quantum circuit simulation on classical computers becomes crucial. However, as the number of quantum bits (qubits) increases, the memory requirement grows exponentially. In order to reduce memory usage and accelerate simulation, we propose a multi-level optimization, namely Mera, by exploring memory and computation redundancy. First, for "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.15332","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/2411.15332/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-05T09:39:33Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"VPS6K1eEqYJS5VvVjOHfNjWKlcJLAZmXcPbnISGn7oLrGeNsxpTgeDmWSjlN6p4mn+pOFqD6Jkhar5glfUE+Cg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-12T23:35:31.153299Z"},"content_sha256":"f26f71bfccb41c06dad8511b784b55c6783122c650d7d064f2182a83c099e47d","schema_version":"1.0","event_id":"sha256:f26f71bfccb41c06dad8511b784b55c6783122c650d7d064f2182a83c099e47d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/XO7YPMXXLT3PR4VVWAUS3T7LIK/bundle.json","state_url":"https://pith.science/pith/XO7YPMXXLT3PR4VVWAUS3T7LIK/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/XO7YPMXXLT3PR4VVWAUS3T7LIK/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-12T23:35:31Z","links":{"resolver":"https://pith.science/pith/XO7YPMXXLT3PR4VVWAUS3T7LIK","bundle":"https://pith.science/pith/XO7YPMXXLT3PR4VVWAUS3T7LIK/bundle.json","state":"https://pith.science/pith/XO7YPMXXLT3PR4VVWAUS3T7LIK/state.json","well_known_bundle":"https://pith.science/.well-known/pith/XO7YPMXXLT3PR4VVWAUS3T7LIK/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:XO7YPMXXLT3PR4VVWAUS3T7LIK","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":"d7b38af21af461e6c9d9557286bbd44518fd8082b6d822b5182077368d6b2a14","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-22T20:07:31Z","title_canon_sha256":"c718837eb3309b5f792e6bb1662ebd80f047055a7f6d8e25614959bc59057737"},"schema_version":"1.0","source":{"id":"2411.15332","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2411.15332","created_at":"2026-07-05T09:39:33Z"},{"alias_kind":"arxiv_version","alias_value":"2411.15332v1","created_at":"2026-07-05T09:39:33Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2411.15332","created_at":"2026-07-05T09:39:33Z"},{"alias_kind":"pith_short_12","alias_value":"XO7YPMXXLT3P","created_at":"2026-07-05T09:39:33Z"},{"alias_kind":"pith_short_16","alias_value":"XO7YPMXXLT3PR4VV","created_at":"2026-07-05T09:39:33Z"},{"alias_kind":"pith_short_8","alias_value":"XO7YPMXX","created_at":"2026-07-05T09:39:33Z"}],"graph_snapshots":[{"event_id":"sha256:f26f71bfccb41c06dad8511b784b55c6783122c650d7d064f2182a83c099e47d","target":"graph","created_at":"2026-07-05T09:39:33Z","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/2411.15332/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"With the development of quantum computing, quantum processor demonstrates the potential supremacy in specific applications, such as Grovers database search and popular quantum neural networks (QNNs). For better calibrating the quantum algorithms and machines, quantum circuit simulation on classical computers becomes crucial. However, as the number of quantum bits (qubits) increases, the memory requirement grows exponentially. In order to reduce memory usage and accelerate simulation, we propose a multi-level optimization, namely Mera, by exploring memory and computation redundancy. First, for ","authors_text":"Edwin Hsing-Mean Sha, Longshan Xu, Qingfeng Zhuge, Yuhong Song, Zili Shao","cross_cats":["cs.ET"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-22T20:07:31Z","title":"Mera: Memory Reduction and Acceleration for Quantum Circuit Simulation via Redundancy Exploration"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2411.15332","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:b47d60cc78cbfb8df2e31342b51771b75bcfe4433b6af1799491a4c51df39638","target":"record","created_at":"2026-07-05T09:39:33Z","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":"d7b38af21af461e6c9d9557286bbd44518fd8082b6d822b5182077368d6b2a14","cross_cats_sorted":["cs.ET"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2024-11-22T20:07:31Z","title_canon_sha256":"c718837eb3309b5f792e6bb1662ebd80f047055a7f6d8e25614959bc59057737"},"schema_version":"1.0","source":{"id":"2411.15332","kind":"arxiv","version":1}},"canonical_sha256":"bbbf87b2f75cf6f8f2b5b0292dcfeb42b348963d9a3f7fddc5a9d97d36d55ac1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"bbbf87b2f75cf6f8f2b5b0292dcfeb42b348963d9a3f7fddc5a9d97d36d55ac1","first_computed_at":"2026-07-05T09:39:33.365364Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:39:33.365364Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nVY8BD76XXwYTGvOaT8+Q8Bj9nkYyc8xBkSZHoL5LZw/JAHt1BofjE0MG73SqzF6ERTppZVDxVfmlptM0ELnAg==","signature_status":"signed_v1","signed_at":"2026-07-05T09:39:33.365788Z","signed_message":"canonical_sha256_bytes"},"source_id":"2411.15332","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b47d60cc78cbfb8df2e31342b51771b75bcfe4433b6af1799491a4c51df39638","sha256:f26f71bfccb41c06dad8511b784b55c6783122c650d7d064f2182a83c099e47d"],"state_sha256":"29d5e640153429d04e087063acc880634b315cdcce01ec692a0a53c50b46a6f6"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"P0mIPRY5zWdv4GctznckHg687mbA8uvebqWG8Yh5DM2ekQ/mFeC0RFQlPSdlUL84lusdVSeHzigRGQLsROgcCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-12T23:35:31.158422Z","bundle_sha256":"748b486be979d79ca555bd94b470bc6c13497a89c5666fa24b0b1eff606c9fee"}}