{"paper":{"title":"Quantum chaos with graphs: a silicon photonics plateform","license":"http://creativecommons.org/licenses/by/4.0/","headline":"A silicon photonics platform realizes quantum graphs where mixing chaotic networks show spectral statistics matching random matrix theory predictions, unlike ergodic ones.","cross_cats":["physics.ins-det"],"primary_cat":"quant-ph","authors_text":"B. Dietz, B. Odouard, C. Lafargue, H. Girin, J.-R. Coudevylle, M. Lebental, S. Bittner, X. Ch\\'ecoury","submitted_at":"2026-05-05T09:12:01Z","abstract_excerpt":"We provide a versatile plateform to investigate wave-particle duality. This photonic waveguide network implements quantum (wave) graphs as proposed in the seminal paper by Kottos \\& Smilansky [PRL \\textbf{85} 968 (2000)]. We experimentally demonstrated that the spectral statistics of a mixing (i.e. strongly chaotic) graph follows the predictions of random matrix theory, contrary to an ergodic (i.e. less chaotic) graph, in agreement with the Bohigas-Giannoni-Schmit conjecture [PRL \\textbf{52} 1 (1984)]. This plateform also gives access to the wavefunction patterns, which are expected to verify "},"claims":{"count":4,"items":[{"kind":"strongest_claim","text":"We experimentally demonstrated that the spectral statistics of a mixing (i.e. strongly chaotic) graph follows the predictions of random matrix theory, contrary to an ergodic (i.e. less chaotic) graph, in agreement with the Bohigas-Giannoni-Schmit conjecture.","source":"verdict.strongest_claim","status":"machine_extracted","claim_id":"C1","attestation":"unclaimed"},{"kind":"weakest_assumption","text":"The fabricated photonic waveguide networks precisely realize the intended quantum graph topologies from Kottos and Smilansky without significant fabrication imperfections affecting the measured spectra.","source":"verdict.weakest_assumption","status":"machine_extracted","claim_id":"C2","attestation":"unclaimed"},{"kind":"one_line_summary","text":"A silicon photonics waveguide network implements quantum graphs, experimentally confirming that strongly chaotic versions exhibit random matrix theory spectral statistics unlike less chaotic ones.","source":"verdict.one_line_summary","status":"machine_extracted","claim_id":"C3","attestation":"unclaimed"},{"kind":"headline","text":"A silicon photonics platform realizes quantum graphs where mixing chaotic networks show spectral statistics matching random matrix theory predictions, unlike ergodic ones.","source":"verdict.pith_extraction.headline","status":"machine_extracted","claim_id":"C4","attestation":"unclaimed"}],"snapshot_sha256":"9bb4d68a9798fba14d76879dfd9b7460f41cf90e1af3a4955069c214ce9b5cb5"},"source":{"id":"2605.12538","kind":"arxiv","version":1},"verdict":{"id":"63a10008-5f64-41d3-bb1d-2c3b304e6586","model_set":{"reader":"grok-4.3"},"created_at":"2026-05-14T21:13:49.476659Z","strongest_claim":"We experimentally demonstrated that the spectral statistics of a mixing (i.e. strongly chaotic) graph follows the predictions of random matrix theory, contrary to an ergodic (i.e. less chaotic) graph, in agreement with the Bohigas-Giannoni-Schmit conjecture.","one_line_summary":"A silicon photonics waveguide network implements quantum graphs, experimentally confirming that strongly chaotic versions exhibit random matrix theory spectral statistics unlike less chaotic ones.","pipeline_version":"pith-pipeline@v0.9.0","weakest_assumption":"The fabricated photonic waveguide networks precisely realize the intended quantum graph topologies from Kottos and Smilansky without significant fabrication imperfections affecting the measured spectra.","pith_extraction_headline":"A silicon photonics platform realizes quantum graphs where mixing chaotic networks show spectral statistics matching random matrix theory predictions, unlike ergodic ones."},"references":{"count":54,"sample":[{"doi":"","year":null,"title":"It means that 1 is an eigenvalue ofFcorresponding to the eigenvector (V) i = 1 2B","work_id":"0c1929a2-530b-4cf3-b150-d2a39f8757ae","ref_index":1,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1103/physrevlett.79.4794","year":1997,"title":"T. Kottos and U. Smilansky, Quantum chaos on graphs, Phys. Rev. Lett.79, 10.1103/PhysRevLett.79.4794 (1997)","work_id":"70c7b41d-b7e3-4a69-a12c-1b1b7c2db876","ref_index":2,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":1999,"title":"T. Kottos and U. Smilansky, Periodic Orbit Theory and Spectral Statistics for Quantum Graphs, Ann. Phys.274, 76 (1999)","work_id":"460495ca-7958-4090-9650-f214145f1ac3","ref_index":3,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"","year":2013,"title":"G. Berkolaiko and P. Kuchment,Introduction to Quan- tum Graphs(American Mathematical Society, Provi- dence, RI, 2013)","work_id":"39d2c16e-ec35-4473-b511-6cb33bd5167f","ref_index":4,"cited_arxiv_id":"","is_internal_anchor":false},{"doi":"10.1080/00018730600908042","year":2006,"title":"S. Gnutzmann and U. Smilansky, Quantum graphs: Ap- plications to quantum chaos and universal spectral statis- tics, Adv. Phys.55, 10.1080/00018730600908042 (2006)","work_id":"2293eaf2-49bf-4266-b1d7-844b1abca831","ref_index":5,"cited_arxiv_id":"","is_internal_anchor":false}],"resolved_work":54,"snapshot_sha256":"18a3dc5c9d287f1d08e87097434c93677abff7a271fcc15c1c2b4a7b55674e10","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"}