Quantum advantage from one-way functions
type: Item
instance of: scholarly article
title: Quantum advantage from one-way functions
DOI: 10.1007/978-3-031-68388-6_13
author: Tomoyuki Morimae
author: Takashi Yamakawa
publication date: 2024-12-13T00:00:00Z
Mathematics Subject Classification ID: 81P68
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7958243
MaRDI profile type: Publication
cites work: BQP and the polynomial hierarchy
cites work: The equivalence of sampling and searching
cites work: Q3191607
cites work: Forrelation
cites work: The computational complexity of linear optics
cites work: Q5111152
cites work: Pseudorandom (function-Like) quantum state generators: new definitions and applications
cites work: Cryptography from pseudorandom quantum states
cites work: On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings
cites work: Computational Complexity
cites work: Multi-collision resistant hash functions and their applications
cites work: Distributional collision resistance beyond one-way functions
cites work: On the computational hardness needed for quantum cryptography
cites work: A Cryptographic Test of Quantumness and Certifiable Randomness from a Single Quantum Device
cites work: Q5874392
cites work: Quantum advantage with shallow circuits
cites work: Classical simulation of commuting quantum computations implies collapse of the polynomial hierarchy
cites work: The random oracle methodology, revisited
cites work: Theory of Cryptography
cites work: On the randomness complexity of efficient sampling
cites work: Separating succinct non-interactive arguments from all falsifiable assumptions
cites work: Foundations of Cryptography
cites work: Interactive shallow Clifford circuits: Quantum advantage against NC¹ and beyond
cites work: Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
cites work: Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
cites work: Pseudorandom quantum states
cites work: Collision resistant hashing for paranoids: dealing with multiple collisions
cites work: On distributional collision resistant hashing
cites work: Q6126345
cites work: Quantum commitments and signatures without one-way functions
cites work: Proofs of quantumness from trapdoor permutations
cites work: Advances in Cryptology - CRYPTO 2003
cites work: Q4318694
cites work: An Equivalence Between Zero Knowledge and Commitments
cites work: Q4864429
cites work: Q3522470
cites work: NP is as easy as detecting unique solutions
cites work: Exponential separation between shallow quantum circuits and unbounded fan-in shallow classical circuits
description: scientific article; zbMATH DE number 7958243