Pith. sign in

Paper Citation Record · LEDGER

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding

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

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

pith.paper-citation-record.v1
2607.28260 v1

Coverage vector

measured 68 of 68 reference resolution

Typed states for the displayed outbound observations.

Source: paper_references, paper_reference_links, observed 2026-07-31T13:00:33.098093Z

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

68 of 68 outbound references displayed

  • verified exact12
  • verified fuzzy0
  • unresolved52
  • parse uncertain0
  • malformed identifier4
  • metadata mismatch0

External citation measurements

No source-named external measurement is stored.

Outbound references

Observation 0ba99329-2b67-42c3-8fbf-9e924be9237b · outbound

This paper cites Berry, Ian D.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Berry, Ian D

Reference 1

Resolution
malformed identifier
doi_truncated, observed 2026-07-31T13:00:55.694546Z

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-07-31T13:00:28.179817Z digest=sha256:3706fee81fb3fff10ba2e7f7893b4773c5d298b347808a9a073c2173127433ed

Observation 6a3dfc10-bd1e-4c18-857c-073af4bcb0bb · outbound

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

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Berry, Nathan Wiebe, Jarrod McClean, Alexandru Paler, Austin Fowler, and Hartmut Neven

Reference 2

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:28.244565Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:28.244565Z digest=sha256:57fbf1a072edafd06cd94390fb0d164c87ac112344e61a89f3a6f07b3453677c

Observation 62005a07-70f1-4926-bfee-c027815a73bb · outbound

This paper cites Bennett, Richard Cleve, David P.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Bennett, Richard Cleve, David P

Reference 3

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:28.325441Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:28.325441Z digest=sha256:4674924e72c973bf5ab21404a4c3b6e46206d236d02b6ab5109de01b3916849f

Observation 1765369b-563d-43ab-8a70-d1f820c9300a · outbound

This paper cites Berry, Andrew M.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Berry, Andrew M

Reference 4

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:28.429762Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:28.429762Z digest=sha256:a697e0408dbb3b807db3b65df30f039a5e2d0478d650304bf102dbd0cad98e8f

Observation acb11bda-cb38-4243-9881-eb2acdc3457b · outbound

This paper cites Berry, Andrew M.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Berry, Andrew M

Reference 5

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:28.477102Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:28.477102Z digest=sha256:5c8201ffab332737a53b45a7e1714b8cfd88a45a85c6d5a01a95e64a0f2090cb

Observation dd462396-e81f-4a17-833e-274ff174238b · outbound

This paper cites Lower bounds on the non-Clifford resources for quantum computations.Quantum Sci.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Lower bounds on the non-Clifford resources for quantum computations.Quantum Sci

Reference 6

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:28.530605Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:28.530605Z digest=sha256:7b0a2600d340d017e5367c2f59c2decd349a13b0aeceff8f7d3cdc92c4a68d4a

Observation 2f7cd9cb-adec-41c6-a72f-8b9badfe542a · outbound

This paper cites Universal quantum computation with ideal Clifford gates and noisy ancillas.Phys.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Universal quantum computation with ideal Clifford gates and noisy ancillas.Phys

Reference 7

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:28.593143Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:28.593143Z digest=sha256:310393f57974c4d9a6036799c4c68ae46b8570befade97520637cc2037653817

Observation 5a5775db-0f71-474d-915e-c11a0b165c59 · outbound

This paper cites Explicit quantum circuits for block encodings of certain sparse matrices.SIAM J.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Explicit quantum circuits for block encodings of certain sparse matrices.SIAM J

Reference 8

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:28.649114Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:28.649114Z digest=sha256:631f8dbe7b8638d0bf7c10265c99c8252696e8d1000206737520796c2939c05f

Observation 30fb4240-d8fd-4b86-9c4f-86446cd27b77 · outbound

This paper cites Resource-state quantum RAM for fast and error-correctable queries.Nat.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Resource-state quantum RAM for fast and error-correctable queries.Nat

Reference 9

Resolution
verified exact
doi, observed 2026-07-31T13:00:55.494630Z

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-07-31T13:00:28.715886Z digest=sha256:0af71efa9e2ef4a06b6b06fcc3a5f10e99b08fd10ebe9f09d6bef999832bca23

