conftrace_

quantum algorithm

28 papers

Explore in graph

Also known as

QA

Co-occurring keywords

quantum computing (88) regret bound (1926) query complexity (183) sublinear algorithm (25) multi-armed bandit (1098) exponential speedup (4) adiabatic quantum computing (5) adiabatic quantum computer (2) amplitude amplification (2) zero-sum game (190)

Papers

Quantum Lipschitz Bandits AAAI 2026
Quantum Algorithms for Spectral Sums AAAI 2026
Quantum Best Arm Identification with Quantum Oracles AAAI 2025
Efficient Quantum Agnostic Improper Learning of Decision Trees AISTATS 2024
HDQMF: Holographic Feature Decomposition Using Quantum Algorithms CVPR 2024
Quantum Algorithms for Non-smooth Non-convex Optimization NIPS 2024
Quantum algorithm for large-scale market equilibrium computation NIPS 2024
Quantum Multi-Armed Bandits and Stochastic Linear Bandits Enjoy Logarithmic Regrets AAAI 2023
Learning k-qubit Quantum Operators via Pauli Decomposition AISTATS 2023
Quantum Multi-Model Fitting CVPR 2023
Quantum Speedups for Zero-Sum Games via Improved Dynamic Gibbs Sampling ICML 2023
Efficient Quantum Algorithms for Quantum Optimal Control ICML 2023
Near-Optimal Quantum Coreset Construction Algorithms for Clustering ICML 2023
Quantum Bayesian Optimization NIPS 2023
Logarithmic-Regret Quantum Learning Algorithms for Zero-Sum Games NIPS 2023
Quantum speedups for stochastic optimization NIPS 2023
Quantum Speedups of Optimizing Approximately Convex Functions with Applications to Logarithmic Regret Stochastic Convex Bandits NIPS 2022
Quantum Algorithms for Sampling Log-Concave Distributions and Estimating Normalizing Constants NIPS 2022
On the Cryptographic Hardness of Learning Single Periodic Neurons NIPS 2021
Sublinear Classical and Quantum Algorithms for General Matrix Games AAAI 2021
Quantum Exploration Algorithms for Multi-Armed Bandits AAAI 2021
Quantum algorithms for reinforcement learning with a generative model ICML 2021
Quantum Expectation-Maximization for Gaussian mixture models ICML 2020
A Quantum Computational Approach to Correspondence Problems on Point Sets CVPR 2020
Learning with Optimized Random Features: Exponential Speedup by Quantum Machine Learning without Sparsity and Low-Rank Assumptions NIPS 2020