Pith. sign in

Paper Citation Record · LEDGER

Optimising quantum circuits is generally hard

As of 13 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 6 inbound Pith citation observations for arXiv:2310.05958.

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

pith.paper-citation-record.v1
2310.05958 v3

Coverage vector

measured 0 of 0 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links

measured 6 of 6 standing notices

One-hop event checks from named stored sources.

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

measured 6 of 6 inbound itemization

Pith citing papers itemized under the disclosed page cap.

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

measured 0 of 1 external citation measurements

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

Source: arxiv_reference, observed 2026-05-23T21:15:49.483953Z

Reference resolution

0 of 0 outbound references displayed

  • verified exact0
  • verified fuzzy0
  • unresolved0
  • parse uncertain0
  • malformed identifier0
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

No outbound reference observations are available for this paper version.

Pith citing papers

Observation ad6c0056-f8c2-4f63-b3b4-09cc11192f8d · inbound

High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization cites this paper.

High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization Optimising quantum circuits is generally hard

Reference 44

Resolution
verified exact
arxiv_id, observed 2026-05-23T21:15:49.487175Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-05-23T21:13:27.130718Z digest=sha256:783d01e92b0894656ba39bc3979ab46d4fcbcc634a486735d33dc2b1b208a415

Observation 1bcc6f98-5adf-41ea-b977-77ae9b66173c · inbound

A Pathway to Practical Quantum Advantage in Solving Navier-Stokes Equations cites this paper.

A Pathway to Practical Quantum Advantage in Solving Navier-Stokes Equations Optimising quantum circuits is generally hard

Reference 36

Resolution
unresolved
no resolver link, observed 2026-08-04T20:14:27.029500Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-08-04T20:14:27.029500Z digest=sha256:f9335b8e9ec42b33f4ad6bf517b2ec63f7af0dd308a7755f2a90db1ad7cc70ad

Observation c37bf102-abe8-45a7-b65a-209aeffda099 · inbound

Distributed Quantum Circuit Optimisation: Evaluating Global and Local encodings cites this paper.

Distributed Quantum Circuit Optimisation: Evaluating Global and Local encodings Optimising quantum circuits is generally hard

Reference 4

Resolution
metadata mismatch
arxiv_id, observed 2026-05-09T06:20:39.663227Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-05-08T18:37:10.711053Z digest=sha256:3890c6d1bb620222cbcb6f15fa807bb62a072a1875b984c9122b352024b8391a

Observation 26a3d3bc-d677-4928-a981-37d8206ef947 · inbound

Distributed Quantum Circuit Optimisation: Evaluating Global and Local encodings cites this paper.

Distributed Quantum Circuit Optimisation: Evaluating Global and Local encodings Optimising quantum circuits is generally hard

Reference 4

Resolution
metadata mismatch
arxiv_id, observed 2026-05-12T03:21:19.307333Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-05-12T03:16:52.066009Z digest=sha256:0187f2920dc07af7784271e28dbe421c6de8085ac2713dd2ea71d1cad689efd3

Observation b53b8d33-afed-464a-aff3-72e33e2683f2 · inbound

Linear-Time T-Gate Optimization via Random Abstraction cites this paper.

Linear-Time T-Gate Optimization via Random Abstraction Optimising quantum circuits is generally hard

Reference 33

Resolution
verified exact
arxiv_id, observed 2026-05-15T02:53:32.993506Z

Source-reported events for the cited work

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

source=pdf_text observed=2026-05-15T02:53:08.294750Z digest=sha256:0767fb07eab056261d9ec3286445783edb743c6a30989f9e4e596e03f32cc059

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

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

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.

source=pdf_text observed=2026-08-05T11:55:26.696275Z digest=sha256:66d12488dbe607aa18aeceb6aa79cad8b4b8ace075b02fa7201c98996f97a69c