Observation 2d8c08f3-4c12-4512-bed3-2f8cab044297 · outbound

This paper cites Quantum regularized least squares.Quantum, 7:988, April 2023.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Quantum regularized least squares.Quantum, 7:988, April 2023

Reference 10

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:28.780855Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:28.780855Z digest=sha256:d80729054d457e894ba37514cbfa26b2f7bb4748b20cc8727a70531e240ae370

Observation 11553d6e-e840-4dc0-b2e9-ca813eeaab62 · outbound

This paper cites Quantum algorithm for Discrete Gaussian Sampling.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Quantum algorithm for Discrete Gaussian Sampling

Reference 11

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:28.824208Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:28.824208Z digest=sha256:1d614ede386d4ff3c01d1208f2395764b64c87578024524f964813dcc35fb667

Observation 84ea4e1b-f3ae-4659-a6d6-7aa5bab4cb86 · outbound

This paper cites Childs, Robin Kothari, and Rolando D.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Childs, Robin Kothari, and Rolando D

Reference 12

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:28.875877Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:28.875877Z digest=sha256:9343fcbf1d460dfd36c4263391967d579b7c9184f494925c41d0d2e24b9526db

Observation 7c139f93-c8d6-4ca9-ab0c-11d73859290e · outbound

This paper cites David Clader, Bryan C.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding David Clader, Bryan C

Reference 13

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:28.917760Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:28.917760Z digest=sha256:1551aab4b589286e1b97a29d14ac6249389a1bc41b3894122457cad0e4ce0836

Observation c090c3ff-e7e4-43e2-89a3-31db7176287b · outbound

This paper cites David Clader, Alexander M.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding David Clader, Alexander M

Reference 14

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:28.961056Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:28.961056Z digest=sha256:aab91134d770b83e98789090c10daa02c51d6943e86c6f0fbee1a541c2dd01a8

Observation 569e6a03-0c7a-4db7-b9de-85a7a2a78656 · outbound

This paper cites Costa, Dong An, Yuval R.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Costa, Dong An, Yuval R

Reference 15

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:29.043088Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:29.043088Z digest=sha256:33e85a5b2fd81cd376b67ea240497b9b0b2f7a08dde8b3e78ea736a585a4fc89

Observation 46cbebbe-7e16-4af8-bd67-a4780c4cf241 · outbound

This paper cites an unresolved cited work.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Unresolved cited work

Reference 16

Resolution
verified exact
doi, observed 2026-07-31T13:00:55.368745Z

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-07-31T13:00:29.119261Z digest=sha256:ff88168e5ffe2f5a804774320806e0ed7047853c2179c26debdd718f74de658f

Observation e51a5f95-9a81-49d6-b70f-362f89efa729 · outbound

This paper cites Fault-tolerant resource estimation of quantum random-access memories.IEEE Trans.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Fault-tolerant resource estimation of quantum random-access memories.IEEE Trans

Reference 17

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:29.211925Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:29.211925Z digest=sha256:357a384689280c5b1ffc561dc2cea7755d8c5171e886cc7c33f6615ae1e9946d

Observation bbb82c37-81f7-4758-ad7f-3aeef5dfccb9 · outbound

This paper cites RecSplit: minimal perfect hashing via recursive splitting.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding RecSplit: minimal perfect hashing via recursive splitting

Reference 18

Resolution
verified exact
doi, observed 2026-07-31T13:00:55.257069Z

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-07-31T13:00:29.313120Z digest=sha256:7ce81daa4de3637e16c2668d4fb0934d5dde533f33ea960381e315fbfcc0d4f0

Observation a2ba4557-7060-4c02-9207-6020acc33734 · outbound

This paper cites Halving the cost of quantum addition.Quantum, 2:74, June 2018.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Halving the cost of quantum addition.Quantum, 2:74, June 2018

Reference 19

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:29.462444Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:29.462444Z digest=sha256:938c1505d0d11cfba29c872c56db3d8f3ec974bd3601648e21a45b7960689b3a

