{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2020:ZKL6QVW3KRNAWZN2YMZ4N4AASN","short_pith_number":"pith:ZKL6QVW3","canonical_record":{"source":{"id":"2007.10363","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-07-20T18:00:09Z","cross_cats_sorted":[],"title_canon_sha256":"2ef36f9d17436d47662ebaf06c2ec73b47ff9b6fd583744095d3606054ed8dbe","abstract_canon_sha256":"f95f049b9bf26a705322460a51931dd591b4551f364985a419da7a4cff914432"},"schema_version":"1.0"},"canonical_sha256":"ca97e856db545a0b65bac333c6f0009345e94c1a7da275026a8b6e2dea98bcbf","source":{"kind":"arxiv","id":"2007.10363","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.10363","created_at":"2026-07-05T02:12:42Z"},{"alias_kind":"arxiv_version","alias_value":"2007.10363v3","created_at":"2026-07-05T02:12:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.10363","created_at":"2026-07-05T02:12:42Z"},{"alias_kind":"pith_short_12","alias_value":"ZKL6QVW3KRNA","created_at":"2026-07-05T02:12:42Z"},{"alias_kind":"pith_short_16","alias_value":"ZKL6QVW3KRNAWZN2","created_at":"2026-07-05T02:12:42Z"},{"alias_kind":"pith_short_8","alias_value":"ZKL6QVW3","created_at":"2026-07-05T02:12:42Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2020:ZKL6QVW3KRNAWZN2YMZ4N4AASN","target":"record","payload":{"canonical_record":{"source":{"id":"2007.10363","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-07-20T18:00:09Z","cross_cats_sorted":[],"title_canon_sha256":"2ef36f9d17436d47662ebaf06c2ec73b47ff9b6fd583744095d3606054ed8dbe","abstract_canon_sha256":"f95f049b9bf26a705322460a51931dd591b4551f364985a419da7a4cff914432"},"schema_version":"1.0"},"canonical_sha256":"ca97e856db545a0b65bac333c6f0009345e94c1a7da275026a8b6e2dea98bcbf","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T02:12:42.159428Z","signature_b64":"XA9fiawGhC36BYsJBgZdXaGO5eUDfJOp46CBcE8ZGyfxM9iWI2XtuVkTObye8oHDjMgGB3GqwxhJ5L3akbRVAA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"ca97e856db545a0b65bac333c6f0009345e94c1a7da275026a8b6e2dea98bcbf","last_reissued_at":"2026-07-05T02:12:42.159007Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T02:12:42.159007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2007.10363","source_version":3,"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-05T02:12:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"bp6YaS90gg2W6/tSNLIcUiuekRPkaXs/cN48DSCqP2kqFezC0q4PEGEmki7eL/6JvQMeLY/KH7SSUp1y6YDxAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T16:07:33.200492Z"},"content_sha256":"b6219ca31073e27d0aa30d4aeec7e79fbcec9970a501b763cc535c9a732a6ce2","schema_version":"1.0","event_id":"sha256:b6219ca31073e27d0aa30d4aeec7e79fbcec9970a501b763cc535c9a732a6ce2"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2020:ZKL6QVW3KRNAWZN2YMZ4N4AASN","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimal universal programming of unitary gates","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Giulio Chiribella, Renato Renner, Yuxiang Yang","submitted_at":"2020-07-20T18:00:09Z","abstract_excerpt":"A universal quantum processor is a device that takes as input a (quantum) program, containing an encoding of an arbitrary unitary gate, and a (quantum) data register, on which the encoded gate is applied. While no perfect universal quantum processor can exist, approximate processors have been proposed in the past two decades. A fundamental open question is how the size of the smallest quantum program scales with the approximation error. Here we answer the question, by proving a bound on the size of the program and designing a concrete protocol that attains the bound in the asymptotic limit. Ou"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.10363","kind":"arxiv","version":3},"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/2007.10363/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-05T02:12:42Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"Mfayn+3CkzAlx9a+7D71xWuv0/x9QWYVjAFZstL1wOPErtkfOOdKHwBy0M5gfe1HCxfXa+11Sxq3vLGaUOtQCQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T16:07:33.200994Z"},"content_sha256":"5a66ae0087b7eea1bc61c023e7412060d98bad7b10fd7646d88459c7a53b1072","schema_version":"1.0","event_id":"sha256:5a66ae0087b7eea1bc61c023e7412060d98bad7b10fd7646d88459c7a53b1072"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/ZKL6QVW3KRNAWZN2YMZ4N4AASN/bundle.json","state_url":"https://pith.science/pith/ZKL6QVW3KRNAWZN2YMZ4N4AASN/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/ZKL6QVW3KRNAWZN2YMZ4N4AASN/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-06T16:07:33Z","links":{"resolver":"https://pith.science/pith/ZKL6QVW3KRNAWZN2YMZ4N4AASN","bundle":"https://pith.science/pith/ZKL6QVW3KRNAWZN2YMZ4N4AASN/bundle.json","state":"https://pith.science/pith/ZKL6QVW3KRNAWZN2YMZ4N4AASN/state.json","well_known_bundle":"https://pith.science/.well-known/pith/ZKL6QVW3KRNAWZN2YMZ4N4AASN/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2020:ZKL6QVW3KRNAWZN2YMZ4N4AASN","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":"f95f049b9bf26a705322460a51931dd591b4551f364985a419da7a4cff914432","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-07-20T18:00:09Z","title_canon_sha256":"2ef36f9d17436d47662ebaf06c2ec73b47ff9b6fd583744095d3606054ed8dbe"},"schema_version":"1.0","source":{"id":"2007.10363","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2007.10363","created_at":"2026-07-05T02:12:42Z"},{"alias_kind":"arxiv_version","alias_value":"2007.10363v3","created_at":"2026-07-05T02:12:42Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.10363","created_at":"2026-07-05T02:12:42Z"},{"alias_kind":"pith_short_12","alias_value":"ZKL6QVW3KRNA","created_at":"2026-07-05T02:12:42Z"},{"alias_kind":"pith_short_16","alias_value":"ZKL6QVW3KRNAWZN2","created_at":"2026-07-05T02:12:42Z"},{"alias_kind":"pith_short_8","alias_value":"ZKL6QVW3","created_at":"2026-07-05T02:12:42Z"}],"graph_snapshots":[{"event_id":"sha256:5a66ae0087b7eea1bc61c023e7412060d98bad7b10fd7646d88459c7a53b1072","target":"graph","created_at":"2026-07-05T02:12:42Z","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/2007.10363/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"A universal quantum processor is a device that takes as input a (quantum) program, containing an encoding of an arbitrary unitary gate, and a (quantum) data register, on which the encoded gate is applied. While no perfect universal quantum processor can exist, approximate processors have been proposed in the past two decades. A fundamental open question is how the size of the smallest quantum program scales with the approximation error. Here we answer the question, by proving a bound on the size of the program and designing a concrete protocol that attains the bound in the asymptotic limit. Ou","authors_text":"Giulio Chiribella, Renato Renner, Yuxiang Yang","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-07-20T18:00:09Z","title":"Optimal universal programming of unitary gates"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.10363","kind":"arxiv","version":3},"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:b6219ca31073e27d0aa30d4aeec7e79fbcec9970a501b763cc535c9a732a6ce2","target":"record","created_at":"2026-07-05T02:12:42Z","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":"f95f049b9bf26a705322460a51931dd591b4551f364985a419da7a4cff914432","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-07-20T18:00:09Z","title_canon_sha256":"2ef36f9d17436d47662ebaf06c2ec73b47ff9b6fd583744095d3606054ed8dbe"},"schema_version":"1.0","source":{"id":"2007.10363","kind":"arxiv","version":3}},"canonical_sha256":"ca97e856db545a0b65bac333c6f0009345e94c1a7da275026a8b6e2dea98bcbf","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"ca97e856db545a0b65bac333c6f0009345e94c1a7da275026a8b6e2dea98bcbf","first_computed_at":"2026-07-05T02:12:42.159007Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T02:12:42.159007Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"XA9fiawGhC36BYsJBgZdXaGO5eUDfJOp46CBcE8ZGyfxM9iWI2XtuVkTObye8oHDjMgGB3GqwxhJ5L3akbRVAA==","signature_status":"signed_v1","signed_at":"2026-07-05T02:12:42.159428Z","signed_message":"canonical_sha256_bytes"},"source_id":"2007.10363","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:b6219ca31073e27d0aa30d4aeec7e79fbcec9970a501b763cc535c9a732a6ce2","sha256:5a66ae0087b7eea1bc61c023e7412060d98bad7b10fd7646d88459c7a53b1072"],"state_sha256":"498139b9a5d79e4440086ce864c8473e62c591c236ae6d4189671cb97ff0730e"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"xFomqCi9kwAr+0PMq1IyjnEOat2JwLqQLMLTg1ZemBwRzALYc2hSEQGkaOEzbTg9AuKu34J5ykHFcEjrlLTQAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T16:07:33.205002Z","bundle_sha256":"3534cecfd06529c394aa10e859d2fac295cd61c204fb059d417fce09bd22462e"}}