{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:HO5VZM3Z23HJNQLJHPTHPYADSN","short_pith_number":"pith:HO5VZM3Z","canonical_record":{"source":{"id":"1804.10368","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-04-27T07:31:37Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"89ec90039abf18067d55287389429953f21f77d8bfe3f1e7eddd1f1a1ef4302a","abstract_canon_sha256":"3d3e635f4dc63eefb2d5755402a16de4a762f0ca4b6db33ddd1a9eecb2545ab2"},"schema_version":"1.0"},"canonical_sha256":"3bbb5cb379d6ce96c1693be677e003935cf3ca70e4341c2ecc2d05e56ca86fff","source":{"kind":"arxiv","id":"1804.10368","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10368","created_at":"2026-05-18T00:17:10Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10368v2","created_at":"2026-05-18T00:17:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10368","created_at":"2026-05-18T00:17:10Z"},{"alias_kind":"pith_short_12","alias_value":"HO5VZM3Z23HJ","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HO5VZM3Z23HJNQLJ","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HO5VZM3Z","created_at":"2026-05-18T12:32:28Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:HO5VZM3Z23HJNQLJHPTHPYADSN","target":"record","payload":{"canonical_record":{"source":{"id":"1804.10368","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-04-27T07:31:37Z","cross_cats_sorted":["cs.CC"],"title_canon_sha256":"89ec90039abf18067d55287389429953f21f77d8bfe3f1e7eddd1f1a1ef4302a","abstract_canon_sha256":"3d3e635f4dc63eefb2d5755402a16de4a762f0ca4b6db33ddd1a9eecb2545ab2"},"schema_version":"1.0"},"canonical_sha256":"3bbb5cb379d6ce96c1693be677e003935cf3ca70e4341c2ecc2d05e56ca86fff","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T00:17:10.799389Z","signature_b64":"ZRKeSgdd73dyw9bTEqI4Hgcd9LwPWY3ukH9STDOuvJqbWO5FnZkpOaNYc+xGDhWNIRvqHGHg1B451CeXeJl/Cg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3bbb5cb379d6ce96c1693be677e003935cf3ca70e4341c2ecc2d05e56ca86fff","last_reissued_at":"2026-05-18T00:17:10.798696Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T00:17:10.798696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1804.10368","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-05-18T00:17:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"fYncfFYGlsstlUVjawZf/t33Qe2XSYXUTGnmTeIBLx2lH9mQv6LJc9yOMggdToyLnyH6prVvRh8owu7+G2ZQBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:38:20.487400Z"},"content_sha256":"715e374e05bf2d981a074e91ebccd4d0902aff44c1eac519d4458a2f78b0ecd7","schema_version":"1.0","event_id":"sha256:715e374e05bf2d981a074e91ebccd4d0902aff44c1eac519d4458a2f78b0ecd7"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:HO5VZM3Z23HJNQLJHPTHPYADSN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Explicit lower bounds on strong quantum simulation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.CC"],"primary_cat":"quant-ph","authors_text":"Cupjin Huang, Mario Szegedy, Michael Newman","submitted_at":"2018-04-27T07:31:37Z","abstract_excerpt":"We consider the problem of strong (amplitude-wise) simulation of $n$-qubit quantum circuits, and identify a subclass of simulators we call monotone. This subclass encompasses almost all prominent simulation techniques. We prove an unconditional (i.e. without relying on any complexity theoretic assumptions) and explicit $(n-2)(2^{n-3}-1)$ lower bound on the running time of simulators within this subclass. Assuming the Strong Exponential Time Hypothesis (SETH), we further remark that a universal simulator computing any amplitude to precision $2^{-n}/2$ must take at least $2^{n - o(n)}$ time. Fin"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10368","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":""},"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:17:10Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"FuwIT1q9IsKKaf2XZZKnxBGCe9aXsEImYQz+gaefEgnnunnZ3LdtXY60Fdac1a9TrZt9NyuhAddUkeC4xPEHCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-30T21:38:20.487862Z"},"content_sha256":"e821255b79056752b054defeb308a16007a3d0ad53c9a4806cdd407ff37145ab","schema_version":"1.0","event_id":"sha256:e821255b79056752b054defeb308a16007a3d0ad53c9a4806cdd407ff37145ab"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HO5VZM3Z23HJNQLJHPTHPYADSN/bundle.json","state_url":"https://pith.science/pith/HO5VZM3Z23HJNQLJHPTHPYADSN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HO5VZM3Z23HJNQLJHPTHPYADSN/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-05-30T21:38:20Z","links":{"resolver":"https://pith.science/pith/HO5VZM3Z23HJNQLJHPTHPYADSN","bundle":"https://pith.science/pith/HO5VZM3Z23HJNQLJHPTHPYADSN/bundle.json","state":"https://pith.science/pith/HO5VZM3Z23HJNQLJHPTHPYADSN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HO5VZM3Z23HJNQLJHPTHPYADSN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:HO5VZM3Z23HJNQLJHPTHPYADSN","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":"3d3e635f4dc63eefb2d5755402a16de4a762f0ca4b6db33ddd1a9eecb2545ab2","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-04-27T07:31:37Z","title_canon_sha256":"89ec90039abf18067d55287389429953f21f77d8bfe3f1e7eddd1f1a1ef4302a"},"schema_version":"1.0","source":{"id":"1804.10368","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1804.10368","created_at":"2026-05-18T00:17:10Z"},{"alias_kind":"arxiv_version","alias_value":"1804.10368v2","created_at":"2026-05-18T00:17:10Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1804.10368","created_at":"2026-05-18T00:17:10Z"},{"alias_kind":"pith_short_12","alias_value":"HO5VZM3Z23HJ","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_16","alias_value":"HO5VZM3Z23HJNQLJ","created_at":"2026-05-18T12:32:28Z"},{"alias_kind":"pith_short_8","alias_value":"HO5VZM3Z","created_at":"2026-05-18T12:32:28Z"}],"graph_snapshots":[{"event_id":"sha256:e821255b79056752b054defeb308a16007a3d0ad53c9a4806cdd407ff37145ab","target":"graph","created_at":"2026-05-18T00:17:10Z","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":"We consider the problem of strong (amplitude-wise) simulation of $n$-qubit quantum circuits, and identify a subclass of simulators we call monotone. This subclass encompasses almost all prominent simulation techniques. We prove an unconditional (i.e. without relying on any complexity theoretic assumptions) and explicit $(n-2)(2^{n-3}-1)$ lower bound on the running time of simulators within this subclass. Assuming the Strong Exponential Time Hypothesis (SETH), we further remark that a universal simulator computing any amplitude to precision $2^{-n}/2$ must take at least $2^{n - o(n)}$ time. Fin","authors_text":"Cupjin Huang, Mario Szegedy, Michael Newman","cross_cats":["cs.CC"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-04-27T07:31:37Z","title":"Explicit lower bounds on strong quantum simulation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1804.10368","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:715e374e05bf2d981a074e91ebccd4d0902aff44c1eac519d4458a2f78b0ecd7","target":"record","created_at":"2026-05-18T00:17:10Z","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":"3d3e635f4dc63eefb2d5755402a16de4a762f0ca4b6db33ddd1a9eecb2545ab2","cross_cats_sorted":["cs.CC"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-04-27T07:31:37Z","title_canon_sha256":"89ec90039abf18067d55287389429953f21f77d8bfe3f1e7eddd1f1a1ef4302a"},"schema_version":"1.0","source":{"id":"1804.10368","kind":"arxiv","version":2}},"canonical_sha256":"3bbb5cb379d6ce96c1693be677e003935cf3ca70e4341c2ecc2d05e56ca86fff","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3bbb5cb379d6ce96c1693be677e003935cf3ca70e4341c2ecc2d05e56ca86fff","first_computed_at":"2026-05-18T00:17:10.798696Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T00:17:10.798696Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"ZRKeSgdd73dyw9bTEqI4Hgcd9LwPWY3ukH9STDOuvJqbWO5FnZkpOaNYc+xGDhWNIRvqHGHg1B451CeXeJl/Cg==","signature_status":"signed_v1","signed_at":"2026-05-18T00:17:10.799389Z","signed_message":"canonical_sha256_bytes"},"source_id":"1804.10368","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:715e374e05bf2d981a074e91ebccd4d0902aff44c1eac519d4458a2f78b0ecd7","sha256:e821255b79056752b054defeb308a16007a3d0ad53c9a4806cdd407ff37145ab"],"state_sha256":"37859e3838c89f09d5ed02baf2a149896f35d3a3ccd6cc21e47208e46a43ff07"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"UrVJSNVtGLlKEcje0e4ag5WG/5LtnVW5UFEWm5JwfFJNJ0J+PiGvIUQA8zy3rdIAU9rAk6XStGGinRS5zK31CA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-30T21:38:20.491201Z","bundle_sha256":"57ac7571742e6ea4f35e9942054c93e1efb8ca080060dc66da3b6ad17a711366"}}