Observation bfebcde4-c79c-4e8f-a48f-30087549cfcf · outbound

This paper cites an unresolved cited work.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Unresolved cited work

Reference 20

Resolution
verified exact
doi, observed 2026-07-31T13:00:55.151449Z

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-07-31T13:00:29.374131Z digest=sha256:5574b242bd4febd0c17fac5375c02ce78f748b7385d7fe3ee34a38190eeeeb4d

Observation 72ede5d2-61a7-44bf-a306-12eb6f78e90c · outbound

This paper cites Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics

Reference 21

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:29.626117Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:29.626117Z digest=sha256:5726f6e8ff90d9e18b4fa61cc76bbd38fc28ae39904544d6ffcf25f0bba292e3

Observation 162660a0-dd42-48f9-a407-af6f76a6df25 · outbound

This paper cites Magic state cultivation: growing T states as cheap as CNOT gates.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Magic state cultivation: growing T states as cheap as CNOT gates

Reference 22

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:29.547495Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:29.547495Z digest=sha256:c1a85ab320bacdd3135002d8179bf1f95f9eda1b17f4ee5562cb1d17038a6f48

Observation 499a924d-2bd6-429c-9bc3-3126dc3fc40c · outbound

This paper cites Quantum random access memory.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Quantum random access memory

Reference 23

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:29.769437Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:29.769437Z digest=sha256:9103f954be9e9fe49f8a27896e063b672e7ed53dacf76ad195a792ead131f3b7

Observation cc92283f-2ac2-4751-bb2b-257727d9dfbb · outbound

This paper cites Architectures for a quantum random access memory.Phys.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Architectures for a quantum random access memory.Phys

Reference 24

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:29.697756Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:29.697756Z digest=sha256:b9c3ed79b1d1d68db98548c99fc08f031b7a0551d9dbc38f3384a640b39a343d

Observation 30aa3ccd-9c6a-4c86-bb6a-bac9c6faaa5c · outbound

This paper cites Multi-qubit Toffoli with exponentially fewer T gates, 2025.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Multi-qubit Toffoli with exponentially fewer T gates, 2025

Reference 25

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:29.914632Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:29.914632Z digest=sha256:b5b18d69240eab9caa0424b15237df23e1ba61df900b072b04fa0493e8fc7641

Observation c53b647e-12a5-4de6-8575-d22bb0a3fcdd · outbound

This paper cites An efficient algorithm for sparse quantum state preparation.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding An efficient algorithm for sparse quantum state preparation

Reference 26

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:29.847296Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:29.847296Z digest=sha256:59baef5f2617f60d9a49087daa6e224c2dc30b60d6556a4ff9721bac079cda7a

Observation d902cf8c-c19a-480f-ae6d-8a788de06d65 · outbound

This paper cites The Heisenberg Representation of Quantum Computers.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding The Heisenberg Representation of Quantum Computers

Reference 27

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:30.097409Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:30.097409Z digest=sha256:3e1e25c90044cc11ab17a2a4e6269750872701a7bd81c25fad1f9f23c1b3a9d2

Observation 870655ed-50d4-4c7a-827e-a1fcf42b1f46 · outbound

This paper cites Quantum state preparation with optimal T- count.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Quantum state preparation with optimal T- count

Reference 28

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:30.006733Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:30.006733Z digest=sha256:5bb7e57d1d01b1bfc3edb9f6833beb8be38f6ac1613d223b40aaf829fd7bc21f

Observation dd45c7cb-8e55-428e-ad1a-e84230e8f94d · outbound

This paper cites Hann, Gideon Lee, S.M.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Hann, Gideon Lee, S.M

Reference 29

Resolution
malformed identifier
no resolver link, observed 2026-07-31T13:00:30.247036Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:30.247036Z digest=sha256:29bec887dd731e91296bfc77031caeb933d40c9d88baf87acba97cfe384a5483

Observation c5a68338-7329-4157-80d8-a73a46e77b0d · outbound

This paper cites Space-time optimized table lookup.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Space-time optimized table lookup

Reference 30

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:30.163814Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:30.163814Z digest=sha256:54c2dabab9e39ffb568e7c3bd2c8276ba5dce4abb1de2de2e022425f1e6ce3f0

