:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Zhao, Andrew
Format:	Preprint
Published:	2024
Subjects:	Quantum Physics Data Structures and Algorithms Machine Learning
Online Access:	https://arxiv.org/abs/2410.21635
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Learning quantum Hamiltonians at any temperature in polynomial time
by: Bakshi, Ainesh, et al.
Published: (2023)

Learning $k$-body Hamiltonians via compressed sensing
by: Ma, Muzhou, et al.
Published: (2024)

Learning fermionic linear optics with Heisenberg scaling and physical operations
by: Christensen, Aria, et al.
Published: (2026)

Structure learning of Hamiltonians from real-time evolution
by: Bakshi, Ainesh, et al.
Published: (2024)

Optimal learning of quantum Hamiltonians from high-temperature Gibbs states
by: Haah, Jeongwan, et al.
Published: (2021)

Improved algorithms for learning quantum Hamiltonians, via flat polynomials
by: Narayanan, Shyam
Published: (2024)

Sublinear Time Quantum Sensitivity Sampling
by: Song, Zhao, et al.
Published: (2025)

Sublinear Time Quantum Algorithm for Attention Approximation
by: Song, Zhao, et al.
Published: (2026)

Robust Dequantization of the Quantum Singular value Transformation and Quantum Machine Learning Algorithms
by: Gall, François Le
Published: (2023)

Exact Spin Elimination in Ising Hamiltonians and Energy-Based Machine Learning
by: Berloff, Natalia G.
Published: (2025)

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

Non-iid hypothesis testing: from classical to quantum
by: De Palma, Giacomo, et al.
Published: (2025)

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

Predicting quantum channels over general product distributions
by: Chen, Sitan, et al.
Published: (2024)

QCircuitBench: A Large-Scale Dataset for Benchmarking Quantum Algorithm Design
by: Yang, Rui, et al.
Published: (2024)

Provably faster randomized and quantum algorithms for $k$-means clustering via uniform sampling
by: Chen, Tyler, et al.
Published: (2025)

Quantum principal component analysis without eigenvector recovery
by: Yuan, Yewei, et al.
Published: (2026)

Quantum Sparse Recovery and Quantum Orthogonal Matching Pursuit
by: Bellante, Armando, et al.
Published: (2025)

Do you know what q-means?
by: Cornelissen, Arjan, et al.
Published: (2023)

A Quantum Approximation Scheme for k-Means
by: Jaiswal, Ragesh
Published: (2023)

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

Mildly-Interacting Fermionic Unitaries are Efficiently Learnable
by: Iyer, Vishnu
Published: (2025)

A Unified Framework for Provably Efficient Algorithms to Estimate Shapley Values
by: Chen, Tyler, et al.
Published: (2025)

Efficient learning of bosonic Gaussian unitaries
by: Fanizza, Marco, et al.
Published: (2025)

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

SYK thermal expectations are classically easy at any temperature
by: Zlokapa, Alexander, et al.
Published: (2026)

Implementing any Linear Combination of Unitaries on Intermediate-term Quantum Computers
by: Chakraborty, Shantanav
Published: (2023)

No-Free-Lunch Theories for Tensor-Network Machine Learning Models
by: Wu, Jing-Chuan, et al.
Published: (2024)

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

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

Many Hamiltonians Are Sparsifiable
by: Basu, Arpon, et al.
Published: (2026)

Quantum Speedup for Spectral Approximation of Kronecker Products
by: Gao, Yeqi, et al.
Published: (2024)

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

Improved classical shadows from local symmetries in the Schur basis
by: Grier, Daniel, et al.
Published: (2024)

Improved approximation algorithms for the EPR Hamiltonian
by: Ju, Nathan, et al.
Published: (2025)

Time-Dependent Hamiltonian Simulation in the Low-Energy Subspace
by: Zhou, Shuo, et al.
Published: (2026)

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

An optimal tradeoff between entanglement and copy complexity for state tomography
by: Chen, Sitan, et al.
Published: (2024)

Quantum Algorithms and Lower Bounds for Finite-Sum Optimization
by: Zhang, Yexin, et al.
Published: (2024)

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