Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links
Paper Citation Record · LEDGER
Rise of conditionally clean ancillae for efficient quantum circuit constructions
As of 14 August 2026, this Paper Citation Record lists 0 of 0 outbound references and 10 inbound Pith citation observations for arXiv:2407.17966.
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-14T06:32:32.682623+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-08-12T00:43:08.467396Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-07-01T13:15:45.815577Z
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 5c8adb91-18d2-44ae-9fc4-7ae7142ad33d · inbound
Utilizing redundancies in Qubit Hilbert Space to reduce entangling gate counts in the Unitary Vibrational Coupled-Cluster Method cites this paper.
Utilizing redundancies in Qubit Hilbert Space to reduce entangling gate counts in the Unitary Vibrational Coupled-Cluster Method Rise of conditionally clean ancillae for efficient quantum circuit constructions
Reference 41
- Resolution
- unresolved
- no resolver link, observed 2026-08-11T22:09:17.215312Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 4c8538f3-283b-417b-bcd7-4cdab6a206e4 · inbound
Fast Laplace transforms on quantum computers cites this paper.
Fast Laplace transforms on quantum computers Rise of conditionally clean ancillae for efficient quantum circuit constructions
Reference 46
- Resolution
- unresolved
- no resolver link, observed 2026-08-11T21:05:24.074403Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation ec63f663-70f9-423b-ad33-8472302b2854 · inbound
A simple algorithm to reflect through eigenspaces of unitaries cites this paper.
A simple algorithm to reflect through eigenspaces of unitaries Rise of conditionally clean ancillae for efficient quantum circuit constructions
Reference 21
- Resolution
- unresolved
- no resolver link, observed 2026-08-11T17:12:14.942339Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 53c79a20-7b82-4b2d-889c-53638d35f3f0 · inbound
Ancilla-free Quantum Adder with Sublinear Depth cites this paper.
Ancilla-free Quantum Adder with Sublinear Depth Rise of conditionally clean ancillae for efficient quantum circuit constructions
Reference 2
- Resolution
- unresolved
- no resolver link, observed 2026-08-10T10:48:18.745529Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 6cb47400-f663-4b00-ba89-5848faba09b2 · inbound
On Exact Space-Depth Trade-Offs in Multi-Controlled Toffoli Decomposition cites this paper.
On Exact Space-Depth Trade-Offs in Multi-Controlled Toffoli Decomposition Rise of conditionally clean ancillae for efficient quantum circuit constructions
Reference 21
- Resolution
- unresolved
- no resolver link, observed 2026-08-09T15:28:21.282897Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 40681d8b-3ef1-47b4-8ff4-62397d6da470 · inbound
Multi-Controlled Quantum Gates in Linear Nearest Neighbor cites this paper.
Multi-Controlled Quantum Gates in Linear Nearest Neighbor Rise of conditionally clean ancillae for efficient quantum circuit constructions
Reference 48
- Resolution
- unresolved
- no resolver link, observed 2026-08-07T12:13:34.165635Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 780a026b-c19f-41a6-9c4c-4326640ac492 · inbound
Quantum algorithm for solving differential equations using SLAC derivatives cites this paper.
Quantum algorithm for solving differential equations using SLAC derivatives Rise of conditionally clean ancillae for efficient quantum circuit constructions
Reference 34
- Resolution
- verified exact
- arxiv_id, observed 2026-05-11T17:56:07.554060Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation d38daefe-6617-42f4-9b4f-ba6b47c90220 · inbound
Quantum algorithm for solving differential equations using SLAC derivatives cites this paper.
Quantum algorithm for solving differential equations using SLAC derivatives Rise of conditionally clean ancillae for efficient quantum circuit constructions
Reference 34
- Resolution
- verified exact
- arxiv_id, observed 2026-07-01T13:15:45.817371Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-14T06:32:32.682623+00:00.
Observation 4aad0e7e-f848-4843-af3e-4d711b734f84 · inbound
Quantum Arithmetic Circuits in Public-Key Cryptography cites this paper.
Quantum Arithmetic Circuits in Public-Key Cryptography Rise of conditionally clean ancillae for efficient quantum circuit constructions
Reference 57
- Resolution
- unresolved
- no resolver link, observed 2026-07-14T03:41:44.573679Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 2fc270dc-4404-4c63-99ab-f37e79957f75 · inbound
ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation cites this paper.
ReOC: Compilation of Recursive Quantum Oracles with Recursion-Aware Uncomputation Rise of conditionally clean ancillae for efficient quantum circuit constructions
Reference 12
- Resolution
- unresolved
- no resolver link, observed 2026-08-12T00:43:08.467396Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.