{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2021:LAIJUEEB5G4TBMBR4Z3C5V4WBM","short_pith_number":"pith:LAIJUEEB","schema_version":"1.0","canonical_sha256":"58109a1081e9b930b031e6762ed7960b3b763bf022ed81b22f6fb057bc6a064a","source":{"kind":"arxiv","id":"2109.15304","version":2},"attestation_state":"computed","paper":{"title":"Universal quantum algorithmic cooling on a quantum computer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Jinzhao Sun, Pei Zeng, Xiao Yuan","submitted_at":"2021-09-30T17:50:39Z","abstract_excerpt":"Quantum cooling, a deterministic process that drives any state to the lowest eigenstate, has been widely used from studying ground state properties of chemistry and condensed matter quantum physics, to general optimization problems. However, the cooling procedure is generally non-unitary, hence its realization on a quantum computer either requires deep circuits or assumes specific input states with variational circuits. Here, we propose universal quantum cooling algorithms that overcome these limitations. By utilizing a dual phase representation of decaying functions, we show how to universall"},"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":"2109.15304","kind":"arxiv","version":2},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2021-09-30T17:50:39Z","cross_cats_sorted":["cond-mat.stat-mech","cond-mat.str-el"],"title_canon_sha256":"3dca1058d5588cfa6ae9e517e976480e814f74d7658ed3a67da5ecaa34aaefc0","abstract_canon_sha256":"674fee9b9b13830da26661133084923f872868e786fc0f600bc35a9f76683b5c"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-07-05T04:28:41.236779Z","signature_b64":"wv3kQRBud6LizdDgbX4oPmQyiIxuKlVgN0zeoQYKrXgQheWKPDEY0wtx0SFxCw6W6meAayxD6BSjOqpQpBruDA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"58109a1081e9b930b031e6762ed7960b3b763bf022ed81b22f6fb057bc6a064a","last_reissued_at":"2026-07-05T04:28:41.236307Z","signature_status":"signed_v1","first_computed_at":"2026-07-05T04:28:41.236307Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Universal quantum algorithmic cooling on a quantum computer","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cond-mat.stat-mech","cond-mat.str-el"],"primary_cat":"quant-ph","authors_text":"Jinzhao Sun, Pei Zeng, Xiao Yuan","submitted_at":"2021-09-30T17:50:39Z","abstract_excerpt":"Quantum cooling, a deterministic process that drives any state to the lowest eigenstate, has been widely used from studying ground state properties of chemistry and condensed matter quantum physics, to general optimization problems. However, the cooling procedure is generally non-unitary, hence its realization on a quantum computer either requires deep circuits or assumes specific input states with variational circuits. Here, we propose universal quantum cooling algorithms that overcome these limitations. By utilizing a dual phase representation of decaying functions, we show how to universall"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"2109.15304","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/2109.15304/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":"2109.15304","created_at":"2026-07-05T04:28:41.236376+00:00"},{"alias_kind":"arxiv_version","alias_value":"2109.15304v2","created_at":"2026-07-05T04:28:41.236376+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.2109.15304","created_at":"2026-07-05T04:28:41.236376+00:00"},{"alias_kind":"pith_short_12","alias_value":"LAIJUEEB5G4T","created_at":"2026-07-05T04:28:41.236376+00:00"},{"alias_kind":"pith_short_16","alias_value":"LAIJUEEB5G4TBMBR","created_at":"2026-07-05T04:28:41.236376+00:00"},{"alias_kind":"pith_short_8","alias_value":"LAIJUEEB","created_at":"2026-07-05T04:28:41.236376+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":2,"internal_anchor_count":0,"sample":[{"citing_arxiv_id":"2509.14451","citing_title":"Quasi-Monte Carlo Method for Linear Combination Unitaries via Classical Post-Processing","ref_index":12,"is_internal_anchor":false},{"citing_arxiv_id":"2510.07439","citing_title":"Quantum Filtering and Analysis of Multiplicities in Eigenvalue Spectra","ref_index":38,"is_internal_anchor":false}]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/LAIJUEEB5G4TBMBR4Z3C5V4WBM","json":"https://pith.science/pith/LAIJUEEB5G4TBMBR4Z3C5V4WBM.json","graph_json":"https://pith.science/api/pith-number/LAIJUEEB5G4TBMBR4Z3C5V4WBM/graph.json","events_json":"https://pith.science/api/pith-number/LAIJUEEB5G4TBMBR4Z3C5V4WBM/events.json","paper":"https://pith.science/paper/LAIJUEEB"},"agent_actions":{"view_html":"https://pith.science/pith/LAIJUEEB5G4TBMBR4Z3C5V4WBM","download_json":"https://pith.science/pith/LAIJUEEB5G4TBMBR4Z3C5V4WBM.json","view_paper":"https://pith.science/paper/LAIJUEEB","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=2109.15304&json=true","fetch_graph":"https://pith.science/api/pith-number/LAIJUEEB5G4TBMBR4Z3C5V4WBM/graph.json","fetch_events":"https://pith.science/api/pith-number/LAIJUEEB5G4TBMBR4Z3C5V4WBM/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/LAIJUEEB5G4TBMBR4Z3C5V4WBM/action/timestamp_anchor","attest_storage":"https://pith.science/pith/LAIJUEEB5G4TBMBR4Z3C5V4WBM/action/storage_attestation","attest_author":"https://pith.science/pith/LAIJUEEB5G4TBMBR4Z3C5V4WBM/action/author_attestation","sign_citation":"https://pith.science/pith/LAIJUEEB5G4TBMBR4Z3C5V4WBM/action/citation_signature","submit_replication":"https://pith.science/pith/LAIJUEEB5G4TBMBR4Z3C5V4WBM/action/replication_record"}},"created_at":"2026-07-05T04:28:41.236376+00:00","updated_at":"2026-07-05T04:28:41.236376+00:00"}