{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2019:MFG2THZK36HVSQ3HYIEWFYC5JK","short_pith_number":"pith:MFG2THZK","schema_version":"1.0","canonical_sha256":"614da99f2adf8f594367c20962e05d4a92f4235f88d9d512a4f50e895a0442e8","source":{"kind":"arxiv","id":"1909.01048","version":1},"attestation_state":"computed","paper":{"title":"Training Optimization for Gate-Model Quantum Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Laszlo Gyongyosi, Sandor Imre","submitted_at":"2019-09-03T10:33:08Z","abstract_excerpt":"Gate-based quantum computations represent an essential to realize near-term quantum computer architectures. A gate-model quantum neural network (QNN) is a QNN implemented on a gate-model quantum computer, realized via a set of unitaries with associated gate parameters. Here, we define a training optimization procedure for gate-model QNNs. By deriving the environmental attributes of the gate-model quantum network, we prove the constraint-based learning models. We show that the optimal learning procedures are different if side information is available in different directions, and if side informa"},"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":"1909.01048","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2019-09-03T10:33:08Z","cross_cats_sorted":["cs.IT","math.IT"],"title_canon_sha256":"862a6e7a4ec154d507b16d4cbc16ab441d633432b87cc3a04da9e20b3360e41d","abstract_canon_sha256":"6f3a724372cf66432f8888d90ddb388cce81137ddcede72cc0a58589611c9ead"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T00:01:15.374696Z","signature_b64":"MJC/LxNwYxRIHjtlE2rG02qusC6Dz7AlKx7vqas2kFgLoDnkEvBWdorN3wL84OQ9pO8D+yCoScK+NZZC9JLVDg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"614da99f2adf8f594367c20962e05d4a92f4235f88d9d512a4f50e895a0442e8","last_reissued_at":"2026-07-05T00:01:15.374305Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T00:01:15.374305Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Training Optimization for Gate-Model Quantum Neural Networks","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.IT","math.IT"],"primary_cat":"quant-ph","authors_text":"Laszlo Gyongyosi, Sandor Imre","submitted_at":"2019-09-03T10:33:08Z","abstract_excerpt":"Gate-based quantum computations represent an essential to realize near-term quantum computer architectures. A gate-model quantum neural network (QNN) is a QNN implemented on a gate-model quantum computer, realized via a set of unitaries with associated gate parameters. Here, we define a training optimization procedure for gate-model QNNs. By deriving the environmental attributes of the gate-model quantum network, we prove the constraint-based learning models. We show that the optimal learning procedures are different if side information is available in different directions, and if side informa"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1909.01048","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/1909.01048/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":"1909.01048","created_at":"2026-07-05T00:01:15.374368+00:00"},{"alias_kind":"arxiv_version","alias_value":"1909.01048v1","created_at":"2026-07-05T00:01:15.374368+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1909.01048","created_at":"2026-07-05T00:01:15.374368+00:00"},{"alias_kind":"pith_short_12","alias_value":"MFG2THZK36HV","created_at":"2026-07-05T00:01:15.374368+00:00"},{"alias_kind":"pith_short_16","alias_value":"MFG2THZK36HVSQ3H","created_at":"2026-07-05T00:01:15.374368+00:00"},{"alias_kind":"pith_short_8","alias_value":"MFG2THZK","created_at":"2026-07-05T00:01:15.374368+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/MFG2THZK36HVSQ3HYIEWFYC5JK","json":"https://pith.science/pith/MFG2THZK36HVSQ3HYIEWFYC5JK.json","graph_json":"https://pith.science/api/pith-number/MFG2THZK36HVSQ3HYIEWFYC5JK/graph.json","events_json":"https://pith.science/api/pith-number/MFG2THZK36HVSQ3HYIEWFYC5JK/events.json","paper":"https://pith.science/paper/MFG2THZK"},"agent_actions":{"view_html":"https://pith.science/pith/MFG2THZK36HVSQ3HYIEWFYC5JK","download_json":"https://pith.science/pith/MFG2THZK36HVSQ3HYIEWFYC5JK.json","view_paper":"https://pith.science/paper/MFG2THZK","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1909.01048&json=true","fetch_graph":"https://pith.science/api/pith-number/MFG2THZK36HVSQ3HYIEWFYC5JK/graph.json","fetch_events":"https://pith.science/api/pith-number/MFG2THZK36HVSQ3HYIEWFYC5JK/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/MFG2THZK36HVSQ3HYIEWFYC5JK/action/timestamp_anchor","attest_storage":"https://pith.science/pith/MFG2THZK36HVSQ3HYIEWFYC5JK/action/storage_attestation","attest_author":"https://pith.science/pith/MFG2THZK36HVSQ3HYIEWFYC5JK/action/author_attestation","sign_citation":"https://pith.science/pith/MFG2THZK36HVSQ3HYIEWFYC5JK/action/citation_signature","submit_replication":"https://pith.science/pith/MFG2THZK36HVSQ3HYIEWFYC5JK/action/replication_record"}},"created_at":"2026-07-05T00:01:15.374368+00:00","updated_at":"2026-07-05T00:01:15.374368+00:00"}