{"paper":{"title":"Permutation-symmetric quantum trajectories","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A stochastic unraveling that respects weak permutation symmetry exactly reproduces the master equation for N emitters coupled to a shared mode while reducing simulation cost from O(N^5) to O(N^2) for two-level systems.","cross_cats":["cond-mat.mes-hall","cond-mat.quant-gas"],"primary_cat":"quant-ph","authors_text":"Aleksandra A. Ziolkowska, Elliot W. Lloyd, Jonathan Keeling","submitted_at":"2026-05-11T18:08:08Z","abstract_excerpt":"We show how one may perform a stochastic unraveling which respects weak permutation symmetry for models of $N$ emitters coupled to a common system (e.g. a cavity mode). For problems involving 2-level emitters, such an unravelling reduces the computational cost from $\\mathcal{O}(N^5)$ to $\\mathcal{O}(N^2)$, and with additional refinements, allows reduction to $\\mathcal{O}(N)$. This significantly increases the range of system sizes for which one can model exact quantum dynamics of such systems. We further show how the method can also be applied to d-level systems, with computational effort scali"},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We show how one may perform a stochastic unraveling which respects weak permutation symmetry for models of N emitters coupled to a common system (e.g. a cavity mode). For problems involving 2-level emitters, such an unravelling reduces the computational cost from O(N^5) to O(N^2), and with additional refinements, allows reduction to O(N).","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"That a stochastic unraveling can be constructed to respect weak permutation symmetry while exactly reproducing the dynamics of the underlying master equation for the symmetric system.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A permutation-symmetric stochastic unraveling reduces quantum trajectory simulation cost for N two-level emitters from O(N^5) to O(N) while preserving exact average dynamics.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A stochastic unraveling that respects weak permutation symmetry exactly reproduces the master equation for N emitters coupled to a shared mode while reducing simulation cost from O(N^5) to O(N^2) for two-level systems.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"50f36aace56111cc363a18edcefbe2b4bd2b7265dfa09f0a50de8d533fca6f6e"},"source":{"id":"2605.11103","kind":"arxiv","version":2},"verdict":{"id":"d9792981-4ce0-40f0-b651-ed541ba1bc38","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-13T02:47:16.123456Z","strongest_claim":"We show how one may perform a stochastic unraveling which respects weak permutation symmetry for models of N emitters coupled to a common system (e.g. a cavity mode). For problems involving 2-level emitters, such an unravelling reduces the computational cost from O(N^5) to O(N^2), and with additional refinements, allows reduction to O(N).","one_line_summary":"A permutation-symmetric stochastic unraveling reduces quantum trajectory simulation cost for N two-level emitters from O(N^5) to O(N) while preserving exact average dynamics.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"That a stochastic unraveling can be constructed to respect weak permutation symmetry while exactly reproducing the dynamics of the underlying master equation for the symmetric system.","pith_extraction_headline":"A stochastic unraveling that respects weak permutation symmetry exactly reproduces the master equation for N emitters coupled to a shared mode while reducing simulation cost from O(N^5) to O(N^2) for two-level systems."},"integrity":{"clean":true,"summary":{"advisory":0,"critical":0,"by_detector":{},"informational":0},"endpoint":"/pith/2605.11103/integrity.json","findings":[],"available":true,"detectors_run":[{"name":"ai_meta_artifact","ran_at":"2026-05-19T13:36:06.961054Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_title_agreement","ran_at":"2026-05-19T10:31:16.856964Z","status":"completed","version":"1.0.0","findings_count":0},{"name":"doi_compliance","ran_at":"2026-05-19T08:46:58.430133Z","status":"completed","version":"1.0.0","findings_count":0}],"snapshot_sha256":"0fc3a47ec9a09db126cad4a3260212fad2d614aa50fb827d69947acda7c1bf8e"},"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"}