{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:6CNYV2Q5V7ST2L3B4WVQ73VJ7J","short_pith_number":"pith:6CNYV2Q5","canonical_record":{"source":{"id":"1810.03176","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-10-07T16:44:18Z","cross_cats_sorted":[],"title_canon_sha256":"39e7463d2304699814068862a36563a96940db8ab9efd4146e59f72265272ae7","abstract_canon_sha256":"ff71dd0ffcb46290aebb6b7e7ef8d8a9be8d50ca16df692d9235a7b7cf17fd04"},"schema_version":"1.0"},"canonical_sha256":"f09b8aea1dafe53d2f61e5ab0feea9fa48125c1f6c404c176ac4c9ee9fbeea58","source":{"kind":"arxiv","id":"1810.03176","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.03176","created_at":"2026-05-18T00:03:54Z"},{"alias_kind":"arxiv_version","alias_value":"1810.03176v1","created_at":"2026-05-18T00:03:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03176","created_at":"2026-05-18T00:03:54Z"},{"alias_kind":"pith_short_12","alias_value":"6CNYV2Q5V7ST","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6CNYV2Q5V7ST2L3B","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6CNYV2Q5","created_at":"2026-05-18T12:32:08Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:6CNYV2Q5V7ST2L3B4WVQ73VJ7J","target":"record","payload":{"canonical_record":{"source":{"id":"1810.03176","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-10-07T16:44:18Z","cross_cats_sorted":[],"title_canon_sha256":"39e7463d2304699814068862a36563a96940db8ab9efd4146e59f72265272ae7","abstract_canon_sha256":"ff71dd0ffcb46290aebb6b7e7ef8d8a9be8d50ca16df692d9235a7b7cf17fd04"},"schema_version":"1.0"},"canonical_sha256":"f09b8aea1dafe53d2f61e5ab0feea9fa48125c1f6c404c176ac4c9ee9fbeea58","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:03:54.276588Z","signature_b64":"XqZwo0QPQ5qwTAtQU80h1TdyBCElZhg8yb6WH8NerfLt3uoPtKxMTHwGK80zJt26INQlabtfjSISq11YxQ39CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f09b8aea1dafe53d2f61e5ab0feea9fa48125c1f6c404c176ac4c9ee9fbeea58","last_reissued_at":"2026-05-18T00:03:54.275912Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:03:54.275912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1810.03176","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-05-18T00:03:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"PlZ/7odfVQm5tGnK/OyQ5qNKyIuhzHHCD6Ji1amXr3z8fCiMWN+S6awzxOKWcGUHZFUn86KLDJ+1A+HxS8CZCw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:31:21.133073Z"},"content_sha256":"9295e3997bce5ac664030c47b0baa09bd4353ac2441a22053591444db8737057","schema_version":"1.0","event_id":"sha256:9295e3997bce5ac664030c47b0baa09bd4353ac2441a22053591444db8737057"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:6CNYV2Q5V7ST2L3B4WVQ73VJ7J","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficient classical simulation of noisy quantum computation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Luming Duan, Xun Gao","submitted_at":"2018-10-07T16:44:18Z","abstract_excerpt":"Understanding the boundary between classical simulatability and the power of quantum computation is a fascinating topic. Direct simulation of noisy quantum computation requires solving an open quantum many-body system, which is very costly. Here, we develop a tensor network formalism to simulate the time-dynamics and the Fourier spectrum of noisy quantum circuits. We prove that under general conditions most of the quantum circuits at any constant level of noise per gate can be efficiently simulated classically with the cost increasing only polynomially with the size of the circuits. The result"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03176","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":""},"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-05-18T00:03:54Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"exu0Oa+QDvf0aj98RMgJCs9QmSbFElM8HlZOJE4Z3cQfFXgAGTTZUcgJqSL3yqmJcqT6ux+nexR9BCflywQZDg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-09T09:31:21.133764Z"},"content_sha256":"6ef9f94cfb9fc08cbd2d80859bb252a85ec8ac46966ba4915b52d6b1c5837687","schema_version":"1.0","event_id":"sha256:6ef9f94cfb9fc08cbd2d80859bb252a85ec8ac46966ba4915b52d6b1c5837687"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6CNYV2Q5V7ST2L3B4WVQ73VJ7J/bundle.json","state_url":"https://pith.science/pith/6CNYV2Q5V7ST2L3B4WVQ73VJ7J/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6CNYV2Q5V7ST2L3B4WVQ73VJ7J/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-06-09T09:31:21Z","links":{"resolver":"https://pith.science/pith/6CNYV2Q5V7ST2L3B4WVQ73VJ7J","bundle":"https://pith.science/pith/6CNYV2Q5V7ST2L3B4WVQ73VJ7J/bundle.json","state":"https://pith.science/pith/6CNYV2Q5V7ST2L3B4WVQ73VJ7J/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6CNYV2Q5V7ST2L3B4WVQ73VJ7J/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:6CNYV2Q5V7ST2L3B4WVQ73VJ7J","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":"ff71dd0ffcb46290aebb6b7e7ef8d8a9be8d50ca16df692d9235a7b7cf17fd04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-10-07T16:44:18Z","title_canon_sha256":"39e7463d2304699814068862a36563a96940db8ab9efd4146e59f72265272ae7"},"schema_version":"1.0","source":{"id":"1810.03176","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1810.03176","created_at":"2026-05-18T00:03:54Z"},{"alias_kind":"arxiv_version","alias_value":"1810.03176v1","created_at":"2026-05-18T00:03:54Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1810.03176","created_at":"2026-05-18T00:03:54Z"},{"alias_kind":"pith_short_12","alias_value":"6CNYV2Q5V7ST","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_16","alias_value":"6CNYV2Q5V7ST2L3B","created_at":"2026-05-18T12:32:08Z"},{"alias_kind":"pith_short_8","alias_value":"6CNYV2Q5","created_at":"2026-05-18T12:32:08Z"}],"graph_snapshots":[{"event_id":"sha256:6ef9f94cfb9fc08cbd2d80859bb252a85ec8ac46966ba4915b52d6b1c5837687","target":"graph","created_at":"2026-05-18T00:03:54Z","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"},"paper":{"abstract_excerpt":"Understanding the boundary between classical simulatability and the power of quantum computation is a fascinating topic. Direct simulation of noisy quantum computation requires solving an open quantum many-body system, which is very costly. Here, we develop a tensor network formalism to simulate the time-dynamics and the Fourier spectrum of noisy quantum circuits. We prove that under general conditions most of the quantum circuits at any constant level of noise per gate can be efficiently simulated classically with the cost increasing only polynomially with the size of the circuits. The result","authors_text":"Luming Duan, Xun Gao","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-10-07T16:44:18Z","title":"Efficient classical simulation of noisy quantum computation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1810.03176","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:9295e3997bce5ac664030c47b0baa09bd4353ac2441a22053591444db8737057","target":"record","created_at":"2026-05-18T00:03:54Z","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":"ff71dd0ffcb46290aebb6b7e7ef8d8a9be8d50ca16df692d9235a7b7cf17fd04","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-10-07T16:44:18Z","title_canon_sha256":"39e7463d2304699814068862a36563a96940db8ab9efd4146e59f72265272ae7"},"schema_version":"1.0","source":{"id":"1810.03176","kind":"arxiv","version":1}},"canonical_sha256":"f09b8aea1dafe53d2f61e5ab0feea9fa48125c1f6c404c176ac4c9ee9fbeea58","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f09b8aea1dafe53d2f61e5ab0feea9fa48125c1f6c404c176ac4c9ee9fbeea58","first_computed_at":"2026-05-18T00:03:54.275912Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:03:54.275912Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XqZwo0QPQ5qwTAtQU80h1TdyBCElZhg8yb6WH8NerfLt3uoPtKxMTHwGK80zJt26INQlabtfjSISq11YxQ39CA==","signature_status":"signed_v1","signed_at":"2026-05-18T00:03:54.276588Z","signed_message":"canonical_sha256_bytes"},"source_id":"1810.03176","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:9295e3997bce5ac664030c47b0baa09bd4353ac2441a22053591444db8737057","sha256:6ef9f94cfb9fc08cbd2d80859bb252a85ec8ac46966ba4915b52d6b1c5837687"],"state_sha256":"44329ae51aa500b8470767eca913471e96b4107f46c9f92fb57511ba07814825"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"y2yrMCkSvu0r5SykdgUvfS8yXX+42BihotsYB0GVP4YhCR6ER2BcOR1vt4SQTixgbryS6BSDiv2OBlEfjd/YBA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-09T09:31:21.137911Z","bundle_sha256":"bd9f3407c4225994c39ecc3815a4c4643625bad5a1114e8541db849f96a15ead"}}