{"arxiv_id":"quant-ph/0406168","incoming":{"papers":108,"sentences":175,"groups":[{"kind":"extends","label":"Builds on it","papers":3,"sentences":3,"quotes":[{"arxiv_id":"1002.0085","title":"Framework for classifying logical operators in stabilizer codes","url":"/paper/1002.0085","section":"Introduction","sentence":"Here, we present a new framework which builds on the current techniques [ref] and reveals the non-local correlations in stabilizer codes through the analysis of logical operators in a bi-partition.","intent_p":0.94,"contests_p":null},{"arxiv_id":"2510.00168","title":"Efficient Learning of Structured Quantum Circuits via Pauli Dimensionality and Sparsity","url":"/paper/2510.00168","section":"Mapping to a Block-Diagonal Unitary via Clifford Circuits","sentence":"This result generalizes [ref] and [ref] .","intent_p":1.0,"contests_p":null},{"arxiv_id":"2412.17209","title":"Classical simulability of Clifford+T circuits with Clifford-augmented matrix product states","url":"/paper/2412.17209","section":"Entanglement Rényi Entropy","sentence":"Specifically, this algorithm generalizes the standard entropy-calculation method for stabilizer states [ref] to cases where the product states include magic states, and it outperforms traditional entropy calculation methods that rely on using MPS to simulate entire states, offering a more efficient, albeit still exponential, approach for calculating the entanglement entropy of $(t ≤N)$-doped Clifford circuits.","intent_p":0.99,"contests_p":null}]},{"kind":"method_or_tool","label":"Uses its method or tool","papers":31,"sentences":39,"quotes":[{"arxiv_id":"1901.03322","title":"Quantifying magic for multi-qubit operations","url":"/paper/1901.03322","section":"Dynamic Monte Carlo","sentence":"Notice that for every sample, $L$ convex optimisations are performed, as well as $L$ steps involving the algorithm of Fattal et al. [ref] , which has runtime polynomial in the total number of qubits.","intent_p":1.0,"contests_p":null},{"arxiv_id":"2604.27053","title":"Resolving spurious topological entanglement entropy in stabilizer codes","url":"/paper/2604.27053","section":"Introduction","sentence":"Following the algorithm of Ref. [ref] , we compute the entanglement entropy $S_A(l)$ of region $A$ in Fig. [ref] for the $(3,3)$-BB code with stabilizer generators [ref] 𝒮_1 = < g r a p h i c s > , 𝒮_2 = < g r a p h i c s > .","intent_p":1.0,"contests_p":null},{"arxiv_id":"1910.07427","title":"Quantum error correction codes and absolutely maximally entangled states","url":"/paper/1910.07427","section":"Entanglement corrections to the Ryu-Takayanagi formula","sentence":"From [ref] , we see that this representation can be found in the following way: Let us denote by $P_B$ the projection mapping $g_A⊗g_B$ to $ℐ_A⊗g_B$, and the list of generators by ${g_i}_i$.","intent_p":1.0,"contests_p":null},{"arxiv_id":"2608.19428","title":"Holographic Bit Threads from String-Diagrammatic Quantum Information Flow","url":"/paper/2608.19428","section":"GHZ as a minimal stabilizer prototype: constructing ZX diagrams from Bell blocks","sentence":"Thus, for this simple GHZ example, we have completed the construction: following the canonical-decomposition strategy of Ref. [ref] , we have obtained an explicit LOCC protocol that transforms the resource state into a Bell pair together with decoupled junk.","intent_p":0.88,"contests_p":null},{"arxiv_id":"2607.06050","title":"Genuine Multi-Entropy in the Toric Code","url":"/paper/2607.06050","section":"Toric codes","sentence":"The measure introduced in [ref] is [equation] where $|G|$ denotes the order of the group $G$ and $G_ABC·G_ABD ·G_ACD ·G_BCD$ is the group of all stabilizer elements which are products of stabilizer elements with support over three or fewer number of parties.","intent_p":0.85,"contests_p":null}]},{"kind":"comparison","label":"Compares with it","papers":1,"sentences":2,"quotes":[{"arxiv_id":"0804.1404","title":"Optimal Entanglement Formulas for Entanglement-Assisted Quantum Coding","url":"/paper/0804.1404","section":"Introduction","sentence":"This formula is also a bipartite entanglement measure for a stabilizer state, because it is equivalent to the measure in Ref. [ref] .","intent_p":0.83,"contests_p":null}]},{"kind":"supports_this_paper","label":"Cites it as support","papers":2,"sentences":2,"quotes":[{"arxiv_id":"2606.24368","title":"Intrinsic spectral structure of bipartite nonlocal magic resource","url":"/paper/2606.24368","section":"Spectral universality of BNMR: Local-isometry invariance","sentence":"This result follows directly from the faithfulness of pure-state magic resource measures [ref] and the local equivalence of bipartite stabilizer states to $q$ independent Bell pairs [ref] .","intent_p":0.97,"contests_p":null},{"arxiv_id":"2605.21664","title":"A journey through Flatland: What does the antiflatness of a spectrum teach us?","url":"/paper/2605.21664","section":"Introduction","sentence":"The observation that a stabilizer state has a flat ES [ref] motivates the introduction of a general notion of antiflatness—a measure of how much a spectrum deviates from uniformity.","intent_p":0.99,"contests_p":null}]},{"kind":"background","label":"Cites it as background","papers":15,"sentences":16,"quotes":[{"arxiv_id":"2507.02540","title":"An Algorithm for Estimating $\\alpha$-Stabilizer R\\'enyi Entropies via Purity","url":"/paper/2507.02540","section":"Non-stabilizerness-Entanglement Correlation","sentence":"To explore this, it is essential to understand the interplay between these resources [ref] .","intent_p":0.86,"contests_p":null},{"arxiv_id":"1107.1761","title":"Tripartite Entanglement in Qudit Stabilizer States and Application in Quantum Error Correction","url":"/paper/1107.1761","section":"Bipartition of qudit stabilizer states","sentence":"Entanglement across bipartitions of stabilizer states has been studied in Section 3 of [ref] and [ref] .","intent_p":0.93,"contests_p":null},{"arxiv_id":"0906.2488","title":"Weight of quadratic forms and graph states","url":"/paper/0906.2488","section":"Introduction","sentence":"Besides this, ad hoc measures for quantifying entanglement in graph states have been defined [ref] .","intent_p":0.91,"contests_p":null},{"arxiv_id":"0906.3195","title":"Time Asymptotics and Entanglement Generation of Clifford Quantum Cellular Automata","url":"/paper/0906.3195","section":"Entanglement generation starting from translation-invariant stabilizer states","sentence":"There are several results on the entanglement entropy for stabilizer states in the literature, the most general example would be the formalism developed in [ref] .","intent_p":0.98,"contests_p":null},{"arxiv_id":"2006.16292","title":"A Gap Between the Hypergraph and Stabilizer Entropy Cones","url":"/paper/2006.16292","section":"Discussion","sentence":"Since stabilizer entropies can be understood in terms of algebraic [ref] and phase space formalisms [ref] , it would be interesting to investigate whether there is a precise relation between entropies in these contexts and in our hypergraph models of entanglement for states with hypergraph-realizable entropies.","intent_p":0.95,"contests_p":null}]}],"unlabelled_sentences":113},"outgoing":{"papers":0,"sentences":0,"groups":[],"unlabelled_sentences":0},"claims":[],"thresholds":{"intent_p":0.8,"supports_p":0.95,"contests_p":0.7},"method":"Citing sentences come from each paper's LaTeX source; every \\cite marks the sentence and the works it cites. Pith's classifier typed each sentence. A label is shown at intent probability 0.8 or more (0.95 for support), a contest at 0.7 or more. Measured accuracy against two blind model families is at https://pith.science/accuracy. The quoted sentences are the citing authors' own.","held_up":{"arxiv_id":"quant-ph/0406168","kind":"model","paper_version":1,"prompt_version":"held-up-v3.5","generated_at":"2026-10-27T16:42:12+00:00","loaded_at":"2026-10-28T01:02:47.087299+00:00","evidence":"substantial","account":[],"groups":[{"kind":"method_or_tool","label":"Uses its method or tool","papers":7,"entries":[{"p":1.0,"quote":null,"citing":[{"self":false,"year":2019,"title":"Quantifying magic for multi-qubit operations","arxiv_id":"1901.03322"}],"verified":true,"paraphrase":"Performed steps involving the algorithm of this paper, which has runtime polynomial in the total number of qubits."},{"p":0.87,"quote":null,"citing":[{"self":false,"year":2026,"title":"Exact quantification of nonlocal magic","arxiv_id":"2608.28563"}],"verified":true,"paraphrase":"Used the standard bipartite normal form of pure stabilizer states from this paper."},{"p":1.0,"quote":null,"citing":[{"self":false,"year":2019,"title":"Quantum error correction codes and absolutely maximally entangled states","arxiv_id":"1910.07427"}],"verified":true,"paraphrase":"Said that from this paper it sees how this representation of the generators of the stabiliser group can be found."},{"p":1.0,"quote":null,"citing":[{"self":false,"year":2026,"title":"Resolving spurious topological entanglement entropy in stabilizer codes","arxiv_id":"2604.27053"}],"verified":true,"paraphrase":"Followed the algorithm of this paper to compute the entanglement entropy of a region for the (3,3)-BB code."},{"p":0.88,"quote":{"text":"Thus, for this simple GHZ example, we have completed the construction: following the canonical-decomposition strategy of Ref. [ref] , we have obtained an explicit LOCC protocol that transforms the resource state into a Bell pair together with decoupled junk.","citing":"2608.19428","section":"GHZ as a minimal stabilizer prototype: constructing ZX diagrams from Bell blocks"},"citing":[{"self":false,"year":2026,"title":"Holographic Bit Threads from String-Diagrammatic Quantum Information Flow","arxiv_id":"2608.19428"}],"verified":true,"paraphrase":"Followed the canonical-decomposition strategy of this paper to obtain an explicit LOCC protocol."},{"p":0.96,"quote":{"text":"In the area-law regime, we introduce a minimal coarse-grained stochastic model based on a Bell pair description of entanglement in the stabilizer formalism [ref] .","citing":"2603.29323","section":"Introduction"},"citing":[{"self":false,"year":2026,"title":"On the Entanglement Entropy Distribution of a Hybrid Quantum Circuit","arxiv_id":"2603.29323"}],"verified":true,"paraphrase":"Introduced a minimal coarse-grained stochastic model based on a Bell pair description of entanglement in the stabilizer formalism from this paper."},{"p":0.94,"quote":null,"citing":[{"self":false,"year":2023,"title":"Phase transition in Stabilizer Entropy and efficient purity estimation","arxiv_id":"2302.07895"}],"verified":true,"paraphrase":"Evaluated a quantity with no error by means of O(n^3) shot measurements, citing this paper."}],"papers_all":33,"self_papers":0,"self_entries":[]}],"counts":{"by_kind":{"extends":2,"comparison":1,"method_or_tool":33,"supports_this_paper":2},"dropped":{"relied_on":0,"unknown_ids":0,"account_lines":0,"contest_vetoed":0,"below_threshold":0,"contest_drawback":0,"contest_without_basis":0,"contest_not_one_sentence":0,"contest_on_group_citation":0},"papers_read":21,"self_papers":2,"citing_papers":108,"sentences_read":27,"citing_sentences":173,"unambiguous_read":27,"typed_independent":37,"independent_papers":106,"by_kind_independent":{"extends":1,"comparison":1,"method_or_tool":33,"supports_this_paper":2}},"input_sha256":"12d789989304502dc8b89b88f510ffc5f31ce1ca094fcf41885ec1ea922470c8","method":"For a paper with five or more citing arXiv papers, Pith selected up to 40 citing sentences its citation classifier typed, read those whose citation markers point at this paper alone, and wrote one paraphrase for each later paper in each group, each resting on one sentence. A later paper is listed under a label only when the classifier gives one of its sentences that label at intent probability 0.8 or more (0.95 for support), Pith's reading of the sentence finds that the citing paper itself did it, and a second check of the paraphrase against the sentence passes. The section lists uses only: building on the paper, using its method, tool, data or values, comparing with it and citing it as support. It does not list criticism or disagreement, so their absence says nothing about how the paper has been received. Code counted the papers, wrote the summary from the listed entries, set the evidence level and linked each entry to its citing paper. Quotes are copied from the citing sentence and shown only when the citing paper's licence is CC BY, CC BY-SA or CC0; otherwise the paraphrase is shown. Papers that share an author with this one are listed apart. A paper with fewer citing papers gets a line counted by code, which names uses only: a later paper whose only label is a contest is counted as not described.","line":null,"summary":"7 later papers by other authors are listed below: 7 used its method or tool."},"_links":{"html":"https://pith.science/paper/quant-ph/0406168"}}