<?xml version="1.0" encoding="UTF-8"?><urlset xmlns="http://www.sitemaps.org/schemas/sitemap/0.9" xmlns:news="http://www.google.com/schemas/sitemap-news/0.9"><url><loc>https://thequantuminformation.com/p/noisy-local-quantum-circuits-become</loc><news:news><news:publication><news:name>The Quantum Information</news:name><news:language>en</news:language></news:publication><news:publication_date>2026-10-03T15:05:55+00:00</news:publication_date><news:title>Noisy Local Quantum Circuits Become Classically Samplable at Constant Depth</news:title></news:news></url><url><loc>https://thequantuminformation.com/p/deciding-when-two-graph-states-are</loc><news:news><news:publication><news:name>The Quantum Information</news:name><news:language>en</news:language></news:publication><news:publication_date>2026-10-02T14:00:13+00:00</news:publication_date><news:title>Deciding when two graph states are locally the same, in polynomial time</news:title></news:news></url></urlset>