Paper Citation Record · LEDGER

Lower bounds for the CNOT-complexity of linear reversible operators

As of 20 August 2026, this Paper Citation Record lists 17 of 17 outbound references and 2 inbound Pith citation observations for arXiv:2607.22248.

A citation records a reference. It does not transfer a finding from one paper to another.

pith.paper-citation-record.v1
2607.22248 v1

Coverage vector

measured 17 of 17 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-01T05:28:48.444849Z

measured 19 of 19 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-20T06:33:59.587034+00:00

measured 2 of 2 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links, observed 2026-08-05T11:55:26.674955Z

measured 0 of 1 external citation measurements

A source-named dated measurement, never combined with another source.

Source: pith, observed 2026-08-05T11:55:26.917958Z

Reference resolution

17 of 17 outbound references displayed

verified exact5
verified fuzzy0
unresolved12
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 60f1e8e3-13c8-4e2f-8cab-4902b92d8d2b · outbound

This paper cites 2013 , url =.

Lower bounds for the CNOT-complexity of linear reversible operators 2013 , url =

Reference 1

Resolution: unresolved; no resolver link, observed 2026-08-01T05:28:45.834826Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 92167d74-0ee9-4638-a2ad-d4a06378d47b · outbound

This paper cites Quantum Science and Technology , abstract =.

Lower bounds for the CNOT-complexity of linear reversible operators Quantum Science and Technology , abstract =

Reference 2

Resolution: unresolved; no resolver link, observed 2026-08-01T05:28:45.985036Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 67d3135b-8ea9-4c51-aae9-bc1516adc8a5 · outbound

This paper cites Quantum Information Processing , volume =.

Lower bounds for the CNOT-complexity of linear reversible operators Quantum Information Processing , volume =

Reference 3

Resolution: verified exact; doi, observed 2026-08-01T05:33:28.128726Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation a41c3cd6-464a-4e83-b027-9bf888417400 · outbound

This paper cites Reversible Computation - 12th International Conference,.

Lower bounds for the CNOT-complexity of linear reversible operators Reversible Computation - 12th International Conference,

Reference 4

Resolution: verified exact; doi, observed 2026-08-01T05:33:28.077618Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 57b4f77f-1ae2-486b-aabb-17ff75437830 · outbound

This paper cites 2021 , issue_date =.

Lower bounds for the CNOT-complexity of linear reversible operators 2021 , issue_date =

Reference 5

Resolution: verified exact; doi, observed 2026-08-01T05:33:28.032011Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 63028726-3980-462a-8887-c78989240449 · outbound

This paper cites Minimum synthesis cost of CNOT circuits.

Lower bounds for the CNOT-complexity of linear reversible operators Minimum synthesis cost of CNOT circuits

Reference 6

Resolution: verified exact; doi, observed 2026-08-01T05:33:27.936717Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 77b2c594-73f1-49a0-b185-b05ee0ed67fa · outbound

This paper cites On exact sizes of minimal CNOT circuits.

Lower bounds for the CNOT-complexity of linear reversible operators On exact sizes of minimal CNOT circuits

Reference 7

Resolution: unresolved; no resolver link, observed 2026-08-01T05:28:46.845085Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 68b483ae-281c-4f9b-bc4e-845e84696759 · outbound

This paper cites 2023 , volume=.

Lower bounds for the CNOT-complexity of linear reversible operators 2023 , volume=

Reference 8

Resolution: unresolved; no resolver link, observed 2026-08-01T05:28:47.062512Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 9e5aada9-9959-4b21-99b5-1339959e6e1b · outbound

This paper cites What is the complexity of this problem? , YEAR =.

Lower bounds for the CNOT-complexity of linear reversible operators What is the complexity of this problem? , YEAR =

Reference 9

Resolution: unresolved; no resolver link, observed 2026-08-01T05:28:47.207382Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 863f4fcb-9e9d-45e0-8882-bf9f10633cf3 · outbound

This paper cites Complexity of linear Boolean operators.

Lower bounds for the CNOT-complexity of linear reversible operators Complexity of linear Boolean operators

Reference 10

Resolution: unresolved; no resolver link, observed 2026-08-01T05:28:47.339722Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7f95b9f7-6406-4c37-acf6-9b938ea027b7 · outbound

This paper cites Proceedings of the 39th Annual Design Automation Conference , pages =.

Lower bounds for the CNOT-complexity of linear reversible operators Proceedings of the 39th Annual Design Automation Conference , pages =

Reference 11

Resolution: unresolved; no resolver link, observed 2026-08-01T05:28:47.514739Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation e61cf1ad-a505-4f22-9c59-c0b55a655e16 · outbound

This paper cites Reversible Computation - 10th International Conference,.

Lower bounds for the CNOT-complexity of linear reversible operators Reversible Computation - 10th International Conference,

Reference 12

Resolution: unresolved; no resolver link, observed 2026-08-01T05:28:47.764743Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b51f556c-c23d-46e6-8614-a3fb2427734a · outbound

This paper cites and Markov, Igor L.

Lower bounds for the CNOT-complexity of linear reversible operators and Markov, Igor L

Reference 13

Resolution: unresolved; no resolver link, observed 2026-08-01T05:28:47.911652Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a7834e91-70f0-4838-8189-a85fbb7ccb57 · outbound

This paper cites 2022 , pages=.

Lower bounds for the CNOT-complexity of linear reversible operators 2022 , pages=

Reference 14

Resolution: unresolved; no resolver link, observed 2026-08-01T05:28:48.015830Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a86b7fc1-6764-408a-9fd2-8a441b51dd88 · outbound

This paper cites Lower Bounds for Additive Complexity of Linear Operators and Bilinear Algorithms for Matrix and Polynomial Multiplication GF(2).

Lower bounds for the CNOT-complexity of linear reversible operators Lower Bounds for Additive Complexity of Linear Operators and Bilinear Algorithms for Matrix and Polynomial Multiplication GF(2)

Reference 15

Resolution: verified exact; doi, observed 2026-08-01T05:33:27.845421Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.

Observation 1c188b8a-5036-44dc-926a-7be69a9ceaae · outbound

This paper cites 2024 , doi =.

Lower bounds for the CNOT-complexity of linear reversible operators 2024 , doi =

Reference 16

Resolution: unresolved; no resolver link, observed 2026-08-01T05:28:48.298318Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d4b568d7-6968-474a-a08f-2b59bd41d2e3 · outbound

This paper cites Heuristic and Optimal Synthesis of CNOT and Clifford Circuits.

Lower bounds for the CNOT-complexity of linear reversible operators Heuristic and Optimal Synthesis of CNOT and Clifford Circuits

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-01T05:28:48.444849Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

Observation f7f83dd8-2140-4499-9c13-b9e8a7e0af00 · inbound

Explicit Matrices over $\mathbb Z_2$ with CNOT and Row Complexity $4n-\mathrm{o}(n)$ and Local Logic Gates cites this paper.

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 91ceed09-376f-4483-9faa-b060c71253f5 · inbound

CNOT-Distance is NP-complete under all-to-all connectivity cites this paper.

CNOT-Distance is NP-complete under all-to-all connectivity Lower bounds for the CNOT-complexity of linear reversible operators

Reference 21

Resolution: verified exact; local_arxiv, observed 2026-08-05T11:55:26.921435Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-20T06:33:59.587034+00:00.