Cover Image

Learning low-degree quantum objects

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Arunachalam, Srinivasan, Dutt, Arkopal, Gutiérrez, Francisco Escudero, Palazuelos, Carlos
Format:	Preprint
Published:	2024
Subjects:	Quantum Physics Computational Complexity Data Structures and Algorithms Machine Learning Functional Analysis
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Testing and learning structured quantum Hamiltonians
by: Arunachalam, Srinivasan, et al.
Published: (2024)

Polynomial-time tolerant testing stabilizer states
by: Arunachalam, Srinivasan, et al.
Published: (2024)

A note on polynomial-time tolerant testing stabilizer states
by: Arunachalam, Srinivasan, et al.
Published: (2024)

Simple algorithms to test and learn local Hamiltonians
by: Gutiérrez, Francisco Escudero
Published: (2024)

Learning stabilizer structure of quantum states
by: Arunachalam, Srinivasan, et al.
Published: (2025)

Learning depth-3 circuits via quantum agnostic boosting
by: Arunachalam, Srinivasan, et al.
Published: (2025)

Certifying and learning quantum Ising Hamiltonians
by: Bluhm, Andreas, et al.
Published: (2025)

Certifying and learning local quantum Hamiltonians
by: Bluhm, Andreas, et al.
Published: (2026)

Nearly optimal algorithms to learn sparse quantum Hamiltonians in physically motivated distances
by: Abbas, Amira, et al.
Published: (2025)

Testing classical properties from quantum data
by: Caro, Matthias C., et al.
Published: (2024)

Interactive proofs for verifying (quantum) learning and testing
by: Caro, Matthias C., et al.
Published: (2024)

Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
by: Allcock, Jonathan, et al.
Published: (2025)

Reducing Isotropy and Volume to KLS: Faster Rounding and Volume Algorithms
by: Jia, He, et al.
Published: (2020)

Information-Computation Gaps in Quantum Learning via Low-Degree Likelihood
by: Chen, Sitan, et al.
Published: (2025)

An Exponential Separation Between Quantum and Quantum-Inspired Classical Algorithms for Linear Systems
by: Grønlund, Allan, et al.
Published: (2024)

Stabilizer bootstrapping: A recipe for efficient agnostic tomography and magic estimation
by: Chen, Sitan, et al.
Published: (2024)

Low-degree phase transitions for detecting a planted clique in sublinear time
by: Mardia, Jay, et al.
Published: (2024)

A quantum neural network framework for scalable quantum circuit approximation of unitary matrices
by: Sarkar, Rohit Sarma, et al.
Published: (2024)

Elfs, transducers and quantum walks
by: Apers, Simon, et al.
Published: (2026)

On estimating the quantum $\ell_α$ distance
by: Liu, Yupan, et al.
Published: (2025)

Fast quantum algorithm for differential equations
by: Bagherimehrab, Mohsen, et al.
Published: (2023)

On estimating the trace of quantum state powers
by: Liu, Yupan, et al.
Published: (2024)

Optimal lower bounds for quantum state tomography
by: Scharnhorst, Thilo, et al.
Published: (2025)

Optimal learning of quantum channels in diamond distance
by: Mele, Antonio Anna, et al.
Published: (2025)

Directed st-connectivity with few paths is in quantum logspace
by: Apers, Simon, et al.
Published: (2024)

A sublinear query quantum algorithm for s-t minimum cut on dense simple graphs
by: Apers, Simon, et al.
Published: (2021)

Beyond Bell sampling: stabilizer state learning and quantum pseudorandomness lower bounds on qudits
by: Allcock, Jonathan, et al.
Published: (2024)

Testing noisy low-degree polynomials for sparsity
by: Bao, Yiqiao, et al.
Published: (2025)

Optimal certification of constant-local Hamiltonians
by: Lee, Junseo, et al.
Published: (2025)

Hamiltonian Property Testing
by: Bluhm, Andreas, et al.
Published: (2024)

Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet case
by: Arunachalam, Srinivasan, et al.
Published: (2021)

Robust and optimal loading of general classical data into quantum computers
by: Zhang, Xiao-Ming
Published: (2024)

On the Power of Interactive Proofs for Learning
by: Gur, Tom, et al.
Published: (2024)

Superconstant Inapproximability of Decision Tree Learning
by: Koch, Caleb, et al.
Published: (2024)

Exact and Approximate Algorithms for Polytree Learning
by: Harviainen, Juha, et al.
Published: (2026)

Learning-Augmented Algorithms for Boolean Satisfiability
by: Attias, Idan, et al.
Published: (2025)

Hardness of Maximum Likelihood Learning of DPPs
by: Grigorescu, Elena, et al.
Published: (2022)

A Distributional-Lifting Theorem for PAC Learning
by: Blanc, Guy, et al.
Published: (2025)

The Sample Complexity of Replicable Realizable PAC Learning
by: Larsen, Kasper Green, et al.
Published: (2026)

Active Learning for Decision Trees with Provable Guarantees
by: Moakhar, Arshia Soltani, et al.
Published: (2026)