Observation 47d0f508-e548-4739-969f-b56bf1fab77c · outbound

This paper cites an unresolved cited work.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Unresolved cited work

Reference 31

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:30.367712Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:30.367712Z digest=sha256:f50bacc33f73f9aa74d9d83795253b1c183927da072822cbd0e33d2214bdd1d6

Observation a5a46600-5733-443d-ab0b-4bd27d32fc31 · outbound

This paper cites Harrow, Avinatan Hassidim, and Seth Lloyd.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Harrow, Avinatan Hassidim, and Seth Lloyd

Reference 32

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:30.307255Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:30.307255Z digest=sha256:cb307e2c869bfa2c1f4319b9410db5e7b7fa9b45bb7dc2e24ca269b96c8ac3b0

Observation 6c1bc1b6-7eb1-4611-b478-8781fffeb18f · outbound

This paper cites Kim and Tuomas Laakkonen.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Kim and Tuomas Laakkonen

Reference 33

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:30.515444Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:30.515444Z digest=sha256:9e89a1ad75e6ec5dce8dd39f0b48c4298303d7ab8001edd966009e24104ac888

Observation 8973ccb0-7a1f-4afd-a846-f01d8c1a7361 · outbound

This paper cites Whitfield, Alejandro Perdomo-Ortiz, Man-Hong Yung, and Al´ an Aspuru-Guzik.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Whitfield, Alejandro Perdomo-Ortiz, Man-Hong Yung, and Al´ an Aspuru-Guzik

Reference 34

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:30.454872Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:30.454872Z digest=sha256:30c1ba0fd19400a270d30fc70b50b79745f80266db52168e5c4b3f50a892beff

Observation 41f6d40b-a007-4b08-a754-6d136eec6407 · outbound

This paper cites Nearly optimal circuit size for sparse quantum state prepara- tion.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Nearly optimal circuit size for sparse quantum state prepara- tion

Reference 35

Resolution
malformed identifier
no resolver link, observed 2026-07-31T13:00:30.678956Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:30.678956Z digest=sha256:4ea9b75f395f5e18a6f58b511ecbf9011ea3c9ca4196b630d0f3951ca1bb00bf

Observation da4431f4-681c-44d0-89f0-4a9127f002fb · outbound

This paper cites Another subexponential-time quantum algorithm for the dihedral hidden subgroup problem.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Another subexponential-time quantum algorithm for the dihedral hidden subgroup problem

Reference 36

Resolution
verified exact
doi, observed 2026-07-31T13:00:54.946483Z

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-07-31T13:00:30.594680Z digest=sha256:d25ec2c8f1ac97c85d1949e23c937d2af603cf17846282e2871908a07cf5b769

Observation c73bad4e-59f1-4704-8171-e9cd504564fc · outbound

This paper cites Magic state distillation: not as costly as you think.Quantum, 3:205, December.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Magic state distillation: not as costly as you think.Quantum, 3:205, December

Reference 37

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:30.850982Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:30.850982Z digest=sha256:2018eb5113d7b193fd7e264e3f53b14767e7f077874927d7d0869d745b6859f8

Observation c8d02b0d-bdde-4f29-b1b3-86d3ae15d00b · outbound

This paper cites Improved Dual Attack and Trapdoor Sampling via Quantum Rejection Sampling.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Improved Dual Attack and Trapdoor Sampling via Quantum Rejection Sampling

Reference 38

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:30.764781Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:30.764781Z digest=sha256:76b862d3568ef00e0f424a9f489390094db4a2d37c6f86ae914317bd45dd46ef

Observation 3dca6ea1-5c15-428d-acfb-706b389cf1a4 · outbound

This paper cites Trading T gates for dirty qubits in state preparation and unitary synthesis.Quantum, 8:1375, June 2024.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Trading T gates for dirty qubits in state preparation and unitary synthesis.Quantum, 8:1375, June 2024

Reference 39

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:31.097987Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:31.097987Z digest=sha256:7167d12c195d1092aba12b93a02521db5f1429d05b58f94a2f9dcbef958276e6

