Paper Citation Record · LEDGER

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits

As of 15 August 2026, this Paper Citation Record lists 31 of 31 outbound references and 0 inbound Pith citation observations for arXiv:1908.01609.

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

pith.paper-citation-record.v1
1908.01609 v1

Coverage vector

measured 31 of 31 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-08-14T15:18:37.838816Z

measured 31 of 31 standing notices

One-hop event checks from named stored sources.

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

measured 0 of 0 inbound itemization

Pith citing papers itemized under the disclosed page cap.

Source: paper_references, paper_reference_links

measured 0 of 1 external citation measurements

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

Source: cited_works

Reference resolution

31 of 31 outbound references displayed

verified exact0
verified fuzzy29
unresolved2
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation ec70e883-97d0-493c-96e1-bbaeff2f79cc · outbound

This paper cites A fast quantum mechanical algorithm for da tabase search,.

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits A fast quantum mechanical algorithm for da tabase search,

Reference 1

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:18:38.803902Z

Source-reported events for the cited work

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

Observation 56b502cb-13f9-47a7-97b7-7440e6479e49 · outbound

This paper cites Polynomial-time algorithms for prime facto rization and discrete logarithms on a quantum computer,.

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits Polynomial-time algorithms for prime facto rization and discrete logarithms on a quantum computer,

Reference 2

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:18:38.789909Z

Source-reported events for the cited work

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

Observation 585cf0bd-5f2c-4be4-8b31-51d9a173598e · outbound

This paper cites Quantum algorit hm for linear systems of equations,.

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits Quantum algorit hm for linear systems of equations,

Reference 3

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:18:38.714751Z

Source-reported events for the cited work

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

Observation 7d77792a-60b8-4477-94fe-70cca4e8c442 · outbound

This paper cites A meet-in- the-middle algorithm for fast synthesis of depth-optimal quantum circ uits,.

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits A meet-in- the-middle algorithm for fast synthesis of depth-optimal quantum circ uits,

Reference 4

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:18:38.694623Z

Source-reported events for the cited work

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

Observation b6dcb4dc-73ec-478d-8092-8fb6c1ef1cda · outbound

This paper cites On the multiplicat ive complexity of boolean functions over the basis (∧,⊕,1),.

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits On the multiplicat ive complexity of boolean functions over the basis (∧,⊕,1),

Reference 5

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:18:38.683023Z

Source-reported events for the cited work

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

Observation 73e220dc-c723-4da6-9730-feeedeca0387 · outbound

This paper cites Low-overhead constructions for the fault-to lerant Toffoli gate,.

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits Low-overhead constructions for the fault-to lerant Toffoli gate,

Reference 6

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:18:38.655957Z

Source-reported events for the cited work

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

Observation 33e1191d-73ac-44eb-be70-b90c385c2686 · outbound

This paper cites Halving the cost of quantum addition,.

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits Halving the cost of quantum addition,

Reference 7

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:18:38.585637Z

Source-reported events for the cited work

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

Observation f7ebea75-f5c6-4dc9-b33a-80198c1eec3d · outbound

This paper cites On the complexity of computing two nonlinear ity measures,.

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits On the complexity of computing two nonlinear ity measures,

Reference 8

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:18:38.574222Z

Source-reported events for the cited work

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

Observation b02d59cd-a126-48ad-a535-eed36cdaaf9f · outbound

This paper cites Tight bounds for the multiplica tive complexity of symmetric functions,.

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits Tight bounds for the multiplica tive complexity of symmetric functions,

Reference 9

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:18:38.563530Z

Source-reported events for the cited work

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

Observation 621a72a6-f86e-4071-afa9-77166f0ece1a · outbound

This paper cites Reduci ng the multiplicative complexity in logic networks for crypto graphy and security applications,.

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits Reduci ng the multiplicative complexity in logic networks for crypto graphy and security applications,

Reference 10

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:18:38.535684Z

Source-reported events for the cited work

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

Observation 0dcd9a01-e5ee-47d6-9409-a2610caf2f75 · outbound

This paper cites Logic minimizat ion techniques with applications to cryptology,.

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits Logic minimizat ion techniques with applications to cryptology,

Reference 11

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:18:38.496057Z

Source-reported events for the cited work

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

Observation fad5e915-0196-4ac5-9954-059c44e8ea8f · outbound

This paper cites The multiplicati ve complexity of 6-variable Boolean functions,.

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits The multiplicati ve complexity of 6-variable Boolean functions,

Reference 12

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:18:38.485095Z

Source-reported events for the cited work

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

Observation 2929b422-3da0-4c47-8051-87862914c747 · outbound

This paper cites Time/space trade-offs for reversible c omputation,.

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits Time/space trade-offs for reversible c omputation,

Reference 13

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:18:38.472991Z

Source-reported events for the cited work

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

Observation 7e132045-819e-432b-b43e-e9fac65d7100 · outbound

This paper cites Hi erarchical reversible logic synthesis using LUTs,.

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits Hi erarchical reversible logic synthesis using LUTs,

Reference 14

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:18:38.412923Z

Source-reported events for the cited work

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

Observation b58aaa58-9f15-402f-8f6f-68157503569f · outbound

This paper cites A best-ﬁt mapping algorithm to facilitate ESOP-decomposi tion in Clifford+ T quantum network synthesis,.

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits A best-ﬁt mapping algorithm to facilitate ESOP-decomposi tion in Clifford+ T quantum network synthesis,

