Paper Citation Record · LEDGER

CNOT-Distance is NP-complete under all-to-all connectivity

As of 8 August 2026, this Paper Citation Record lists 34 of 34 outbound references and 1 inbound Pith citation observation for arXiv:2608.03825.

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

pith.paper-citation-record.v1
2608.03825 v1

Coverage vector

measured 34 of 34 reference resolution

Typed states for the displayed outbound observations.

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

measured 35 of 35 standing notices

One-hop event checks from named stored sources.

Source: scholarly_work_events, retraction_status_cache, observed 2026-08-08T06:32:00.761636+00:00

measured 1 of 1 inbound itemization

Pith citing papers itemized under the disclosed page cap.

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

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.931598Z

Reference resolution

34 of 34 outbound references displayed

verified exact5
verified fuzzy20
unresolved8
parse uncertain0
malformed identifier0
metadata mismatch1

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 0df6541e-9311-44e8-a474-0cc6b48a0d64 · outbound

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

CNOT-Distance is NP-complete under all-to-all connectivity CNOT-Distance is NP-complete under all-to-all connectivity

Reference 1

Resolution: metadata mismatch; local_arxiv, observed 2026-08-05T11:55:26.935040Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 6434a620-9b61-447f-b407-5f91e7a40153 · outbound

This paper cites an unresolved cited work.

CNOT-Distance is NP-complete under all-to-all connectivity Unresolved cited work

Reference 2

Resolution: unresolved; raw_fallback, observed 2026-08-05T11:55:27.209037Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 3f758080-cc53-4810-ba79-8576fca027a1 · outbound

This paper cites , N}and denote byIN theN×N identity matrix.

CNOT-Distance is NP-complete under all-to-all connectivity , N}and denote byIN theN×N identity matrix

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T11:55:27.199082Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 7c83eef5-87fd-4d1f-a562-bed8b702bc60 · outbound

This paper cites LetG= (V, E) be a finite simple graph, and write n=|V|, m=|E|.

CNOT-Distance is NP-complete under all-to-all connectivity LetG= (V, E) be a finite simple graph, and write n=|V|, m=|E|

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T11:55:27.189417Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 59bb40fa-54c3-49c2-8858-d8652c1ab4b4 · outbound

This paper cites We first prove the decision result and its ancillary vari- ants, and then derive hardness for exact computation, fixed-additive approximation, and multiplicative approx- imation.

CNOT-Distance is NP-complete under all-to-all connectivity We first prove the decision result and its ancillary vari- ants, and then derive hardness for exact computation, fixed-additive approximation, and multiplicative approx- imation

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T11:55:27.179910Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation e7975830-96b8-4578-8c5e-c952a4bbdecb · outbound

This paper cites Thus ex- act CNOT-count minimisation remains computation- ally hard even after routing constraints and restricted gate availability are removed.

CNOT-Distance is NP-complete under all-to-all connectivity Thus ex- act CNOT-count minimisation remains computation- ally hard even after routing constraints and restricted gate availability are removed

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T11:55:27.169337Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 914b914e-9702-415d-bbff-195ee2f1295f · outbound

This paper cites an unresolved cited work.

CNOT-Distance is NP-complete under all-to-all connectivity Unresolved cited work

Reference 7

Resolution: unresolved; raw_fallback, observed 2026-08-05T11:55:27.158578Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 983a2811-4d6d-4f74-80a8-0669ba0993da · outbound

This paper cites an unresolved cited work.

CNOT-Distance is NP-complete under all-to-all connectivity Unresolved cited work

Reference 8

Resolution: unresolved; raw_fallback, observed 2026-08-05T11:55:27.149049Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 96e213d3-7b44-4cf0-bb61-b740e3591829 · outbound

This paper cites an unresolved cited work.

CNOT-Distance is NP-complete under all-to-all connectivity Unresolved cited work

Reference 9

Resolution: unresolved; raw_fallback, observed 2026-08-05T11:55:27.139821Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 6e702df5-9577-4e3e-8fcb-fc0ed888cc94 · outbound

This paper cites Fort= 0, takeQ 0 =L, letρ 0 be the identity map, and take the input variables inU G as the basisB 0.

