{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2023:5BWBDAJIIHYKZSPRODNXPJBGEF","short_pith_number":"pith:5BWBDAJI","schema_version":"1.0","canonical_sha256":"e86c11812841f0acc9f170db77a426217afeabf8ca8ba7abcd901a110ba7d748","source":{"kind":"arxiv","id":"2306.17422","version":1},"attestation_state":"computed","paper":{"title":"Variational preparation of entangled states on quantum computers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Le Bin Ho, Nguyen Tan Viet, Vu Tuan Hai","submitted_at":"2023-06-30T06:29:24Z","abstract_excerpt":"We propose a variational approach for preparing entangled quantum states on quantum computers. The methodology involves training a unitary operation to match with a target unitary using the Fubini-Study distance as a cost function. We employ various gradient-based optimization techniques to enhance performance, including Adam and quantum natural gradient. Our investigation showcases the versatility of different ansatzes featuring a hypergraph structure, enabling the preparation of diverse entanglement target states such as GHZ, W, and absolutely maximally entangled states. Remarkably, the circ"},"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":"2306.17422","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2023-06-30T06:29:24Z","cross_cats_sorted":[],"title_canon_sha256":"1dd30a528108c332487167f8710e9a2e3d086b3a317c2565807ddd45cdc4ec82","abstract_canon_sha256":"30ba3581257728c413b42ded969da1b017ced96546753456458a54a44c520480"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T06:26:26.847997Z","signature_b64":"3JThXA0FsMjBsIzDx9muP8njZ9PdrbGt+ME1GFDv0+MqegD667lfpQClUcEs4aHrkn0pdRehotCZbgDTbSK4CA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"e86c11812841f0acc9f170db77a426217afeabf8ca8ba7abcd901a110ba7d748","last_reissued_at":"2026-07-05T06:26:26.847386Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T06:26:26.847386Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Variational preparation of entangled states on quantum computers","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Le Bin Ho, Nguyen Tan Viet, Vu Tuan Hai","submitted_at":"2023-06-30T06:29:24Z","abstract_excerpt":"We propose a variational approach for preparing entangled quantum states on quantum computers. The methodology involves training a unitary operation to match with a target unitary using the Fubini-Study distance as a cost function. We employ various gradient-based optimization techniques to enhance performance, including Adam and quantum natural gradient. Our investigation showcases the versatility of different ansatzes featuring a hypergraph structure, enabling the preparation of diverse entanglement target states such as GHZ, W, and absolutely maximally entangled states. Remarkably, the circ"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2306.17422","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/2306.17422/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":"2306.17422","created_at":"2026-07-05T06:26:26.847448+00:00"},{"alias_kind":"arxiv_version","alias_value":"2306.17422v1","created_at":"2026-07-05T06:26:26.847448+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2306.17422","created_at":"2026-07-05T06:26:26.847448+00:00"},{"alias_kind":"pith_short_12","alias_value":"5BWBDAJIIHYK","created_at":"2026-07-05T06:26:26.847448+00:00"},{"alias_kind":"pith_short_16","alias_value":"5BWBDAJIIHYKZSPR","created_at":"2026-07-05T06:26:26.847448+00:00"},{"alias_kind":"pith_short_8","alias_value":"5BWBDAJI","created_at":"2026-07-05T06:26:26.847448+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":1,"sample":[{"citing_arxiv_id":"2502.10242","citing_title":"Variational optical phase learning on a continuous-variable quantum compiler","ref_index":34,"is_internal_anchor":true}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/5BWBDAJIIHYKZSPRODNXPJBGEF","json":"https://pith.science/pith/5BWBDAJIIHYKZSPRODNXPJBGEF.json","graph_json":"https://pith.science/api/pith-number/5BWBDAJIIHYKZSPRODNXPJBGEF/graph.json","events_json":"https://pith.science/api/pith-number/5BWBDAJIIHYKZSPRODNXPJBGEF/events.json","paper":"https://pith.science/paper/5BWBDAJI"},"agent_actions":{"view_html":"https://pith.science/pith/5BWBDAJIIHYKZSPRODNXPJBGEF","download_json":"https://pith.science/pith/5BWBDAJIIHYKZSPRODNXPJBGEF.json","view_paper":"https://pith.science/paper/5BWBDAJI","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2306.17422&json=true","fetch_graph":"https://pith.science/api/pith-number/5BWBDAJIIHYKZSPRODNXPJBGEF/graph.json","fetch_events":"https://pith.science/api/pith-number/5BWBDAJIIHYKZSPRODNXPJBGEF/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/5BWBDAJIIHYKZSPRODNXPJBGEF/action/timestamp_anchor","attest_storage":"https://pith.science/pith/5BWBDAJIIHYKZSPRODNXPJBGEF/action/storage_attestation","attest_author":"https://pith.science/pith/5BWBDAJIIHYKZSPRODNXPJBGEF/action/author_attestation","sign_citation":"https://pith.science/pith/5BWBDAJIIHYKZSPRODNXPJBGEF/action/citation_signature","submit_replication":"https://pith.science/pith/5BWBDAJIIHYKZSPRODNXPJBGEF/action/replication_record"}},"created_at":"2026-07-05T06:26:26.847448+00:00","updated_at":"2026-07-05T06:26:26.847448+00:00"}