{"bundle_type":"pith_open_graph_bundle","bundle_version":"1.0","pith_number":"pith:2018:UQAWMAJ7NKUCPEUX6B2UPV7ZZW","short_pith_number":"pith:UQAWMAJ7","canonical_record":{"source":{"id":"1806.00463","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-06-01T17:41:35Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"12827bca53ab65a4d317e64c8eb8d545874cb90ea16fde31917475aec94824e6","abstract_canon_sha256":"79d58070ff5565afccf8edf6631f480c3705980a303fec46f0e6d439f8ac3ac6"},"schema_version":"1.0"},"canonical_sha256":"a40166013f6aa8279297f07547d7f9cdbd3ae54247c35b117ef206a8a57bbcfc","source":{"kind":"arxiv","id":"1806.00463","version":3},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00463","created_at":"2026-05-17T23:48:34Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00463v3","created_at":"2026-05-17T23:48:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00463","created_at":"2026-05-17T23:48:34Z"},{"alias_kind":"pith_short_12","alias_value":"UQAWMAJ7NKUC","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UQAWMAJ7NKUCPEUX","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UQAWMAJ7","created_at":"2026-05-18T12:32:56Z"}],"events":[{"event_type":"record_created","subject_pith_number":"pith:2018:UQAWMAJ7NKUCPEUX6B2UPV7ZZW","target":"record","payload":{"canonical_record":{"source":{"id":"1806.00463","kind":"arxiv","version":3},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-06-01T17:41:35Z","cross_cats_sorted":["stat.ML"],"title_canon_sha256":"12827bca53ab65a4d317e64c8eb8d545874cb90ea16fde31917475aec94824e6","abstract_canon_sha256":"79d58070ff5565afccf8edf6631f480c3705980a303fec46f0e6d439f8ac3ac6"},"schema_version":"1.0"},"canonical_sha256":"a40166013f6aa8279297f07547d7f9cdbd3ae54247c35b117ef206a8a57bbcfc","receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-17T23:48:34.119642Z","signature_b64":"yZhMa9FVpaDY0GBANaiB3JqzNk8tzhY/eGNoeyqTMNLKA/KnVXSqr9IyhTL6q9lW4qpLAXcSmlxgFVL4Z/XkCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a40166013f6aa8279297f07547d7f9cdbd3ae54247c35b117ef206a8a57bbcfc","last_reissued_at":"2026-05-17T23:48:34.119023Z","signature_status":"signed_v1","first_computed_at":"2026-05-17T23:48:34.119023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"source_kind":"arxiv","source_id":"1806.00463","source_version":3,"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-05-17T23:48:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"N/5OZnOAZqeSrZzNfgHTdycl5J262y2AIL2kBCiaJ0+iokhqMW1/JyVch+oWIpcv6NX5SY1aPoLyxO6lUS2NAw==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:02:07.505537Z"},"content_sha256":"8f724f37a22f48c8cae06d66faefdb9f7818b4d52dfe3c762d490051ea3f9406","schema_version":"1.0","event_id":"sha256:8f724f37a22f48c8cae06d66faefdb9f7818b4d52dfe3c762d490051ea3f9406"},{"event_type":"graph_snapshot","subject_pith_number":"pith:2018:UQAWMAJ7NKUCPEUX6B2UPV7ZZW","target":"graph","payload":{"graph_snapshot":{"paper":{"title":"Adversarial quantum circuit learning for pure state approximation","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["stat.ML"],"primary_cat":"quant-ph","authors_text":"Edward Grant, Leonard Wossnig, Marcello Benedetti, Simone Severini","submitted_at":"2018-06-01T17:41:35Z","abstract_excerpt":"Adversarial learning is one of the most successful approaches to modelling high-dimensional probability distributions from data. The quantum computing community has recently begun to generalize this idea and to look for potential applications. In this work, we derive an adversarial algorithm for the problem of approximating an unknown quantum pure state. Although this could be done on universal quantum computers, the adversarial formulation enables us to execute the algorithm on near-term quantum computers. Two parametrized circuits are optimized in tandem: One tries to approximate the target "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00463","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":""},"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-05-17T23:48:34Z","supersedes":[],"prev_event":null,"signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"GWWxhUKmbVq8lmLQC+QxMA3SaKgP2KulWGSnEV2ZdNSTOW9n1akCWqsrOs5sPsU0/XuY0bKNxpFJqR/VpQ8tBA==","signed_message":"open_graph_event_sha256_bytes","signed_at":"2026-05-28T22:02:07.506195Z"},"content_sha256":"e747a44124e93e75aaeda4ef8e90bcc75b09b7e384a6798ed0d6c0e444d66d13","schema_version":"1.0","event_id":"sha256:e747a44124e93e75aaeda4ef8e90bcc75b09b7e384a6798ed0d6c0e444d66d13"}],"timestamp_proofs":[],"mirror_hints":[{"mirror_type":"https","name":"Pith Resolver","base_url":"https://pith.science","bundle_url":"https://pith.science/pith/UQAWMAJ7NKUCPEUX6B2UPV7ZZW/bundle.json","state_url":"https://pith.science/pith/UQAWMAJ7NKUCPEUX6B2UPV7ZZW/state.json","well_known_bundle_url":"https://pith.science/.well-known/pith/UQAWMAJ7NKUCPEUX6B2UPV7ZZW/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-05-28T22:02:07Z","links":{"resolver":"https://pith.science/pith/UQAWMAJ7NKUCPEUX6B2UPV7ZZW","bundle":"https://pith.science/pith/UQAWMAJ7NKUCPEUX6B2UPV7ZZW/bundle.json","state":"https://pith.science/pith/UQAWMAJ7NKUCPEUX6B2UPV7ZZW/state.json","well_known_bundle":"https://pith.science/.well-known/pith/UQAWMAJ7NKUCPEUX6B2UPV7ZZW/bundle.json"},"state":{"state_type":"pith_open_graph_state","state_version":"1.0","pith_number":"pith:2018:UQAWMAJ7NKUCPEUX6B2UPV7ZZW","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":"79d58070ff5565afccf8edf6631f480c3705980a303fec46f0e6d439f8ac3ac6","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-06-01T17:41:35Z","title_canon_sha256":"12827bca53ab65a4d317e64c8eb8d545874cb90ea16fde31917475aec94824e6"},"schema_version":"1.0","source":{"id":"1806.00463","kind":"arxiv","version":3}},"source_aliases":[{"alias_kind":"arxiv","alias_value":"1806.00463","created_at":"2026-05-17T23:48:34Z"},{"alias_kind":"arxiv_version","alias_value":"1806.00463v3","created_at":"2026-05-17T23:48:34Z"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1806.00463","created_at":"2026-05-17T23:48:34Z"},{"alias_kind":"pith_short_12","alias_value":"UQAWMAJ7NKUC","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_16","alias_value":"UQAWMAJ7NKUCPEUX","created_at":"2026-05-18T12:32:56Z"},{"alias_kind":"pith_short_8","alias_value":"UQAWMAJ7","created_at":"2026-05-18T12:32:56Z"}],"graph_snapshots":[{"event_id":"sha256:e747a44124e93e75aaeda4ef8e90bcc75b09b7e384a6798ed0d6c0e444d66d13","target":"graph","created_at":"2026-05-17T23:48:34Z","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"},"paper":{"abstract_excerpt":"Adversarial learning is one of the most successful approaches to modelling high-dimensional probability distributions from data. The quantum computing community has recently begun to generalize this idea and to look for potential applications. In this work, we derive an adversarial algorithm for the problem of approximating an unknown quantum pure state. Although this could be done on universal quantum computers, the adversarial formulation enables us to execute the algorithm on near-term quantum computers. Two parametrized circuits are optimized in tandem: One tries to approximate the target ","authors_text":"Edward Grant, Leonard Wossnig, Marcello Benedetti, Simone Severini","cross_cats":["stat.ML"],"headline":"","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-06-01T17:41:35Z","title":"Adversarial quantum circuit learning for pure state approximation"},"references":{"count":0,"internal_anchors":0,"resolved_work":0,"sample":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1806.00463","kind":"arxiv","version":3},"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:8f724f37a22f48c8cae06d66faefdb9f7818b4d52dfe3c762d490051ea3f9406","target":"record","created_at":"2026-05-17T23:48:34Z","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":"79d58070ff5565afccf8edf6631f480c3705980a303fec46f0e6d439f8ac3ac6","cross_cats_sorted":["stat.ML"],"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2018-06-01T17:41:35Z","title_canon_sha256":"12827bca53ab65a4d317e64c8eb8d545874cb90ea16fde31917475aec94824e6"},"schema_version":"1.0","source":{"id":"1806.00463","kind":"arxiv","version":3}},"canonical_sha256":"a40166013f6aa8279297f07547d7f9cdbd3ae54247c35b117ef206a8a57bbcfc","receipt":{"algorithm":"ed25519","builder_version":"pith-number-builder-2026-05-17-v1","canonical_sha256":"a40166013f6aa8279297f07547d7f9cdbd3ae54247c35b117ef206a8a57bbcfc","first_computed_at":"2026-05-17T23:48:34.119023Z","key_id":"pith-v1-2026-05","kind":"pith_receipt","last_reissued_at":"2026-05-17T23:48:34.119023Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","receipt_version":"0.3","signature_b64":"yZhMa9FVpaDY0GBANaiB3JqzNk8tzhY/eGNoeyqTMNLKA/KnVXSqr9IyhTL6q9lW4qpLAXcSmlxgFVL4Z/XkCA==","signature_status":"signed_v1","signed_at":"2026-05-17T23:48:34.119642Z","signed_message":"canonical_sha256_bytes"},"source_id":"1806.00463","source_kind":"arxiv","source_version":3}}},"equivocations":[],"invalid_events":[],"applied_event_ids":["sha256:8f724f37a22f48c8cae06d66faefdb9f7818b4d52dfe3c762d490051ea3f9406","sha256:e747a44124e93e75aaeda4ef8e90bcc75b09b7e384a6798ed0d6c0e444d66d13"],"state_sha256":"6ea46997b8cf089de4ff509e75e309fca09d2162218ab3d8e08ee8ff8af89038"},"bundle_signature":{"signature_status":"signed_v1","algorithm":"ed25519","key_id":"pith-v1-2026-05","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54","signature_b64":"jtbIAbQIPd8Ecyb1xenk1XoQBXbRmPYPlXSWn7bzj4TfMdNm+Jhzy6Ocb02JGvOCDgJidO0TK28D4oCGSdvaBQ==","signed_message":"bundle_sha256_bytes","signed_at":"2026-05-28T22:02:07.510657Z","bundle_sha256":"3606814a130d2997ab3aa832de22502dc1030e1eab59d4c96075ae77d0d2c8cc"}}