{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:2RSQ3YSZKJW5MNIEBREOB4I36T","short_pith_number":"pith:2RSQ3YSZ","schema_version":"1.0","canonical_sha256":"d4650de259526dd635040c48e0f11bf4c40211f066dbaf80124b8eace5267479","source":{"kind":"arxiv","id":"1904.00043","version":2},"attestation_state":"computed","paper":{"title":"Quantum Generative Adversarial Networks for Learning and Loading Random Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aur\\'elien Lucchi, Christa Zoufal, Stefan Woerner","submitted_at":"2019-03-29T18:44:28Z","abstract_excerpt":"Quantum algorithms have the potential to outperform their classical counterparts in a variety of tasks. The realization of the advantage often requires the ability to load classical data efficiently into quantum states. However, the best known methods require $\\mathcal{O}\\left(2^n\\right)$ gates to load an exact representation of a generic data structure into an $n$-qubit state. This scaling can easily predominate the complexity of a quantum algorithm and, thereby, impair potential quantum advantage. Our work presents a hybrid quantum-classical algorithm for efficient, approximate quantum state"},"verification_status":{"content_addressed":true,"pith_receipt":true,"author_attested":false,"weak_author_claims":0,"strong_author_claims":0,"externally_anchored":false,"storage_verified":false,"citation_signatures":0,"replication_records":0,"graph_snapshot":true,"references_resolved":false,"formal_links_present":false},"canonical_record":{"source":{"id":"1904.00043","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-03-29T18:44:28Z","cross_cats_sorted":[],"title_canon_sha256":"9bb2ed2705a8569e3892eefb5e6f56583ce58ba2b0a9088724699c2010a54e61","abstract_canon_sha256":"c3a34f448694029f6ea72008a4873b806c7f43ddc2a5ea8833bf77356824e13c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:24:06.848782Z","signature_b64":"hwvh4KP++6PXICDqwCmYjxOyZXbi/rrLvpC8HFdwnVExyynK8OuwEvs1dvgr240YY6rck20WVVM4j+B1LMYKBw==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d4650de259526dd635040c48e0f11bf4c40211f066dbaf80124b8eace5267479","last_reissued_at":"2026-07-05T00:24:06.848306Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:24:06.848306Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Quantum Generative Adversarial Networks for Learning and Loading Random Distributions","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Aur\\'elien Lucchi, Christa Zoufal, Stefan Woerner","submitted_at":"2019-03-29T18:44:28Z","abstract_excerpt":"Quantum algorithms have the potential to outperform their classical counterparts in a variety of tasks. The realization of the advantage often requires the ability to load classical data efficiently into quantum states. However, the best known methods require $\\mathcal{O}\\left(2^n\\right)$ gates to load an exact representation of a generic data structure into an $n$-qubit state. This scaling can easily predominate the complexity of a quantum algorithm and, thereby, impair potential quantum advantage. Our work presents a hybrid quantum-classical algorithm for efficient, approximate quantum state"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1904.00043","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/1904.00043/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"},"aliases":[{"alias_kind":"arxiv","alias_value":"1904.00043","created_at":"2026-07-05T00:24:06.848376+00:00"},{"alias_kind":"arxiv_version","alias_value":"1904.00043v2","created_at":"2026-07-05T00:24:06.848376+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1904.00043","created_at":"2026-07-05T00:24:06.848376+00:00"},{"alias_kind":"pith_short_12","alias_value":"2RSQ3YSZKJW5","created_at":"2026-07-05T00:24:06.848376+00:00"},{"alias_kind":"pith_short_16","alias_value":"2RSQ3YSZKJW5MNIE","created_at":"2026-07-05T00:24:06.848376+00:00"},{"alias_kind":"pith_short_8","alias_value":"2RSQ3YSZ","created_at":"2026-07-05T00:24:06.848376+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"1908.10778","citing_title":"Classical versus Quantum Models in Machine Learning: Insights from a Finance Application","ref_index":10,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/2RSQ3YSZKJW5MNIEBREOB4I36T","json":"https://pith.science/pith/2RSQ3YSZKJW5MNIEBREOB4I36T.json","graph_json":"https://pith.science/api/pith-number/2RSQ3YSZKJW5MNIEBREOB4I36T/graph.json","events_json":"https://pith.science/api/pith-number/2RSQ3YSZKJW5MNIEBREOB4I36T/events.json","paper":"https://pith.science/paper/2RSQ3YSZ"},"agent_actions":{"view_html":"https://pith.science/pith/2RSQ3YSZKJW5MNIEBREOB4I36T","download_json":"https://pith.science/pith/2RSQ3YSZKJW5MNIEBREOB4I36T.json","view_paper":"https://pith.science/paper/2RSQ3YSZ","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1904.00043&json=true","fetch_graph":"https://pith.science/api/pith-number/2RSQ3YSZKJW5MNIEBREOB4I36T/graph.json","fetch_events":"https://pith.science/api/pith-number/2RSQ3YSZKJW5MNIEBREOB4I36T/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/2RSQ3YSZKJW5MNIEBREOB4I36T/action/timestamp_anchor","attest_storage":"https://pith.science/pith/2RSQ3YSZKJW5MNIEBREOB4I36T/action/storage_attestation","attest_author":"https://pith.science/pith/2RSQ3YSZKJW5MNIEBREOB4I36T/action/author_attestation","sign_citation":"https://pith.science/pith/2RSQ3YSZKJW5MNIEBREOB4I36T/action/citation_signature","submit_replication":"https://pith.science/pith/2RSQ3YSZKJW5MNIEBREOB4I36T/action/replication_record"}},"created_at":"2026-07-05T00:24:06.848376+00:00","updated_at":"2026-07-05T00:24:06.848376+00:00"}