{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2012:4CPQG2X4GRVFG7ATU62ONIMWEE","short_pith_number":"pith:4CPQG2X4","canonical_record":{"source":{"id":"1204.0567","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-04-03T00:42:20Z","cross_cats_sorted":[],"title_canon_sha256":"fc60c4702af97d6f292b968d6f3b844a2b438e272f4a01a25215f08207e3a5fc","abstract_canon_sha256":"aecac5cc34e5d269cd3064a13cec795006266798d4a37225540af10c7946a310"},"schema_version":"1.0"},"canonical_sha256":"e09f036afc346a537c13a7b4e6a19621366be2ecfd52566e9f24370ec6648922","source":{"kind":"arxiv","id":"1204.0567","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.0567","created_at":"2026-05-18T03:30:53Z"},{"alias_kind":"arxiv_version","alias_value":"1204.0567v1","created_at":"2026-05-18T03:30:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0567","created_at":"2026-05-18T03:30:53Z"},{"alias_kind":"pith_short_12","alias_value":"4CPQG2X4GRVF","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4CPQG2X4GRVFG7AT","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4CPQG2X4","created_at":"2026-05-18T12:26:53Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2012:4CPQG2X4GRVFG7ATU62ONIMWEE","target":"record","payload":{"canonical_record":{"source":{"id":"1204.0567","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-04-03T00:42:20Z","cross_cats_sorted":[],"title_canon_sha256":"fc60c4702af97d6f292b968d6f3b844a2b438e272f4a01a25215f08207e3a5fc","abstract_canon_sha256":"aecac5cc34e5d269cd3064a13cec795006266798d4a37225540af10c7946a310"},"schema_version":"1.0"},"canonical_sha256":"e09f036afc346a537c13a7b4e6a19621366be2ecfd52566e9f24370ec6648922","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T03:30:53.848249Z","signature_b64":"7HZmegYOzqAR7zRVXdXvJ/oRc5vZ9amE3jMWTN8/4gYZ7xkTOslPvwLM1ncnvWOYI3X+BO2lDwRI94gUUtmVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e09f036afc346a537c13a7b4e6a19621366be2ecfd52566e9f24370ec6648922","last_reissued_at":"2026-05-18T03:30:53.847346Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T03:30:53.847346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1204.0567","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-18T03:30:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"OS1ehf1fX64kLow762SfitfUADECx5RR9F+JBNuPV52oogx8dvsBZSnuj7xFimeczaOppTWeO+8mBQV5FYKRAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:05:13.810139Z"},"content_sha256":"63dfef0dffa8ff22b0e34addd5bbbdb4627fa7e6ca9a4bcb976ced00313e5f72","schema_version":"1.0","event_id":"sha256:63dfef0dffa8ff22b0e34addd5bbbdb4627fa7e6ca9a4bcb976ced00313e5f72"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2012:4CPQG2X4GRVFG7ATU62ONIMWEE","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Simulating chemistry efficiently on fault-tolerant quantum computers","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Al\\'an Aspuru-Guzik, James D. Whitfield, Man-Hong Yung, N. Cody Jones, Peter L. McMahon, Rodney Van Meter, Yoshihisa Yamamoto","submitted_at":"2012-04-03T00:42:20Z","abstract_excerpt":"Quantum computers can in principle simulate quantum physics exponentially faster than their classical counterparts, but some technical hurdles remain. Here we consider methods to make proposed chemical simulation algorithms computationally fast on fault-tolerant quantum computers in the circuit model. Fault tolerance constrains the choice of available gates, so that arbitrary gates required for a simulation algorithm must be constructed from sequences of fundamental operations. We examine techniques for constructing arbitrary gates which perform substantially faster than circuits based on the "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0567","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-18T03:30:53Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"z63f0IpKuYakTQqS3DI0GAGUqGJeJetDNUeSfUr9surNFLtV1rRsyikyWHqquIbDg6gw2H3ZbePNpPABP+wCAg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-26T18:05:13.810523Z"},"content_sha256":"4bf73ac31abf3cd4dde9f63b55e63e7b4140c4dfe43ef770902d659e32950aea","schema_version":"1.0","event_id":"sha256:4bf73ac31abf3cd4dde9f63b55e63e7b4140c4dfe43ef770902d659e32950aea"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/4CPQG2X4GRVFG7ATU62ONIMWEE/bundle.json","state_url":"https://pith.science/pith/4CPQG2X4GRVFG7ATU62ONIMWEE/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/4CPQG2X4GRVFG7ATU62ONIMWEE/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-26T18:05:13Z","links":{"resolver":"https://pith.science/pith/4CPQG2X4GRVFG7ATU62ONIMWEE","bundle":"https://pith.science/pith/4CPQG2X4GRVFG7ATU62ONIMWEE/bundle.json","state":"https://pith.science/pith/4CPQG2X4GRVFG7ATU62ONIMWEE/state.json","well_known_bundle":"https://pith.science/.well-known/pith/4CPQG2X4GRVFG7ATU62ONIMWEE/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2012:4CPQG2X4GRVFG7ATU62ONIMWEE","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":"aecac5cc34e5d269cd3064a13cec795006266798d4a37225540af10c7946a310","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-04-03T00:42:20Z","title_canon_sha256":"fc60c4702af97d6f292b968d6f3b844a2b438e272f4a01a25215f08207e3a5fc"},"schema_version":"1.0","source":{"id":"1204.0567","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1204.0567","created_at":"2026-05-18T03:30:53Z"},{"alias_kind":"arxiv_version","alias_value":"1204.0567v1","created_at":"2026-05-18T03:30:53Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1204.0567","created_at":"2026-05-18T03:30:53Z"},{"alias_kind":"pith_short_12","alias_value":"4CPQG2X4GRVF","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_16","alias_value":"4CPQG2X4GRVFG7AT","created_at":"2026-05-18T12:26:53Z"},{"alias_kind":"pith_short_8","alias_value":"4CPQG2X4","created_at":"2026-05-18T12:26:53Z"}],"graph_snapshots":[{"event_id":"sha256:4bf73ac31abf3cd4dde9f63b55e63e7b4140c4dfe43ef770902d659e32950aea","target":"graph","created_at":"2026-05-18T03:30:53Z","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":"Quantum computers can in principle simulate quantum physics exponentially faster than their classical counterparts, but some technical hurdles remain. Here we consider methods to make proposed chemical simulation algorithms computationally fast on fault-tolerant quantum computers in the circuit model. Fault tolerance constrains the choice of available gates, so that arbitrary gates required for a simulation algorithm must be constructed from sequences of fundamental operations. We examine techniques for constructing arbitrary gates which perform substantially faster than circuits based on the ","authors_text":"Al\\'an Aspuru-Guzik, James D. Whitfield, Man-Hong Yung, N. Cody Jones, Peter L. McMahon, Rodney Van Meter, Yoshihisa Yamamoto","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-04-03T00:42:20Z","title":"Simulating chemistry efficiently on fault-tolerant quantum computers"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1204.0567","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:63dfef0dffa8ff22b0e34addd5bbbdb4627fa7e6ca9a4bcb976ced00313e5f72","target":"record","created_at":"2026-05-18T03:30:53Z","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":"aecac5cc34e5d269cd3064a13cec795006266798d4a37225540af10c7946a310","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2012-04-03T00:42:20Z","title_canon_sha256":"fc60c4702af97d6f292b968d6f3b844a2b438e272f4a01a25215f08207e3a5fc"},"schema_version":"1.0","source":{"id":"1204.0567","kind":"arxiv","version":1}},"canonical_sha256":"e09f036afc346a537c13a7b4e6a19621366be2ecfd52566e9f24370ec6648922","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"e09f036afc346a537c13a7b4e6a19621366be2ecfd52566e9f24370ec6648922","first_computed_at":"2026-05-18T03:30:53.847346Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-18T03:30:53.847346Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"7HZmegYOzqAR7zRVXdXvJ/oRc5vZ9amE3jMWTN8/4gYZ7xkTOslPvwLM1ncnvWOYI3X+BO2lDwRI94gUUtmVAA==","signature_status":"signed_v1","signed_at":"2026-05-18T03:30:53.848249Z","signed_message":"canonical_sha256_bytes"},"source_id":"1204.0567","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:63dfef0dffa8ff22b0e34addd5bbbdb4627fa7e6ca9a4bcb976ced00313e5f72","sha256:4bf73ac31abf3cd4dde9f63b55e63e7b4140c4dfe43ef770902d659e32950aea"],"state_sha256":"6c473834193e6b61110d1a14386f3b69cc31f63bf3914ca0e3444cde2579a89b"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gbX/2njmfLUF4GeKrUGaSJvZb5iw8yPC++fJoWfhnxw4AG6nIczISDjVbnEm0L4r9N5lc1HQp/hlaOJpVbucAA==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-26T18:05:13.813536Z","bundle_sha256":"949a4e453c5fed70c9c1c5f9de289f7e3e66a644edfa1157e51618f4ef43da47"}}