{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2024:2CTSDWGA3PBINZ3G2KHGTK4ZC4","short_pith_number":"pith:2CTSDWGA","canonical_record":{"source":{"id":"2408.16794","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2024-08-28T18:39:56Z","cross_cats_sorted":[],"title_canon_sha256":"9afa8be587833585947d19152bdccc6547b63e07edc4e8c8a6670dd4623e2438","abstract_canon_sha256":"cd2b2510fbae8abea5628e6d80e57aa6cb842e2f1dbc8f970d7698f3be8fc0ff"},"schema_version":"1.0"},"canonical_sha256":"d0a721d8c0dbc286e766d28e69ab991708f13acebd634654c92b6ff380973557","source":{"kind":"arxiv","id":"2408.16794","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.16794","created_at":"2026-07-05T10:43:38Z"},{"alias_kind":"arxiv_version","alias_value":"2408.16794v2","created_at":"2026-07-05T10:43:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.16794","created_at":"2026-07-05T10:43:38Z"},{"alias_kind":"pith_short_12","alias_value":"2CTSDWGA3PBI","created_at":"2026-07-05T10:43:38Z"},{"alias_kind":"pith_short_16","alias_value":"2CTSDWGA3PBINZ3G","created_at":"2026-07-05T10:43:38Z"},{"alias_kind":"pith_short_8","alias_value":"2CTSDWGA","created_at":"2026-07-05T10:43:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2024:2CTSDWGA3PBINZ3G2KHGTK4ZC4","target":"record","payload":{"canonical_record":{"source":{"id":"2408.16794","kind":"arxiv","version":2},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2024-08-28T18:39:56Z","cross_cats_sorted":[],"title_canon_sha256":"9afa8be587833585947d19152bdccc6547b63e07edc4e8c8a6670dd4623e2438","abstract_canon_sha256":"cd2b2510fbae8abea5628e6d80e57aa6cb842e2f1dbc8f970d7698f3be8fc0ff"},"schema_version":"1.0"},"canonical_sha256":"d0a721d8c0dbc286e766d28e69ab991708f13acebd634654c92b6ff380973557","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T10:43:38.778967Z","signature_b64":"QTyOuVknQyzLCrCovLLvvVGxfH2lQAwTxiHhWf2VGOa8NfvF/xk5a/qcpkWbcwKlmPnl8/5E6/idBj1U7s8EBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d0a721d8c0dbc286e766d28e69ab991708f13acebd634654c92b6ff380973557","last_reissued_at":"2026-07-05T10:43:38.778499Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T10:43:38.778499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2408.16794","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-05T10:43:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"cYllZz/8LxjScYW02q52+sD0n6fqtKkDktJBliejl4gh8KPUItRT8m0X8pjfpWicSFs9q/uJAiVK0cYmW+iTDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T09:21:20.456717Z"},"content_sha256":"a821653c6123b5056640b169d645b5f0c8b4e998d492ea7797c53ea8366b73f4","schema_version":"1.0","event_id":"sha256:a821653c6123b5056640b169d645b5f0c8b4e998d492ea7797c53ea8366b73f4"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2024:2CTSDWGA3PBINZ3G2KHGTK4ZC4","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"A quantum random access memory (QRAM) using a polynomial encoding of binary strings","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Priyanka Mukhopadhyay","submitted_at":"2024-08-28T18:39:56Z","abstract_excerpt":"Quantum algorithms claim significant speedup over their classical counterparts for solving many problems. An important aspect of many of these algorithms is the existence of a quantum oracle, which needs to be implemented efficiently in order to realize the claimed advantages. A quantum random access memory (QRAM) is a promising architecture for realizing these oracles. In this paper we develop a new design for QRAM and implement it with Clifford+T circuit. We focus on optimizing the T-count and T-depth since non-Clifford gates are the most expensive to implement fault-tolerantly. Integral to "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.16794","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/2408.16794/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-05T10:43:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"gUtIV10GdxpS+d/9RgQhOjkS9B8LAdKlvx5/Wrk239boPbvSYKPOXCuvN2GxHGYJhhTDPKiUgKRyb8QGVNiFBw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-07T09:21:20.457250Z"},"content_sha256":"cbf2bb4584efa9e3293ca69d2b8ac16a6e0799be8ff790bbdb7282a1a3bb7eeb","schema_version":"1.0","event_id":"sha256:cbf2bb4584efa9e3293ca69d2b8ac16a6e0799be8ff790bbdb7282a1a3bb7eeb"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/2CTSDWGA3PBINZ3G2KHGTK4ZC4/bundle.json","state_url":"https://pith.science/pith/2CTSDWGA3PBINZ3G2KHGTK4ZC4/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/2CTSDWGA3PBINZ3G2KHGTK4ZC4/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-07T09:21:20Z","links":{"resolver":"https://pith.science/pith/2CTSDWGA3PBINZ3G2KHGTK4ZC4","bundle":"https://pith.science/pith/2CTSDWGA3PBINZ3G2KHGTK4ZC4/bundle.json","state":"https://pith.science/pith/2CTSDWGA3PBINZ3G2KHGTK4ZC4/state.json","well_known_bundle":"https://pith.science/.well-known/pith/2CTSDWGA3PBINZ3G2KHGTK4ZC4/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2024:2CTSDWGA3PBINZ3G2KHGTK4ZC4","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":"cd2b2510fbae8abea5628e6d80e57aa6cb842e2f1dbc8f970d7698f3be8fc0ff","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2024-08-28T18:39:56Z","title_canon_sha256":"9afa8be587833585947d19152bdccc6547b63e07edc4e8c8a6670dd4623e2438"},"schema_version":"1.0","source":{"id":"2408.16794","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2408.16794","created_at":"2026-07-05T10:43:38Z"},{"alias_kind":"arxiv_version","alias_value":"2408.16794v2","created_at":"2026-07-05T10:43:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2408.16794","created_at":"2026-07-05T10:43:38Z"},{"alias_kind":"pith_short_12","alias_value":"2CTSDWGA3PBI","created_at":"2026-07-05T10:43:38Z"},{"alias_kind":"pith_short_16","alias_value":"2CTSDWGA3PBINZ3G","created_at":"2026-07-05T10:43:38Z"},{"alias_kind":"pith_short_8","alias_value":"2CTSDWGA","created_at":"2026-07-05T10:43:38Z"}],"graph_snapshots":[{"event_id":"sha256:cbf2bb4584efa9e3293ca69d2b8ac16a6e0799be8ff790bbdb7282a1a3bb7eeb","target":"graph","created_at":"2026-07-05T10:43:38Z","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/2408.16794/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Quantum algorithms claim significant speedup over their classical counterparts for solving many problems. An important aspect of many of these algorithms is the existence of a quantum oracle, which needs to be implemented efficiently in order to realize the claimed advantages. A quantum random access memory (QRAM) is a promising architecture for realizing these oracles. In this paper we develop a new design for QRAM and implement it with Clifford+T circuit. We focus on optimizing the T-count and T-depth since non-Clifford gates are the most expensive to implement fault-tolerantly. Integral to ","authors_text":"Priyanka Mukhopadhyay","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2024-08-28T18:39:56Z","title":"A quantum random access memory (QRAM) using a polynomial encoding of binary strings"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2408.16794","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:a821653c6123b5056640b169d645b5f0c8b4e998d492ea7797c53ea8366b73f4","target":"record","created_at":"2026-07-05T10:43:38Z","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":"cd2b2510fbae8abea5628e6d80e57aa6cb842e2f1dbc8f970d7698f3be8fc0ff","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by-nc-nd/4.0/","primary_cat":"quant-ph","submitted_at":"2024-08-28T18:39:56Z","title_canon_sha256":"9afa8be587833585947d19152bdccc6547b63e07edc4e8c8a6670dd4623e2438"},"schema_version":"1.0","source":{"id":"2408.16794","kind":"arxiv","version":2}},"canonical_sha256":"d0a721d8c0dbc286e766d28e69ab991708f13acebd634654c92b6ff380973557","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"d0a721d8c0dbc286e766d28e69ab991708f13acebd634654c92b6ff380973557","first_computed_at":"2026-07-05T10:43:38.778499Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T10:43:38.778499Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"QTyOuVknQyzLCrCovLLvvVGxfH2lQAwTxiHhWf2VGOa8NfvF/xk5a/qcpkWbcwKlmPnl8/5E6/idBj1U7s8EBw==","signature_status":"signed_v1","signed_at":"2026-07-05T10:43:38.778967Z","signed_message":"canonical_sha256_bytes"},"source_id":"2408.16794","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:a821653c6123b5056640b169d645b5f0c8b4e998d492ea7797c53ea8366b73f4","sha256:cbf2bb4584efa9e3293ca69d2b8ac16a6e0799be8ff790bbdb7282a1a3bb7eeb"],"state_sha256":"d696df00443d980c13bbd7e7b39ca875846657067f6ca509607378f9e7dca400"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"HWvt6VoS8P8GvfO4vjZ8hC54TvWM6+OTRvewtZvz9RywhYBmx0cfRHssoMByRndmXmYT2hlx9sBQfWLAoPDBBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-07T09:21:20.462755Z","bundle_sha256":"95b8ec01de50cbebbca0fb67c2ed059d1424f5e22148fee6cc1e23741455336f"}}