Paper Citation Record · LEDGER

Nearly optimal quantum circuits for Boolean oracles

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

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

pith.paper-citation-record.v1
2607.28402 v1

Coverage vector

measured 25 of 25 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-31T08:30:41.721277Z

measured 25 of 25 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 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

25 of 25 outbound references displayed

verified exact0
verified fuzzy0
unresolved25
parse uncertain0
malformed identifier0
metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 6640bf1d-4eb4-4d1d-9d7c-46cc678b9647 · outbound

This paper cites Quantum Linear System Solver Based on Time-optimal Adiabatic Quantum Computing and Quantum Approximate Optimization Algorithm.

Nearly optimal quantum circuits for Boolean oracles Quantum Linear System Solver Based on Time-optimal Adiabatic Quantum Computing and Quantum Approximate Optimization Algorithm

Reference 1

Resolution: unresolved; no resolver link, observed 2026-07-31T08:30:41.431287Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4e2951c6-d543-46e5-a5f7-f3182a8f6cbb · outbound

This paper cites Multiplicative complexity of vector valued Boolean functions.

Nearly optimal quantum circuits for Boolean oracles Multiplicative complexity of vector valued Boolean functions

Reference 2

Resolution: unresolved; no resolver link, observed 2026-07-31T08:30:41.434669Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 0e2b8616-507f-430f-b8ed-8d902e47a758 · outbound

This paper cites Berry, Nathan Wiebe, Jarrod McClean, Alexandru Paler, Austin Fowler, and Hartmut Neven.

Nearly optimal quantum circuits for Boolean oracles Berry, Nathan Wiebe, Jarrod McClean, Alexandru Paler, Austin Fowler, and Hartmut Neven

Reference 3

Resolution: unresolved; no resolver link, observed 2026-07-31T08:30:41.438211Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f3973c86-cd3d-4bb1-9ad0-b327fc67d7ec · outbound

This paper cites Optimal T depth quantum circuits for implementing arbitrary Boolean functions, June 2025.

Nearly optimal quantum circuits for Boolean oracles Optimal T depth quantum circuits for implementing arbitrary Boolean functions, June 2025

Reference 4

Resolution: unresolved; no resolver link, observed 2026-07-31T08:30:41.442093Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation c7600876-1c6c-4ff9-bd73-f499de104cde · outbound

This paper cites an unresolved cited work.

Nearly optimal quantum circuits for Boolean oracles Unresolved cited work

Reference 5

Resolution: unresolved; no resolver link, observed 2026-07-31T08:30:41.445068Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation af2e2b03-9fde-4fbb-8408-4028f6d46e97 · outbound

This paper cites Kumar, and David Zuckerman.

Nearly optimal quantum circuits for Boolean oracles Kumar, and David Zuckerman

Reference 6

Resolution: unresolved; no resolver link, observed 2026-07-31T08:30:41.451654Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 072599b5-c9cc-4591-b0ff-33aa81b1439f · outbound

This paper cites Implementing grover oracles for quantum key search on AES and LowMC.

Nearly optimal quantum circuits for Boolean oracles Implementing grover oracles for quantum key search on AES and LowMC

Reference 7

Resolution: unresolved; no resolver link, observed 2026-07-31T08:30:41.465142Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation bb81aee2-d541-41b8-9d75-17a6cb22e84b · outbound

This paper cites an unresolved cited work.

Nearly optimal quantum circuits for Boolean oracles Unresolved cited work

Reference 8

Resolution: unresolved; no resolver link, observed 2026-07-31T08:30:41.484816Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation b3046183-13ba-4312-aea3-239d538c1bbb · outbound

This paper cites an unresolved cited work.

Nearly optimal quantum circuits for Boolean oracles Unresolved cited work

Reference 9

Resolution: unresolved; no resolver link, observed 2026-07-31T08:30:41.487792Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d0aca38d-14c5-4827-b8cb-ab74c624d257 · outbound

This paper cites Trading T gates for dirty qubits in state preparation and unitary synthesis.

Nearly optimal quantum circuits for Boolean oracles Trading T gates for dirty qubits in state preparation and unitary synthesis

Reference 10

Resolution: unresolved; no resolver link, observed 2026-07-31T08:30:41.494739Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2962dfc3-a846-43b4-b25f-bd20b0517e0c · outbound

This paper cites an unresolved cited work.

Nearly optimal quantum circuits for Boolean oracles Unresolved cited work

Reference 11

Resolution: unresolved; no resolver link, observed 2026-07-31T08:30:41.515150Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4c266055-610f-48ff-9e98-1f69ed480334 · outbound

This paper cites Halving the cost of QROM , May 2026.

