{"as_of":"2026-08-13T22:23:00Z","caps":{"database_statements":6,"inbound":100,"outbound":100},"context_digest":"sha256:b402a6444f5f5e009b19ee2793d9a62f0a20d285bf0ddbd5ffd3af61e6b0e672","coverage":[{"denominator":68,"lane":"reference_resolution","note":"Typed states for the displayed outbound observations.","records_observed":68,"source":"paper_references, paper_reference_links","source_observed_at":"2026-07-31T13:00:33.098093Z","state":"measured"},{"denominator":68,"lane":"standing_notices","note":"One-hop event checks from named stored sources.","records_observed":68,"source":"scholarly_work_events, retraction_status_cache","source_observed_at":"2026-08-13T06:32:02.005865+00:00","state":"measured"},{"denominator":0,"lane":"inbound_itemization","note":"Pith citing papers itemized under the disclosed page cap.","records_observed":0,"source":"paper_references, paper_reference_links","source_observed_at":null,"state":"measured"},{"denominator":1,"lane":"external_citation_measurements","note":"A source-named dated measurement, never combined with another source.","records_observed":0,"source":"cited_works","source_observed_at":null,"state":"measured"}],"external_citation_measurements":[],"inbound":[],"links":{"evidence":"/evidence","html":"/paper/2607.28260/citation-record","integrity":"/paper/2607.28260/integrity","json":"/paper/2607.28260/citation-record.json","paper":"/paper/2607.28260"},"outbound":[{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1088/1367-2630/18/3/","metadata_source":"doi_reference","pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:55.620958Z","title":"Berry, Ian D","venue":null,"work_id":"d72c22f9-1413-4817-ad15-db9186682a82","year":2016},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":1,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:28.179817Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:3706fee81fb3fff10ba2e7f7893b4773c5d298b347808a9a073c2173127433ed","observation_id":"0ba99329-2b67-42c3-8fbf-9e924be9237b","resolution":{"observed_at":"2026-07-31T13:00:55.694546Z","resolver_source":"doi_truncated","status":"malformed_identifier"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:28.244565Z","title":"Berry, Nathan Wiebe, Jarrod McClean, Alexandru Paler, Austin Fowler, and Hartmut Neven","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":2,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:28.244565Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:57fbf1a072edafd06cd94390fb0d164c87ac112344e61a89f3a6f07b3453677c","observation_id":"6a3dfc10-bd1e-4c18-857c-073af4bcb0bb","resolution":{"observed_at":"2026-07-31T13:00:28.244565Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:28.325441Z","title":"Bennett, Richard Cleve, David P","venue":null,"work_id":null,"year":1995},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":3,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:28.325441Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:4674924e72c973bf5ab21404a4c3b6e46206d236d02b6ab5109de01b3916849f","observation_id":"62005a07-70f1-4926-bfee-c027815a73bb","resolution":{"observed_at":"2026-07-31T13:00:28.325441Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:28.429762Z","title":"Berry, Andrew M","venue":null,"work_id":null,"year":2015},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":4,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:28.429762Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:a697e0408dbb3b807db3b65df30f039a5e2d0478d650304bf102dbd0cad98e8f","observation_id":"1765369b-563d-43ab-8a70-d1f820c9300a","resolution":{"observed_at":"2026-07-31T13:00:28.429762Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:28.477102Z","title":"Berry, Andrew M","venue":null,"work_id":null,"year":2017},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":5,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:28.477102Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:5c8201ffab332737a53b45a7e1714b8cfd88a45a85c6d5a01a95e64a0f2090cb","observation_id":"acb11bda-cb38-4243-9881-eb2acdc3457b","resolution":{"observed_at":"2026-07-31T13:00:28.477102Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:28.530605Z","title":"Lower bounds on the non-Clifford resources for quantum computations.Quantum Sci","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":6,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:28.530605Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:7b0a2600d340d017e5367c2f59c2decd349a13b0aeceff8f7d3cdc92c4a68d4a","observation_id":"dd462396-e81f-4a17-833e-274ff174238b","resolution":{"observed_at":"2026-07-31T13:00:28.530605Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:28.593143Z","title":"Universal quantum computation with ideal Clifford gates and noisy ancillas.Phys","venue":null,"work_id":null,"year":2005},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":7,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:28.593143Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:310393f57974c4d9a6036799c4c68ae46b8570befade97520637cc2037653817","observation_id":"2f7cd9cb-adec-41c6-a72f-8b9badfe542a","resolution":{"observed_at":"2026-07-31T13:00:28.593143Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:28.649114Z","title":"Explicit quantum circuits for block encodings of certain sparse matrices.SIAM J","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":8,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:28.649114Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:631f8dbe7b8638d0bf7c10265c99c8252696e8d1000206737520796c2939c05f","observation_id":"5a5775db-0f71-474d-915e-c11a0b165c59","resolution":{"observed_at":"2026-07-31T13:00:28.649114Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1038/s41467-026-73275-x","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Resource-state quantum RAM for fast and error-correctable queries.Nat","venue":"Nature Communications","work_id":"55347395-ac66-4fb0-99f4-95e6fe584701","year":2026},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":9,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:28.715886Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:0af71efa9e2ef4a06b6b06fcc3a5f10e99b08fd10ebe9f09d6bef999832bca23","observation_id":"30fb4240-d8fd-4b86-9c4f-86446cd27b77","resolution":{"observed_at":"2026-07-31T13:00:55.494630Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:28.780855Z","title":"Quantum regularized least squares.Quantum, 7:988, April 2023","venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":10,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:28.780855Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:d80729054d457e894ba37514cbfa26b2f7bb4748b20cc8727a70531e240ae370","observation_id":"2d8c08f3-4c12-4512-bed3-2f8cab044297","resolution":{"observed_at":"2026-07-31T13:00:28.780855Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.20133","last_updated":"2026-05-19T17:17:29Z","snapshot_observed_at":"2026-08-08T01:12:26.236960Z","submitted_at":"2026-05-19T17:17:29Z","title":"Quantum algorithm for Discrete Gaussian Sampling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.20133","snapshot_observed_at":"2026-07-31T13:00:28.824208Z","title":"Quantum algorithm for discrete Gaussian sampling, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":11,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:28.824208Z"},"links":{"cited_paper":"/paper/2605.20133","citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:1d614ede386d4ff3c01d1208f2395764b64c87578024524f964813dcc35fb667","observation_id":"11553d6e-e840-4dc0-b2e9-ca813eeaab62","resolution":{"observed_at":"2026-07-31T13:00:28.824208Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:28.875877Z","title":"Childs, Robin Kothari, and Rolando D","venue":null,"work_id":null,"year":1920},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":12,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:28.875877Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:9343fcbf1d460dfd36c4263391967d579b7c9184f494925c41d0d2e24b9526db","observation_id":"84ea4e1b-f3ae-4659-a6d6-7aa5bab4cb86","resolution":{"observed_at":"2026-07-31T13:00:28.875877Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:28.917760Z","title":"David Clader, Bryan C","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":13,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:28.917760Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:1551aab4b589286e1b97a29d14ac6249389a1bc41b3894122457cad0e4ce0836","observation_id":"7c139f93-c8d6-4ca9-ab0c-11d73859290e","resolution":{"observed_at":"2026-07-31T13:00:28.917760Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:28.961056Z","title":"David Clader, Alexander M","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":14,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:28.961056Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:aab91134d770b83e98789090c10daa02c51d6943e86c6f0fbee1a541c2dd01a8","observation_id":"c090c3ff-e7e4-43e2-89a3-31db7176287b","resolution":{"observed_at":"2026-07-31T13:00:28.961056Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:29.043088Z","title":"Costa, Dong An, Yuval R","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":15,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:29.043088Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:33e85a5b2fd81cd376b67ea240497b9b0b2f7a08dde8b3e78ea736a585a4fc89","observation_id":"569e6a03-0c7a-4db7-b9de-85a7a2a78656","resolution":{"observed_at":"2026-07-31T13:00:29.043088Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/s11128-022-03549-y","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Quantum Information Processing","work_id":"1449715b-dba3-4d1b-bec9-f485a3a5f704","year":2022},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":16,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:29.119261Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:ff88168e5ffe2f5a804774320806e0ed7047853c2179c26debdd718f74de658f","observation_id":"46cbebbe-7e16-4af8-bd67-a4780c4cf241","resolution":{"observed_at":"2026-07-31T13:00:55.368745Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:29.211925Z","title":"Fault-tolerant resource estimation of quantum random-access memories.IEEE Trans","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":17,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:29.211925Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:357a384689280c5b1ffc561dc2cea7755d8c5171e886cc7c33f6615ae1e9946d","observation_id":"e51a5f95-9a81-49d6-b70f-362f89efa729","resolution":{"observed_at":"2026-07-31T13:00:29.211925Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611976007","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"RecSplit: minimal perfect hashing via recursive splitting","venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"92cdeb70-14f0-455b-936d-1bea1df93077","year":2020},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":18,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:29.313120Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:7ce81daa4de3637e16c2668d4fb0934d5dde533f33ea960381e315fbfcc0d4f0","observation_id":"bbb82c37-81f7-4758-ad7f-3aeef5dfccb9","resolution":{"observed_at":"2026-07-31T13:00:55.257069Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:29.462444Z","title":"Halving the cost of quantum addition.Quantum, 2:74, June 2018","venue":null,"work_id":null,"year":2018},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":19,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:29.462444Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:938c1505d0d11cfba29c872c56db3d8f3ec974bd3601648e21a45b7960689b3a","observation_id":"a2ba4557-7060-4c02-9207-6020acc33734","resolution":{"observed_at":"2026-07-31T13:00:29.462444Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1137/1.9781611976007.14","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":null,"venue":"Society for Industrial and Applied Mathematics eBooks","work_id":"17d63bd0-fc36-46e8-9950-4c323777bee8","year":null},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":20,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:29.374131Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:5574b242bd4febd0c17fac5375c02ce78f748b7385d7fe3ee34a38190eeeeb4d","observation_id":"bfebcde4-c79c-4e8f-a48f-30087549cfcf","resolution":{"observed_at":"2026-07-31T13:00:55.151449Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:29.626117Z","title":"Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":21,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:29.626117Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:5726f6e8ff90d9e18b4fa61cc76bbd38fc28ae39904544d6ffcf25f0bba292e3","observation_id":"72ede5d2-61a7-44bf-a306-12eb6f78e90c","resolution":{"observed_at":"2026-07-31T13:00:29.626117Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2409.17595","last_updated":"2024-09-26T07:21:58Z","snapshot_observed_at":"2026-08-13T21:53:07.774758Z","submitted_at":"2024-09-26T07:21:58Z","title":"Magic state cultivation: growing T states as cheap as CNOT gates","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2409.17595","snapshot_observed_at":"2026-07-31T13:00:29.547495Z","title":"Magic state cultivation: growing T states as cheap as CNOT gates, 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":22,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:29.547495Z"},"links":{"cited_paper":"/paper/2409.17595","citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:dfdf7ea7b80afc6f6e8278f182541b04adebb07d86554335ee69cb421a34c8b7","observation_id":"162660a0-dd42-48f9-a407-af6f76a6df25","resolution":{"observed_at":"2026-07-31T13:00:29.547495Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:29.769437Z","title":"Quantum random access memory","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":23,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:29.769437Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:9103f954be9e9fe49f8a27896e063b672e7ed53dacf76ad195a792ead131f3b7","observation_id":"499a924d-2bd6-429c-9bc3-3126dc3fc40c","resolution":{"observed_at":"2026-07-31T13:00:29.769437Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:29.697756Z","title":"Architectures for a quantum random access memory.Phys","venue":null,"work_id":null,"year":2008},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":24,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:29.697756Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:b9c3ed79b1d1d68db98548c99fc08f031b7a0551d9dbc38f3384a640b39a343d","observation_id":"cc92283f-2ac2-4751-bb2b-257727d9dfbb","resolution":{"observed_at":"2026-07-31T13:00:29.697756Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:29.914632Z","title":"Multi-qubit Toffoli with exponentially fewer T gates, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":25,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:29.914632Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:b5b18d69240eab9caa0424b15237df23e1ba61df900b072b04fa0493e8fc7641","observation_id":"30aa3ccd-9c6a-4c86-bb6a-bac9c6faaa5c","resolution":{"observed_at":"2026-07-31T13:00:29.914632Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:29.847296Z","title":"An efficient algorithm for sparse quantum state preparation","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":26,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:29.847296Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:59baef5f2617f60d9a49087daa6e224c2dc30b60d6556a4ff9721bac079cda7a","observation_id":"c53b647e-12a5-4de6-8575-d22bb0a3fcdd","resolution":{"observed_at":"2026-07-31T13:00:29.847296Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"quant-ph/9807006","last_updated":"1998-07-01T19:34:39Z","snapshot_observed_at":"2026-08-13T13:22:45.686549Z","submitted_at":"1998-07-01T19:34:39Z","title":"The Heisenberg Representation of Quantum Computers","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"quant-ph/9807006","snapshot_observed_at":"2026-07-31T13:00:30.097409Z","title":"The Heisenberg representation of quantum computers, 1998","venue":null,"work_id":null,"year":1998},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":27,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:30.097409Z"},"links":{"cited_paper":"/paper/quant-ph/9807006","citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:3e1e25c90044cc11ab17a2a4e6269750872701a7bd81c25fad1f9f23c1b3a9d2","observation_id":"d902cf8c-c19a-480f-ae6d-8a788de06d65","resolution":{"observed_at":"2026-07-31T13:00:30.097409Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:30.006733Z","title":"Quantum state preparation with optimal T- count","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":28,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:30.006733Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:5bb7e57d1d01b1bfc3edb9f6833beb8be38f6ac1613d223b40aaf829fd7bc21f","observation_id":"870655ed-50d4-4c7a-827e-a1fcf42b1f46","resolution":{"observed_at":"2026-07-31T13:00:30.006733Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:30.247036Z","title":"Hann, Gideon Lee, S.M","venue":null,"work_id":null,"year":2021},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":29,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:30.247036Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:29bec887dd731e91296bfc77031caeb933d40c9d88baf87acba97cfe384a5483","observation_id":"dd45c7cb-8e55-428e-ad1a-e84230e8f94d","resolution":{"observed_at":"2026-07-31T13:00:30.247036Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2211.01133","last_updated":"2022-11-02T14:10:40Z","snapshot_observed_at":"2026-08-13T13:50:50.734186Z","submitted_at":"2022-11-02T14:10:40Z","title":"Space-time optimized table lookup","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2211.01133","snapshot_observed_at":"2026-07-31T13:00:30.163814Z","title":"Space-time opti- mized table lookup, 2022","venue":null,"work_id":null,"year":2022},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":30,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:30.163814Z"},"links":{"cited_paper":"/paper/2211.01133","citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:54c2dabab9e39ffb568e7c3bd2c8276ba5dce4abb1de2de2e022425f1e6ce3f0","observation_id":"c5a68338-7329-4157-80d8-a73a46e77b0d","resolution":{"observed_at":"2026-07-31T13:00:30.163814Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:30.367712Z","title":null,"venue":null,"work_id":null,"year":1922},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":31,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:30.367712Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:f50bacc33f73f9aa74d9d83795253b1c183927da072822cbd0e33d2214bdd1d6","observation_id":"47d0f508-e548-4739-969f-b56bf1fab77c","resolution":{"observed_at":"2026-07-31T13:00:30.367712Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:30.307255Z","title":"Harrow, Avinatan Hassidim, and Seth Lloyd","venue":null,"work_id":null,"year":2009},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":32,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:30.307255Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:cb307e2c869bfa2c1f4319b9410db5e7b7fa9b45bb7dc2e24ca269b96c8ac3b0","observation_id":"a5a46600-5733-443d-ab0b-4bd27d32fc31","resolution":{"observed_at":"2026-07-31T13:00:30.307255Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:30.515444Z","title":"Kim and Tuomas Laakkonen","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":33,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:30.515444Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:9e89a1ad75e6ec5dce8dd39f0b48c4298303d7ab8001edd966009e24104ac888","observation_id":"6c1bc1b6-7eb1-4611-b478-8781fffeb18f","resolution":{"observed_at":"2026-07-31T13:00:30.515444Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:30.454872Z","title":"Whitfield, Alejandro Perdomo-Ortiz, Man-Hong Yung, and Al´ an Aspuru-Guzik","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":34,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:30.454872Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:30c1ba0fd19400a270d30fc70b50b79745f80266db52168e5c4b3f50a892beff","observation_id":"8973ccb0-7a1f-4afd-a846-f01d8c1a7361","resolution":{"observed_at":"2026-07-31T13:00:30.454872Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:30.678956Z","title":"Nearly optimal circuit size for sparse quantum state prepara- tion","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":35,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:30.678956Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:4ea9b75f395f5e18a6f58b511ecbf9011ea3c9ca4196b630d0f3951ca1bb00bf","observation_id":"41f6d40b-a007-4b08-a754-6d136eec6407","resolution":{"observed_at":"2026-07-31T13:00:30.678956Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.4230/lipics.tqc.2013.20","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Another subexponential-time quantum algorithm for the dihedral hidden subgroup problem","venue":"DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)","work_id":"8789c181-06ce-40ca-a20c-9a0e74f57839","year":2013},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":36,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:30.594680Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:d25ec2c8f1ac97c85d1949e23c937d2af603cf17846282e2871908a07cf5b769","observation_id":"da4431f4-681c-44d0-89f0-4a9127f002fb","resolution":{"observed_at":"2026-07-31T13:00:54.946483Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:30.850982Z","title":"Magic state distillation: not as costly as you think.Quantum, 3:205, December","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":37,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:30.850982Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:2018eb5113d7b193fd7e264e3f53b14767e7f077874927d7d0869d745b6859f8","observation_id":"c73bad4e-59f1-4704-8171-e9cd504564fc","resolution":{"observed_at":"2026-07-31T13:00:30.850982Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.24798","last_updated":"2026-05-24T01:01:43Z","snapshot_observed_at":"2026-08-06T07:32:26.386866Z","submitted_at":"2026-05-24T01:01:43Z","title":"Improved Dual Attack and Trapdoor Sampling via Quantum Rejection Sampling","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.24798","snapshot_observed_at":"2026-07-31T13:00:30.764781Z","title":"Improved dual attack and trapdoor sampling via quantum rejection sampling, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":38,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:30.764781Z"},"links":{"cited_paper":"/paper/2605.24798","citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:76b862d3568ef00e0f424a9f489390094db4a2d37c6f86ae914317bd45dd46ef","observation_id":"c8d02b0d-bdde-4f29-b1b3-86d3ae15d00b","resolution":{"observed_at":"2026-07-31T13:00:30.764781Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:31.097987Z","title":"Trading T gates for dirty qubits in state preparation and unitary synthesis.Quantum, 8:1375, June 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":39,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:31.097987Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:7167d12c195d1092aba12b93a02521db5f1429d05b58f94a2f9dcbef958276e6","observation_id":"3dca6ea1-5c15-428d-acfb-706b389cf1a4","resolution":{"observed_at":"2026-07-31T13:00:31.097987Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.22331/q-2021-03-15-412","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Quantum circuits for sparse isometries","venue":"Quantum","work_id":"983941b6-d1c1-4e79-aaff-8eaf9e16a4fd","year":2021},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":40,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:31.179254Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:c4388bce0bf7035778f01fee080531896727978d39a80f211387343cc11d895c","observation_id":"caa6fda2-e460-4717-8d9c-779d06213ca4","resolution":{"observed_at":"2026-07-31T13:00:54.703438Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:31.015865Z","title":null,"venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":41,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:31.015865Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:0f34780565262d5c805aea98113fc825ee0245c6989d24b2172577f12d2f325c","observation_id":"54d5f4c4-6404-475c-bb24-924c61657318","resolution":{"observed_at":"2026-07-31T13:00:31.015865Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:31.337314Z","title":"Quantum algorithms and the finite element method","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":42,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:31.337314Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:8bb9c6888397f84526c0b49505f13a743ee82dd4ffa51311f6c05fa3a88eb9b1","observation_id":"1a68dde4-91cd-4c3d-bc8c-b590c6153a8e","resolution":{"observed_at":"2026-07-31T13:00:31.337314Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2605.20334","last_updated":"2026-05-19T18:00:04Z","snapshot_observed_at":"2026-07-06T23:30:53.900592Z","submitted_at":"2026-05-19T18:00:04Z","title":"Halving the cost of QROM","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2605.20334","snapshot_observed_at":"2026-07-31T13:00:31.429578Z","title":"Halving the cost of QROM, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":43,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:31.429578Z"},"links":{"cited_paper":"/paper/2605.20334","citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:af50b99aabedd8cb883e237f469b192a019cb41d8ae09549c133beb981ebc894","observation_id":"4ad7c3ee-76aa-44c3-9df3-7986923eb49f","resolution":{"observed_at":"2026-07-31T13:00:31.429578Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1103/physreva.110.032439","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Toward optimal circuit size for sparse quantum state preparation.Phys","venue":"Physical review. A/Physical review, A","work_id":"d6ae3bad-0b4c-49cf-ac4d-9f74a1320305","year":2024},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":44,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:31.272331Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:ed77da506fd2bd06141de6902f88139269c30ed8c2c3fff93ee49605c093f594","observation_id":"e1c6aa81-9ba2-4202-a618-4fddc35f06b7","resolution":{"observed_at":"2026-07-31T13:00:54.590986Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:31.581981Z","title":"Quantum rejection sampling.ACM Trans","venue":null,"work_id":null,"year":2013},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":45,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:31.581981Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:b0967af0e3a166d82b919d97257942e312589771a12e027a16b6b72f5a173911","observation_id":"6b509324-3b12-401c-986a-926702cc8dd8","resolution":{"observed_at":"2026-07-31T13:00:31.581981Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1007/3-540-48447-7_5","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Hash and displace: efficient evaluation of minimal perfect hash functions","venue":"Lecture notes in computer science","work_id":"c0b1a6f5-baca-4357-a51e-64e436441f58","year":1999},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":46,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:31.668363Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:0789c6a1b58ca1d82817eb827adf047932c240d582a988414ebcc87b8db64ace","observation_id":"1c82730a-3d2f-4e35-b959-edea120c6ee2","resolution":{"observed_at":"2026-07-31T13:00:54.310204Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1103/physreva.106.022617","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Efficient deterministic preparation of quantum states using decision diagrams.Phys","venue":"Physical review. A/Physical review, A","work_id":"42c70b39-3ae2-4ea4-9c34-dd9819f96bca","year":2022},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":47,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:31.497446Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:b1af2d9fde22d55efebe96e931285b7ff473d8839d0dcb52b17acf61697aeff1","observation_id":"0c98c6ad-c15b-4672-96a4-b5eff88443f6","resolution":{"observed_at":"2026-07-31T13:00:54.491401Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:31.818007Z","title":"Lefterovici, and Antonio F","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":48,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:31.818007Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:2f9babd4462a85dfc9156ddd3b9a14bdf0789be00ef5574d48b9a496e4c6f72f","observation_id":"feb6d0db-f4e1-41c4-8d53-6a50de5fee73","resolution":{"observed_at":"2026-07-31T13:00:31.818007Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:31.879949Z","title":"Ross and Peter Selinger","venue":null,"work_id":null,"year":2016},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":49,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:31.879949Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:58ff16bbdb7d54933301f28a760d7268ee4f49e1003aaaf4d3b2e1cf5da70c7a","observation_id":"5a3325ae-81d2-49a7-9173-89c7b0f16086","resolution":{"observed_at":"2026-07-31T13:00:31.879949Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:31.757337Z","title":"Parallelising the queries in bucket brigade quantum RAM.Phys","venue":null,"work_id":null,"year":2020},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":50,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:31.757337Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:01b1a6bce026e80ad10212ee86338f01974f4845606924ac09b410c0166e480a","observation_id":"bf6729bd-32fe-490d-98e8-513ae61640ce","resolution":{"observed_at":"2026-07-31T13:00:31.757337Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:32.050722Z","title":"Sanders, Guang Hao Low, Artur Scherer, and Dominic W","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":51,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:32.050722Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:b9d4561be6f7d755349602936460d15c862e85e989cfccf94b845980954c61c0","observation_id":"17986579-017a-4d0a-91eb-5d809343e44f","resolution":{"observed_at":"2026-07-31T13:00:32.050722Z","resolver_source":null,"status":"malformed_identifier"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:32.145297Z","title":null,"venue":null,"work_id":null,"year":2023},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":52,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:32.145297Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:19b1cfbe5dd09425c1c67bf767d6dbe280a566116b1983a1123c31a6ac5783f8","observation_id":"746ec8d9-8d58-4a7c-8537-c67746faf85e","resolution":{"observed_at":"2026-07-31T13:00:32.145297Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:31.956381Z","title":"Sparse quantum state preparation with improved Toffoli cost, 2026","venue":null,"work_id":null,"year":2026},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":53,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:31.956381Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:9db7165978d35bb044e4e65e56caa50d8c8c806e12e1fa9129de18261807c790","observation_id":"7c7ecb86-d52d-475f-8d26-98483ce396fc","resolution":{"observed_at":"2026-07-31T13:00:31.956381Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:32.293999Z","title":"Temme, T","venue":null,"work_id":null,"year":2011},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":54,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:32.293999Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:9774b7935943ed876af83a12810ae1d4b7a371f95555b90b2681699d69155898","observation_id":"ca76d6b5-33e9-4e3f-9308-74d73bee1ed5","resolution":{"observed_at":"2026-07-31T13:00:32.293999Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:32.395719Z","title":"Quantum data fitting.Phys","venue":null,"work_id":null,"year":2012},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":55,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:32.395719Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:4a7a188e0ba6639e607d709e5b417befb9f8e29c48419ef33de74f4c06cb9817","observation_id":"853fd114-08da-4a7e-b7c9-43beaec3b4ca","resolution":{"observed_at":"2026-07-31T13:00:32.395719Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:32.233580Z","title":"Block-encoding structured matrices for data input in quantum computing.Quantum, 8:1226, January 2024","venue":null,"work_id":null,"year":2024},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":56,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:32.233580Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:e433636da43735861f4f569461cfdcc836fe0fd1fcfa4d99c14fbc38b7ff5067","observation_id":"9277ddef-fca6-4643-823c-0be356feba4c","resolution":{"observed_at":"2026-07-31T13:00:32.233580Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:32.532209Z","title":"Dictionary-based block encoding of sparse matrices with low subnormalization and circuit depth.Quantum, 9:1805, July 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":57,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:32.532209Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:0ffd8b47c23d77d55af65407c28ee648e597ebd152d586715227c1b44b76a083","observation_id":"f8289917-3ff2-4ead-a1f4-8fb7155410fb","resolution":{"observed_at":"2026-07-31T13:00:32.532209Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1103/physrevapplied.23.054066","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Reducing circuit depth in quantum state preparation for quantum simulation using measurements and feedforward","venue":"Physical Review Applied","work_id":"b0acd376-3e70-4f6e-8947-bd5bc02f4c62","year":2025},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":58,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:32.584455Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:87d38d21b7fe0a774c8eae4336019c980f3b86873edcbbefe46c19886e4a19dd","observation_id":"67db6c01-8ecb-45c2-8a68-1de7c290d2fd","resolution":{"observed_at":"2026-07-31T13:00:54.133676Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:32.467552Z","title":"Fat-Tree QRAM: A high-bandwidth shared quan- tum random access memory for parallel queries","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":59,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:32.467552Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:4d444d6d76ba8290bc60d825445e4a22431fa3489f983f04834cfa04d433ab79","observation_id":"e1e4526d-cd98-4bf5-88bb-1c62df8e3c1f","resolution":{"observed_at":"2026-07-31T13:00:32.467552Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1038/s41534-024-00835-8","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Circuit complexity of quantum access models for en- coding classical data.npj Quantum Inf., 10(1):42, April 2024","venue":"npj Quantum Information","work_id":"0cf7cef7-3047-429e-97e4-3e55985f94a0","year":2024},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":60,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:32.797198Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:ae69e99b44b494c2c8df78376aa1108c79b474bc6eca588780ae98f467f54e74","observation_id":"6478da86-73b3-419f-bac4-d9296ac89e5e","resolution":{"observed_at":"2026-07-31T13:00:53.949752Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:32.866222Z","title":"Quantum state preparation with opti- mal circuit depth: implementations and applications.Phys","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":61,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:32.866222Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:2db7250534786238a0a42585f27aa593cf2ef96024941619a876ab603e19f6d8","observation_id":"79674621-b8c2-4f94-8486-99f14cdabb83","resolution":{"observed_at":"2026-07-31T13:00:32.866222Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:32.635767Z","title":"Block encoding of sparse matrices with a periodic diagonal structure,","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":62,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:32.635767Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:fc6e9bb3f4d272829f98511d16957e65f770264f365bea260a7cc3b8c9ecc26a","observation_id":"2269b837-4043-4f50-bc65-071c554ed0cd","resolution":{"observed_at":"2026-07-31T13:00:32.635767Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":{"arxiv_id":"2503.16208","last_updated":"2025-03-20T14:55:04Z","snapshot_observed_at":"2026-08-07T16:48:58.318966Z","submitted_at":"2025-03-20T14:55:04Z","title":"Constant-Depth Quantum Circuits for Arbitrary Quantum State Preparation via Measurement and Feedback","version":1},"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":"2503.16208","snapshot_observed_at":"2026-07-31T13:00:33.098093Z","title":"Constant-depth quantum circuits for arbitrary quantum state preparation via measurement and feedback, 2025","venue":null,"work_id":null,"year":2025},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":63,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:33.098093Z"},"links":{"cited_paper":"/paper/2503.16208","citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:889a95aa84613f62456a77ce45ffec583eef766f03d7e3776514227a2b7c051c","observation_id":"506e7218-cc8b-427c-a8c9-d27dd594e00e","resolution":{"observed_at":"2026-07-31T13:00:33.098093Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":"10.1103/d896-mktn","metadata_source":"openalex","pith_arxiv_id":null,"snapshot_observed_at":"2026-08-05T02:28:24.338817Z","title":"Unified architecture for quantum lookup tables.Phys","venue":"Physical Review Research","work_id":"db465feb-f218-43d6-9d26-e4d04f3e3a64","year":2025},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":67,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:33.024089Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:a42b66826e0dda08fa7a1085635e545d7b9c74b144c190e427361fc59c2b04e5","observation_id":"69959dce-b2e7-44b8-b96b-cbed981b7143","resolution":{"observed_at":"2026-07-31T13:00:53.811552Z","resolver_source":"doi","status":"verified_exact"},"standing_notice":{"events":[],"observation":"No event found in the named queried sources as of 2026-08-13T06:32:02.005865+00:00.","reason":null,"source_receipts":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"state":"measured"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:30.934029Z","title":"doi: 10.22331/q-2019-12-02-205","venue":null,"work_id":null,"year":2019},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":2019,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:30.934029Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:9f3b62097c16b0bcb3d4da34ca81130bda878b44d084b2371ef8e1d87f899bc8","observation_id":"69a76200-21db-4920-a4da-00e8622862ad","resolution":{"observed_at":"2026-07-31T13:00:30.934029Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:32.944779Z","title":"URLhttps://link.aps.org/doi/10.1103/ PhysRevLett.129.230504","venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":2022,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:32.944779Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:42ac63c98b47aeb9d3ef5d058323d8a329ea7a129b7c736c23143e8df11efc72","observation_id":"430f1342-223a-4fcd-8230-1bc93ca53a81","resolution":{"observed_at":"2026-07-31T13:00:32.944779Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:32.690884Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":2026,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:32.690884Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:d508bb120ff3ccbe23d74167b23f98f0c121310703305980dd051f8949454553","observation_id":"5fe027ab-f9d5-4e7d-a2bb-2e1a52c70583","resolution":{"observed_at":"2026-07-31T13:00:32.690884Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}},{"citation":{"cited_paper":null,"cited_work":{"arxiv_id":null,"doi":null,"metadata_source":null,"pith_arxiv_id":null,"snapshot_observed_at":"2026-07-31T13:00:28.382091Z","title":null,"venue":null,"work_id":null,"year":null},"citing_paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding","version":1},"reference_index":3457,"source":"pdf_text","source_observed_at":"2026-07-31T13:00:28.382091Z"},"links":{"citing_paper":"/paper/2607.28260"},"observation_digest":"sha256:350aa339fae32ea109202d67a214ae5331c32406f562c2d7d22ea862d77caa8c","observation_id":"5aadee7b-67de-4a0d-b212-91bbf222b8f3","resolution":{"observed_at":"2026-07-31T13:00:28.382091Z","resolver_source":null,"status":"unresolved"},"standing_notice":{"events":[],"reason":"canonical_work_link_unavailable","source_receipts":[],"state":"unavailable"}}],"paper":{"arxiv_id":"2607.28260","last_updated":"2026-07-30T14:18:29Z","latest_version":1,"primary_category":"quant-ph","snapshot_observed_at":"2026-08-11T01:02:41.745926Z","submitted_at":"2026-07-30T14:18:29Z","title":"Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding"},"reference_resolution":{"displayed":68,"state_counts":{"malformed_identifier":4,"metadata_mismatch":0,"parse_uncertain":0,"unresolved":52,"verified_exact":12,"verified_fuzzy":0},"total_outbound_references":68},"refusal":"A citation records a reference. It does not transfer a finding from one paper to another.","schema":"pith.paper-citation-record.v1","standing_sources":[{"observed_at":"2026-08-13T06:32:02.005865+00:00","source":"crossref"},{"observed_at":"2026-08-13T06:31:53.387327+00:00","source":"retraction_watch"}],"thesis":"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."}