{"paper":{"title":"Quantum dynamics of two $XX$ interacting PT-symmetric non-Hermitian qubits: enhancement of quantum annealing","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"Adding small PT-symmetric non-Hermitian terms to two interacting qubits greatly enhances the probability of reaching the ground state in quantum annealing.","cross_cats":[],"primary_cat":"quant-ph","authors_text":"Ilya M. Eremin, Mikhail V. Fistul, Yana Komissarova","submitted_at":"2026-05-13T05:02:12Z","abstract_excerpt":"Quantum information platforms enable analog quantum simulations, such as quantum annealing, offering a promising route to solving complex combinatorial optimization problems. Here, we propose a quantum information architecture based on networks of interacting parity-time (PT)-symmetric non-Hermitian qubits. While the dynamics of individual PT-symmetric qubits have been experimentally demonstrated across multiple platforms including NV centers, superconducting circuits, and trapped-ion systems yet coherent dynamics in interacting systems remain largely unexplored. To address this issue we theor"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"adding even tiny PT-symmetric non-Hermitian terms in the qubits Hamiltonian allows to greatly enhance the probability of reaching the ground state after annealing.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The model assumes fully coherent unitary evolution with no decoherence or environmental noise, and that the PT-symmetric non-Hermitian terms can be engineered and controlled in physical qubit platforms.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"Tiny PT-symmetric non-Hermitian terms added to two XX-coupled qubits increase the success probability of reaching the ground state in quantum annealing.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"Adding small PT-symmetric non-Hermitian terms to two interacting qubits greatly enhances the probability of reaching the ground state in quantum annealing.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"cb0244731cd690d1c7088992ee3f1a07f54d244f0041799ba2ee82379969a9fd"},"source":{"id":"2605.13008","kind":"arxiv","version":1},"verdict":{"id":"98fb58c4-336b-4fdc-acd3-5480ea216dc3","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T19:15:05.973041Z","strongest_claim":"adding even tiny PT-symmetric non-Hermitian terms in the qubits Hamiltonian allows to greatly enhance the probability of reaching the ground state after annealing.","one_line_summary":"Tiny PT-symmetric non-Hermitian terms added to two XX-coupled qubits increase the success probability of reaching the ground state in quantum annealing.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The model assumes fully coherent unitary evolution with no decoherence or environmental noise, and that the PT-symmetric non-Hermitian terms can be engineered and controlled in physical qubit platforms.","pith_extraction_headline":"Adding small PT-symmetric non-Hermitian terms to two interacting qubits greatly enhances the probability of reaching the ground state in quantum annealing."},"references":{"count":61,"sample":[{"doi":"","year":null,"title":"(5) and can be represented as 4×4 matrix: ˆH=   sϵ(1−s) ∆ 2 (1−s) ∆ 2 0 (1−s) ∆ 2 −2iγ sg(1−s) ∆ 2 (1−s) ∆ 2 sg2iγ(1−s) ∆ 2 0 (1−s) ∆ 2 (1−s) ∆ 2 −sϵ   .(6) III. TWO INTERACTINGPT–SYMMETRIC QU","work_id":"6e96725e-53b6-4471-8b89-d522e22126ac","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2015,"title":"D. Mehta and C. Grosan, A collection of challenging opti- mization problems in science, engineering and economics, in2015 IEEE Congress on Evolutionary Computation (CEC)(IEEE, 2015) pp. 2697–2704","work_id":"b9195152-42a4-45c4-8306-5e84889cc3ba","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1983,"title":"S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, Optimiza- tion by simulated annealing, Science220, 671 (1983)","work_id":"ea890f0e-9948-4b57-b753-a2a2901fe660","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2017,"title":"R. Sioshansi, A. J. Conejo,et al., Optimization in en- gineering, Cham: Springer International Publishing120 (2017)","work_id":"5d971ea5-b858-4d91-b878-ae825c3611f7","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1959,"title":"G. B. Dantzig and J. H. Ramser, The truck dispatching problem, Management Science6, 80 (1959)","work_id":"3446a5e1-4c7e-4410-9b77-8b0e155ecd30","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":61,"snapshot_sha256":"b5515909a92338e25946085f548e4d02b0d939a6b0c0b69b81e293063b7dacde","internal_anchors":1},"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"}