{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2021:HXPGQOBITOSYPBVVBUWPUBB3RC","short_pith_number":"pith:HXPGQOBI","canonical_record":{"source":{"id":"2110.13439","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-10-26T06:49:44Z","cross_cats_sorted":[],"title_canon_sha256":"023565785780d9187822951086b8e38b2c342cc6a49350591bdd381d54a36ec2","abstract_canon_sha256":"f964e249bc09f4387794d07a522d866ac5db5e0cd5312545f256a2470e6c4262"},"schema_version":"1.0"},"canonical_sha256":"3dde6838289ba58786b50d2cfa043b88aa37a0764588c0793e02527fa504b1b7","source":{"kind":"arxiv","id":"2110.13439","version":1},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.13439","created_at":"2026-07-05T03:25:38Z"},{"alias_kind":"arxiv_version","alias_value":"2110.13439v1","created_at":"2026-07-05T03:25:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.13439","created_at":"2026-07-05T03:25:38Z"},{"alias_kind":"pith_short_12","alias_value":"HXPGQOBITOSY","created_at":"2026-07-05T03:25:38Z"},{"alias_kind":"pith_short_16","alias_value":"HXPGQOBITOSYPBVV","created_at":"2026-07-05T03:25:38Z"},{"alias_kind":"pith_short_8","alias_value":"HXPGQOBI","created_at":"2026-07-05T03:25:38Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2021:HXPGQOBITOSYPBVVBUWPUBB3RC","target":"record","payload":{"canonical_record":{"source":{"id":"2110.13439","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-10-26T06:49:44Z","cross_cats_sorted":[],"title_canon_sha256":"023565785780d9187822951086b8e38b2c342cc6a49350591bdd381d54a36ec2","abstract_canon_sha256":"f964e249bc09f4387794d07a522d866ac5db5e0cd5312545f256a2470e6c4262"},"schema_version":"1.0"},"canonical_sha256":"3dde6838289ba58786b50d2cfa043b88aa37a0764588c0793e02527fa504b1b7","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T03:25:38.834731Z","signature_b64":"S8shbyJ2gC5aki2hMCPp1hTeBh74NVQF+0bXW5iDU+kIcjVTsAakEGFi1QGGe5on1F0r6qK26lnYyxU90c+WCg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"3dde6838289ba58786b50d2cfa043b88aa37a0764588c0793e02527fa504b1b7","last_reissued_at":"2026-07-05T03:25:38.834334Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T03:25:38.834334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2110.13439","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-05T03:25:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hjKMw18GhyxTx54faijaE9yrovuKy8TWLUmPCetqHaLI/3+2CkSJlmHmJJ45kBwfsb8AYYZoKnaqCVkztUYcBg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T18:53:01.049836Z"},"content_sha256":"c5352d44a74d505399202261e9aeac0bec16847a90022e66244aa98cf392532c","schema_version":"1.0","event_id":"sha256:c5352d44a74d505399202261e9aeac0bec16847a90022e66244aa98cf392532c"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2021:HXPGQOBITOSYPBVVBUWPUBB3RC","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Halving the cost of quantum multiplexed rotations","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Guang Hao Low","submitted_at":"2021-10-26T06:49:44Z","abstract_excerpt":"We improve the number of $T$ gates needed for a $b$-bit approximation of a multiplexed quantum gate with $c$ controls applying $n$ single-qubit arbitrary phase rotations from $4n b+\\mathcal{O}(\\sqrt{cn b})$ to $2n b+\\mathcal{O}(\\sqrt{cn b})$, and reduce the number of qubits needed by up to a factor of two. This generic quantum circuit primitive is found in many quantum algorithms, and our results roughly halve the cost of state-of-art electronic structure simulations based on qubitization of double-factorized or tensor-hypercontracted representations. We achieve this by extending recent ideas "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.13439","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/2110.13439/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-05T03:25:38Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"ZcXT3a9Euuyk7AoHRjyR7O9VXirlZ6d+qnxHIGE58zuho/iE8OAxR4BZ8e9kSY0i25v7BCYhyoWP2A37xhreAA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-18T18:53:01.050330Z"},"content_sha256":"6a10befb684143c0aae123ee5d3076d51a3e84e7a8e756e57476b805613e64ee","schema_version":"1.0","event_id":"sha256:6a10befb684143c0aae123ee5d3076d51a3e84e7a8e756e57476b805613e64ee"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/HXPGQOBITOSYPBVVBUWPUBB3RC/bundle.json","state_url":"https://pith.science/pith/HXPGQOBITOSYPBVVBUWPUBB3RC/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/HXPGQOBITOSYPBVVBUWPUBB3RC/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-18T18:53:01Z","links":{"resolver":"https://pith.science/pith/HXPGQOBITOSYPBVVBUWPUBB3RC","bundle":"https://pith.science/pith/HXPGQOBITOSYPBVVBUWPUBB3RC/bundle.json","state":"https://pith.science/pith/HXPGQOBITOSYPBVVBUWPUBB3RC/state.json","well_known_bundle":"https://pith.science/.well-known/pith/HXPGQOBITOSYPBVVBUWPUBB3RC/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2021:HXPGQOBITOSYPBVVBUWPUBB3RC","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":"f964e249bc09f4387794d07a522d866ac5db5e0cd5312545f256a2470e6c4262","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-10-26T06:49:44Z","title_canon_sha256":"023565785780d9187822951086b8e38b2c342cc6a49350591bdd381d54a36ec2"},"schema_version":"1.0","source":{"id":"2110.13439","kind":"arxiv","version":1}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2110.13439","created_at":"2026-07-05T03:25:38Z"},{"alias_kind":"arxiv_version","alias_value":"2110.13439v1","created_at":"2026-07-05T03:25:38Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2110.13439","created_at":"2026-07-05T03:25:38Z"},{"alias_kind":"pith_short_12","alias_value":"HXPGQOBITOSY","created_at":"2026-07-05T03:25:38Z"},{"alias_kind":"pith_short_16","alias_value":"HXPGQOBITOSYPBVV","created_at":"2026-07-05T03:25:38Z"},{"alias_kind":"pith_short_8","alias_value":"HXPGQOBI","created_at":"2026-07-05T03:25:38Z"}],"graph_snapshots":[{"event_id":"sha256:6a10befb684143c0aae123ee5d3076d51a3e84e7a8e756e57476b805613e64ee","target":"graph","created_at":"2026-07-05T03:25: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/2110.13439/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"We improve the number of $T$ gates needed for a $b$-bit approximation of a multiplexed quantum gate with $c$ controls applying $n$ single-qubit arbitrary phase rotations from $4n b+\\mathcal{O}(\\sqrt{cn b})$ to $2n b+\\mathcal{O}(\\sqrt{cn b})$, and reduce the number of qubits needed by up to a factor of two. This generic quantum circuit primitive is found in many quantum algorithms, and our results roughly halve the cost of state-of-art electronic structure simulations based on qubitization of double-factorized or tensor-hypercontracted representations. We achieve this by extending recent ideas ","authors_text":"Guang Hao Low","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-10-26T06:49:44Z","title":"Halving the cost of quantum multiplexed rotations"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2110.13439","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:c5352d44a74d505399202261e9aeac0bec16847a90022e66244aa98cf392532c","target":"record","created_at":"2026-07-05T03:25: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":"f964e249bc09f4387794d07a522d866ac5db5e0cd5312545f256a2470e6c4262","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-10-26T06:49:44Z","title_canon_sha256":"023565785780d9187822951086b8e38b2c342cc6a49350591bdd381d54a36ec2"},"schema_version":"1.0","source":{"id":"2110.13439","kind":"arxiv","version":1}},"canonical_sha256":"3dde6838289ba58786b50d2cfa043b88aa37a0764588c0793e02527fa504b1b7","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"3dde6838289ba58786b50d2cfa043b88aa37a0764588c0793e02527fa504b1b7","first_computed_at":"2026-07-05T03:25:38.834334Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T03:25:38.834334Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"S8shbyJ2gC5aki2hMCPp1hTeBh74NVQF+0bXW5iDU+kIcjVTsAakEGFi1QGGe5on1F0r6qK26lnYyxU90c+WCg==","signature_status":"signed_v1","signed_at":"2026-07-05T03:25:38.834731Z","signed_message":"canonical_sha256_bytes"},"source_id":"2110.13439","source_kind":"arxiv","source_version":1}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:c5352d44a74d505399202261e9aeac0bec16847a90022e66244aa98cf392532c","sha256:6a10befb684143c0aae123ee5d3076d51a3e84e7a8e756e57476b805613e64ee"],"state_sha256":"c9c2d3409b2da8ccead716f3ea3a7dd26a2edccb675a94935bcef39cd38537ef"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"nZWc+8NE6I85ulmBQKij8z/xC4Y+1pzb8zH54Na58siU2OtkCp1G5KLlE4TTK4KxgPi/qQMaj/GqGQsbKfpBAQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-18T18:53:01.055541Z","bundle_sha256":"4b68e3b0b208d6732f0904178415a3074f130296c769c6fe3a59cbca6f7304a7"}}