{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2019:LKA4DY7SPHZX2NQ7SXI5OKVFC6","short_pith_number":"pith:LKA4DY7S","canonical_record":{"source":{"id":"1901.07481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-22T17:40:24Z","cross_cats_sorted":[],"title_canon_sha256":"76317ff7e07916da172dd8ffaffbbd3b02cbfc75bfe2fbe04f34041d68b292c1","abstract_canon_sha256":"7ec3a6032fdb1d02f401d86b5df9698c31908c090ddbe8084c9e0ab9cce3ebb7"},"schema_version":"1.0"},"canonical_sha256":"5a81c1e3f279f37d361f95d1d72aa517be7c32eca839d6869a115bcc4d8c2995","source":{"kind":"arxiv","id":"1901.07481","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07481","created_at":"2026-05-17T23:55:44Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07481v1","created_at":"2026-05-17T23:55:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07481","created_at":"2026-05-17T23:55:44Z"},{"alias_kind":"pith_short_12","alias_value":"LKA4DY7SPHZX","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LKA4DY7SPHZX2NQ7","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LKA4DY7S","created_at":"2026-05-18T12:33:21Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2019:LKA4DY7SPHZX2NQ7SXI5OKVFC6","target":"record","payload":{"canonical_record":{"source":{"id":"1901.07481","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-22T17:40:24Z","cross_cats_sorted":[],"title_canon_sha256":"76317ff7e07916da172dd8ffaffbbd3b02cbfc75bfe2fbe04f34041d68b292c1","abstract_canon_sha256":"7ec3a6032fdb1d02f401d86b5df9698c31908c090ddbe8084c9e0ab9cce3ebb7"},"schema_version":"1.0"},"canonical_sha256":"5a81c1e3f279f37d361f95d1d72aa517be7c32eca839d6869a115bcc4d8c2995","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:55:44.659252Z","signature_b64":"nnIvhheEk2XPNoBTgW8GgRJ5lcRT6EkWlEcm5+b+y5GwnRajINx3dXcHoliOFp3Rl1fG8zsOYLvOs+21uMHOCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a81c1e3f279f37d361f95d1d72aa517be7c32eca839d6869a115bcc4d8c2995","last_reissued_at":"2026-05-17T23:55:44.658719Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:55:44.658719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1901.07481","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-17T23:55:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"qXPY0boFyZu/2xJ/bN86jY0LI/IdNvkfI4Kqf44AylbgqzSPvUyb1MzPvql8tVr1+MzQ4DVTf7RWDxhH10J+Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T07:01:11.125613Z"},"content_sha256":"27ad46509ebdfe241cd9ceba166bfbcb460abf77044c2ebe0ce78800fdf0da07","schema_version":"1.0","event_id":"sha256:27ad46509ebdfe241cd9ceba166bfbcb460abf77044c2ebe0ce78800fdf0da07"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2019:LKA4DY7SPHZX2NQ7SXI5OKVFC6","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Efficiently estimating average fidelity of a quantum logic gate using few classical random bits","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aditya Nema, Pranab Sen","submitted_at":"2019-01-22T17:40:24Z","abstract_excerpt":"We give three new algorithms for efficient in-place estimation, without using ancilla qubits, of average fidelity of a quantum logic gate acting on a d-dimensional system using much fewer random bits than what was known so far. Previous approaches for efficient estimation of average gate fidelity replaced Haar random unitaries in the naive estimation algorithm by approximate unitary 2-designs, and sampled them uniformly and independently. In contrast, in our first algorithm we sample the unitaries of the approximate unitary 2-design uniformly using a limited independence pseudorandom generator"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07481","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-17T23:55:44Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"MZ9M7nPsja+5cPwZjkG5nLY+kLbvo8CcW8YCv4Xrgrj677jvm+h8VpZjmt/8Oc2HYJvyieMagR5twY6oL++MBQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-06-30T07:01:11.125954Z"},"content_sha256":"fed8eb6b21b7f0bf995d4f0a08f305fd6da60b73179918d3f508af94a0808261","schema_version":"1.0","event_id":"sha256:fed8eb6b21b7f0bf995d4f0a08f305fd6da60b73179918d3f508af94a0808261"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/LKA4DY7SPHZX2NQ7SXI5OKVFC6/bundle.json","state_url":"https://pith.science/pith/LKA4DY7SPHZX2NQ7SXI5OKVFC6/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/LKA4DY7SPHZX2NQ7SXI5OKVFC6/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-30T07:01:11Z","links":{"resolver":"https://pith.science/pith/LKA4DY7SPHZX2NQ7SXI5OKVFC6","bundle":"https://pith.science/pith/LKA4DY7SPHZX2NQ7SXI5OKVFC6/bundle.json","state":"https://pith.science/pith/LKA4DY7SPHZX2NQ7SXI5OKVFC6/state.json","well_known_bundle":"https://pith.science/.well-known/pith/LKA4DY7SPHZX2NQ7SXI5OKVFC6/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2019:LKA4DY7SPHZX2NQ7SXI5OKVFC6","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":"7ec3a6032fdb1d02f401d86b5df9698c31908c090ddbe8084c9e0ab9cce3ebb7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-22T17:40:24Z","title_canon_sha256":"76317ff7e07916da172dd8ffaffbbd3b02cbfc75bfe2fbe04f34041d68b292c1"},"schema_version":"1.0","source":{"id":"1901.07481","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1901.07481","created_at":"2026-05-17T23:55:44Z"},{"alias_kind":"arxiv_version","alias_value":"1901.07481v1","created_at":"2026-05-17T23:55:44Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1901.07481","created_at":"2026-05-17T23:55:44Z"},{"alias_kind":"pith_short_12","alias_value":"LKA4DY7SPHZX","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_16","alias_value":"LKA4DY7SPHZX2NQ7","created_at":"2026-05-18T12:33:21Z"},{"alias_kind":"pith_short_8","alias_value":"LKA4DY7S","created_at":"2026-05-18T12:33:21Z"}],"graph_snapshots":[{"event_id":"sha256:fed8eb6b21b7f0bf995d4f0a08f305fd6da60b73179918d3f508af94a0808261","target":"graph","created_at":"2026-05-17T23:55:44Z","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 give three new algorithms for efficient in-place estimation, without using ancilla qubits, of average fidelity of a quantum logic gate acting on a d-dimensional system using much fewer random bits than what was known so far. Previous approaches for efficient estimation of average gate fidelity replaced Haar random unitaries in the naive estimation algorithm by approximate unitary 2-designs, and sampled them uniformly and independently. In contrast, in our first algorithm we sample the unitaries of the approximate unitary 2-design uniformly using a limited independence pseudorandom generator","authors_text":"Aditya Nema, Pranab Sen","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-22T17:40:24Z","title":"Efficiently estimating average fidelity of a quantum logic gate using few classical random bits"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.07481","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:27ad46509ebdfe241cd9ceba166bfbcb460abf77044c2ebe0ce78800fdf0da07","target":"record","created_at":"2026-05-17T23:55:44Z","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":"7ec3a6032fdb1d02f401d86b5df9698c31908c090ddbe8084c9e0ab9cce3ebb7","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-01-22T17:40:24Z","title_canon_sha256":"76317ff7e07916da172dd8ffaffbbd3b02cbfc75bfe2fbe04f34041d68b292c1"},"schema_version":"1.0","source":{"id":"1901.07481","kind":"arxiv","version":1}},"canonical_sha256":"5a81c1e3f279f37d361f95d1d72aa517be7c32eca839d6869a115bcc4d8c2995","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"5a81c1e3f279f37d361f95d1d72aa517be7c32eca839d6869a115bcc4d8c2995","first_computed_at":"2026-05-17T23:55:44.658719Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:55:44.658719Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"nnIvhheEk2XPNoBTgW8GgRJ5lcRT6EkWlEcm5+b+y5GwnRajINx3dXcHoliOFp3Rl1fG8zsOYLvOs+21uMHOCg==","signature_status":"signed_v1","signed_at":"2026-05-17T23:55:44.659252Z","signed_message":"canonical_sha256_bytes"},"source_id":"1901.07481","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:27ad46509ebdfe241cd9ceba166bfbcb460abf77044c2ebe0ce78800fdf0da07","sha256:fed8eb6b21b7f0bf995d4f0a08f305fd6da60b73179918d3f508af94a0808261"],"state_sha256":"3cf55a397b769f10630179a9141e14a029a193d7fe06f6b0a5b56012d21b2aba"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"86ChRuQGndNZLf2Qz4SPTb5r7CkQ1ORu6uuILOZlJoxxIjy1Ae4fZyrXU8e1phIK00JqEMTuDfF3ZBSZJIYoAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-06-30T07:01:11.127766Z","bundle_sha256":"e8e872fd6e8985a35cc0ed08eae2c3725ff48807e2aeb037a42c429b6e9f5dca"}}