Efficient simulation of random states and random unitaries
From MaRDI portal
Publication:2055680
DOI10.1007/978-3-030-45727-3_26zbMath1480.81026arXiv1910.05729OpenAlexW3032830280MaRDI QIDQ2055680
Alexander Russell, Gorjan Alagic, Christian Majenz
Publication date: 1 December 2021
Full work available at URL: https://arxiv.org/abs/1910.05729
Quantum computation (81P68) Quantum cryptography (quantum-theoretic aspects) (81P94) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (4)
Semi-quantum money ⋮ Tight adaptive reprogramming in the QROM ⋮ Efficient simulation of random states and random unitaries ⋮ Scalable pseudorandom quantum states
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum cryptography: public key distribution and coin tossing
- Local random quantum circuits are approximate polynomial-designs
- Pseudorandom quantum states
- Unitary designs and codes
- New hash functions and their use in authentication and set equality
- Unforgeable quantum encryption
- Efficient simulation of random states and random unitaries
- (Pseudo) random quantum states with binary phase
- How to record quantum queries, and applications to quantum indifferentiability
- Security of the Fiat-Shamir transformation in the quantum random-oracle model
- Quantum Proofs of Knowledge
- Zero-knowledge against quantum attacks
- Efficient Quantum Circuits for Schur and Clebsch-Gordan Transforms
- Quantum money from hidden subspaces
- Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries
- The Information-Disturbance Tradeoff and the Continuity of Stinespring's Representation
- On the Power of Two-Party Quantum Cryptography
- Quantum-Secure Message Authentication Codes
- Small designs for path-connected spaces and path-connected homogeneous spaces
- Positive Functions on C ∗ -Algebras
This page was built for publication: Efficient simulation of random states and random unitaries