Reference 15

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:18:38.401829Z

Source-reported events for the cited work

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

Observation 0c61e133-d3fd-49f0-a2d6-115e34b412c1 · outbound

This paper cites Universal quantum computatio n with ideal Clifford gates and noisy ancillas,.

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits Universal quantum computatio n with ideal Clifford gates and noisy ancillas,

Reference 16

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:18:38.389952Z

Source-reported events for the cited work

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

Observation f51e3c9a-cb0d-4c12-ba4a-52580afdc29b · outbound

This paper cites Quantum computation wi th realistic magic-state factories,.

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits Quantum computation wi th realistic magic-state factories,

Reference 17

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:18:38.378259Z

Source-reported events for the cited work

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

Observation f6a4f3cc-ee4d-45b8-a084-aa552680f9dd · outbound

This paper cites Reversible pebbling game for quantum memory management,.

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits Reversible pebbling game for quantum memory management,

Reference 18

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:18:38.314783Z

Source-reported events for the cited work

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

Observation 2096e549-0d98-4340-bd9c-0bff2d3042b9 · outbound

This paper cites Quantum teleportation i s a universal computational primitive,.

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits Quantum teleportation i s a universal computational primitive,

Reference 19

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:18:38.227949Z

Source-reported events for the cited work

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

Observation 94e86044-aaf3-428f-997c-cd07ec1c113b · outbound

This paper cites Application of a resource th eory for magic states to fault-tolerant quantum computing,.

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits Application of a resource th eory for magic states to fault-tolerant quantum computing,

Reference 20

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:18:38.204337Z

Source-reported events for the cited work

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

Observation e15450f1-b101-4021-9b9c-065fc90ec3dc · outbound

This paper cites REVS: A tool fo r space-optimized reversible circuit synthesis,.

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits REVS: A tool fo r space-optimized reversible circuit synthesis,

Reference 21

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:18:38.191266Z

Source-reported events for the cited work

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

Observation 855fb6c2-57e7-47e3-bb17-47fb0c35e8eb · outbound

This paper cites an unresolved cited work.

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits Unresolved cited work

Reference 22

Resolution: unresolved; raw_fallback, observed 2026-08-14T15:18:38.179582Z

Source-reported events for the cited work

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

Observation ced3172f-8d2e-4786-bbb9-c30392c6fcec · outbound

This paper cites DAG-awa re AIG rewriting: a fresh look at combinational logic synthesis,.

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits DAG-awa re AIG rewriting: a fresh look at combinational logic synthesis,

Reference 23

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:18:38.168191Z

Source-reported events for the cited work

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

Observation 9f8cede8-7030-4c86-987c-50c57504fe93 · outbound

This paper cites ESOP-based toffo li gate cascade generation,.

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits ESOP-based toffo li gate cascade generation,

Reference 24

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:18:38.146652Z

Source-reported events for the cited work

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

Observation 4dbe1d93-3869-4476-9624-967cd6290532 · outbound

This paper cites Applying grover’s algorithm to AES: quantum resource esti mates,.

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits Applying grover’s algorithm to AES: quantum resource esti mates,

Reference 25

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:18:38.063293Z

Source-reported events for the cited work

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

Observation 0c9de4cd-3447-48c8-84a7-a87fd240eaad · outbound

This paper cites Q#: Enabling scalable quantum computing and development with a high-lev el DSL,.

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits Q#: Enabling scalable quantum computing and development with a high-lev el DSL,

Reference 26

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:18:38.049996Z

Source-reported events for the cited work

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

Observation 5ddeacd5-a006-48f6-9426-c7a5e40b7724 · outbound

This paper cites Z3: an efﬁcient SMT solver ,.

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits Z3: an efﬁcient SMT solver ,

Reference 27

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:18:38.036480Z

Source-reported events for the cited work

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

Observation be7c4c0e-a3c4-4867-90ee-41038431b4e8 · outbound

This paper cites Synthesizing shortest linear straight-line programs over GF(2) using SA T,.

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits Synthesizing shortest linear straight-line programs over GF(2) using SA T,

Reference 28

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:18:38.022281Z

Source-reported events for the cited work

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

Observation d291b372-9334-4c5e-89db-682a8b36d9e9 · outbound

This paper cites Aut omated optimization of large quantum circuits with continuous par ameters,.

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits Aut omated optimization of large quantum circuits with continuous par ameters,

Reference 29

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:18:37.942322Z

Source-reported events for the cited work

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

Observation 7d55e2ca-639e-473d-b099-651338b97f32 · outbound

This paper cites On the CNOT-complexity of CNOT-PHASE circuits.

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits On the CNOT-complexity of CNOT-PHASE circuits

Reference 30

Resolution: unresolved; no resolver link, observed 2026-08-14T15:18:37.814285Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 941bd76f-f95d-41bd-8264-2f71903f9ad2 · outbound

This paper cites SA T-based {CNOT, T} quantum circuit synthesis,.

The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits SA T-based {CNOT, T} quantum circuit synthesis,

Reference 31

Resolution: verified fuzzy; raw_fallback, observed 2026-08-14T15:18:37.883296Z

Source-reported events for the cited work

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

Pith citing papers

No inbound Pith citation observations are available.