{"record_type":"pith_number_record","schema_url":"https://pith.science/schemas/pith-number/v1.json","pith_number":"pith:2013:BJGCZ2AACBYCEHF3J2MWNGKIBX","short_pith_number":"pith:BJGCZ2AA","schema_version":"1.0","canonical_sha256":"0a4c2ce8001070221cbb4e996699480dfe21c77f2069cc0163df64d5e7728d48","source":{"kind":"arxiv","id":"1302.6555","version":1},"attestation_state":"computed","paper":{"title":"Non-Hermitian Quantum Annealing in the Antiferromagnetic Ising Chain","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP","physics.comp-ph"],"primary_cat":"quant-ph","authors_text":"Alan R. Bishop, Alexander I. Nesterov, Gennady P. Berman, Juan C. Beas Zepeda","submitted_at":"2013-02-26T19:48:51Z","abstract_excerpt":"A non-Hermitian quantum optimization algorithm is created and used to find the ground state of an antiferromagnetic Ising chain. We demonstrate analytically and numerically (for up to N=1024 spins) that our approach leads to a significant reduction of the annealing time that is proportional to $\\ln N$, which is much less than the time (proportional to $N^2$) required for the quantum annealing based on the corresponding Hermitian algorithm. We propose to use this approach to achieve similar speed-up for NP-complete problems by using classical computers in combination with quantum algorithms."},"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":"1302.6555","kind":"arxiv","version":1},"metadata":{"license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","primary_cat":"quant-ph","submitted_at":"2013-02-26T19:48:51Z","cross_cats_sorted":["math-ph","math.MP","physics.comp-ph"],"title_canon_sha256":"e4d42ea93de65cc457bffce1cdfa0601978f1dd4907dc2653ef5c4f156be3246","abstract_canon_sha256":"bc4ae7b859704bf30cf5504f5974a14cbe03ffca8233c88af3a34bc5dfb51580"},"schema_version":"1.0"},"receipt":{"kind":"pith_receipt","key_id":"pith-v1-2026-05","algorithm":"ed25519","signed_at":"2026-05-18T02:30:15.983887Z","signature_b64":"pcvf8xBLsuG/V/lrQDvNIOk6kWpyqzLH3npfDz9E6VV5zOodus8Iee592WFULRW3t7K9xiZV2RTDz4A1tCqRCA==","signed_message":"canonical_sha256_bytes","builder_version":"pith-number-builder-2026-05-17-v1","receipt_version":"0.3","canonical_sha256":"0a4c2ce8001070221cbb4e996699480dfe21c77f2069cc0163df64d5e7728d48","last_reissued_at":"2026-05-18T02:30:15.983273Z","signature_status":"signed_v1","first_computed_at":"2026-05-18T02:30:15.983273Z","public_key_fingerprint":"8d4b5ee74e4693bcd1df2446408b0d54"},"graph_snapshot":{"paper":{"title":"Non-Hermitian Quantum Annealing in the Antiferromagnetic Ising Chain","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["math-ph","math.MP","physics.comp-ph"],"primary_cat":"quant-ph","authors_text":"Alan R. Bishop, Alexander I. Nesterov, Gennady P. Berman, Juan C. Beas Zepeda","submitted_at":"2013-02-26T19:48:51Z","abstract_excerpt":"A non-Hermitian quantum optimization algorithm is created and used to find the ground state of an antiferromagnetic Ising chain. We demonstrate analytically and numerically (for up to N=1024 spins) that our approach leads to a significant reduction of the annealing time that is proportional to $\\ln N$, which is much less than the time (proportional to $N^2$) required for the quantum annealing based on the corresponding Hermitian algorithm. We propose to use this approach to achieve similar speed-up for NP-complete problems by using classical computers in combination with quantum algorithms."},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1302.6555","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":""},"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":"1302.6555","created_at":"2026-05-18T02:30:15.983373+00:00"},{"alias_kind":"arxiv_version","alias_value":"1302.6555v1","created_at":"2026-05-18T02:30:15.983373+00:00"},{"alias_kind":"doi","alias_value":"10.48550/arxiv.1302.6555","created_at":"2026-05-18T02:30:15.983373+00:00"},{"alias_kind":"pith_short_12","alias_value":"BJGCZ2AACBYC","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_16","alias_value":"BJGCZ2AACBYCEHF3","created_at":"2026-05-18T12:27:38.830355+00:00"},{"alias_kind":"pith_short_8","alias_value":"BJGCZ2AA","created_at":"2026-05-18T12:27:38.830355+00:00"}],"events":[],"event_summary":{},"paper_claims":[],"inbound_citations":{"count":0,"internal_anchor_count":0,"sample":[]},"formal_canon":{"evidence_count":0,"sample":[],"anchors":[]},"links":{"html":"https://pith.science/pith/BJGCZ2AACBYCEHF3J2MWNGKIBX","json":"https://pith.science/pith/BJGCZ2AACBYCEHF3J2MWNGKIBX.json","graph_json":"https://pith.science/api/pith-number/BJGCZ2AACBYCEHF3J2MWNGKIBX/graph.json","events_json":"https://pith.science/api/pith-number/BJGCZ2AACBYCEHF3J2MWNGKIBX/events.json","paper":"https://pith.science/paper/BJGCZ2AA"},"agent_actions":{"view_html":"https://pith.science/pith/BJGCZ2AACBYCEHF3J2MWNGKIBX","download_json":"https://pith.science/pith/BJGCZ2AACBYCEHF3J2MWNGKIBX.json","view_paper":"https://pith.science/paper/BJGCZ2AA","resolve_alias":"https://pith.science/api/pith-number/resolve?arxiv=1302.6555&json=true","fetch_graph":"https://pith.science/api/pith-number/BJGCZ2AACBYCEHF3J2MWNGKIBX/graph.json","fetch_events":"https://pith.science/api/pith-number/BJGCZ2AACBYCEHF3J2MWNGKIBX/events.json","actions":{"anchor_timestamp":"https://pith.science/pith/BJGCZ2AACBYCEHF3J2MWNGKIBX/action/timestamp_anchor","attest_storage":"https://pith.science/pith/BJGCZ2AACBYCEHF3J2MWNGKIBX/action/storage_attestation","attest_author":"https://pith.science/pith/BJGCZ2AACBYCEHF3J2MWNGKIBX/action/author_attestation","sign_citation":"https://pith.science/pith/BJGCZ2AACBYCEHF3J2MWNGKIBX/action/citation_signature","submit_replication":"https://pith.science/pith/BJGCZ2AACBYCEHF3J2MWNGKIBX/action/replication_record"}},"created_at":"2026-05-18T02:30:15.983373+00:00","updated_at":"2026-05-18T02:30:15.983373+00:00"}