Observation caa6fda2-e460-4717-8d9c-779d06213ca4 · outbound

This paper cites Quantum circuits for sparse isometries.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Quantum circuits for sparse isometries

Reference 40

Resolution
verified exact
doi, observed 2026-07-31T13:00:54.703438Z

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-07-31T13:00:31.179254Z digest=sha256:c4388bce0bf7035778f01fee080531896727978d39a80f211387343cc11d895c

Observation 54d5f4c4-6404-475c-bb24-924c61657318 · outbound

This paper cites an unresolved cited work.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Unresolved cited work

Reference 41

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:31.015865Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:31.015865Z digest=sha256:0f34780565262d5c805aea98113fc825ee0245c6989d24b2172577f12d2f325c

Observation 1a68dde4-91cd-4c3d-bc8c-b590c6153a8e · outbound

This paper cites Quantum algorithms and the finite element method.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Quantum algorithms and the finite element method

Reference 42

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:31.337314Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:31.337314Z digest=sha256:8bb9c6888397f84526c0b49505f13a743ee82dd4ffa51311f6c05fa3a88eb9b1

Observation 4ad7c3ee-76aa-44c3-9df3-7986923eb49f · outbound

This paper cites Halving the cost of QROM.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Halving the cost of QROM

Reference 43

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:31.429578Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:31.429578Z digest=sha256:af50b99aabedd8cb883e237f469b192a019cb41d8ae09549c133beb981ebc894

Observation e1c6aa81-9ba2-4202-a618-4fddc35f06b7 · outbound

This paper cites Toward optimal circuit size for sparse quantum state preparation.Phys.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Toward optimal circuit size for sparse quantum state preparation.Phys

Reference 44

Resolution
verified exact
doi, observed 2026-07-31T13:00:54.590986Z

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-07-31T13:00:31.272331Z digest=sha256:ed77da506fd2bd06141de6902f88139269c30ed8c2c3fff93ee49605c093f594

Observation 6b509324-3b12-401c-986a-926702cc8dd8 · outbound

This paper cites Quantum rejection sampling.ACM Trans.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Quantum rejection sampling.ACM Trans

Reference 45

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:31.581981Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:31.581981Z digest=sha256:b0967af0e3a166d82b919d97257942e312589771a12e027a16b6b72f5a173911

Observation 1c82730a-3d2f-4e35-b959-edea120c6ee2 · outbound

This paper cites Hash and displace: efficient evaluation of minimal perfect hash functions.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Hash and displace: efficient evaluation of minimal perfect hash functions

Reference 46

Resolution
verified exact
doi, observed 2026-07-31T13:00:54.310204Z

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-07-31T13:00:31.668363Z digest=sha256:0789c6a1b58ca1d82817eb827adf047932c240d582a988414ebcc87b8db64ace

Observation 0c98c6ad-c15b-4672-96a4-b5eff88443f6 · outbound

This paper cites Efficient deterministic preparation of quantum states using decision diagrams.Phys.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Efficient deterministic preparation of quantum states using decision diagrams.Phys

Reference 47

Resolution
verified exact
doi, observed 2026-07-31T13:00:54.491401Z

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-07-31T13:00:31.497446Z digest=sha256:b1af2d9fde22d55efebe96e931285b7ff473d8839d0dcb52b17acf61697aeff1

Observation feb6d0db-f4e1-41c4-8d53-6a50de5fee73 · outbound

This paper cites Lefterovici, and Antonio F.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Lefterovici, and Antonio F

Reference 48

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:31.818007Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:31.818007Z digest=sha256:2f9babd4462a85dfc9156ddd3b9a14bdf0789be00ef5574d48b9a496e4c6f72f

Observation 5a3325ae-81d2-49a7-9173-89c7b0f16086 · outbound

This paper cites Ross and Peter Selinger.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Ross and Peter Selinger

Reference 49

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:31.879949Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:31.879949Z digest=sha256:58ff16bbdb7d54933301f28a760d7268ee4f49e1003aaaf4d3b2e1cf5da70c7a

Observation bf6729bd-32fe-490d-98e8-513ae61640ce · outbound

