{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2026:6KMUYN3IM2TBU3WQS4EKWIVYEL","short_pith_number":"pith:6KMUYN3I","canonical_record":{"source":{"id":"2607.26478","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-29T05:11:20Z","cross_cats_sorted":["cs.CC","cs.CR"],"title_canon_sha256":"69bd64c3c48d543f6a9193a9e250d76401dc8b8aaa776addaa6d607780531c25","abstract_canon_sha256":"ff80ec88ffa0f6b947c9bba2531354a9051a7f58d13687d8c37446b378c461e7"},"schema_version":"1.0"},"canonical_sha256":"f2994c376866a61a6ed09708ab22b822d2d4474a559305b317fe7039ae11da1b","source":{"kind":"arxiv","id":"2607.26478","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.26478","created_at":"2026-07-30T01:20:37Z"},{"alias_kind":"arxiv_version","alias_value":"2607.26478v1","created_at":"2026-07-30T01:20:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.26478","created_at":"2026-07-30T01:20:37Z"},{"alias_kind":"pith_short_12","alias_value":"6KMUYN3IM2TB","created_at":"2026-07-30T01:20:37Z"},{"alias_kind":"pith_short_16","alias_value":"6KMUYN3IM2TBU3WQ","created_at":"2026-07-30T01:20:37Z"},{"alias_kind":"pith_short_8","alias_value":"6KMUYN3I","created_at":"2026-07-30T01:20:37Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2026:6KMUYN3IM2TBU3WQS4EKWIVYEL","target":"record","payload":{"canonical_record":{"source":{"id":"2607.26478","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-29T05:11:20Z","cross_cats_sorted":["cs.CC","cs.CR"],"title_canon_sha256":"69bd64c3c48d543f6a9193a9e250d76401dc8b8aaa776addaa6d607780531c25","abstract_canon_sha256":"ff80ec88ffa0f6b947c9bba2531354a9051a7f58d13687d8c37446b378c461e7"},"schema_version":"1.0"},"canonical_sha256":"f2994c376866a61a6ed09708ab22b822d2d4474a559305b317fe7039ae11da1b","receipt":{"kind":"pith_receipt","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"f2994c376866a61a6ed09708ab22b822d2d4474a559305b317fe7039ae11da1b","last_reissued_at":"2026-07-30T01:20:37.303769Z","signature_status":"unsigned_v0","first_computed_at":"2026-07-30T01:20:37.303769Z"},"source_kind":"arxiv","source_id":"2607.26478","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-07-30T01:20:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"AraPCzJwCcOoO0mV/7Wwpnac9d9oQY10MUjEYDmYxmC0DVEas5BsNIJtSxPt58obUr2ObYP0qZr9P/fmxv+SAQ==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T03:53:01.235270Z"},"content_sha256":"c44095b8cbfaf4ba0c396d6d1f9607b7719ce2a5fac83f1b53d08fd4d4097c2e","schema_version":"1.0","event_id":"sha256:c44095b8cbfaf4ba0c396d6d1f9607b7719ce2a5fac83f1b53d08fd4d4097c2e"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2026:6KMUYN3IM2TBU3WQS4EKWIVYEL","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Explicit Separations for One-Query Unitary Synthesis","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","headline":"","cross_cats":["cs.CC","cs.CR"],"primary_cat":"quant-ph","authors_text":"Alex Lombardi, Fangqi Dong, Fermi Ma","submitted_at":"2026-07-29T05:11:20Z","abstract_excerpt":"The unitary synthesis problem (Aaronson-Kuperberg, CCC 2007) asks whether every $n$-qubit unitary $U$ is computable by efficient quantum circuits relative to some classical oracle $f = f_U$ depending on $U$. Recently, Lombardi-Ma-Wright (STOC 2024) proved that Haar-random unitaries cannot be efficiently synthesized by algorithms that make 1 query (or poly$(n)$ parallel queries) to an arbitrary classical oracle. In this work, we prove several results about the hardness (and easiness!) of variants of unitary synthesis. Our results include: (1) 1-query vs. 2-query unitary synthesis: we prove 1-qu"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.26478","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":""},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2607.26478/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-30T01:20:37Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"wI4LnOrkblCElXYFI5nWUOxcZ3pfOGL2cjVoZZTjm7pWV3d3nEO/uA7YbzWzKXmYK67sgviGHUIfcF+xi5SjDw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-15T03:53:01.236192Z"},"content_sha256":"19eba91a2adf0afa50beceed5baec004b7ca3e5522388b6221de7d6e842e31b2","schema_version":"1.0","event_id":"sha256:19eba91a2adf0afa50beceed5baec004b7ca3e5522388b6221de7d6e842e31b2"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/6KMUYN3IM2TBU3WQS4EKWIVYEL/bundle.json","state_url":"https://pith.science/pith/6KMUYN3IM2TBU3WQS4EKWIVYEL/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/6KMUYN3IM2TBU3WQS4EKWIVYEL/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-15T03:53:01Z","links":{"resolver":"https://pith.science/pith/6KMUYN3IM2TBU3WQS4EKWIVYEL","bundle":"https://pith.science/pith/6KMUYN3IM2TBU3WQS4EKWIVYEL/bundle.json","state":"https://pith.science/pith/6KMUYN3IM2TBU3WQS4EKWIVYEL/state.json","well_known_bundle":"https://pith.science/.well-known/pith/6KMUYN3IM2TBU3WQS4EKWIVYEL/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2026:6KMUYN3IM2TBU3WQS4EKWIVYEL","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":"ff80ec88ffa0f6b947c9bba2531354a9051a7f58d13687d8c37446b378c461e7","cross_cats_sorted":["cs.CC","cs.CR"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-29T05:11:20Z","title_canon_sha256":"69bd64c3c48d543f6a9193a9e250d76401dc8b8aaa776addaa6d607780531c25"},"schema_version":"1.0","source":{"id":"2607.26478","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2607.26478","created_at":"2026-07-30T01:20:37Z"},{"alias_kind":"arxiv_version","alias_value":"2607.26478v1","created_at":"2026-07-30T01:20:37Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2607.26478","created_at":"2026-07-30T01:20:37Z"},{"alias_kind":"pith_short_12","alias_value":"6KMUYN3IM2TB","created_at":"2026-07-30T01:20:37Z"},{"alias_kind":"pith_short_16","alias_value":"6KMUYN3IM2TBU3WQ","created_at":"2026-07-30T01:20:37Z"},{"alias_kind":"pith_short_8","alias_value":"6KMUYN3I","created_at":"2026-07-30T01:20:37Z"}],"graph_snapshots":[{"event_id":"sha256:19eba91a2adf0afa50beceed5baec004b7ca3e5522388b6221de7d6e842e31b2","target":"graph","created_at":"2026-07-30T01:20:37Z","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/2607.26478/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"The unitary synthesis problem (Aaronson-Kuperberg, CCC 2007) asks whether every $n$-qubit unitary $U$ is computable by efficient quantum circuits relative to some classical oracle $f = f_U$ depending on $U$. Recently, Lombardi-Ma-Wright (STOC 2024) proved that Haar-random unitaries cannot be efficiently synthesized by algorithms that make 1 query (or poly$(n)$ parallel queries) to an arbitrary classical oracle. In this work, we prove several results about the hardness (and easiness!) of variants of unitary synthesis. Our results include: (1) 1-query vs. 2-query unitary synthesis: we prove 1-qu","authors_text":"Alex Lombardi, Fangqi Dong, Fermi Ma","cross_cats":["cs.CC","cs.CR"],"headline":"","license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-29T05:11:20Z","title":"Explicit Separations for One-Query Unitary Synthesis"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2607.26478","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:c44095b8cbfaf4ba0c396d6d1f9607b7719ce2a5fac83f1b53d08fd4d4097c2e","target":"record","created_at":"2026-07-30T01:20:37Z","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":"ff80ec88ffa0f6b947c9bba2531354a9051a7f58d13687d8c37446b378c461e7","cross_cats_sorted":["cs.CC","cs.CR"],"license":"http://creativecommons.org/licenses/by-nc-sa/4.0/","primary_cat":"quant-ph","submitted_at":"2026-07-29T05:11:20Z","title_canon_sha256":"69bd64c3c48d543f6a9193a9e250d76401dc8b8aaa776addaa6d607780531c25"},"schema_version":"1.0","source":{"id":"2607.26478","kind":"arxiv","version":1}},"canonical_sha256":"f2994c376866a61a6ed09708ab22b822d2d4474a559305b317fe7039ae11da1b","receipt":{"builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"f2994c376866a61a6ed09708ab22b822d2d4474a559305b317fe7039ae11da1b","first_computed_at":"2026-07-30T01:20:37.303769Z","kind":"pith_receipt","last_reissued_at":"2026-07-30T01:20:37.303769Z","receipt_version":"0.3","signature_status":"unsigned_v0"},"source_id":"2607.26478","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c44095b8cbfaf4ba0c396d6d1f9607b7719ce2a5fac83f1b53d08fd4d4097c2e","sha256:19eba91a2adf0afa50beceed5baec004b7ca3e5522388b6221de7d6e842e31b2"],"state_sha256":"148bb221dada2d3ae823b6debc80d03b1af33d832e42d0832e094887f4db06b9"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"IUR4EM5FfFqWvP9AwfjiUhflifVSFpzllIz96r1CoZdOA21UybPu4+bxuW3C3RTlIDbA0ijtClkRSg7alIeBAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-15T03:53:01.242934Z","bundle_sha256":"05bfec883f3f88c6b2bee62f3f70174433fb074abf35233c199b4d32e9bfc298"}}