Imagen de Portada

Quartic quantum speedups for planted inference

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Schmidhuber, Alexander, O'Donnell, Ryan, Kothari, Robin, Babbush, Ryan
Formato:	Preprint
Publicado:	2024
Materias:	Quantum Physics Computational Complexity Cryptography and Security
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

No exponential quantum speedup for $\mathrm{SIS}^\infty$ anymore
por: Kothari, Robin, et al.
Publicado: (2025)

Pseudorandom Permutations from Random Reversible Circuits
por: He, William, et al.
Publicado: (2024)

Uniformity testing when you have the source code
por: Canonne, Clément L., et al.
Publicado: (2024)

Improved quantum data analysis
por: Bădescu, Costin, et al.
Publicado: (2020)

Proofs of quantum memory
por: Hhan, Minki, et al.
Publicado: (2025)

Pseudorandom quantum authentication
por: Haug, Tobias, et al.
Publicado: (2025)

The Role of piracy in quantum proofs
por: Broadbent, Anne, et al.
Publicado: (2024)

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

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

Unitary Complexity and the Uhlmann Transformation Problem
por: Bostanci, John, et al.
Publicado: (2023)

A simplified version of the quantum OTOC$^{(2)}$ problem
por: King, Robbie, et al.
Publicado: (2025)

Pseudorandom density matrices
por: Bansal, Nikhil, et al.
Publicado: (2024)

Clifford Strategies in Interactive Protocols are Classically Simulatable
por: Shalit, Itay
Publicado: (2024)

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

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

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

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

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

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

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

Quantum Cryptography in Algorithmica
por: Kretschmer, William, et al.
Publicado: (2022)

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

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

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

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

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

Verifiable Quantum Advantage without Structure
por: Yamakawa, Takashi, et al.
Publicado: (2022)

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

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

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

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

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

Quantum Statistical Witness Indistinguishability
por: Nassar, Shafik, et al.
Publicado: (2025)

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

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

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

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

Quantum Pseudorandom Scramblers
por: Lu, Chuhan, et al.
Publicado: (2023)

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

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