This paper cites Parallelising the queries in bucket brigade quantum RAM.Phys.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Parallelising the queries in bucket brigade quantum RAM.Phys

Reference 50

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:31.757337Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:31.757337Z digest=sha256:01b1a6bce026e80ad10212ee86338f01974f4845606924ac09b410c0166e480a

Observation 17986579-017a-4d0a-91eb-5d809343e44f · outbound

This paper cites Sanders, Guang Hao Low, Artur Scherer, and Dominic W.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Sanders, Guang Hao Low, Artur Scherer, and Dominic W

Reference 51

Resolution
malformed identifier
no resolver link, observed 2026-07-31T13:00:32.050722Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:32.050722Z digest=sha256:b9d4561be6f7d755349602936460d15c862e85e989cfccf94b845980954c61c0

Observation 746ec8d9-8d58-4a7c-8537-c67746faf85e · outbound

This paper cites an unresolved cited work.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Unresolved cited work

Reference 52

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:32.145297Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:32.145297Z digest=sha256:19b1cfbe5dd09425c1c67bf767d6dbe280a566116b1983a1123c31a6ac5783f8

Observation 7c7ecb86-d52d-475f-8d26-98483ce396fc · outbound

This paper cites Sparse quantum state preparation with improved Toffoli cost, 2026.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Sparse quantum state preparation with improved Toffoli cost, 2026

Reference 53

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:31.956381Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:31.956381Z digest=sha256:9db7165978d35bb044e4e65e56caa50d8c8c806e12e1fa9129de18261807c790

Observation ca76d6b5-33e9-4e3f-9308-74d73bee1ed5 · outbound

This paper cites Temme, T.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Temme, T

Reference 54

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:32.293999Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:32.293999Z digest=sha256:9774b7935943ed876af83a12810ae1d4b7a371f95555b90b2681699d69155898

Observation 853fd114-08da-4a7e-b7c9-43beaec3b4ca · outbound

This paper cites Quantum data fitting.Phys.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Quantum data fitting.Phys

Reference 55

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:32.395719Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:32.395719Z digest=sha256:4a7a188e0ba6639e607d709e5b417befb9f8e29c48419ef33de74f4c06cb9817

Observation 9277ddef-fca6-4643-823c-0be356feba4c · outbound

This paper cites Block-encoding structured matrices for data input in quantum computing.Quantum, 8:1226, January 2024.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Block-encoding structured matrices for data input in quantum computing.Quantum, 8:1226, January 2024

Reference 56

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:32.233580Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:32.233580Z digest=sha256:e433636da43735861f4f569461cfdcc836fe0fd1fcfa4d99c14fbc38b7ff5067

Observation f8289917-3ff2-4ead-a1f4-8fb7155410fb · outbound

This paper cites Dictionary-based block encoding of sparse matrices with low subnormalization and circuit depth.Quantum, 9:1805, July 2025.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Dictionary-based block encoding of sparse matrices with low subnormalization and circuit depth.Quantum, 9:1805, July 2025

Reference 57

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:32.532209Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:32.532209Z digest=sha256:0ffd8b47c23d77d55af65407c28ee648e597ebd152d586715227c1b44b76a083

Observation 67db6c01-8ecb-45c2-8a68-1de7c290d2fd · outbound

This paper cites Reducing circuit depth in quantum state preparation for quantum simulation using measurements and feedforward.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Reducing circuit depth in quantum state preparation for quantum simulation using measurements and feedforward

Reference 58

Resolution
verified exact
doi, observed 2026-07-31T13:00:54.133676Z

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-07-31T13:00:32.584455Z digest=sha256:87d38d21b7fe0a774c8eae4336019c980f3b86873edcbbefe46c19886e4a19dd

Observation e1e4526d-cd98-4bf5-88bb-1c62df8e3c1f · outbound

This paper cites Fat-Tree QRAM: A high-bandwidth shared quan- tum random access memory for parallel queries.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Fat-Tree QRAM: A high-bandwidth shared quan- tum random access memory for parallel queries

Reference 59

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:32.467552Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:32.467552Z digest=sha256:4d444d6d76ba8290bc60d825445e4a22431fa3489f983f04834cfa04d433ab79