CNOT-Distance is NP-complete under all-to-all connectivity Fort= 0, takeQ 0 =L, letρ 0 be the identity map, and take the input variables inU G as the basisB 0

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T11:55:27.129926Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 62b87625-108a-42df-8506-d7f2bde80ccb · outbound

This paper cites Elementary gates for quantum compu- tation,.

CNOT-Distance is NP-complete under all-to-all connectivity Elementary gates for quantum compu- tation,

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T11:55:27.120266Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 66f9f94f-73e1-494f-ae6e-bdfaf406e679 · outbound

This paper cites Improved simulation of stabilizer circuits,.

CNOT-Distance is NP-complete under all-to-all connectivity Improved simulation of stabilizer circuits,

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T11:55:27.110603Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation f72c36c2-61ed-482f-bb5a-19f8811f2a6f · outbound

This paper cites On the controlled-NOT complexity of controlled-NOT–phase circuits,.

CNOT-Distance is NP-complete under all-to-all connectivity On the controlled-NOT complexity of controlled-NOT–phase circuits,

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T11:55:27.101051Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation cf6e2407-79db-4fe7-b5b6-3ab57fa8e790 · outbound

This paper cites Clifford circuit optimization with templates and symbolic pauli gates,.

CNOT-Distance is NP-complete under all-to-all connectivity Clifford circuit optimization with templates and symbolic pauli gates,

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T11:55:27.091840Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 3d5fd0ce-73fd-4b65-9501-83496fabdf2b · outbound

This paper cites Global synthesis of CNOT circuits with holes,.

CNOT-Distance is NP-complete under all-to-all connectivity Global synthesis of CNOT circuits with holes,

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T11:55:27.081298Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 5901c24f-5c98-4f39-8f76-9ff9632c7816 · outbound

This paper cites Optimal synthesis of linear reversible circuits,.

CNOT-Distance is NP-complete under all-to-all connectivity Optimal synthesis of linear reversible circuits,

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T11:55:27.069736Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 8e810dff-f538-4f61-ae1e-09e109ee087f · outbound

This paper cites Optimising quantum circuits is generally hard.

CNOT-Distance is NP-complete under all-to-all connectivity Optimising quantum circuits is generally hard

Reference 17

Resolution: unresolved; no resolver link, observed 2026-08-05T11:55:26.696275Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation a554604a-b7a2-4fe3-8212-a972ee4126a4 · outbound

This paper cites Quantum circuits of CNOT gates: opti- mization and entanglement,.

CNOT-Distance is NP-complete under all-to-all connectivity Quantum circuits of CNOT gates: opti- mization and entanglement,

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T11:55:27.058827Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 784ad66c-4694-4fe0-ab3d-86932f7a9ce6 · outbound

This paper cites On exact sizes of minimal CNOT circuits,.

CNOT-Distance is NP-complete under all-to-all connectivity On exact sizes of minimal CNOT circuits,

Reference 19

Resolution: unresolved; no resolver link, observed 2026-08-05T11:55:26.668561Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 396d1e94-e58d-4e95-bfe4-67647f812b70 · outbound

This paper cites Minimum synthesis cost of CNOT circuits,.

CNOT-Distance is NP-complete under all-to-all connectivity Minimum synthesis cost of CNOT circuits,

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T11:55:27.047594Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 91ceed09-376f-4483-9faa-b060c71253f5 · outbound

This paper cites Lower bounds for the CNOT-complexity of linear reversible operators.

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-08T06:32:00.761636+00:00.

Observation 70a50f1c-5c51-420d-b6f0-f1e2cbacddc2 · outbound

This paper cites Explicit matrices overZ 2 with CNOT and row complexity 4n−o(n) and local logic gates,.

CNOT-Distance is NP-complete under all-to-all connectivity Explicit matrices overZ 2 with CNOT and row complexity 4n−o(n) and local logic gates,

Reference 22

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T11:55:27.038343Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 7f0dbfd9-2864-4792-bd2f-953176d4287b · outbound

This paper cites Gaussian elimination ver- sus greedy methods for the synthesis of linear reversible circuits,.

