How to model unitary oracles

DOI10.1007/978-3-032-01878-6_8MaRDI QIDQ6863963zbMATH OpenFDO

Authors Mark Zhandry

Publication date 4 February 2026

Full work available at URL https://doi.org/10.1007/978-3-032-01878-6_8

zbMATH Keywords

pseudorandom unitaries, efficient quantum circuitsquantum complexity-theoretic separation

Mathematics Subject Classification ID

Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60)

Cites work

• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Complexity Theoretic Issues Concerning Block Ciphers Related to D.E.S.
• Computational Pseudorandomness, the Wormhole Growth Paradox, and Constraints on the AdS/CFT Duality (Abstract)
• scientific article; zbMATH DE number 1842483 (Why is no real title available?)
• scientific article; zbMATH DE number 2103524 (Why is no real title available?)
• Perturbation Bounds for Determinants and Characteristic Polynomials
• Post-quantum succinct arguments: breaking the quantum rewinding barrier
• PP is as Hard as the Polynomial-Time Hierarchy
• Pseudorandom quantum states
• Quantum proofs of knowledge
• Quantum pseudorandom scramblers
• Quantum versus classical proofs and advice
• Random oracles in a quantum world
• Real-valued somewhat-pseudorandom unitaries
• Strengths and Weaknesses of Quantum Computing
• The black hole interior from non-isometric codes and complexity
• The equivalence of the random oracle model and the ideal cipher model, revisited
• The ghost in the radiation: robust encodings of the black hole interior
• The random matrix theory of the classical compact groups
• The Random Oracle Model and the Ideal Cipher Model Are Equivalent
• Theory of Cryptography

Cited in

(1)

• On the cryptographic futility of non-collapsing measurements

This page was built for publication: How to model unitary oracles

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6863963)