Typed states for the displayed outbound observations.
Source: paper_references, paper_reference_links, observed 2026-08-16T11:44:10.310057Z
Paper Citation Record · LEDGER
The Hardness of Learning Quantum Circuits and its Cryptographic Applications
As of 22 August 2026, this Paper Citation Record lists 81 of 81 outbound references and 2 inbound Pith citation observations for arXiv:2504.15343.
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-22T06:32:14.747728+00:00
Pith citing papers itemized under the disclosed page cap.
Source: paper_references, paper_reference_links, observed 2026-05-18T17:57:12.580235Z
A source-named dated measurement, never combined with another source.
Source: arxiv_reference, observed 2026-05-18T18:01:43.902411Z
Reference resolution
81 of 81 outbound references displayed
- verified exact5
- verified fuzzy62
- unresolved14
- parse uncertain0
- malformed identifier0
- metadata mismatch0
External citation measurements
No source-named external measurement is stored.
Outbound references
Observation 6cbb07d4-cb99-4519-a8c9-4018f2d3dba5 · outbound
This paper cites The computational complexity of linear optics.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications The computational complexity of linear optics
Reference 1
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T11:44:10.068777Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 2aec6669-1f36-4b3f-8a43-12d3808c3868 · outbound
This paper cites Quantum error correction below the surface code threshold.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Quantum error correction below the surface code threshold
Reference 2
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T11:44:10.072292Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 2d7285fe-67cd-48cc-b4a0-548a25211218 · outbound
This paper cites Quantum supremacy using a programmable superconducting processor.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Quantum supremacy using a programmable superconducting processor
Reference 3
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:11.049390Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation bd1e118b-e58f-4187-ace2-2c31a0d6e4e3 · outbound
This paper cites Polynomial simulations of decohered quantum computers.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Polynomial simulations of decohered quantum computers
Reference 4
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:11.039133Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 14f956c8-3bba-46e9-86f0-368ce1f866e8 · outbound
This paper cites Complexity-theoretic foundations of quantum supremacy experiments.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Complexity-theoretic foundations of quantum supremacy experiments
Reference 5
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:11.028266Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 09503ecd-13fe-42eb-b93d-e9bef95b35fd · outbound
This paper cites A polynomial-time classical algorithm for noisy random circuit sampling.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications A polynomial-time classical algorithm for noisy random circuit sampling
Reference 6
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:11.017518Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation f987994c-15de-46e3-9d77-7649438d75c3 · outbound
This paper cites Grilo, and Aarthi Sundaram.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Grilo, and Aarthi Sundaram
Reference 7
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:11.007521Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 8b8b5e9e-771a-4fbd-82c8-31ad1a30cca8 · outbound
This paper cites Certified randomness from quantum supremacy.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Certified randomness from quantum supremacy
Reference 8
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.997410Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 05d5f018-9eb7-4b23-82c3-87ad6189a449 · outbound
This paper cites A Simple Proof that Toffoli and Hadamard are Quantum Universal.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications A Simple Proof that Toffoli and Hadamard are Quantum Universal
Reference 9
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T11:44:10.095034Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation e5077513-b63a-42e8-9adb-d6aad5031156 · outbound
This paper cites Cryptography from pseudorandom quantum states.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Cryptography from pseudorandom quantum states
Reference 10
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.986720Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 85c8d7b5-35f9-4b28-8a52-6b121d79578f · outbound
This paper cites Bennett, Ethan Bernstein, Gilles Brassard, and Umesh Vazirani.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Bennett, Ethan Bernstein, Gilles Brassard, and Umesh Vazirani
Reference 11
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.975814Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation ca73ba85-63ac-40c8-91c2-79e308cae7bf · outbound
This paper cites On certified randomness from fourier sampling or random circuit sampling, 2024.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications On certified randomness from fourier sampling or random circuit sampling, 2024
Reference 12
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.965134Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 755182f9-fa81-4589-b579-317c57985ebc · outbound
This paper cites A brief review on the impossibility of quantum bit commitment.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications A brief review on the impossibility of quantum bit commitment
Reference 13
- Resolution
- verified exact
- local_arxiv, observed 2026-08-16T11:44:10.421209Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation a81133cb-fafc-42ee-8812-208faec04539 · outbound
This paper cites Oracle Separation Between Quantum Commitments and Quantum One-wayness.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Oracle Separation Between Quantum Commitments and Quantum One-wayness
Reference 14
- Resolution
- verified exact
- local_arxiv, observed 2026-08-16T11:44:10.408437Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation c1410d13-1df4-48f3-afae-758097629a7d · outbound
This paper cites On the computational hardness needed for quantum cryptography.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications On the computational hardness needed for quantum cryptography
Reference 15
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.956031Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 1fc66da8-c032-4e9f-8832-16488e8afdc4 · outbound
This paper cites Logical quantum processor based on reconfigurable atom arrays.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Logical quantum processor based on reconfigurable atom arrays
Reference 16
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T11:44:10.116724Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 1dac9c45-57cd-4168-80ec-8227a3616c0c · outbound
This paper cites Unitary Complexity and the Uhlmann Transformation Problem.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Unitary Complexity and the Uhlmann Transformation Problem
Reference 17
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T11:44:10.119546Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation b14694f5-1ac4-44cc-96b5-856bcd86f9c1 · outbound
This paper cites an unresolved cited work.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Unresolved cited work
Reference 18
- Resolution
- unresolved
- raw_fallback, observed 2026-08-16T11:44:10.938736Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation c5428310-9e33-4300-ad7b-c99e0c76d9f2 · outbound
This paper cites On the complexity and verification of quantum random circuit sampling.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications On the complexity and verification of quantum random circuit sampling
Reference 19
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.928507Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 519bb6a9-ad7b-4041-8ca2-5934970369b2 · outbound
This paper cites Efficient quantum pseudorandomness from hamiltonian phase states, 2024.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Efficient quantum pseudorandomness from hamiltonian phase states, 2024
Reference 20
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.919294Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation f4441cb0-e963-414b-aa1e-62f2c248d3dc · outbound
This paper cites A new world in the depths of microcrypt: Separating OWSGs and quantum money from QEFID.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications A new world in the depths of microcrypt: Separating OWSGs and quantum money from QEFID
Reference 21
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.911039Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation d376366f-9a07-46ae-a65d-108bd3afe268 · outbound
This paper cites An efficient quantum parallel repetition theorem and applications.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications An efficient quantum parallel repetition theorem and applications
Reference 22
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.902740Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 2c8dd312-c8d7-40ce-9b0f-7cb4ad86bb5b · outbound
This paper cites A Cryptographic Perspective on the Verifiability of Quantum Advantage.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications A Cryptographic Perspective on the Verifiability of Quantum Advantage
Reference 23
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.894796Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 4932a44f-bcc8-4773-a317-87d5b43a94d4 · outbound
This paper cites Cavalar, Eli Goldin, Matthew Gray, and Peter Hall.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Cavalar, Eli Goldin, Matthew Gray, and Peter Hall
Reference 24
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.886570Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation ad39bbc1-bc72-4531-bda9-0230837548e6 · outbound
This paper cites Learning algorithms from natural proofs.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Learning algorithms from natural proofs
Reference 25
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.878561Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation bf0cd1e0-a21f-4af6-875e-85b512f01e11 · outbound
This paper cites Quantum State Learning Implies Circuit Lower Bounds.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Quantum State Learning Implies Circuit Lower Bounds
Reference 26
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.870599Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 15d1e96f-b2dd-450e-86d6-d506bcf0e6df · outbound
This paper cites Random quantum circuits transform local noise into global white noise.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Random quantum circuits transform local noise into global white noise
Reference 27
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.862627Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation dd284522-8d23-45da-902f-0f3eea4b4339 · outbound
This paper cites From average case complexity to improper learning complexity, 2014.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications From average case complexity to improper learning complexity, 2014
Reference 28
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.854913Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 8fd7c3bd-9a44-4336-943d-98231cda886a · outbound
This paper cites Gorshkov, Bill Fefferman, and Michael J.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Gorshkov, Bill Fefferman, and Michael J
Reference 29
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.847166Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 66472207-4e7b-400f-a847-64586c0155af · outbound
This paper cites Effect of nonunital noise on random-circuit sampling.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Effect of nonunital noise on random-circuit sampling
Reference 30
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.838762Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 70545272-16b6-4e4c-ae99-7dc012389d0c · outbound
This paper cites Anti-concentration for the unitary haar measure and applications to random quantum circuits, 2024.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Anti-concentration for the unitary haar measure and applications to random quantum circuits, 2024
Reference 31
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.830616Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 9b897b4a-b60a-438a-a698-d7fb504ee224 · outbound
This paper cites Module- L attice-based K ey- E ncapsulation M echanism S tandard.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Module- L attice-based K ey- E ncapsulation M echanism S tandard
Reference 32
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.822636Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 7fe2251d-33b8-49f9-87c3-7a1ed395b3ea · outbound
This paper cites Foundations of C ryptography: V olume 2, B asic A pplications , volume 2.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Foundations of C ryptography: V olume 2, B asic A pplications , volume 2
Reference 33
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.814286Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation bcb73a07-0e3a-4d4b-b12f-6f90b4f5c915 · outbound
This paper cites Computational Complexity of Learning Efficiently Generatable Pure States.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Computational Complexity of Learning Efficiently Generatable Pure States
Reference 34
- Resolution
- verified exact
- local_arxiv, observed 2026-08-16T11:44:10.387795Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 651bd2c2-224e-459c-b3f6-5c6c7ed45478 · outbound
This paper cites A pseudorandom generator from any one-way function.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications A pseudorandom generator from any one-way function
Reference 35
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.806176Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation f992f828-b1f8-44ba-ae14-cbdbec209b63 · outbound
This paper cites Predicting many properties of a quantum system from very few measurements.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Predicting many properties of a quantum system from very few measurements
Reference 36
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.797716Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 4a227025-adec-4fd8-8824-331d39155503 · outbound
This paper cites an unresolved cited work.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Unresolved cited work
Reference 37
- Resolution
- unresolved
- raw_fallback, observed 2026-08-16T11:44:10.789171Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 03eaecf9-3286-4d17-ae21-fd7d472e92a0 · outbound
This paper cites Quantum cryptography and meta-complexity, 2024.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Quantum cryptography and meta-complexity, 2024
Reference 38
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.780371Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 4872f16c-56e2-4e9b-bda5-4ecf7df52738 · outbound
This paper cites From the hardness of detecting superpositions to cryptography: Q uantum public key encryption and commitments.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications From the hardness of detecting superpositions to cryptography: Q uantum public key encryption and commitments
Reference 39
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.771813Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation af44e9b2-aee7-4c84-b194-4d98278f2a21 · outbound
This paper cites Certifying almost all quantum states with few single-qubit measurements, 2024.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Certifying almost all quantum states with few single-qubit measurements, 2024
Reference 40
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.763524Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 03acc4ee-4df1-4c89-bf85-92c286f81922 · outbound
This paper cites Constructive P roofs of C oncentration B ounds.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Constructive P roofs of C oncentration B ounds
Reference 41
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.755000Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 6d4bfd19-b54d-4441-b15d-520b06199e1a · outbound
This paper cites Impagliazzo and L.A.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Impagliazzo and L.A
Reference 42
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.745979Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation f36486a7-f065-44d8-8f69-36665b082aff · outbound
This paper cites A personal view of average-case complexity.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications A personal view of average-case complexity
Reference 43
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.737369Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 12f26d28-be72-45c5-bce0-93b18753593e · outbound
This paper cites Pseudorandom quantum states.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Pseudorandom quantum states
Reference 44
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.728731Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 2f9f192d-a798-46dd-992b-e4f8cda5e2e8 · outbound
This paper cites Kim, and Daniel Ranard.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Kim, and Daniel Ranard
Reference 45
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.720521Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 188f0082-d728-4117-ba5c-64722377e8f0 · outbound
This paper cites Quantum cryptography in algorithmica.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Quantum cryptography in algorithmica
Reference 46
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.712319Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation b7f34032-fa16-4cd3-801c-0535ed028b03 · outbound
This paper cites Quantum-computable one-way functions without one-way functions, 2024.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Quantum-computable one-way functions without one-way functions, 2024
Reference 47
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T11:44:10.209136Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation f918be88-535e-4888-984e-e1bd8bfea7d5 · outbound
This paper cites Quantum pseudorandomness and classical complexity.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Quantum pseudorandomness and classical complexity
Reference 48
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.699474Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation c3f796a9-214c-4812-bbf5-d4307ff38329 · outbound
This paper cites Klivans and Alexander A.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Klivans and Alexander A
Reference 49
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.691162Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation eb7ac024-0782-4635-a8b1-b9600f72c451 · outbound
This paper cites Commitments from quantum one-wayness.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Commitments from quantum one-wayness
Reference 50
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.682733Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 3dc18fb4-0dc1-4028-8e3d-9485ca7a9efe · outbound
This paper cites Founding Quantum Cryptography on Quantum Advantage, or, Towards Cryptography from $\mathsf{\#P}$-Hardness.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Founding Quantum Cryptography on Quantum Advantage, or, Towards Cryptography from $\mathsf{\#P}$-Hardness
Reference 51
- Resolution
- verified exact
- local_arxiv, observed 2026-08-16T11:44:10.374454Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 22a232c1-662c-4d20-8f92-7cbb0d347e01 · outbound
This paper cites Cryptographic limitations on learning boolean formulae and finite automata.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Cryptographic limitations on learning boolean formulae and finite automata
Reference 52
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T11:44:10.224356Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 44cd6ee6-4de9-4393-ac6a-0d0a0892543a · outbound
This paper cites Parallelization, amplification, and exponential time simulation of quantum interactive proof systems.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Parallelization, amplification, and exponential time simulation of quantum interactive proof systems
Reference 53
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T11:44:10.227228Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation bd33c642-ef03-4dd9-a7e6-7a73906fe83d · outbound
This paper cites Constructing digital signatures from a one-way function.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Constructing digital signatures from a one-way function
Reference 54
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.665001Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 78dbf0ed-f90e-4ee6-a6b4-c0b9f4b818c8 · outbound
This paper cites Learning quantum states prepared by shallow circuits in polynomial time.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Learning quantum states prepared by shallow circuits in polynomial time
Reference 55
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T11:44:10.232990Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation 2675bf73-420e-4a45-82cb-e6e68e63b3d3 · outbound
This paper cites Constant depth circuits, F ourier transform, and learnability.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Constant depth circuits, F ourier transform, and learnability
Reference 56
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.656696Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation c4407a4a-5f30-41a8-9c25-675af0b5b695 · outbound
This paper cites A one-query lower bound for unitary synthesis and breaking quantum cryptography.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications A one-query lower bound for unitary synthesis and breaking quantum cryptography
Reference 57
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.648408Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 71e781ab-6575-44e7-9031-f6b86ddbf777 · outbound
This paper cites On ideal lattices and learning with errors over rings.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications On ideal lattices and learning with errors over rings
Reference 58
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.640588Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 6245ea4a-2402-42c2-8f02-500debf6aff1 · outbound
This paper cites Noise-induced shallow circuits and absence of barren plateaus, 2024.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Noise-induced shallow circuits and absence of barren plateaus, 2024
Reference 59
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.631879Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation f645e229-29de-4f7d-a727-d4242833241e · outbound
This paper cites Cryptographic characterization of quantum advantage, 2024.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Cryptographic characterization of quantum advantage, 2024
Reference 60
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.622961Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation fa5f8263-87ab-44c7-aa3b-0ae4b64301f9 · outbound
This paper cites Morvan, B.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Morvan, B
Reference 61
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.613991Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 3c894382-4058-4da3-99e6-2bc6f5c0ea9f · outbound
This paper cites One-Wayness in Quantum Cryptography.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications One-Wayness in Quantum Cryptography
Reference 62
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T11:44:10.253593Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation dcde096e-8afb-4755-b8eb-b3a3118906a9 · outbound
This paper cites Quantum commitments and signatures without one-way functions.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Quantum commitments and signatures without one-way functions
Reference 63
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.605603Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 25507b54-3ff8-4d30-89ac-9a1c86d9449e · outbound
This paper cites FIPS 204 : M odule- L attice- B ased D igital S ignature S tandard, 2024.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications FIPS 204 : M odule- L attice- B ased D igital S ignature S tandard, 2024
Reference 64
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.597415Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation b3cde67f-92a1-4145-b13b-108317619c3d · outbound
This paper cites Hardness vs randomness.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Hardness vs randomness
Reference 65
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.589453Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 76cc251c-deec-41a2-b63f-c3eedbce4699 · outbound
This paper cites A computational separation between quantum no-cloning and no-telegraphing.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications A computational separation between quantum no-cloning and no-telegraphing
Reference 66
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.580407Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation e0d99246-d9cf-434a-bc56-a7e2ba03f7bd · outbound
This paper cites On classical simulation algorithms for noisy boson sampling, 2023.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications On classical simulation algorithms for noisy boson sampling, 2023
Reference 67
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.571749Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 240a8424-ab15-410b-9beb-4e5c1a023cd7 · outbound
This paper cites Oliveira and Rahul Santhanam.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Oliveira and Rahul Santhanam
Reference 68
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.562727Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation a9df4df5-0f3d-43f9-99f3-1fb290fc11bd · outbound
This paper cites The learning stabilizers with noise problem, 2024.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications The learning stabilizers with noise problem, 2024
Reference 69
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.551937Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation fa63e681-ca93-488d-9fbc-198009f6b292 · outbound
This paper cites Hard Quantum Extrapolations in Quantum Cryptography.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Hard Quantum Extrapolations in Quantum Cryptography
Reference 70
- Resolution
- verified exact
- local_arxiv, observed 2026-08-16T11:44:10.344040Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation fbb84817-ea8c-41ca-8a6e-a692f10dacec · outbound
This paper cites Ryan-Anderson, C.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Ryan-Anderson, C
Reference 71
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.542099Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation fb4c2d0a-00ed-4e7d-9f7a-a6b17407b9af · outbound
This paper cites On lattices, learning with errors, random linear codes, and cryptography, 2024.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications On lattices, learning with errors, random linear codes, and cryptography, 2024
Reference 72
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.532015Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 226759dd-1e9f-4a61-909c-85b49ccbcbb1 · outbound
This paper cites Quantum computation with programmable neutral-atom arrays.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Quantum computation with programmable neutral-atom arrays
Reference 73
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.521373Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 0709971a-4d30-4231-a783-797cb65bd43b · outbound
This paper cites an unresolved cited work.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Unresolved cited work
Reference 74
- Resolution
- unresolved
- raw_fallback, observed 2026-08-16T11:44:10.511427Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation f837b7b6-c006-421a-a9e7-343a771289ce · outbound
This paper cites Quantum advantage with gaussian boson sampling in photonic quantum computers.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Quantum advantage with gaussian boson sampling in photonic quantum computers
Reference 75
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.500379Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 94e7cb49-49f3-42e9-8cce-e5800c7cb472 · outbound
This paper cites Optimal cloning of pure states.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Optimal cloning of pure states
Reference 76
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.490305Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 707b887f-e721-4034-9215-7c213dfdb72b · outbound
This paper cites General properties of quantum bit commitments.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications General properties of quantum bit commitments
Reference 77
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.480840Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 877e81f2-8ca2-4bd8-8edc-c0fda0d3ebe5 · outbound
This paper cites Quantum computational advantage via 62-qubit superconducting processor.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Quantum computational advantage via 62-qubit superconducting processor
Reference 78
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.471653Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation 031b8cad-79b4-4f4b-a263-98d8133f2490 · outbound
This paper cites Phase-programmable gaussian boson sampling using stimulated squeezed light.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Phase-programmable gaussian boson sampling using stimulated squeezed light
Reference 79
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.462097Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation c99c011a-db62-4a65-93b1-096ef84d7636 · outbound
This paper cites Learning quantum states and unitaries of bounded gate complexity.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Learning quantum states and unitaries of bounded gate complexity
Reference 80
- Resolution
- unresolved
- no resolver link, observed 2026-08-16T11:44:10.307187Z
Source-reported events for the cited work
Unavailable: canonical work link unavailable.
Observation bc003b44-23b8-4060-a76d-80d295b2abfa · outbound
This paper cites Quantum computational advantage using photons.
The Hardness of Learning Quantum Circuits and its Cryptographic Applications Quantum computational advantage using photons
Reference 81
- Resolution
- verified fuzzy
- raw_fallback, observed 2026-08-16T11:44:10.447533Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Pith citing papers
Observation 84998fc0-bc67-414f-958d-1c3a1fb6f247 · inbound
On the Complexity of Quantum States and Circuits from the Orthogonal and Symplectic Groups cites this paper.
On the Complexity of Quantum States and Circuits from the Orthogonal and Symplectic Groups The Hardness of Learning Quantum Circuits and its Cryptographic Applications
Reference 27
- Resolution
- verified exact
- arxiv_id, observed 2026-05-18T18:01:43.905365Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.
Observation a978e8fc-1325-44d7-b636-60daa566ddba · inbound
Cloning is as Hard as Learning for Stabilizer States cites this paper.
Cloning is as Hard as Learning for Stabilizer States The Hardness of Learning Quantum Circuits and its Cryptographic Applications
Reference 9
- Resolution
- verified exact
- arxiv_id, observed 2026-05-10T11:30:19.012978Z
Source-reported events for the cited work
No event found in the named queried sources as of 2026-08-22T06:32:14.747728+00:00.