CNOT-Distance is NP-complete under all-to-all connectivity Gaussian elimination ver- sus greedy methods for the synthesis of linear reversible circuits,

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T11:55:27.028997Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 82b02f8c-e315-4ba1-a7b5-ef2be79bc841 · outbound

This paper cites CNOT minimal circuit synthesis: A reinforcement learning approach,.

CNOT-Distance is NP-complete under all-to-all connectivity CNOT minimal circuit synthesis: A reinforcement learning approach,

Reference 24

Resolution: unresolved; no resolver link, observed 2026-08-05T11:55:26.683911Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 62295a3c-8aa9-4371-bff5-e87d831c4878 · outbound

This paper cites AlphaCNOT: Learning CNOT minimization with model-based planning,.

CNOT-Distance is NP-complete under all-to-all connectivity AlphaCNOT: Learning CNOT minimization with model-based planning,

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T11:55:27.017807Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 4afd287e-84d7-4e9a-be61-6f9b5f80fdbc · outbound

This paper cites Parallelizable Exact Synthesis of Quantum Circuits via Semi-Tensor Product.

CNOT-Distance is NP-complete under all-to-all connectivity Parallelizable Exact Synthesis of Quantum Circuits via Semi-Tensor Product

Reference 26

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

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 4c0e4471-969b-4b22-99b9-ad501704e58e · outbound

This paper cites Toward Minimum Graphic Parity Networks.

CNOT-Distance is NP-complete under all-to-all connectivity Toward Minimum Graphic Parity Networks

Reference 27

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

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 7478a9d4-1f0b-4e65-9304-49e998dc7ae6 · outbound

This paper cites Optimal space–depth trade-off of CNOT cir- cuits in quantum logic synthesis,.

CNOT-Distance is NP-complete under all-to-all connectivity Optimal space–depth trade-off of CNOT cir- cuits in quantum logic synthesis,

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T11:55:27.007021Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 00e2038e-9cd1-4297-811e-e2951ffcf23e · outbound

This paper cites CNOT-optimal circuit synthesis,.

CNOT-Distance is NP-complete under all-to-all connectivity CNOT-optimal circuit synthesis,

Reference 30

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T11:55:26.978008Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation b2b5af18-308a-484e-8661-72264cd33335 · outbound

This paper cites Reducibility among combinatorial prob- lems,.

CNOT-Distance is NP-complete under all-to-all connectivity Reducibility among combinatorial prob- lems,

Reference 31

Resolution: unresolved; no resolver link, observed 2026-08-05T11:55:26.705915Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d7e3d0be-e4cd-4f65-99ab-e3886c31b5a0 · outbound

This paper cites Logic minimiza- tion techniques with applications to cryptology,.

CNOT-Distance is NP-complete under all-to-all connectivity Logic minimiza- tion techniques with applications to cryptology,

Reference 32

Resolution: verified exact; doi, observed 2026-08-05T11:55:26.749821Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation ce0618e1-f899-409e-b9cd-802ddc5bf9df · outbound

This paper cites Some APX-completeness re- sults for cubic graphs,.

CNOT-Distance is NP-complete under all-to-all connectivity Some APX-completeness re- sults for cubic graphs,

Reference 33

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T11:55:26.955735Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 5fcab2c8-74b4-42ed-ac45-b5d799337459 · outbound

This paper cites Optimization, approximation, and complexity classes,.

CNOT-Distance is NP-complete under all-to-all connectivity Optimization, approximation, and complexity classes,

Reference 34

Resolution: verified fuzzy; raw_fallback, observed 2026-08-05T11:55:26.945630Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Observation 6dd66808-79ce-4024-8855-56bcd63d9346 · outbound

This paper cites an unresolved cited work.

CNOT-Distance is NP-complete under all-to-all connectivity Unresolved cited work

Reference 2008

Resolution: verified exact; doi, observed 2026-08-05T11:55:26.783471Z

Source-reported events for the cited work

No event found in the named queried sources as of 2026-08-08T06:32:00.761636+00:00.

Pith citing papers

Observation 0df6541e-9311-44e8-a474-0cc6b48a0d64 · inbound