Imagen de Portada

A Classical Quadratic Speedup for Planted $k$XOR

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Gupta, Meghal, He, William, O'Donnell, Ryan, Singer, Noah G.
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Cryptography and Security Quantum Physics
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Few Single-Qubit Measurements Suffice to Certify Any Quantum State
por: Gupta, Meghal, et al.
Publicado: (2025)

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

Quantum chi-squared tomography and mutual information testing
por: Flammia, Steven T., et al.
Publicado: (2023)

SPAM Tolerance for Pauli Error Estimation
por: O'Donnell, Ryan, et al.
Publicado: (2025)

The state hidden subgroup problem and an efficient algorithm for locating unentanglement
por: Bouland, Adam, et al.
Publicado: (2024)

On Learning Parities with Dependent Noise
por: Golowich, Noah, et al.
Publicado: (2024)

On Wagner's k-Tree Algorithm Over Integers
por: Lin, Haoxing, et al.
Publicado: (2024)

Instance-Optimal Quantum State Certification with Entangled Measurements
por: O'Donnell, Ryan, et al.
Publicado: (2025)

Improved Classical and Quantum Algorithms for the Shortest Vector Problem via Bounded Distance Decoding
por: Aggarwal, Divesh, et al.
Publicado: (2020)

Query-optimal estimation of unitary channels in diamond distance
por: Haah, Jeongwan, et al.
Publicado: (2023)

Comprehensive characterization of three-qubit Grover search algorithm on IBM's 127-qubit superconducting quantum computers
por: AbuGhanem, M.
Publicado: (2024)

Average-Case Complexity of Quantum Stabilizer Decoding
por: Khesin, Andrey Boris, et al.
Publicado: (2025)

Quantum Local Differential Privacy and Quantum Statistical Query Model
por: Angrisani, Armando, et al.
Publicado: (2022)

The NISQ Complexity of Collision Finding
por: Hamoudi, Yassine, et al.
Publicado: (2022)

Super-Constant Weight Dicke States in Constant Depth Without Fanout
por: Gretta, Lucas, et al.
Publicado: (2026)

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

The Planted Orthogonal Vectors Problem
por: Kühnemann, David, et al.
Publicado: (2025)

Differentially Private Learning Beyond the Classical Dimensionality Regime
por: Dwork, Cynthia, et al.
Publicado: (2024)

Differentially Private Algorithms for Graph Cuts: A Shifting Mechanism Approach and More
por: Chandra, Rishi, et al.
Publicado: (2024)

A Persistent Hierarchical Bloom Filter-based Framework for Authentication and Tracking of ICs
por: Shishir, Fairuz Shadmani, et al.
Publicado: (2024)

Privacy Filters are Captured by Residues: A Characterization of Free Natural Filters and the Cost of Adaptivity
por: Regehr, Matthew, et al.
Publicado: (2026)

Low-degree Security of the Planted Random Subgraph Problem
por: Bogdanov, Andrej, et al.
Publicado: (2024)

Improved Differentially Private Algorithms for Rank Aggregation
por: Hillebrand, Quentin, et al.
Publicado: (2025)

Almost Instance-optimal Clipping for Summation Problems in the Shuffle Model of Differential Privacy
por: Dong, Wei, et al.
Publicado: (2024)

Dynamic Accountable Storage: An Efficient Protocol for Real-time Cloud Storage Auditing
por: Goodrich, Michael T., et al.
Publicado: (2024)

Private Lossless Multiple Release
por: Andersson, Joel Daniel, et al.
Publicado: (2025)

Space-Efficient Private Estimation of Quantiles
por: Cafaro, Massimo, et al.
Publicado: (2025)

Fast and Optimal Differentially Private Frequent-Substring Mining
por: Guo, Peaker, et al.
Publicado: (2026)

Differentially Private Matchings
por: Dinitz, Michael, et al.
Publicado: (2025)

Individualized Privacy Accounting via Subsampling with Applications in Combinatorial Optimization
por: Ghazi, Badih, et al.
Publicado: (2024)

Private Hyperparameter Tuning with Ex-Post Guarantee
por: Ghazi, Badih, et al.
Publicado: (2025)

Adversary Resilient Learned Bloom Filters
por: Almashaqbeh, Ghada, et al.
Publicado: (2024)

Differentially Private Space-Efficient Algorithms for Counting Distinct Elements in the Turnstile Model
por: Cummings, Rachel, et al.
Publicado: (2025)

It is high time we let go of the Mersenne Twister
por: Vigna, Sebastiano
Publicado: (2019)

Differentially Private Substring and Document Counting with Near-Optimal Error
por: Bernardini, Giulia, et al.
Publicado: (2024)

Local Node Differential Privacy
por: Raskhodnikova, Sofya, et al.
Publicado: (2026)

Differentially Private Set Representations
por: Patel, Sarvar, et al.
Publicado: (2025)

Scalable Private Partition Selection via Adaptive Weighting
por: Chen, Justin Y., et al.
Publicado: (2025)

Fine-Grained Privacy Guarantees for Coverage Problems
por: Dhulipala, Laxman, et al.
Publicado: (2024)

Near-Universally-Optimal Differentially Private Minimum Spanning Trees
por: Hladík, Richard, et al.
Publicado: (2024)