Image de couverture de livre

Simple constructions of linear-depth t-designs and pseudorandom unitaries

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Metger, Tony, Poremba, Alexander, Sinha, Makrand, Yuen, Henry
Format:	Preprint
Publié:	2024
Sujets:	Quantum Physics Cryptography and Security
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Pseudorandom unitaries with non-adaptive security
par: Metger, Tony, et autres
Publié: (2024)

Unitary Complexity and the Uhlmann Transformation Problem
par: Bostanci, John, et autres
Publié: (2023)

The Hardness of Learning Quantum Circuits and its Cryptographic Applications
par: Fefferman, Bill, et autres
Publié: (2025)

Efficient unitary designs and pseudorandom unitaries from permutations
par: Chen, Chi-Fang, et autres
Publié: (2024)

Succinct arguments for QMA from standard assumptions via compiled nonlocal games
par: Metger, Tony, et autres
Publié: (2024)

Quantum One-Wayness of the Single-Round Sponge with Invertible Permutations
par: Carolan, Joseph, et autres
Publié: (2024)

Single-Round Proofs of Quantumness from Knowledge Assumptions
par: Arabadjieva, Petia, et autres
Publié: (2024)

The power of a single Haar random state: constructing and separating quantum pseudorandomness
par: Chen, Boyang, et autres
Publié: (2024)

(Quantum) Indifferentiability and Pre-Computation
par: Carolan, Joseph, et autres
Publié: (2024)

Revocable Encryption, Programs, and More: The Case of Multi-Copy Security
par: Ananth, Prabhanjan, et autres
Publié: (2024)

The Learning Stabilizers with Noise problem
par: Poremba, Alexander, et autres
Publié: (2024)

Quantum copy-protection of compute-and-compare programs in the quantum random oracle model
par: Coladangelo, Andrea, et autres
Publié: (2020)

Quantum Cryptography in Algorithmica
par: Kretschmer, William, et autres
Publié: (2022)

Scalable, quantum-accessible, and adaptive pseudorandom quantum state and pseudorandom function-like quantum state generators
par: Batra, Rishabh, et autres
Publié: (2025)

Efficient Quantum Pseudorandomness from Hamiltonian Phase States
par: Bostanci, John, et autres
Publié: (2024)

On the Two-sided Permutation Inversion Problem
par: Alagic, Gorjan, et autres
Publié: (2023)

Post-Quantum Cryptography from Quantum Stabilizer Decoding
par: Lu, Jonathan Z., et autres
Publié: (2026)

The NISQ Complexity of Collision Finding
par: Hamoudi, Yassine, et autres
Publié: (2022)

On black-box separations of quantum digital signatures from pseudorandom states
par: Coladangelo, Andrea, et autres
Publié: (2024)

Cloning Games, Black Holes and Cryptography
par: Poremba, Alexander, et autres
Publié: (2024)

On Scalable Pseudorandom Unitaries and the Unitary Synthesis Problem
par: Brakerski, Zvika, et autres
Publié: (2026)

Simultaneous Haar Indistinguishability with Applications to Unclonable Cryptography
par: Ananth, Prabhanjan, et autres
Publié: (2024)

How To Track Qubits Through Space and Time (Or: Sailing in a Quantum Boat)
par: Bartusek, James, et autres
Publié: (2026)

New constructions of pseudorandom codes
par: Ghentiyala, Surendra, et autres
Publié: (2024)

An efficient quantum parallel repetition theorem and applications
par: Bostanci, John, et autres
Publié: (2023)

Noise-tolerant learnability of shallow quantum circuits from statistics and the cost of quantum pseudorandomness
par: Wadhwa, Chirag, et autres
Publié: (2024)

A Simple Framework for Secure Key Leasing
par: Kitagawa, Fuyuki, et autres
Publié: (2024)

Simple and tight device-independent security proofs
par: Arnon, Rotem, et autres
Publié: (2016)

A Simple and Efficient One-Shot Signature Scheme
par: Huang, Andrew, et autres
Publié: (2025)

Layered Uploading for Quantum Convolutional Neural Networks
par: Barrué, Grégoire, et autres
Publié: (2024)

Average-Case Complexity of Quantum Stabilizer Decoding
par: Khesin, Andrey Boris, et autres
Publié: (2025)

Towards Simple and Useful One-Time Programs in the Quantum Random Oracle Model
par: Stambler, Lev
Publié: (2026)

Quantum One-Time Memories from Stateless Hardware, Random Access Codes, and Simple Nonconvex Optimization
par: Stambler, Lev
Publié: (2025)

Assessing the feasibility of quantum learning algorithms for noisy linear problems
par: Kim, Minkyu, et autres
Publié: (2024)

Pseudorandom unitaries are neither real nor sparse nor noise-robust
par: Haug, Tobias, et autres
Publié: (2023)

Digital signatures with classical shadows on near-term quantum computers
par: Niroula, Pradeep, et autres
Publié: (2026)

Local transformations of bipartite entanglement are rigid
par: Bostanci, John, et autres
Publié: (2025)

NISQ Security and Complexity via Simple Classical Reasoning
par: Cojocaru, Alexandru, et autres
Publié: (2025)

Super-Quadratic Quantum Speed-ups and Guessing Many Likely Keys
par: Glaser, Timo, et autres
Publié: (2025)

An efficient construction of Raz's two-source randomness extractor with improved parameters
par: Foreman, Cameron, et autres
Publié: (2025)