{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2025:3DILHVHG5TAJ6QQ5LUK47SPJHR","short_pith_number":"pith:3DILHVHG","schema_version":"1.0","canonical_sha256":"d8d0b3d4e6ecc09f421d5d15cfc9e93c7185e9d8ce67c44039592d40f70cdfa0","source":{"kind":"arxiv","id":"2505.22924","version":2},"attestation_state":"computed","paper":{"title":"Optimizing QUBO on a quantum computer by mimicking imaginary time evolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alice Di Tucci, Yahui Chai","submitted_at":"2025-05-28T22:56:57Z","abstract_excerpt":"We propose a hybrid quantum-classical algorithm for solving QUBO problems using an Imaginary Time Evolution-Mimicking Circuit (ITEMC). The circuit parameters are optimized to closely mimic imaginary time evolution, using only single- and two-qubit expectation values. This significantly reduces the measurement overhead by avoiding full energy evaluation. By updating the initial state based on results from last step iteratively, the algorithm quickly converges to the low-energy solutions. With a pre-sorting step that optimizes quantum gate ordering based on QUBO coefficients, the convergence is "},"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":"2505.22924","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2025-05-28T22:56:57Z","cross_cats_sorted":[],"title_canon_sha256":"65baec59e25b8e796b5fc558b893c4b347bf275dbeb0281aa3bf8297051de8ab","abstract_canon_sha256":"1e335f00ad5106e20472f8e13277338f9bdf4d2f8a5911b63a17650f8d60fdda"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T11:23:28.826095Z","signature_b64":"VtLOAvmRjnrJGuKHW4YbfDY9VMPMBI7xJmgt88Ai+ETrYG64sPJeGEuxbSTyv+8DVJ5zXwlp8YwdifvD7FTGBQ==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"d8d0b3d4e6ecc09f421d5d15cfc9e93c7185e9d8ce67c44039592d40f70cdfa0","last_reissued_at":"2026-07-05T11:23:28.825593Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T11:23:28.825593Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Optimizing QUBO on a quantum computer by mimicking imaginary time evolution","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Alice Di Tucci, Yahui Chai","submitted_at":"2025-05-28T22:56:57Z","abstract_excerpt":"We propose a hybrid quantum-classical algorithm for solving QUBO problems using an Imaginary Time Evolution-Mimicking Circuit (ITEMC). The circuit parameters are optimized to closely mimic imaginary time evolution, using only single- and two-qubit expectation values. This significantly reduces the measurement overhead by avoiding full energy evaluation. By updating the initial state based on results from last step iteratively, the algorithm quickly converges to the low-energy solutions. With a pre-sorting step that optimizes quantum gate ordering based on QUBO coefficients, the convergence is "},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2505.22924","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/2505.22924/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":"2505.22924","created_at":"2026-07-05T11:23:28.825653+00:00"},{"alias_kind":"arxiv_version","alias_value":"2505.22924v2","created_at":"2026-07-05T11:23:28.825653+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2505.22924","created_at":"2026-07-05T11:23:28.825653+00:00"},{"alias_kind":"pith_short_12","alias_value":"3DILHVHG5TAJ","created_at":"2026-07-05T11:23:28.825653+00:00"},{"alias_kind":"pith_short_16","alias_value":"3DILHVHG5TAJ6QQ5","created_at":"2026-07-05T11:23:28.825653+00:00"},{"alias_kind":"pith_short_8","alias_value":"3DILHVHG","created_at":"2026-07-05T11:23:28.825653+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":3,"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":16,"is_internal_anchor":false},{"citing_arxiv_id":"2509.09148","citing_title":"A penalty-free quantum algorithm to find energy eigenstates","ref_index":32,"is_internal_anchor":false},{"citing_arxiv_id":"2604.26047","citing_title":"Iterative warm-start optimization with quantum imaginary time evolution","ref_index":9,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/3DILHVHG5TAJ6QQ5LUK47SPJHR","json":"https://pith.science/pith/3DILHVHG5TAJ6QQ5LUK47SPJHR.json","graph_json":"https://pith.science/api/pith-number/3DILHVHG5TAJ6QQ5LUK47SPJHR/graph.json","events_json":"https://pith.science/api/pith-number/3DILHVHG5TAJ6QQ5LUK47SPJHR/events.json","paper":"https://pith.science/paper/3DILHVHG"},"agent_actions":{"view_html":"https://pith.science/pith/3DILHVHG5TAJ6QQ5LUK47SPJHR","download_json":"https://pith.science/pith/3DILHVHG5TAJ6QQ5LUK47SPJHR.json","view_paper":"https://pith.science/paper/3DILHVHG","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2505.22924&json=true","fetch_graph":"https://pith.science/api/pith-number/3DILHVHG5TAJ6QQ5LUK47SPJHR/graph.json","fetch_events":"https://pith.science/api/pith-number/3DILHVHG5TAJ6QQ5LUK47SPJHR/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/3DILHVHG5TAJ6QQ5LUK47SPJHR/action/timestamp_anchor","attest_storage":"https://pith.science/pith/3DILHVHG5TAJ6QQ5LUK47SPJHR/action/storage_attestation","attest_author":"https://pith.science/pith/3DILHVHG5TAJ6QQ5LUK47SPJHR/action/author_attestation","sign_citation":"https://pith.science/pith/3DILHVHG5TAJ6QQ5LUK47SPJHR/action/citation_signature","submit_replication":"https://pith.science/pith/3DILHVHG5TAJ6QQ5LUK47SPJHR/action/replication_record"}},"created_at":"2026-07-05T11:23:28.825653+00:00","updated_at":"2026-07-05T11:23:28.825653+00:00"}