Observation 6478da86-73b3-419f-bac4-d9296ac89e5e · outbound

This paper cites Circuit complexity of quantum access models for en- coding classical data.npj Quantum Inf., 10(1):42, April 2024.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Circuit complexity of quantum access models for en- coding classical data.npj Quantum Inf., 10(1):42, April 2024

Reference 60

Resolution
verified exact
doi, observed 2026-07-31T13:00:53.949752Z

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-07-31T13:00:32.797198Z digest=sha256:ae69e99b44b494c2c8df78376aa1108c79b474bc6eca588780ae98f467f54e74

Observation 79674621-b8c2-4f94-8486-99f14cdabb83 · outbound

This paper cites Quantum state preparation with opti- mal circuit depth: implementations and applications.Phys.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Quantum state preparation with opti- mal circuit depth: implementations and applications.Phys

Reference 61

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:32.866222Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:32.866222Z digest=sha256:2db7250534786238a0a42585f27aa593cf2ef96024941619a876ab603e19f6d8

Observation 2269b837-4043-4f50-bc65-071c554ed0cd · outbound

This paper cites Block encoding of sparse matrices with a periodic diagonal structure,.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Block encoding of sparse matrices with a periodic diagonal structure,

Reference 62

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:32.635767Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:32.635767Z digest=sha256:fc6e9bb3f4d272829f98511d16957e65f770264f365bea260a7cc3b8c9ecc26a

Observation 506e7218-cc8b-427c-a8c9-d27dd594e00e · outbound

This paper cites Constant-Depth Quantum Circuits for Arbitrary Quantum State Preparation via Measurement and Feedback.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Constant-Depth Quantum Circuits for Arbitrary Quantum State Preparation via Measurement and Feedback

Reference 63

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:33.098093Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:33.098093Z digest=sha256:889a95aa84613f62456a77ce45ffec583eef766f03d7e3776514227a2b7c051c

Observation 69959dce-b2e7-44b8-b96b-cbed981b7143 · outbound

This paper cites Unified architecture for quantum lookup tables.Phys.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Unified architecture for quantum lookup tables.Phys

Reference 67

Resolution
verified exact
doi, observed 2026-07-31T13:00:53.811552Z

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-07-31T13:00:33.024089Z digest=sha256:a42b66826e0dda08fa7a1085635e545d7b9c74b144c190e427361fc59c2b04e5

Observation 69a76200-21db-4920-a4da-00e8622862ad · outbound

This paper cites doi: 10.22331/q-2019-12-02-205.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding doi: 10.22331/q-2019-12-02-205

Reference 2019

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:30.934029Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:30.934029Z digest=sha256:9f3b62097c16b0bcb3d4da34ca81130bda878b44d084b2371ef8e1d87f899bc8

Observation 430f1342-223a-4fcd-8230-1bc93ca53a81 · outbound

This paper cites URLhttps://link.aps.org/doi/10.1103/ PhysRevLett.129.230504.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding URLhttps://link.aps.org/doi/10.1103/ PhysRevLett.129.230504

Reference 2022

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:32.944779Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:32.944779Z digest=sha256:42ac63c98b47aeb9d3ef5d058323d8a329ea7a129b7c736c23143e8df11efc72

Observation 5fe027ab-f9d5-4e7d-a2bb-2e1a52c70583 · outbound

This paper cites an unresolved cited work.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Unresolved cited work

Reference 2026

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:32.690884Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:32.690884Z digest=sha256:d508bb120ff3ccbe23d74167b23f98f0c121310703305980dd051f8949454553

Observation 5aadee7b-67de-4a0d-b212-91bbf222b8f3 · outbound

This paper cites an unresolved cited work.

Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding Unresolved cited work

Reference 3457

Resolution
unresolved
no resolver link, observed 2026-07-31T13:00:28.382091Z

Source-reported events for the cited work

Unavailable: canonical work link unavailable.

source=pdf_text observed=2026-07-31T13:00:28.382091Z digest=sha256:350aa339fae32ea109202d67a214ae5331c32406f562c2d7d22ea862d77caa8c

Pith citing papers

No inbound Pith citation observations are available.