{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:ZKL6QVW3KRNAWZN2YMZ4N4AASN","short_pith_number":"pith:ZKL6QVW3","schema_version":"1.0","canonical_sha256":"ca97e856db545a0b65bac333c6f0009345e94c1a7da275026a8b6e2dea98bcbf","source":{"kind":"arxiv","id":"2007.10363","version":3},"attestation_state":"computed","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"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"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"},"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"},"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"},"aliases":[{"alias_kind":"arxiv","alias_value":"2007.10363","created_at":"2026-07-05T02:12:42.159062+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.10363v3","created_at":"2026-07-05T02:12:42.159062+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.10363","created_at":"2026-07-05T02:12:42.159062+00:00"},{"alias_kind":"pith_short_12","alias_value":"ZKL6QVW3KRNA","created_at":"2026-07-05T02:12:42.159062+00:00"},{"alias_kind":"pith_short_16","alias_value":"ZKL6QVW3KRNAWZN2","created_at":"2026-07-05T02:12:42.159062+00:00"},{"alias_kind":"pith_short_8","alias_value":"ZKL6QVW3","created_at":"2026-07-05T02:12:42.159062+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2512.21260","citing_title":"Random dilation superchannel","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2507.10784","citing_title":"Quantum Advantage in Storage and Retrieval of Isometry Channels","ref_index":33,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/ZKL6QVW3KRNAWZN2YMZ4N4AASN","json":"https://pith.science/pith/ZKL6QVW3KRNAWZN2YMZ4N4AASN.json","graph_json":"https://pith.science/api/pith-number/ZKL6QVW3KRNAWZN2YMZ4N4AASN/graph.json","events_json":"https://pith.science/api/pith-number/ZKL6QVW3KRNAWZN2YMZ4N4AASN/events.json","paper":"https://pith.science/paper/ZKL6QVW3"},"agent_actions":{"view_html":"https://pith.science/pith/ZKL6QVW3KRNAWZN2YMZ4N4AASN","download_json":"https://pith.science/pith/ZKL6QVW3KRNAWZN2YMZ4N4AASN.json","view_paper":"https://pith.science/paper/ZKL6QVW3","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.10363&json=true","fetch_graph":"https://pith.science/api/pith-number/ZKL6QVW3KRNAWZN2YMZ4N4AASN/graph.json","fetch_events":"https://pith.science/api/pith-number/ZKL6QVW3KRNAWZN2YMZ4N4AASN/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/ZKL6QVW3KRNAWZN2YMZ4N4AASN/action/timestamp_anchor","attest_storage":"https://pith.science/pith/ZKL6QVW3KRNAWZN2YMZ4N4AASN/action/storage_attestation","attest_author":"https://pith.science/pith/ZKL6QVW3KRNAWZN2YMZ4N4AASN/action/author_attestation","sign_citation":"https://pith.science/pith/ZKL6QVW3KRNAWZN2YMZ4N4AASN/action/citation_signature","submit_replication":"https://pith.science/pith/ZKL6QVW3KRNAWZN2YMZ4N4AASN/action/replication_record"}},"created_at":"2026-07-05T02:12:42.159062+00:00","updated_at":"2026-07-05T02:12:42.159062+00:00"}