Nearly optimal quantum circuits for Boolean oracles Halving the cost of QROM , May 2026

Reference 12

Resolution: unresolved; no resolver link, observed 2026-07-31T08:30:41.524810Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 63da6b13-a0cd-4159-8ba5-18d7c40ea127 · outbound

This paper cites The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits.

Nearly optimal quantum circuits for Boolean oracles The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits

Reference 13

Resolution: unresolved; no resolver link, observed 2026-07-31T08:30:41.527608Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 2eb15c84-9e4d-43d7-b955-3541f1886d09 · outbound

This paper cites Quantum circuit for multi-qubit Toffoli gate with optimal resource, February 2024.

Nearly optimal quantum circuits for Boolean oracles Quantum circuit for multi-qubit Toffoli gate with optimal resource, February 2024

Reference 14

Resolution: unresolved; no resolver link, observed 2026-07-31T08:30:41.536663Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation ce33d3aa-f61b-44c9-bf4c-8d57ac99b8ab · outbound

This paper cites Optimization of Quantum Read-Only Memory Circuits , April 2022.

Nearly optimal quantum circuits for Boolean oracles Optimization of Quantum Read-Only Memory Circuits , April 2022

Reference 15

Resolution: unresolved; no resolver link, observed 2026-07-31T08:30:41.545244Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation d1d64f62-a6cb-49eb-a0ea-8668a22b4afb · outbound

This paper cites an unresolved cited work.

Nearly optimal quantum circuits for Boolean oracles Unresolved cited work

Reference 16

Resolution: unresolved; no resolver link, observed 2026-07-31T08:30:41.574741Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 02de5550-1450-4875-b889-d4d0b3ad39d3 · outbound

This paper cites LUT-Based Hierarchical Reversible Logic Synthesis.

Nearly optimal quantum circuits for Boolean oracles LUT-Based Hierarchical Reversible Logic Synthesis

Reference 17

Resolution: unresolved; no resolver link, observed 2026-07-31T08:30:41.625714Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 11efaed1-89bb-4a63-84fb-874654a9f008 · outbound

This paper cites BDD-based synthesis of reversible logic for large functions.

Nearly optimal quantum circuits for Boolean oracles BDD-based synthesis of reversible logic for large functions

Reference 18

Resolution: unresolved; no resolver link, observed 2026-07-31T08:30:41.664316Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 7348e8e0-36bf-4dd1-a93d-e7fd84d3d591 · outbound

This paper cites Asymptotically optimal synthesis of reversible circuits.

Nearly optimal quantum circuits for Boolean oracles Asymptotically optimal synthesis of reversible circuits

Reference 19

Resolution: unresolved; no resolver link, observed 2026-07-31T08:30:41.667265Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation f96b62ca-7e58-4250-8edd-61dc09ac7274 · outbound

This paper cites Zakablukov.

Nearly optimal quantum circuits for Boolean oracles Zakablukov

Reference 20

Resolution: unresolved; no resolver link, observed 2026-07-31T08:30:41.670042Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 1bab19ff-4aac-4488-8ff6-129739e3089a · outbound

This paper cites Zakablukov.

Nearly optimal quantum circuits for Boolean oracles Zakablukov

Reference 21

Resolution: unresolved; no resolver link, observed 2026-07-31T08:30:41.672435Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 4525b224-f343-4cdc-8212-d094fc8387ab · outbound

This paper cites Zakablukov.

Nearly optimal quantum circuits for Boolean oracles Zakablukov

Reference 22

Resolution: unresolved; no resolver link, observed 2026-07-31T08:30:41.674799Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 54e810ac-17a6-42d2-890c-0680c7e7814f · outbound

This paper cites Quantum State Preparation with Optimal Circuit Depth : Implementations and Applications.

Nearly optimal quantum circuits for Boolean oracles Quantum State Preparation with Optimal Circuit Depth : Implementations and Applications

Reference 23

Resolution: unresolved; no resolver link, observed 2026-07-31T08:30:41.696598Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 13212f74-5981-45bc-a7cf-16dce3d8fb49 · outbound

This paper cites Unified architecture for quantum lookup tables.

Nearly optimal quantum circuits for Boolean oracles Unified architecture for quantum lookup tables

Reference 24

Resolution: unresolved; no resolver link, observed 2026-07-31T08:30:41.699034Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Observation 13daeb30-8464-4160-96b7-117e65f3a9ae · outbound

This paper cites Circuit complexity of quantum access models for encoding classical data.

Nearly optimal quantum circuits for Boolean oracles Circuit complexity of quantum access models for encoding classical data

Reference 25

Resolution: unresolved; no resolver link, observed 2026-07-31T08:30:41.721277Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

Pith citing papers

No inbound Pith citation observations are available.