Quantum advantage from one-way functions
From MaRDI portal
Publication:6652974
Recommendations
Cites work
- scientific article; zbMATH DE number 708806 (Why is no real title available?)
- scientific article; zbMATH DE number 845842 (Why is no real title available?)
- scientific article; zbMATH DE number 7651035 (Why is no real title available?)
- scientific article; zbMATH DE number 7829332 (Why is no real title available?)
- A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device
- Adaptive quantum computation, constant depth quantum circuits and Arthur-Merlin games
- Advances in Cryptology - CRYPTO 2003
- An Equivalence Between Zero Knowledge and Commitments
- BQP and the polynomial hierarchy
- Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy.
- Collision resistant hashing for paranoids: dealing with multiple collisions
- Complexity-theoretic foundations of quantum supremacy experiments
- Computational Complexity
- Cryptography from pseudorandom quantum states
- Distributional collision resistance beyond one-way functions
- Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits
- Forrelation: a problem that optimally separates quantum from classical computing
- Foundations of Cryptography
- Foundations of Cryptography
- Interactive shallow Clifford circuits: Quantum advantage against NC¹ and beyond
- Multi-collision resistant hash functions and their applications
- NP is as easy as detecting unique solutions
- On distributional collision resistant hashing
- On the computational hardness needed for quantum cryptography
- On the randomness complexity of efficient sampling
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- Practical and provably-secure commitment schemes from collision-free hashing
- Proofs of quantumness from trapdoor permutations
- Pseudorandom (function-Like) quantum state generators: new definitions and applications
- Pseudorandom quantum states
- Quantum advantage with shallow circuits
- Quantum commitments and signatures without one-way functions
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function
- The computational complexity of linear optics
- The equivalence of sampling and searching
- The need for structure in quantum speedups
- The random oracle methodology, revisited.
- Theory of Cryptography
This page was built for publication: Quantum advantage from one-way functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6652974)
