Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-07-31T02:42:14.736309Z
Paper Citation Record · LEDGER
Explicit Matrices over $\mathbb Z_2$ with CNOT and Row Complexity $4n-\mathrm{o}(n)$ and Local Logic Gates
As of 19 August 2026, this Paper Citation Record lists 23 of 23 outbound references and 0 inbound Pith citation observations for arXiv:2607.28598.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-19T06:32:44.657259+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links
A source-named dated measurement, never combined with another source.
Source: cited_works
Reference resolution
23 of 23 outbound references displayed
- verified exact0
- verified fuzzy0
- unresolved23
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 7913aba0-2429-4618-9a06-f446273684c9 · outbound
This paper cites A Quantum Complexity Lowerbound from Differential Geometry.
Explicit Matrices over $\mathbb Z_2$ with CNOT and Row Complexity $4n-\mathrm{o}(n)$ and Local Logic Gates A Quantum Complexity Lowerbound from Differential Geometry
Reference 1
- Resolution
- unresolved
- no resolver link, observed 2026-07-31T02:42:14.669691Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation fc6bfa6b-89d3-433d-8a6d-ea4cdc5a8fd3 · outbound
This paper cites Universality in long-distance geometry and quantum complexity.
Explicit Matrices over $\mathbb Z_2$ with CNOT and Row Complexity $4n-\mathrm{o}(n)$ and Local Logic Gates Universality in long-distance geometry and quantum complexity
Reference 2
- Resolution
- unresolved
- no resolver link, observed 2026-07-31T02:42:14.673843Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 25d93544-1752-471a-b2f6-7ffc9a821e6b · outbound
This paper cites an unresolved cited work.
Explicit Matrices over $\mathbb Z_2$ with CNOT and Row Complexity $4n-\mathrm{o}(n)$ and Local Logic Gates Unresolved cited work
Reference 3
- Resolution
- unresolved
- no resolver link, observed 2026-07-31T02:42:14.677648Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 5a4b8da3-cdc1-41bb-8344-20f473b4ffdb · outbound
This paper cites The Solovay-Kitaev algorithm.
Explicit Matrices over $\mathbb Z_2$ with CNOT and Row Complexity $4n-\mathrm{o}(n)$ and Local Logic Gates The Solovay-Kitaev algorithm
Reference 4
- Resolution
- unresolved
- no resolver link, observed 2026-07-31T02:42:14.680711Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 28bb597d-80d1-462c-be2c-7a8c38dd294a · outbound
This paper cites an unresolved cited work.
Explicit Matrices over $\mathbb Z_2$ with CNOT and Row Complexity $4n-\mathrm{o}(n)$ and Local Logic Gates Unresolved cited work
Reference 5
- Resolution
- unresolved
- no resolver link, observed 2026-07-31T02:42:14.684551Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation f7f83dd8-2140-4499-9c13-b9e8a7e0af00 · outbound
This paper cites Lower bounds for the CNOT-complexity of linear reversible operators.
Explicit Matrices over $\mathbb Z_2$ with CNOT and Row Complexity $4n-\mathrm{o}(n)$ and Local Logic Gates Lower bounds for the CNOT-complexity of linear reversible operators
Reference 6
- Resolution
- unresolved
- no resolver link, observed 2026-07-31T02:42:14.688000Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation fde3fa40-490a-4aef-91d8-43f45c5bedd1 · outbound
This paper cites an unresolved cited work.
Explicit Matrices over $\mathbb Z_2$ with CNOT and Row Complexity $4n-\mathrm{o}(n)$ and Local Logic Gates Unresolved cited work
Reference 7
- Resolution
- unresolved
- no resolver link, observed 2026-07-31T02:42:14.691324Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation c0ba4aa9-d79a-45fb-9030-9bca9d328ad3 · outbound
This paper cites Nielsen,A Geometric Approach to Quantum Circuit Lower Bounds,Quantum Infor- mation & Computation, vol.
Explicit Matrices over $\mathbb Z_2$ with CNOT and Row Complexity $4n-\mathrm{o}(n)$ and Local Logic Gates Nielsen,A Geometric Approach to Quantum Circuit Lower Bounds,Quantum Infor- mation & Computation, vol
Reference 8
- Resolution
- unresolved
- no resolver link, observed 2026-07-31T02:42:14.694342Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 60f44bd7-a132-46ff-9c7f-80f8c59ad976 · outbound
This paper cites Nielsen and I.
Explicit Matrices over $\mathbb Z_2$ with CNOT and Row Complexity $4n-\mathrm{o}(n)$ and Local Logic Gates Nielsen and I
Reference 9
- Resolution
- unresolved
- no resolver link, observed 2026-07-31T02:42:14.697134Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 0997c767-0218-47d8-850e-f84f6152ce20 · outbound
This paper cites Quantum Computation as Geometry.
Explicit Matrices over $\mathbb Z_2$ with CNOT and Row Complexity $4n-\mathrm{o}(n)$ and Local Logic Gates Quantum Computation as Geometry
Reference 10
- Resolution
- unresolved
- no resolver link, observed 2026-07-31T02:42:14.699954Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation cec670d2-8b25-4809-b6c1-9e533edabc6b · outbound
This paper cites an unresolved cited work.
Explicit Matrices over $\mathbb Z_2$ with CNOT and Row Complexity $4n-\mathrm{o}(n)$ and Local Logic Gates Unresolved cited work
Reference 11
- Resolution
- unresolved
- no resolver link, observed 2026-07-31T02:42:14.702907Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 3da681c8-7182-4c22-a98a-43ab517a90d7 · outbound
This paper cites an unresolved cited work.
Explicit Matrices over $\mathbb Z_2$ with CNOT and Row Complexity $4n-\mathrm{o}(n)$ and Local Logic Gates Unresolved cited work
Reference 12
- Resolution
- unresolved
- no resolver link, observed 2026-07-31T02:42:14.705650Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 778be610-7c85-4d3d-9140-ab1d608a1713 · outbound
This paper cites The Complexity of Quantum States and Transformations: From Quantum Money to Black Holes.
Explicit Matrices over $\mathbb Z_2$ with CNOT and Row Complexity $4n-\mathrm{o}(n)$ and Local Logic Gates The Complexity of Quantum States and Transformations: From Quantum Money to Black Holes
Reference 13
- Resolution
- unresolved
- no resolver link, observed 2026-07-31T02:42:14.708415Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 4cf40147-8ab4-4c6e-9440-fb14b77c9d18 · outbound
This paper cites Andr´ en, L.
Explicit Matrices over $\mathbb Z_2$ with CNOT and Row Complexity $4n-\mathrm{o}(n)$ and Local Logic Gates Andr´ en, L
Reference 14
- Resolution
- unresolved
- no resolver link, observed 2026-07-31T02:42:14.711561Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 73188976-470a-4f76-9c62-f2a8d739af6a · outbound
This paper cites Gowers,Rough Structure and Classification,79-117, GAF A Special Volume, Vision in Mathematics, 2000.
Explicit Matrices over $\mathbb Z_2$ with CNOT and Row Complexity $4n-\mathrm{o}(n)$ and Local Logic Gates Gowers,Rough Structure and Classification,79-117, GAF A Special Volume, Vision in Mathematics, 2000
Reference 15
- Resolution
- unresolved
- no resolver link, observed 2026-07-31T02:42:14.714249Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 878d7890-b6e7-420f-86ce-d8b10fce5239 · outbound
This paper cites Gowers,A conversation about complexity lower bounds,Gowers’ webblog, 2009.
Explicit Matrices over $\mathbb Z_2$ with CNOT and Row Complexity $4n-\mathrm{o}(n)$ and Local Logic Gates Gowers,A conversation about complexity lower bounds,Gowers’ webblog, 2009
Reference 16
- Resolution
- unresolved
- no resolver link, observed 2026-07-31T02:42:14.716976Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 09874fee-fe6e-4d37-ab65-d61bcd17aef1 · outbound
This paper cites an unresolved cited work.
Explicit Matrices over $\mathbb Z_2$ with CNOT and Row Complexity $4n-\mathrm{o}(n)$ and Local Logic Gates Unresolved cited work
Reference 17
- Resolution
- unresolved
- no resolver link, observed 2026-07-31T02:42:14.719711Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 90582091-4b4b-46dd-abd2-847a06f342cc · outbound
This paper cites an unresolved cited work.
Explicit Matrices over $\mathbb Z_2$ with CNOT and Row Complexity $4n-\mathrm{o}(n)$ and Local Logic Gates Unresolved cited work
Reference 18
- Resolution
- unresolved
- no resolver link, observed 2026-07-31T02:42:14.722447Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 0c460dbd-92fd-438a-b9ba-b43c4bbadc41 · outbound
This paper cites Yu,Quantum Complexity of Permutations,575-595, Pure and Applied Mathematics Quarterly, Volume 19, Number 2, 2023.
Explicit Matrices over $\mathbb Z_2$ with CNOT and Row Complexity $4n-\mathrm{o}(n)$ and Local Logic Gates Yu,Quantum Complexity of Permutations,575-595, Pure and Applied Mathematics Quarterly, Volume 19, Number 2, 2023
Reference 19
- Resolution
- unresolved
- no resolver link, observed 2026-07-31T02:42:14.725087Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 667d8e5d-0c20-4533-8c95-da1ff2263e8b · outbound
This paper cites an unresolved cited work.
Explicit Matrices over $\mathbb Z_2$ with CNOT and Row Complexity $4n-\mathrm{o}(n)$ and Local Logic Gates Unresolved cited work
Reference 20
- Resolution
- unresolved
- no resolver link, observed 2026-07-31T02:42:14.727918Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 95eb46fd-4d4c-454b-a3b0-1d1591c9cfb5 · outbound
This paper cites Bataille,Quantum circuits of CNOT gates: Optimization and entanglement,Quantum Information Processing, 21(7):269, 2022.
Explicit Matrices over $\mathbb Z_2$ with CNOT and Row Complexity $4n-\mathrm{o}(n)$ and Local Logic Gates Bataille,Quantum circuits of CNOT gates: Optimization and entanglement,Quantum Information Processing, 21(7):269, 2022
Reference 21
- Resolution
- unresolved
- no resolver link, observed 2026-07-31T02:42:14.730596Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 1e6f84f6-4dba-497c-bad5-8bde7a17ea13 · outbound
This paper cites an unresolved cited work.
Explicit Matrices over $\mathbb Z_2$ with CNOT and Row Complexity $4n-\mathrm{o}(n)$ and Local Logic Gates Unresolved cited work
Reference 22
- Resolution
- unresolved
- no resolver link, observed 2026-07-31T02:42:14.733550Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation c444e8c2-235d-473f-81ca-8111a838d639 · outbound
This paper cites Shoup,New Algorithms for Finding Irreducible Polynomials over Finite Fields,Math- ematics of Computation, 54 (189), 435–447, 1990.
Explicit Matrices over $\mathbb Z_2$ with CNOT and Row Complexity $4n-\mathrm{o}(n)$ and Local Logic Gates Shoup,New Algorithms for Finding Irreducible Polynomials over Finite Fields,Math- ematics of Computation, 54 (189), 435–447, 1990
Reference 23
- Resolution
- unresolved
- no resolver link, observed 2026-07-31T02:42:14.736309Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Pith citing papers
No inbound Pith citation observations are available.