Cover Image

The Role of piracy in quantum proofs

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Broadbent, Anne, Grilo, Alex B., Podder, Supartha, Sikora, Jamie
Format:	Preprint
Published:	2024
Subjects:	Quantum Physics Computational Complexity Cryptography and Security
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The Round Complexity of Proofs in the Bounded Quantum Storage Model
by: Grilo, Alex B., et al.
Published: (2024)

Quantum delegation with an off-the-shelf device
by: Broadbent, Anne, et al.
Published: (2023)

Quantum-proof multi-source randomness extractors in the Markov model
by: Arnon, Rotem, et al.
Published: (2015)

Experimental relativistic zero-knowledge proofs with unconditional security
by: Weng, Chen-Xun, et al.
Published: (2025)

New Lower-bounds for Quantum Computation with Non-Collapsing Measurements
by: Miloschewsky, David, et al.
Published: (2024)

On the Approximate Non-Deterministic Degree of Total Boolean Functions
by: Pednekar, Samruddhi, et al.
Published: (2026)

Modifications of Quantum Computation and Adaptive Queries to PP
by: Miloschewsky, David, et al.
Published: (2025)

Proofs of quantum memory
by: Hhan, Minki, et al.
Published: (2025)

Pseudorandom quantum authentication
by: Haug, Tobias, et al.
Published: (2025)

Quartic quantum speedups for planted inference
by: Schmidhuber, Alexander, et al.
Published: (2024)

On the success probability of quantum order finding
by: Ekerå, Martin
Published: (2022)

An efficient quantum parallel repetition theorem and applications
by: Bostanci, John, et al.
Published: (2023)

En Route to a Standard QMA1 vs. QCMA Oracle Separation
by: Miloschewsky, David, et al.
Published: (2026)

Quantum interactive proofs using quantum energy teleportation
by: Ikeda, Kazuki, et al.
Published: (2023)

Pseudorandom density matrices
by: Bansal, Nikhil, et al.
Published: (2024)

Clifford Strategies in Interactive Protocols are Classically Simulatable
by: Shalit, Itay
Published: (2024)

Quantum Automating $\mathbf{TC}^0$-Frege Is LWE-Hard
by: Arteche, Noel, et al.
Published: (2024)

Pseudorandomness in the (Inverseless) Haar Random Oracle Model
by: Ananth, Prabhanjan, et al.
Published: (2024)

A Meta-Complexity Characterization of Quantum Cryptography
by: Cavalar, Bruno P., et al.
Published: (2024)

Quantum Fast Implementation of Functional Bootstrapping and Private Information Retrieval
by: Ma, Guangsheng, et al.
Published: (2024)

Quantum-Computable One-Way Functions without One-Way Functions
by: Kretschmer, William, et al.
Published: (2024)

On Lattices, Learning with Errors, Random Linear Codes, and Cryptography
by: Regev, Oded
Published: (2024)

Quantum Cryptography in Algorithmica
by: Kretschmer, William, et al.
Published: (2022)

Quantum Cryptography and Hardness of Non-Collapsing Measurements
by: Morimae, Tomoyuki, et al.
Published: (2025)

Finding dense sub-lattices as low-energy states of a Hamiltonian
by: Barberà-Rodríguez, Júlia, et al.
Published: (2023)

Hardness of Quantum Distribution Learning and Quantum Cryptography
by: Hiroka, Taiga, et al.
Published: (2025)

A Note on Output Length of One-Way State Generators and EFIs
by: Hhan, Minki, et al.
Published: (2023)

Verifiable Quantum Advantage without Structure
by: Yamakawa, Takashi, et al.
Published: (2022)

From Worst-Case Hardness of $\mathsf{NP}$ to Quantum Cryptography via Quantum Indistinguishability Obfuscation
by: Morimae, Tomoyuki, et al.
Published: (2025)

Parallel Kac's Walk Generates PRU
by: Lu, Chuhan, et al.
Published: (2025)

On the Computational Hardness of Quantum One-Wayness
by: Cavalar, Bruno, et al.
Published: (2023)

Improved Quantum Lifting by Coherent Measure-and-Reprogram
by: Cojocaru, Alexandru, et al.
Published: (2025)

Quantum Statistical Witness Indistinguishability
by: Nassar, Shafik, et al.
Published: (2025)

NISQ Security and Complexity via Simple Classical Reasoning
by: Cojocaru, Alexandru, et al.
Published: (2025)

Quantum Advantage from One-Way Functions
by: Morimae, Tomoyuki, et al.
Published: (2023)

Classical vs Quantum Advice and Proofs under Classically-Accessible Oracle
by: Li, Xingjian, et al.
Published: (2023)

A Computational Separation Between Quantum No-cloning and No-telegraphing
by: Nehoran, Barak, et al.
Published: (2023)

Quantum Pseudorandom Scramblers
by: Lu, Chuhan, et al.
Published: (2023)

Pseudorandom unitaries are neither real nor sparse nor noise-robust
by: Haug, Tobias, et al.
Published: (2023)

Pseudorandom and Pseudoentangled States from Subset States
by: Jeronimo, Fernando Granha, et al.
Published: (2023)