{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:U2A7VLWLQ7O63MQZYOQUL7GTTA","short_pith_number":"pith:U2A7VLWL","canonical_record":{"source":{"id":"2206.11772","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-06-23T15:13:46Z","cross_cats_sorted":[],"title_canon_sha256":"9abdfcc013f669e18c58a225d564297257cf3e5ed4afe3dfc140615b9a155bb1","abstract_canon_sha256":"16c601f282a576c4576c567ee8cd0e36a3464c433a554733dc1f6084447cecc6"},"schema_version":"1.0"},"canonical_sha256":"a681faaecb87ddedb219c3a145fcd39802df48ea6a3cae76cfbb2d2d787f6299","source":{"kind":"arxiv","id":"2206.11772","version":4},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.11772","created_at":"2026-07-05T08:05:46Z"},{"alias_kind":"arxiv_version","alias_value":"2206.11772v4","created_at":"2026-07-05T08:05:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.11772","created_at":"2026-07-05T08:05:46Z"},{"alias_kind":"pith_short_12","alias_value":"U2A7VLWLQ7O6","created_at":"2026-07-05T08:05:46Z"},{"alias_kind":"pith_short_16","alias_value":"U2A7VLWLQ7O63MQZ","created_at":"2026-07-05T08:05:46Z"},{"alias_kind":"pith_short_8","alias_value":"U2A7VLWL","created_at":"2026-07-05T08:05:46Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:U2A7VLWLQ7O63MQZYOQUL7GTTA","target":"record","payload":{"canonical_record":{"source":{"id":"2206.11772","kind":"arxiv","version":4},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-06-23T15:13:46Z","cross_cats_sorted":[],"title_canon_sha256":"9abdfcc013f669e18c58a225d564297257cf3e5ed4afe3dfc140615b9a155bb1","abstract_canon_sha256":"16c601f282a576c4576c567ee8cd0e36a3464c433a554733dc1f6084447cecc6"},"schema_version":"1.0"},"canonical_sha256":"a681faaecb87ddedb219c3a145fcd39802df48ea6a3cae76cfbb2d2d787f6299","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T08:05:46.626601Z","signature_b64":"r6ziDv/E5i9KWEIjOTmRZvt0sJ4UTlsKPNXE7e2hm22mbLYEwUWKr+pxmnJq/tfZiiZozMHsuV3TClU98P6WCQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a681faaecb87ddedb219c3a145fcd39802df48ea6a3cae76cfbb2d2d787f6299","last_reissued_at":"2026-07-05T08:05:46.626145Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T08:05:46.626145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2206.11772","source_version":4,"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-05T08:05:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"oLlC3eN57pxtGou3+0h7EjdA09sPFBKQaVkC5WtuCUthdBmB5CF/KDHsJbG1Jlg8dRDjkF59fdAdLE0oeARBCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T17:18:03.859427Z"},"content_sha256":"70d7caf3e02b440b57cfeeacc804e1ddf4c93e3bdadd836907dc5225818ea6b3","schema_version":"1.0","event_id":"sha256:70d7caf3e02b440b57cfeeacc804e1ddf4c93e3bdadd836907dc5225818ea6b3"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:U2A7VLWLQ7O63MQZYOQUL7GTTA","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Double-bracket quantum algorithms for diagonalization","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Marek Gluza","submitted_at":"2022-06-23T15:13:46Z","abstract_excerpt":"This work proposes double-bracket iterations as a framework for obtaining diagonalizing quantum circuits. Their implementation on a quantum computer consists of interlacing evolutions generated by the input Hamiltonian with diagonal evolutions which can be chosen variationally. No qubit overheads or controlled-unitary operations are needed but the method is recursive which makes the circuit depth grow exponentially with the number of recursion steps. To make near-term implementations viable, the proposal includes optimization of diagonal evolution generators and of recursion step durations. In"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.11772","kind":"arxiv","version":4},"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/2206.11772/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-05T08:05:46Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"hULegOb/2KpkUPxeLttsjdGYA+CeHAJXFGm6hPs6r5A/Tb8M8sFbcGJHReHiNTpsYKwnlXeQuVCx6eTT2dkvCg==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-10T17:18:03.860058Z"},"content_sha256":"61fe6120e61dc731402d09fad20bcd650ec579bd1e357f294b6d069e0ba6223d","schema_version":"1.0","event_id":"sha256:61fe6120e61dc731402d09fad20bcd650ec579bd1e357f294b6d069e0ba6223d"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/U2A7VLWLQ7O63MQZYOQUL7GTTA/bundle.json","state_url":"https://pith.science/pith/U2A7VLWLQ7O63MQZYOQUL7GTTA/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/U2A7VLWLQ7O63MQZYOQUL7GTTA/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-10T17:18:03Z","links":{"resolver":"https://pith.science/pith/U2A7VLWLQ7O63MQZYOQUL7GTTA","bundle":"https://pith.science/pith/U2A7VLWLQ7O63MQZYOQUL7GTTA/bundle.json","state":"https://pith.science/pith/U2A7VLWLQ7O63MQZYOQUL7GTTA/state.json","well_known_bundle":"https://pith.science/.well-known/pith/U2A7VLWLQ7O63MQZYOQUL7GTTA/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:U2A7VLWLQ7O63MQZYOQUL7GTTA","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":"16c601f282a576c4576c567ee8cd0e36a3464c433a554733dc1f6084447cecc6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-06-23T15:13:46Z","title_canon_sha256":"9abdfcc013f669e18c58a225d564297257cf3e5ed4afe3dfc140615b9a155bb1"},"schema_version":"1.0","source":{"id":"2206.11772","kind":"arxiv","version":4}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2206.11772","created_at":"2026-07-05T08:05:46Z"},{"alias_kind":"arxiv_version","alias_value":"2206.11772v4","created_at":"2026-07-05T08:05:46Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2206.11772","created_at":"2026-07-05T08:05:46Z"},{"alias_kind":"pith_short_12","alias_value":"U2A7VLWLQ7O6","created_at":"2026-07-05T08:05:46Z"},{"alias_kind":"pith_short_16","alias_value":"U2A7VLWLQ7O63MQZ","created_at":"2026-07-05T08:05:46Z"},{"alias_kind":"pith_short_8","alias_value":"U2A7VLWL","created_at":"2026-07-05T08:05:46Z"}],"graph_snapshots":[{"event_id":"sha256:61fe6120e61dc731402d09fad20bcd650ec579bd1e357f294b6d069e0ba6223d","target":"graph","created_at":"2026-07-05T08:05:46Z","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/2206.11772/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"This work proposes double-bracket iterations as a framework for obtaining diagonalizing quantum circuits. Their implementation on a quantum computer consists of interlacing evolutions generated by the input Hamiltonian with diagonal evolutions which can be chosen variationally. No qubit overheads or controlled-unitary operations are needed but the method is recursive which makes the circuit depth grow exponentially with the number of recursion steps. To make near-term implementations viable, the proposal includes optimization of diagonal evolution generators and of recursion step durations. In","authors_text":"Marek Gluza","cross_cats":[],"headline":"","license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-06-23T15:13:46Z","title":"Double-bracket quantum algorithms for diagonalization"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2206.11772","kind":"arxiv","version":4},"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:70d7caf3e02b440b57cfeeacc804e1ddf4c93e3bdadd836907dc5225818ea6b3","target":"record","created_at":"2026-07-05T08:05:46Z","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":"16c601f282a576c4576c567ee8cd0e36a3464c433a554733dc1f6084447cecc6","cross_cats_sorted":[],"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2022-06-23T15:13:46Z","title_canon_sha256":"9abdfcc013f669e18c58a225d564297257cf3e5ed4afe3dfc140615b9a155bb1"},"schema_version":"1.0","source":{"id":"2206.11772","kind":"arxiv","version":4}},"canonical_sha256":"a681faaecb87ddedb219c3a145fcd39802df48ea6a3cae76cfbb2d2d787f6299","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a681faaecb87ddedb219c3a145fcd39802df48ea6a3cae76cfbb2d2d787f6299","first_computed_at":"2026-07-05T08:05:46.626145Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T08:05:46.626145Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"r6ziDv/E5i9KWEIjOTmRZvt0sJ4UTlsKPNXE7e2hm22mbLYEwUWKr+pxmnJq/tfZiiZozMHsuV3TClU98P6WCQ==","signature_status":"signed_v1","signed_at":"2026-07-05T08:05:46.626601Z","signed_message":"canonical_sha256_bytes"},"source_id":"2206.11772","source_kind":"arxiv","source_version":4}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:70d7caf3e02b440b57cfeeacc804e1ddf4c93e3bdadd836907dc5225818ea6b3","sha256:61fe6120e61dc731402d09fad20bcd650ec579bd1e357f294b6d069e0ba6223d"],"state_sha256":"be58fdf30a8ff1d6ce1ae2a20be5a6eec353d03816f1669ef18b02a0646f306f"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"69HkURSZzV6zuBlOcVavWY7EAqepMjx3h1IoeZdSM2XieHHkmhVz+nXJ1Vwu9qjswfx95I7A/d92cIlkiKcJCg==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-10T17:18:03.865037Z","bundle_sha256":"c1f8735ad15399f143af627280109e6a6db5e0ccecc74ee14001f647ccf8da9a"}}