{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2020:U7GQZVCANK5TJK2XS4PFV5YA7Z","short_pith_number":"pith:U7GQZVCA","schema_version":"1.0","canonical_sha256":"a7cd0cd4406abb34ab57971e5af700fe67429ecd27ee292bfe35f7afe6fc855e","source":{"kind":"arxiv","id":"2007.04424","version":1},"attestation_state":"computed","paper":{"title":"MoG-VQE: Multiobjective genetic variational quantum eigensolver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.mes-hall"],"primary_cat":"quant-ph","authors_text":"A. R. Oganov, A. Samarin, D. Chivilikhin, I. Iorsh, O. Kyriienko, V. Ulyantsev","submitted_at":"2020-07-08T20:44:50Z","abstract_excerpt":"Variational quantum eigensolver (VQE) emerged as a first practical algorithm for near-term quantum computers. Its success largely relies on the chosen variational ansatz, corresponding to a quantum circuit that prepares an approximate ground state of a Hamiltonian. Typically, it either aims to achieve high representation accuracy (at the expense of circuit depth), or uses a shallow circuit sacrificing the convergence to the exact ground state energy. Here, we propose the approach which can combine both low depth and improved precision, capitalizing on a genetically-improved ansatz for hardware"},"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":"2007.04424","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2020-07-08T20:44:50Z","cross_cats_sorted":["cond-mat.mes-hall"],"title_canon_sha256":"88b0b3e1c0b8a0c118e79ec5e71f617a41bcf483a2d0453d9cb3a81328f9e3ac","abstract_canon_sha256":"3d3fe09e044dc41ab1ad88407bc2efea14883fa5c74ec01f4097e31e257b6bc5"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T01:17:30.091415Z","signature_b64":"31l9fKZrFEX8uPoCUk5oOOSd/AZMX/KQkRsGNflkbIYPCASr6/Z1Bhfu0B5rh8ub2RT/UjD2s2hLBjI0vijPBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"a7cd0cd4406abb34ab57971e5af700fe67429ecd27ee292bfe35f7afe6fc855e","last_reissued_at":"2026-07-05T01:17:30.090982Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T01:17:30.090982Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"MoG-VQE: Multiobjective genetic variational quantum eigensolver","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.mes-hall"],"primary_cat":"quant-ph","authors_text":"A. R. Oganov, A. Samarin, D. Chivilikhin, I. Iorsh, O. Kyriienko, V. Ulyantsev","submitted_at":"2020-07-08T20:44:50Z","abstract_excerpt":"Variational quantum eigensolver (VQE) emerged as a first practical algorithm for near-term quantum computers. Its success largely relies on the chosen variational ansatz, corresponding to a quantum circuit that prepares an approximate ground state of a Hamiltonian. Typically, it either aims to achieve high representation accuracy (at the expense of circuit depth), or uses a shallow circuit sacrificing the convergence to the exact ground state energy. Here, we propose the approach which can combine both low depth and improved precision, capitalizing on a genetically-improved ansatz for hardware"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2007.04424","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/2007.04424/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":"2007.04424","created_at":"2026-07-05T01:17:30.091037+00:00"},{"alias_kind":"arxiv_version","alias_value":"2007.04424v1","created_at":"2026-07-05T01:17:30.091037+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2007.04424","created_at":"2026-07-05T01:17:30.091037+00:00"},{"alias_kind":"pith_short_12","alias_value":"U7GQZVCANK5T","created_at":"2026-07-05T01:17:30.091037+00:00"},{"alias_kind":"pith_short_16","alias_value":"U7GQZVCANK5TJK2X","created_at":"2026-07-05T01:17:30.091037+00:00"},{"alias_kind":"pith_short_8","alias_value":"U7GQZVCA","created_at":"2026-07-05T01:17:30.091037+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2502.03962","citing_title":"Quantum Circuit Design using a Progressive Widening Enhanced Monte Carlo Tree Search","ref_index":31,"is_internal_anchor":false},{"citing_arxiv_id":"2605.03932","citing_title":"Magic-Informed Quantum Architecture Search","ref_index":3,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/U7GQZVCANK5TJK2XS4PFV5YA7Z","json":"https://pith.science/pith/U7GQZVCANK5TJK2XS4PFV5YA7Z.json","graph_json":"https://pith.science/api/pith-number/U7GQZVCANK5TJK2XS4PFV5YA7Z/graph.json","events_json":"https://pith.science/api/pith-number/U7GQZVCANK5TJK2XS4PFV5YA7Z/events.json","paper":"https://pith.science/paper/U7GQZVCA"},"agent_actions":{"view_html":"https://pith.science/pith/U7GQZVCANK5TJK2XS4PFV5YA7Z","download_json":"https://pith.science/pith/U7GQZVCANK5TJK2XS4PFV5YA7Z.json","view_paper":"https://pith.science/paper/U7GQZVCA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2007.04424&json=true","fetch_graph":"https://pith.science/api/pith-number/U7GQZVCANK5TJK2XS4PFV5YA7Z/graph.json","fetch_events":"https://pith.science/api/pith-number/U7GQZVCANK5TJK2XS4PFV5YA7Z/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/U7GQZVCANK5TJK2XS4PFV5YA7Z/action/timestamp_anchor","attest_storage":"https://pith.science/pith/U7GQZVCANK5TJK2XS4PFV5YA7Z/action/storage_attestation","attest_author":"https://pith.science/pith/U7GQZVCANK5TJK2XS4PFV5YA7Z/action/author_attestation","sign_citation":"https://pith.science/pith/U7GQZVCANK5TJK2XS4PFV5YA7Z/action/citation_signature","submit_replication":"https://pith.science/pith/U7GQZVCANK5TJK2XS4PFV5YA7Z/action/replication_record"}},"created_at":"2026-07-05T01:17:30.091037+00:00","updated_at":"2026-07-05T01:17:30.091037+00:00"}