{"arxiv_id":"2003.01664","incoming":{"papers":14,"sentences":32,"groups":[{"kind":"extends","label":"Builds on it","papers":1,"sentences":3,"quotes":[{"arxiv_id":"2606.30525","title":"Working With Measurement-Based Computations on Qudits","url":"/paper/2606.30525","section":"Introduction","sentence":"In particular, we adapt the qubit gflow concept of `focusing' [ref] to and show that the existence of is equivalent to the existence of focused .","intent_p":0.96,"contests_p":null}]},{"kind":"method_or_tool","label":"Uses its method or tool","papers":1,"sentences":1,"quotes":[{"arxiv_id":"2102.10984","title":"Kindergarden quantum mechanics graduates (...or how I learned to stop gluing LEGO together and love the ZX-calculus)","url":"/paper/2102.10984","section":"Automated circuit optimisation","sentence":"This simplify-and-extract technique for ZX was introduced in [ref] , generalised to a broader family of diagrams in [ref] , and forms the basis of the quantum circuit optimisation tool PyZX [ref] (Fig. [ref]).","intent_p":0.89,"contests_p":null}]},{"kind":"background","label":"Cites it as background","papers":6,"sentences":6,"quotes":[{"arxiv_id":"2403.10864","title":"Multi-controlled Phase Gate Synthesis with ZX-calculus applied to Neutral Atom Hardware","url":"/paper/2403.10864","section":"Circuit extraction","sentence":"Extracting quantum circuits back from graph-like ZX-diagrams where the circuit has only as many qubits as there are outputs/inputs, is so far only possible in polynomial time if the underlying graph has some kind of flow [ref] .","intent_p":0.87,"contests_p":null},{"arxiv_id":"2206.13330","title":"Multi-agent blind quantum computation without universal cluster states","url":"/paper/2206.13330","section":"ZX-Calculus","sentence":"The process of converting a ZX-diagram into a quantum circuit is often referred to as circuit extraction [ref] .","intent_p":0.85,"contests_p":null},{"arxiv_id":"2111.03114","title":"Spin-networks in the ZX-calculus","url":"/paper/2111.03114","section":"The ZXH-calculus","sentence":"It has found use in quantum computation and quantum foundations, for instance in the fields of quantum circuit optimisation, verification and simulation, quantum error correction, and measurement-based quantum computation [ref] .","intent_p":0.88,"contests_p":null},{"arxiv_id":"2606.30525","title":"Working With Measurement-Based Computations on Qudits","url":"/paper/2606.30525","section":"–preserving rewriting","sentence":"Thus, in the qubit case, there is a thriving system of `flow-preserving rewrite rules' [ref] which map some given one-way computation to a different computation implementing the same linear operation.","intent_p":0.8,"contests_p":null},{"arxiv_id":"2103.06610","title":"Completeness of the ZH-calculus","url":"/paper/2103.06610","section":"Introduction","sentence":"One of the best-studied graphical calculi is the ZX-calculus [ref] , which has been applied extensively in the study of quantum circuits and related structures in quantum computation (e.g. measurement-based quantum computing [ref] , fault-tolerant quantum computations [ref] , error-correcting codes [ref] , and circuit optimisation [ref] ).","intent_p":1.0,"contests_p":null}]}],"unlabelled_sentences":22},"outgoing":{"papers":9,"sentences":25,"groups":[{"kind":"extends","label":"Builds on","papers":2,"sentences":4,"quotes":[{"arxiv_id":"1902.03178","title":"Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus","url":"/paper/1902.03178","section":"Circuit extraction","sentence":"The extraction algorithm modifies that of Ref. [ref] so that it can handle measurements in multiples planes (not just the plane).","intent_p":1.0,"contests_p":null},{"arxiv_id":"1903.10477","title":"Reducing T-count with the ZX-calculus","url":"/paper/1903.10477","section":"Removing Clifford vertices","sentence":"Our Lemmas [ref] and [ref] are generalisations of the work found in Ref. [ref] and Ref. [ref] .","intent_p":0.98,"contests_p":null}]},{"kind":"method_or_tool","label":"Uses the method or tool of","papers":3,"sentences":3,"quotes":[{"arxiv_id":"1902.03178","title":"Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus","url":"/paper/1902.03178","section":"Our contributions","sentence":"Combined with the known procedure for transforming a quantum circuit into a measurement pattern using the [ref] , our pattern simplification and circuit extraction procedure can be used to reduce the T-gate count of quantum circuits.","intent_p":0.9,"contests_p":null},{"arxiv_id":"1904.04735","title":"PyZX: Large Scale Automated Diagrammatic Reasoning","url":"/paper/1904.04735","section":"Conclusions and Future Work","sentence":"A Jupyter notebook demonstrating the T-count optimisation is available at <https://github.com/Quantomatic/pyzx/blob/5d409a246857b7600cc9bb0fbc13043d54fb9449/demos/T-count%20Benchmark.ipynb>.] [ref] .","intent_p":0.95,"contests_p":null},{"arxiv_id":"1903.10477","title":"Reducing T-count with the ZX-calculus","url":"/paper/1903.10477","section":"Further pattern optimisation","sentence":"These measurement pattern rewrite rules, seen then as transformations of ZX-diagrams, were used in Ref. [ref] to reduce the T-count of circuits.","intent_p":0.86,"contests_p":null}]},{"kind":"comparison","label":"Compares with","papers":1,"sentences":2,"quotes":[{"arxiv_id":"1903.10477","title":"Reducing T-count with the ZX-calculus","url":"/paper/1903.10477","section":"Conclusions and Future Work","sentence":"Such increases are avoided in the procedure of Ref. [ref] , where two-qubit gates are not resynthesized.","intent_p":0.88,"contests_p":null}]},{"kind":"background","label":"Cites as background","papers":4,"sentences":4,"quotes":[{"arxiv_id":"1902.03178","title":"Graph-theoretic Simplification of Quantum Circuits with the ZX-calculus","url":"/paper/1902.03178","section":"Removing Clifford vertices","sentence":"The `graph-like' studied in Ref. [ref] are MBQC+LC form diagrams where every vertex is measured in the plane.","intent_p":0.8,"contests_p":null},{"arxiv_id":"1903.10477","title":"Reducing T-count with the ZX-calculus","url":"/paper/1903.10477","section":"Phase-gadget form","sentence":"Phase gadgets have been used particularly in the study of circuit optimisation [ref] .","intent_p":0.99,"contests_p":null},{"arxiv_id":"1906.01734","title":"Phase Gadget Synthesis for Shallow Circuits","url":"/paper/1906.01734","section":"Phase-gadget form","sentence":"Phase gadgets have been used particularly in the study of circuit optimisation [ref] .","intent_p":0.99,"contests_p":null},{"arxiv_id":"1911.09039","title":"Techniques to Reduce $\\pi/4$-Parity-Phase Circuits, Motivated by the ZX Calculus","url":"/paper/1911.09039","section":"Phase-gadget form","sentence":"Phase gadgets have been used particularly in the study of circuit optimisation [ref] .","intent_p":0.99,"contests_p":null}]}],"unlabelled_sentences":12},"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":"2003.01664","kind":"model","paper_version":3,"prompt_version":"held-up-v3.5","generated_at":"2026-10-27T23:46:11+00:00","loaded_at":"2026-10-28T01:04:41.376566+00:00","evidence":"substantial","account":[],"groups":[{"kind":"extends","label":"Builds on it","papers":1,"entries":[{"p":1.0,"quote":null,"citing":[{"self":false,"year":2021,"title":"Relating Measurement Patterns to Circuits via Pauli Flow","arxiv_id":"2109.05654"}],"verified":true,"paraphrase":"Extended this paper's work on gflow, along with another work's, to handle a wider class of measurement patterns."}],"papers_all":2,"self_papers":0,"self_entries":[]},{"kind":"method_or_tool","label":"Uses its method or tool","papers":2,"entries":[{"p":0.97,"quote":null,"citing":[{"self":false,"year":2026,"title":"Graphix: A software framework for Measurement-Based Quantum Computation","arxiv_id":"2608.24781"}],"verified":true,"paraphrase":"Implemented the algorithm described in Section 4.1 of this paper, adapting its operations on ZX diagrams to the measurement calculus."},{"p":0.99,"quote":{"text":"The next step was extracting a new quantum circuit from the reduced ZX-graph [ref] .","citing":"2207.07725","section":"Basis Gate Decomposition of $e^-i π𝒮$ for Local Spin $S = 1, 3/2$"},"citing":[{"self":false,"year":2022,"title":"Preparing Valence-Bond-Solid states on noisy intermediate-scale quantum computers","arxiv_id":"2207.07725"}],"verified":true,"paraphrase":"Extracted a new quantum circuit from the reduced ZX-graph using this paper's method."}],"papers_all":8,"self_papers":0,"self_entries":[]}],"counts":{"by_kind":{"extends":2,"method_or_tool":8,"supports_this_paper":1},"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":16,"self_papers":16,"citing_papers":48,"sentences_read":23,"citing_sentences":132,"unambiguous_read":23,"typed_independent":8,"independent_papers":32,"by_kind_independent":{"extends":1,"method_or_tool":7}},"input_sha256":"b4289fc028f493b7873ced4ec30420ea7fb0e57db4bd0b2aecad6ffb36034098","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":"3 later papers by other authors are listed below: 1 built on it and 2 used its method or tool."},"_links":{"html":"https://pith.science/paper/2003.01664"}}