{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:LJ3VK5KBFYLPTCRQMZKERJ4VNV","short_pith_number":"pith:LJ3VK5KB","schema_version":"1.0","canonical_sha256":"5a775575412e16f98a30665448a7956d6548bb7e7165412c2b2532fc1d4b1a4c","source":{"kind":"arxiv","id":"2507.17614","version":1},"attestation_state":"computed","paper":{"title":"Comparing performance of variational quantum algorithm simulations on HPC systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"quant-ph","authors_text":"Amine Bentellis, Amit Jamadagni, Burak Mete, Jeanette Miriam Lorenz, Luigi Iapichino, Marco De Pascale, Mario Hern\\'andez Vera, Marita Oliv, Stefan Huber, Tobias Valentin Bauer, Yaknan John Gambo","submitted_at":"2025-07-23T15:46:54Z","abstract_excerpt":"Variational quantum algorithms are of special importance in the research on quantum computing applications because of their applicability to current Noisy Intermediate-Scale Quantum (NISQ) devices. The main building blocks of these algorithms (among them, the definition of the Hamiltonian and of the ansatz, the optimizer) define a relatively large parameter space, making the comparison of results and performance between different approaches and software simulators cumbersome and prone to errors. In this paper, we employ a generic description of the problem, in terms of both Hamiltonian and ans"},"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":"2507.17614","kind":"arxiv","version":1},"metadata":{"license":"http://creativecommons.org/licenses/by/4.0/","primary_cat":"quant-ph","submitted_at":"2025-07-23T15:46:54Z","cross_cats_sorted":["cs.DC"],"title_canon_sha256":"eec50319495bed3f4c1c487414b458bd89c3ff26d59bd2bd366c8008af8f38d5","abstract_canon_sha256":"7bec437c4351ae58911fe600fb683192087fc6ca4bf45370d6bc99de80c37e11"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:42:10.724640Z","signature_b64":"nBDlIetuKlWYQghpQ3SJTdkCTrRhLPRJzeoCmRk6kD9eoivljPI4ZTy7kvU3mTVNZpEs5P4rBGmrBU+oqxn7Bg==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"5a775575412e16f98a30665448a7956d6548bb7e7165412c2b2532fc1d4b1a4c","last_reissued_at":"2026-07-05T11:42:10.724143Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:42:10.724143Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Comparing performance of variational quantum algorithm simulations on HPC systems","license":"http://creativecommons.org/licenses/by/4.0/","headline":"","cross_cats":["cs.DC"],"primary_cat":"quant-ph","authors_text":"Amine Bentellis, Amit Jamadagni, Burak Mete, Jeanette Miriam Lorenz, Luigi Iapichino, Marco De Pascale, Mario Hern\\'andez Vera, Marita Oliv, Stefan Huber, Tobias Valentin Bauer, Yaknan John Gambo","submitted_at":"2025-07-23T15:46:54Z","abstract_excerpt":"Variational quantum algorithms are of special importance in the research on quantum computing applications because of their applicability to current Noisy Intermediate-Scale Quantum (NISQ) devices. The main building blocks of these algorithms (among them, the definition of the Hamiltonian and of the ansatz, the optimizer) define a relatively large parameter space, making the comparison of results and performance between different approaches and software simulators cumbersome and prone to errors. In this paper, we employ a generic description of the problem, in terms of both Hamiltonian and ans"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2507.17614","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/2507.17614/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":"2507.17614","created_at":"2026-07-05T11:42:10.724203+00:00"},{"alias_kind":"arxiv_version","alias_value":"2507.17614v1","created_at":"2026-07-05T11:42:10.724203+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2507.17614","created_at":"2026-07-05T11:42:10.724203+00:00"},{"alias_kind":"pith_short_12","alias_value":"LJ3VK5KBFYLP","created_at":"2026-07-05T11:42:10.724203+00:00"},{"alias_kind":"pith_short_16","alias_value":"LJ3VK5KBFYLPTCRQ","created_at":"2026-07-05T11:42:10.724203+00:00"},{"alias_kind":"pith_short_8","alias_value":"LJ3VK5KB","created_at":"2026-07-05T11:42:10.724203+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":1,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2606.28169","citing_title":"Time Evolution on Hybrid Tensor Networks -- A Novel and Parallelizable Algorithm","ref_index":111,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LJ3VK5KBFYLPTCRQMZKERJ4VNV","json":"https://pith.science/pith/LJ3VK5KBFYLPTCRQMZKERJ4VNV.json","graph_json":"https://pith.science/api/pith-number/LJ3VK5KBFYLPTCRQMZKERJ4VNV/graph.json","events_json":"https://pith.science/api/pith-number/LJ3VK5KBFYLPTCRQMZKERJ4VNV/events.json","paper":"https://pith.science/paper/LJ3VK5KB"},"agent_actions":{"view_html":"https://pith.science/pith/LJ3VK5KBFYLPTCRQMZKERJ4VNV","download_json":"https://pith.science/pith/LJ3VK5KBFYLPTCRQMZKERJ4VNV.json","view_paper":"https://pith.science/paper/LJ3VK5KB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2507.17614&json=true","fetch_graph":"https://pith.science/api/pith-number/LJ3VK5KBFYLPTCRQMZKERJ4VNV/graph.json","fetch_events":"https://pith.science/api/pith-number/LJ3VK5KBFYLPTCRQMZKERJ4VNV/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LJ3VK5KBFYLPTCRQMZKERJ4VNV/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LJ3VK5KBFYLPTCRQMZKERJ4VNV/action/storage_attestation","attest_author":"https://pith.science/pith/LJ3VK5KBFYLPTCRQMZKERJ4VNV/action/author_attestation","sign_citation":"https://pith.science/pith/LJ3VK5KBFYLPTCRQMZKERJ4VNV/action/citation_signature","submit_replication":"https://pith.science/pith/LJ3VK5KBFYLPTCRQMZKERJ4VNV/action/replication_record"}},"created_at":"2026-07-05T11:42:10.724203+00:00","updated_at":"2026-07-05T11:42:10.724203+00:00"}