{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:FJVR3FCKP6OZMOHFCEKNSGENT5","short_pith_number":"pith:FJVR3FCK","canonical_record":{"source":{"id":"2403.08724","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-03-13T17:23:09Z","cross_cats_sorted":[],"title_canon_sha256":"de1130e2956220c234ec3276629423ec6702646c155406a28e23160c4cc63669","abstract_canon_sha256":"38974be3cb8b20b61b24089906e0e99424c22e950b87d6dc905704264036ac28"},"schema_version":"1.0"},"canonical_sha256":"2a6b1d944a7f9d9638e51114d9188d9f791a7a225ac9677792cb75543f97f880","source":{"kind":"arxiv","id":"2403.08724","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.08724","created_at":"2026-07-05T09:53:40Z"},{"alias_kind":"arxiv_version","alias_value":"2403.08724v2","created_at":"2026-07-05T09:53:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.08724","created_at":"2026-07-05T09:53:40Z"},{"alias_kind":"pith_short_12","alias_value":"FJVR3FCKP6OZ","created_at":"2026-07-05T09:53:40Z"},{"alias_kind":"pith_short_16","alias_value":"FJVR3FCKP6OZMOHF","created_at":"2026-07-05T09:53:40Z"},{"alias_kind":"pith_short_8","alias_value":"FJVR3FCK","created_at":"2026-07-05T09:53:40Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:FJVR3FCKP6OZMOHFCEKNSGENT5","target":"record","payload":{"canonical_record":{"source":{"id":"2403.08724","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-03-13T17:23:09Z","cross_cats_sorted":[],"title_canon_sha256":"de1130e2956220c234ec3276629423ec6702646c155406a28e23160c4cc63669","abstract_canon_sha256":"38974be3cb8b20b61b24089906e0e99424c22e950b87d6dc905704264036ac28"},"schema_version":"1.0"},"canonical_sha256":"2a6b1d944a7f9d9638e51114d9188d9f791a7a225ac9677792cb75543f97f880","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T09:53:40.455924Z","signature_b64":"Ba6I+EgT6mWQFEoiwkZsWhKoQNuzCyWKpub/3YDJPK3D17O9fCqGsTq988sEFSFxD6hE1Pdh0YGhIVz9b+lOCw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"2a6b1d944a7f9d9638e51114d9188d9f791a7a225ac9677792cb75543f97f880","last_reissued_at":"2026-07-05T09:53:40.455434Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T09:53:40.455434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2403.08724","source_version":2,"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:53:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"/Vvo3l+XtZA+SYYVHF5Uu54h3iSPu82JlHKNoYDh9DT+aLwwJCjWUo5u9M+OKalEnNfPXd2m/o0O0c51Jqg5AQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T09:14:54.025642Z"},"content_sha256":"70c4a60f1773a1b8fb9df7e952c6935a852f2ca00d27cd7b9e157ad971645a6c","schema_version":"1.0","event_id":"sha256:70c4a60f1773a1b8fb9df7e952c6935a852f2ca00d27cd7b9e157ad971645a6c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:FJVR3FCKP6OZMOHFCEKNSGENT5","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Stabilizer Tensor Networks: universal quantum simulator on a basis of stabilizer states","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Artur Garcia-Saez, Sergi Masot-Llima","submitted_at":"2024-03-13T17:23:09Z","abstract_excerpt":"Efficient simulation of quantum computers relies on understanding and exploiting the properties of quantum states. This is the case for methods such as tensor networks, based on entanglement, and the tableau formalism, which represents stabilizer states. In this work, we integrate these two approaches to present a generalization of the tableau formalism used for Clifford circuit simulation. We explicitly prove how to update our formalism with Clifford gates, non-Clifford gates, and measurements, enabling universal circuit simulation. We also discuss how the framework allows for efficient simul"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.08724","kind":"arxiv","version":2},"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.08724/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:53:40Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"3xqucA7SeIN1QiA4pqlH9HTbCytEC1CxvrpIrB7TBFXJeyYIKP8mUczz+YYzUYZuB2Z68jkoGWs5cQthuOquCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-03T09:14:54.026128Z"},"content_sha256":"2f8c212f28096795a958e73f03f87da3dbd002fd1ddcb01aa0a2bd8bd4c2eafd","schema_version":"1.0","event_id":"sha256:2f8c212f28096795a958e73f03f87da3dbd002fd1ddcb01aa0a2bd8bd4c2eafd"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/FJVR3FCKP6OZMOHFCEKNSGENT5/bundle.json","state_url":"https://pith.science/pith/FJVR3FCKP6OZMOHFCEKNSGENT5/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/FJVR3FCKP6OZMOHFCEKNSGENT5/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-03T09:14:54Z","links":{"resolver":"https://pith.science/pith/FJVR3FCKP6OZMOHFCEKNSGENT5","bundle":"https://pith.science/pith/FJVR3FCKP6OZMOHFCEKNSGENT5/bundle.json","state":"https://pith.science/pith/FJVR3FCKP6OZMOHFCEKNSGENT5/state.json","well_known_bundle":"https://pith.science/.well-known/pith/FJVR3FCKP6OZMOHFCEKNSGENT5/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:FJVR3FCKP6OZMOHFCEKNSGENT5","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":"38974be3cb8b20b61b24089906e0e99424c22e950b87d6dc905704264036ac28","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-03-13T17:23:09Z","title_canon_sha256":"de1130e2956220c234ec3276629423ec6702646c155406a28e23160c4cc63669"},"schema_version":"1.0","source":{"id":"2403.08724","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2403.08724","created_at":"2026-07-05T09:53:40Z"},{"alias_kind":"arxiv_version","alias_value":"2403.08724v2","created_at":"2026-07-05T09:53:40Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2403.08724","created_at":"2026-07-05T09:53:40Z"},{"alias_kind":"pith_short_12","alias_value":"FJVR3FCKP6OZ","created_at":"2026-07-05T09:53:40Z"},{"alias_kind":"pith_short_16","alias_value":"FJVR3FCKP6OZMOHF","created_at":"2026-07-05T09:53:40Z"},{"alias_kind":"pith_short_8","alias_value":"FJVR3FCK","created_at":"2026-07-05T09:53:40Z"}],"graph_snapshots":[{"event_id":"sha256:2f8c212f28096795a958e73f03f87da3dbd002fd1ddcb01aa0a2bd8bd4c2eafd","target":"graph","created_at":"2026-07-05T09:53:40Z","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.08724/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Efficient simulation of quantum computers relies on understanding and exploiting the properties of quantum states. This is the case for methods such as tensor networks, based on entanglement, and the tableau formalism, which represents stabilizer states. In this work, we integrate these two approaches to present a generalization of the tableau formalism used for Clifford circuit simulation. We explicitly prove how to update our formalism with Clifford gates, non-Clifford gates, and measurements, enabling universal circuit simulation. We also discuss how the framework allows for efficient simul","authors_text":"Artur Garcia-Saez, Sergi Masot-Llima","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-03-13T17:23:09Z","title":"Stabilizer Tensor Networks: universal quantum simulator on a basis of stabilizer states"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2403.08724","kind":"arxiv","version":2},"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:70c4a60f1773a1b8fb9df7e952c6935a852f2ca00d27cd7b9e157ad971645a6c","target":"record","created_at":"2026-07-05T09:53:40Z","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":"38974be3cb8b20b61b24089906e0e99424c22e950b87d6dc905704264036ac28","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2024-03-13T17:23:09Z","title_canon_sha256":"de1130e2956220c234ec3276629423ec6702646c155406a28e23160c4cc63669"},"schema_version":"1.0","source":{"id":"2403.08724","kind":"arxiv","version":2}},"canonical_sha256":"2a6b1d944a7f9d9638e51114d9188d9f791a7a225ac9677792cb75543f97f880","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"2a6b1d944a7f9d9638e51114d9188d9f791a7a225ac9677792cb75543f97f880","first_computed_at":"2026-07-05T09:53:40.455434Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T09:53:40.455434Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"Ba6I+EgT6mWQFEoiwkZsWhKoQNuzCyWKpub/3YDJPK3D17O9fCqGsTq988sEFSFxD6hE1Pdh0YGhIVz9b+lOCw==","signature_status":"signed_v1","signed_at":"2026-07-05T09:53:40.455924Z","signed_message":"canonical_sha256_bytes"},"source_id":"2403.08724","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70c4a60f1773a1b8fb9df7e952c6935a852f2ca00d27cd7b9e157ad971645a6c","sha256:2f8c212f28096795a958e73f03f87da3dbd002fd1ddcb01aa0a2bd8bd4c2eafd"],"state_sha256":"80d69847b99b8f970863d5dcb1d47ee43059518e48f50608302d9f41f6e7d8da"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"D6eyixCEgfwXj9Y5NtI/ER5VJLbvs2GnVaksr2Gb6wMijsFM9YmdzhcZ23K8U6zzYKZxbcQNcK7KCba7jOhgCw==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-03T09:14:54.031217Z","bundle_sha256":"3851915ff0f76b614f99e2ca9cbebeb2fa7f5e25a2c971f97916eaa78e8c6d1c"}}