Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-05-14T22:01:29.915409Z
Paper Citation Record · LEDGER
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions
As of 4 August 2026, this Paper Citation Record lists 35 of 35 outbound references and 2 inbound Pith citation observations for arXiv:2605.02986.
A citation records a reference. It does not transfer a finding from one paper to another.
Coverage vector
One-hop event checks from named stored sources.
Source: scholarly_work_events, retraction_status_cache, observed 2026-08-04T06:34:03.388597+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-07-02T23:28:23.970724Z
A source-named dated measurement, never combined with another source.
Source: pith, observed 2026-07-02T23:37:27.164369Z
Reference resolution
35 of 35 outbound references displayed
- verified exact5
- verified fuzzy30
- unresolved0
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 8c7ac97d-ac71-4546-9c9d-2d25b84f2a9b · outbound
This paper cites Hamiltonian simulation using linear combinations of unitary op- erations.Quantum Information and Computation, 12(11&12):901–924.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions Hamiltonian simulation using linear combinations of unitary op- erations.Quantum Information and Computation, 12(11&12):901–924
Reference 1
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-14T22:59:36.529293Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation ce719016-78a3-4e3b-b1f5-d397ac0efc5b · outbound
This paper cites Implementing any linear combination of unitaries on intermediate-term quan- tum computers.Quantum, 8:1496.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions Implementing any linear combination of unitaries on intermediate-term quan- tum computers.Quantum, 8:1496
Reference 2
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-14T22:59:36.522917Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation f29c9f23-cb83-45eb-987f-d5220e04eff4 · outbound
This paper cites Universal programmable quantum circuit schemes to emulate an operator.The Journal of chemical physics, 137(23).
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions Universal programmable quantum circuit schemes to emulate an operator.The Journal of chemical physics, 137(23)
Reference 3
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-14T22:59:36.504924Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 8614e9b0-a6e7-4bd5-a028-f8913bff1a86 · outbound
This paper cites Simulating hamiltonian dynamics with a truncated taylor se- ries.Physical review letters, 114(9):090502.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions Simulating hamiltonian dynamics with a truncated taylor se- ries.Physical review letters, 114(9):090502
Reference 4
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-14T22:59:36.516198Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation fb3bc2b4-3c81-429a-b456-ea4976a7db23 · outbound
This paper cites Hamiltonian simulation and linear combination of unitary de- composition of structured matrices.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions Hamiltonian simulation and linear combination of unitary de- composition of structured matrices
Reference 5
- Resolution
- verified exact
- arxiv_id, observed 2026-05-14T22:03:02.792630Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 3d43e977-e1c7-494d-b592-f358021e1641 · outbound
This paper cites A quantum compiler design method by using linear combinations of permutations.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions A quantum compiler design method by using linear combinations of permutations
Reference 6
- Resolution
- verified exact
- arxiv_id, observed 2026-05-14T22:03:02.799090Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation d44a359a-a08a-465b-a1b5-9713472f5818 · outbound
This paper cites Hamiltonian simulation by qubitization.Quantum, 3:163.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions Hamiltonian simulation by qubitization.Quantum, 3:163
Reference 7
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-14T22:59:36.509440Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 021c4a0a-e860-4fd0-b02d-d49123aced17 · outbound
This paper cites Quantum singular value transfor- mation and beyond: exponential improvements for quantum matrix arithmetics.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions Quantum singular value transfor- mation and beyond: exponential improvements for quantum matrix arithmetics
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-14T22:59:36.483028Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 0ffd836f-26e6-4779-9cf6-34dab9266fc9 · outbound
This paper cites Low-rank matrix completion: A contempo- rary survey.IEEE Access, 7:94215–94237.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions Low-rank matrix completion: A contempo- rary survey.IEEE Access, 7:94215–94237
Reference 9
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-14T22:59:36.500597Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation efd7e885-b3a4-45f0-8b74-ed465b56796e · outbound
This paper cites Quantum circuits for general multiqubit gates.Physical review letters, 93(13):130502.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions Quantum circuits for general multiqubit gates.Physical review letters, 93(13):130502
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-14T22:59:36.509851Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 1fa27876-dbe1-46b2-b856-407f82501b65 · outbound
This paper cites Synthesis of quantum cir- cuits for d-level systems by using cosine-sine decom- position.Quantum Information and Computation, 9(5&6):0423–0443.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions Synthesis of quantum cir- cuits for d-level systems by using cosine-sine decom- position.Quantum Information and Computation, 9(5&6):0423–0443
Reference 11
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-14T22:59:36.541835Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation ce5e8eb5-53f1-4bfb-a39a-5d0b77a9ab8c · outbound
This paper cites Qcompiler: Quantum com- pilation with the csd method.Computer Physics Communications, 184(3):853–865.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions Qcompiler: Quantum com- pilation with the csd method.Computer Physics Communications, 184(3):853–865
Reference 12
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-14T22:59:36.534794Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation fcb936b2-4d24-4d91-9355-72b6decdaa63 · outbound
This paper cites Efficient quantum state tomogra- phy.Nature communications, 1(1):149.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions Efficient quantum state tomogra- phy.Nature communications, 1(1):149
Reference 13
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-14T22:59:36.547354Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 1b1cb88a-b9cf-4a56-8e8f-746f8501c645 · outbound
This paper cites Quantum state to- mography via compressed sensing.Physical review letters, 105(15):150401.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions Quantum state to- mography via compressed sensing.Physical review letters, 105(15):150401
Reference 14
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-14T22:59:36.515864Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 9806abba-c80b-4cdd-b03c-9b81d06480f4 · outbound
This paper cites An overview of low-rank matrix recovery from incom- plete observations.IEEE Journal of Selected Topics in Signal Processing, 10(4):608–622.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions An overview of low-rank matrix recovery from incom- plete observations.IEEE Journal of Selected Topics in Signal Processing, 10(4):608–622
Reference 15
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-14T22:59:36.535574Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 1300f046-ed71-4ec8-aff3-861e358adf43 · outbound
This paper cites Guaranteed rank minimization via singular value projection.Advances in Neural Information Pro- cessing Systems, 23.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions Guaranteed rank minimization via singular value projection.Advances in Neural Information Pro- cessing Systems, 23
Reference 16
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-14T22:59:36.480478Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 74f9ff46-e5b9-4aab-a22f-ef6c9f960a54 · outbound
This paper cites Exact ma- trix completion via convex optimization.Commu- nications of the ACM, 55(6):111–119.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions Exact ma- trix completion via convex optimization.Commu- nications of the ACM, 55(6):111–119
Reference 17
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-14T22:59:36.434622Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 96a03831-e876-4a32-95f8-acdea1f97800 · outbound
This paper cites A singular value thresholding algorithm for matrix completion.SIAM Journal on optimization, 20(4):1956–1982.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions A singular value thresholding algorithm for matrix completion.SIAM Journal on optimization, 20(4):1956–1982
Reference 18
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-14T22:59:36.455630Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 943e54ae-d8cb-4885-9aa8-1b80517c44da · outbound
This paper cites Matrix factorization techniques for recommender systems.Computer, 42(8):30–37.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions Matrix factorization techniques for recommender systems.Computer, 42(8):30–37
Reference 19
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-14T22:59:36.439301Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 601f1f17-b13d-4703-b029-59953239e4c8 · outbound
This paper cites A crypto- graphic test of quantumness and certifiable random- ness from a single quantum device.Journal of the ACM (JACM), 68(5):1–47.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions A crypto- graphic test of quantumness and certifiable random- ness from a single quantum device.Journal of the ACM (JACM), 68(5):1–47
Reference 20
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-14T22:59:36.451636Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation ce50e68c-7070-4aad-9f50-b57efa594f1b · outbound
This paper cites Quantum trapdoor functions from classical one-way functions.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions Quantum trapdoor functions from classical one-way functions
Reference 21
- Resolution
- verified exact
- arxiv_id, observed 2026-05-14T22:03:02.785693Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 18fd110e-096a-436b-9d05-9f66b2f3c647 · outbound
This paper cites Quantum cryptography with classical communication: parallel remote state preparation for copy-protection, verification, and more.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions Quantum cryptography with classical communication: parallel remote state preparation for copy-protection, verification, and more
Reference 22
- Resolution
- verified exact
- arxiv_id, observed 2026-05-14T22:03:02.779190Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation a020ba48-0f08-4b32-80e2-40739bdeaba0 · outbound
This paper cites Quantum ho- momorphic encryption for circuits of low t-gate com- plexity.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions Quantum ho- momorphic encryption for circuits of low t-gate com- plexity
Reference 23
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-14T22:59:36.476795Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 24b5b1e3-1a41-428b-bfab-82fc92614d45 · outbound
This paper cites Experimental investigation of prac- tical unforgeable quantum money.npj Quantum In- formation, 4(1):5.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions Experimental investigation of prac- tical unforgeable quantum money.npj Quantum In- formation, 4(1):5
Reference 24
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-14T22:59:36.429271Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation b6009cac-9ebb-4e7c-ae8b-e20bf55dbeee · outbound
This paper cites On Quantum Obfuscation.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions On Quantum Obfuscation
Reference 25
- Resolution
- verified exact
- local_arxiv, observed 2026-05-14T22:03:02.805279Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 276c39ef-eb00-40d0-a296-1865d299f05b · outbound
This paper cites Quantum state obfuscation from classical oracles.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions Quantum state obfuscation from classical oracles
Reference 26
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-14T22:59:36.444931Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation eab095b6-06e5-4c40-a66f-e2651643e275 · outbound
This paper cites Pseudo- random quantum states.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions Pseudo- random quantum states
Reference 27
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-14T22:59:36.406270Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 103edb26-3a80-4152-a766-0ca21a780b40 · outbound
This paper cites (pseudo) ran- dom quantum states with binary phase.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions (pseudo) ran- dom quantum states with binary phase
Reference 28
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-14T22:59:36.495750Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 30541e3a-1e17-4928-80fd-d905229d5a0a · outbound
This paper cites On the complexity of nonneg- ative matrix factorization.SIAM journal on opti- mization, 20(3):1364–1377.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions On the complexity of nonneg- ative matrix factorization.SIAM journal on opti- mization, 20(3):1364–1377
Reference 29
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-14T22:59:36.522506Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation eaaf232a-6a67-41ee-93ff-6bcb599b2f9b · outbound
This paper cites Exact recovery of sparsely-used dictionaries.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions Exact recovery of sparsely-used dictionaries
Reference 30
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-14T22:59:36.470894Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation f4ffa2b8-ef45-4b1b-b292-32030e0347e3 · outbound
This paper cites Phase retrieval via matrix completion.SIAM review, 57(2):225–251.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions Phase retrieval via matrix completion.SIAM review, 57(2):225–251
Reference 31
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-14T22:59:36.495003Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 4ec4291b-6419-452e-bc8a-8245c1503172 · outbound
This paper cites Fast, sample- efficient algorithms for structured phase retrieval.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions Fast, sample- efficient algorithms for structured phase retrieval
Reference 32
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-14T22:59:36.554601Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 74175a96-3b42-4938-9191-e5a9b344e798 · outbound
This paper cites Extended successive convex approxi- mation for phase retrieval with dictionary learning.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions Extended successive convex approxi- mation for phase retrieval with dictionary learning
Reference 33
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-14T22:59:36.387985Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 59f8346f-dc21-4f7f-925f-7d9b5a16e429 · outbound
This paper cites New algorithms for learning incoherent and overcomplete dictionaries.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions New algorithms for learning incoherent and overcomplete dictionaries
Reference 34
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-14T22:59:36.485687Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation bce90a1b-5060-4bcf-96dc-6f42c8f9610c · outbound
This paper cites Link analysis ranking: algorithms, theory, and experiments.
Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions Link analysis ranking: algorithms, theory, and experiments
Reference 35
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-05-14T22:59:36.490607Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Pith citing papers
Observation eead02c1-ea21-403a-8197-37e4d6fd1a77 · inbound
Lowering LCU Circuit Width through Maximum-Weight Birkhoff-von Neumann Decomposition cites this paper.
Lowering LCU Circuit Width through Maximum-Weight Birkhoff-von Neumann Decomposition Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions
Reference 36
- Resolution
- verified exact
- local_arxiv, observed 2026-06-30T16:35:12.704700Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.
Observation 52d66a86-0c33-421a-bba0-69cbfc0025cc · inbound
Lowering LCU Circuit Width through Maximum-Weight Birkhoff-von Neumann Decomposition cites this paper.
Lowering LCU Circuit Width through Maximum-Weight Birkhoff-von Neumann Decomposition Exploiting all ancilla outcomes in linear combinations of unitaries: low-rank recovery and quantum trapdoor functions
Reference 36
- Resolution
- verified exact
- local_arxiv, observed 2026-07-02T23:37:27.165864Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-04T06:34:03.388597+00:00.