{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2022:OOCNQHROCVX2IJG6XACNUASAHJ","short_pith_number":"pith:OOCNQHRO","canonical_record":{"source":{"id":"2202.06976","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-02-14T19:00:06Z","cross_cats_sorted":[],"title_canon_sha256":"97a34bf025cd76533bb3c8a8a4d1bb66c4d5e042f91a32b67dbce432722345f5","abstract_canon_sha256":"57e5299ddc19bfa25f40e5f95f8a071bcd2f9b81e20e94f468fee3e9246b88f9"},"schema_version":"1.0"},"canonical_sha256":"7384d81e2e156fa424deb804da02403a692f6e422070800b3447dfd1e96ec0f1","source":{"kind":"arxiv","id":"2202.06976","version":2},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.06976","created_at":"2026-07-05T06:29:29Z"},{"alias_kind":"arxiv_version","alias_value":"2202.06976v2","created_at":"2026-07-05T06:29:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.06976","created_at":"2026-07-05T06:29:29Z"},{"alias_kind":"pith_short_12","alias_value":"OOCNQHROCVX2","created_at":"2026-07-05T06:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"OOCNQHROCVX2IJG6","created_at":"2026-07-05T06:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"OOCNQHRO","created_at":"2026-07-05T06:29:29Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2022:OOCNQHROCVX2IJG6XACNUASAHJ","target":"record","payload":{"canonical_record":{"source":{"id":"2202.06976","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-02-14T19:00:06Z","cross_cats_sorted":[],"title_canon_sha256":"97a34bf025cd76533bb3c8a8a4d1bb66c4d5e042f91a32b67dbce432722345f5","abstract_canon_sha256":"57e5299ddc19bfa25f40e5f95f8a071bcd2f9b81e20e94f468fee3e9246b88f9"},"schema_version":"1.0"},"canonical_sha256":"7384d81e2e156fa424deb804da02403a692f6e422070800b3447dfd1e96ec0f1","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:29:29.471780Z","signature_b64":"PoasT+G9fHvW4c/gBwDE7kF2aqUwEj5IxDNHfQwITweawCclScfANGgQocCs7eWF97YG2r8n/ArZeCmNUq8bDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"7384d81e2e156fa424deb804da02403a692f6e422070800b3447dfd1e96ec0f1","last_reissued_at":"2026-07-05T06:29:29.471357Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:29:29.471357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"2202.06976","source_version":2,"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-05T06:29:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"JkCAtlMWwnu6Guz5QU/IcnY7N60dqpMWGDDOCDBNFjT83hNxkBlOMB9zxNnMa2xtzIdK6yJ6x5LVbaYVsqy7Ag==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T00:47:36.837452Z"},"content_sha256":"882e6e5d90c4ebafe1a1ba43858509769991f52a467f371a6339573561f8bacb","schema_version":"1.0","event_id":"sha256:882e6e5d90c4ebafe1a1ba43858509769991f52a467f371a6339573561f8bacb"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2022:OOCNQHROCVX2IJG6XACNUASAHJ","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Optimizing quantum circuits with Riemannian gradient flow","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Nathan Killoran, Roeland Wiersema","submitted_at":"2022-02-14T19:00:06Z","abstract_excerpt":"Variational quantum algorithms are a promising class of algorithms that can be performed on currently available quantum computers. In most settings, the free parameters of a variational circuit are optimized using a classical optimizer that updates parameters in Euclidean geometry. Since quantum circuits are elements of the special unitary group, we can consider an alternative optimization perspective that depends on the structure of this group. In this work, we investigate a Riemannian optimization scheme over the special unitary group and we discuss its implementation on a quantum computer. "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.06976","kind":"arxiv","version":2},"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/2202.06976/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-05T06:29:29Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"afcMaoOc491v5V4hXYn3bu2uGuX4q4b3mo6yGZ7m3BRi+BFDNdCrzrfRgGmsD65nr6TA2jHEdVcpblfJ8adpAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-08-06T00:47:36.837753Z"},"content_sha256":"a6c7b0eb6a49e794dbf18147ca655c79d3044c30743c7bb0bb32a1ec754403bf","schema_version":"1.0","event_id":"sha256:a6c7b0eb6a49e794dbf18147ca655c79d3044c30743c7bb0bb32a1ec754403bf"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/OOCNQHROCVX2IJG6XACNUASAHJ/bundle.json","state_url":"https://pith.science/pith/OOCNQHROCVX2IJG6XACNUASAHJ/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/OOCNQHROCVX2IJG6XACNUASAHJ/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-06T00:47:36Z","links":{"resolver":"https://pith.science/pith/OOCNQHROCVX2IJG6XACNUASAHJ","bundle":"https://pith.science/pith/OOCNQHROCVX2IJG6XACNUASAHJ/bundle.json","state":"https://pith.science/pith/OOCNQHROCVX2IJG6XACNUASAHJ/state.json","well_known_bundle":"https://pith.science/.well-known/pith/OOCNQHROCVX2IJG6XACNUASAHJ/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2022:OOCNQHROCVX2IJG6XACNUASAHJ","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":"57e5299ddc19bfa25f40e5f95f8a071bcd2f9b81e20e94f468fee3e9246b88f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-02-14T19:00:06Z","title_canon_sha256":"97a34bf025cd76533bb3c8a8a4d1bb66c4d5e042f91a32b67dbce432722345f5"},"schema_version":"1.0","source":{"id":"2202.06976","kind":"arxiv","version":2}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"2202.06976","created_at":"2026-07-05T06:29:29Z"},{"alias_kind":"arxiv_version","alias_value":"2202.06976v2","created_at":"2026-07-05T06:29:29Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2202.06976","created_at":"2026-07-05T06:29:29Z"},{"alias_kind":"pith_short_12","alias_value":"OOCNQHROCVX2","created_at":"2026-07-05T06:29:29Z"},{"alias_kind":"pith_short_16","alias_value":"OOCNQHROCVX2IJG6","created_at":"2026-07-05T06:29:29Z"},{"alias_kind":"pith_short_8","alias_value":"OOCNQHRO","created_at":"2026-07-05T06:29:29Z"}],"graph_snapshots":[{"event_id":"sha256:a6c7b0eb6a49e794dbf18147ca655c79d3044c30743c7bb0bb32a1ec754403bf","target":"graph","created_at":"2026-07-05T06:29:29Z","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/2202.06976/integrity.json","findings":[],"snapshot_sha256":"c28c3603d3b5d939e8dc4c7e95fa8dfce3d595e45f758748cecf8e644a296938","summary":{"advisory":0,"by_detector":{},"critical":0,"informational":0}},"paper":{"abstract_excerpt":"Variational quantum algorithms are a promising class of algorithms that can be performed on currently available quantum computers. In most settings, the free parameters of a variational circuit are optimized using a classical optimizer that updates parameters in Euclidean geometry. Since quantum circuits are elements of the special unitary group, we can consider an alternative optimization perspective that depends on the structure of this group. In this work, we investigate a Riemannian optimization scheme over the special unitary group and we discuss its implementation on a quantum computer. ","authors_text":"Nathan Killoran, Roeland Wiersema","cross_cats":[],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-02-14T19:00:06Z","title":"Optimizing quantum circuits with Riemannian gradient flow"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2202.06976","kind":"arxiv","version":2},"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:882e6e5d90c4ebafe1a1ba43858509769991f52a467f371a6339573561f8bacb","target":"record","created_at":"2026-07-05T06:29:29Z","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":"57e5299ddc19bfa25f40e5f95f8a071bcd2f9b81e20e94f468fee3e9246b88f9","cross_cats_sorted":[],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2022-02-14T19:00:06Z","title_canon_sha256":"97a34bf025cd76533bb3c8a8a4d1bb66c4d5e042f91a32b67dbce432722345f5"},"schema_version":"1.0","source":{"id":"2202.06976","kind":"arxiv","version":2}},"canonical_sha256":"7384d81e2e156fa424deb804da02403a692f6e422070800b3447dfd1e96ec0f1","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"7384d81e2e156fa424deb804da02403a692f6e422070800b3447dfd1e96ec0f1","first_computed_at":"2026-07-05T06:29:29.471357Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-07-05T06:29:29.471357Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"PoasT+G9fHvW4c/gBwDE7kF2aqUwEj5IxDNHfQwITweawCclScfANGgQocCs7eWF97YG2r8n/ArZeCmNUq8bDA==","signature_status":"signed_v1","signed_at":"2026-07-05T06:29:29.471780Z","signed_message":"canonical_sha256_bytes"},"source_id":"2202.06976","source_kind":"arxiv","source_version":2}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:882e6e5d90c4ebafe1a1ba43858509769991f52a467f371a6339573561f8bacb","sha256:a6c7b0eb6a49e794dbf18147ca655c79d3044c30743c7bb0bb32a1ec754403bf"],"state_sha256":"99cb58e958bc6bf4d5a475fabf1466d5e10ec88171582d673abd86bb07d62b34"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"H3riLhqBJ+YgsQCkJvRbS/05DM6I7MA8ecBNEeEW/TEB+brtPTdyzmOQ54ElVwNRXgBpkeOxdMxACvLL58VwDQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-08-06T00:47:36.841042Z","bundle_sha256":"4092e0c84cc7f60b8c62fb76e3e52c62bb7d555bc98883b9c6a8ba1548052c09"}}