:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Raymond, Rudy
Format:	Recurso digital
Language:
Published:	Zenodo 2025
Online Access:	https://doi.org/10.5281/zenodo.15425252
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Optimal Parameter Configurations for Sequential Optimization of Variational Quantum Eigensolver
by: Endo, Katsuhiro, et al.
Published: (2023)

Quantum-Enhanced Simulation-Based Optimization for Newsvendor Problems
by: Sharma, Monit, et al.
Published: (2024)

Recursive Quantum Relaxation for Combinatorial Optimization Problems
by: Kondo, Ruho, et al.
Published: (2024)

Simulating Time Evolution with Fully Optimized Single-Qubit Gates on Parameterized Quantum Circuits
by: Wada, Kaito, et al.
Published: (2021)

Non-Variational Quantum Random Access Optimization with Alternating Operator Ansatz
by: He, Zichang, et al.
Published: (2025)

Parameter Setting Heuristics Make the Quantum Approximate Optimization Algorithm Suitable for the Early Fault-Tolerant Era
by: He, Zichang, et al.
Published: (2024)

Quantum Machine Learning on Near-Term Quantum Devices: Current State of Supervised and Unsupervised Techniques for Real-World Applications
by: Gujju, Yaswitha, et al.
Published: (2023)

Quantum Circuit Optimization through Iteratively Pre-Conditioned Gradient Descent
by: Srinivasan, Dhruv, et al.
Published: (2023)

QUACOD: Quantum Optimization via Coordinate Descent for Scalable Drone Scheduling
by: Nguyen, Van-Quang-Huy, et al.
Published: (2026)

Quantum Speedup for Network Coordination via Fourier Sparsity
by: Dixit, Vinayak
Published: (2026)

Quantum Natural Stochastic Pairwise Coordinate Descent
by: Sohail, Mohammad Aamir, et al.
Published: (2024)

The Quantum Advantage in Binary Teams and the Coordination Dilemma: Supplementary
by: Deshpande, Shashank A., et al.
Published: (2023)

Quantum Relaxation for Solving Multiple Knapsack Problems
by: Sharma, Monit, et al.
Published: (2024)

Setwise Coordinate Descent for Dual Asynchronous Decentralized Optimization
by: Costantini, Marina, et al.
Published: (2025)

Online Convex Optimization Using Coordinate Descent Algorithms
by: Lin, Yankai, et al.
Published: (2022)

Testing Scalable Bell Inequalities for Quantum Graph States on IBM Quantum Devices
by: Yang, Bo, et al.
Published: (2021)

Efficient Learning of Structured Quantum Circuits via Pauli Dimensionality and Sparsity
by: Grewal, Sabee, et al.
Published: (2025)

Noise Robustness of Quantum Relaxation for Combinatorial Optimization
by: Tamura, Kentaro, et al.
Published: (2024)

Coordinate Descent for SLOPE
by: Larsson, Johan, et al.
Published: (2022)

Supplementary Material for "Driving by Disproof: A Model Checking Approach to Fleet Coordination"
by: Koenig, Lukas, et al.
Published: (2025)

Supplementary Materials
by: Krismanuel, Hari
Published: (2025)

Supplementary Material
by: Loggia, Gilles
Published: (2025)

Supplementary Material
by: Mall, Manish Kumar
Published: (2026)

Supplementary Material
by: He, Shaoyan
Published: (2026)

Supplementary Material
by: Gordillo León, Fernando
Published: (2026)

Decentralized Collaborative Learning Framework with External Privacy Leakage Analysis
by: Idé, Tsuyoshi, et al.
Published: (2024)

Efficient quantum readout-error mitigation for sparse measurement outcomes of near-term quantum devices
by: Yang, Bo, et al.
Published: (2022)

Stochastic Shadow Descent: Training Parametrized Quantum Circuits with Shadows of Gradients
by: Pramanik, Sayantan, et al.
Published: (2025)

Coordinate Descent for Network Linearization
by: Rakhlin, Vlad, et al.
Published: (2025)

CRAKEN Supplementary Materials
by: Anonymous Authors
Published: (2025)

Online Supplementary Material
by: Anonymous Authors
Published: (2026)

Sparsity for Ultrafast Material Identification
by: Yurui Qu, et al.
Published: (2024)

Geometry of Sparsity-Inducing Norms
by: Chancelier, Jean-Philippe, et al.
Published: (2025)

Parameter-free Mirror Descent
by: Jacobsen, Andrew, et al.
Published: (2022)

Scalable Base Station Configuration via Bayesian Optimization with Block Coordinate Descent
by: Takamori, Kakeru, et al.
Published: (2026)

Distributed Stochastic Block Coordinate Descent for Time-Varying Multi-Agent Optimization
by: Yu, Zhan, et al.
Published: (2019)

Block Coordinate Descent Methods for Optimization under J-Orthogonality Constraints with Applications
by: He, Di, et al.
Published: (2024)

Fast Parameter Optimization of Delayed Feedback Reservoir with Backpropagation and Gradient Descent
by: Ikeda, Sosei, et al.
Published: (2025)

Quantum Hamiltonian Descent for Non-smooth Optimization
by: Leng, Jiaqi, et al.
Published: (2025)

SOFA: A Compute-Memory Optimized Sparsity Accelerator via Cross-Stage Coordinated Tiling
by: Wang, Huizheng, et al.
Published: (2024)