Guardado en:
| Autores principales: | Häner, Thomas, Booth, Kyle E. C., Borujeni, Sima E., Zhu, Elton Yechao |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2407.20185 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Scalable iterative pruning of large language and vision models using block coordinate descent
por: Rosenberg, Gili, et al.
Publicado: (2024)
por: Rosenberg, Gili, et al.
Publicado: (2024)
Iteration Complexity of Variational Quantum Algorithms
por: Kungurtsev, Vyacheslav, et al.
Publicado: (2022)
por: Kungurtsev, Vyacheslav, et al.
Publicado: (2022)
Solving General QUBOs with Warm-Start QAOA via a Reduction to Max-Cut
por: Bhattacharyya, Bikrant, et al.
Publicado: (2025)
por: Bhattacharyya, Bikrant, et al.
Publicado: (2025)
Standardization of Multi-Objective QUBOs
por: Lee, Loong Kuan, et al.
Publicado: (2025)
por: Lee, Loong Kuan, et al.
Publicado: (2025)
Solving the semidefinite relaxation of QUBOs in matrix multiplication time, and faster with a quantum computer
por: Augustino, Brandon, et al.
Publicado: (2023)
por: Augustino, Brandon, et al.
Publicado: (2023)
Quadratic unconstrained binary optimization and constraint programming approaches for lattice-based cyclic peptide docking
por: Brubaker, J. Kyle, et al.
Publicado: (2024)
por: Brubaker, J. Kyle, et al.
Publicado: (2024)
Solving quadratic binary optimization problems using quantum SDP methods: Non-asymptotic running time analysis
por: Henze, Fabian, et al.
Publicado: (2025)
por: Henze, Fabian, et al.
Publicado: (2025)
Increasing the Hardness of Posiform Planting Using Random QUBOs for Programmable Quantum Annealer Benchmarking
por: Pelofske, Elijah, et al.
Publicado: (2024)
por: Pelofske, Elijah, et al.
Publicado: (2024)
Solving a real-world modular logistic scheduling problem with a quantum-classical metaheuristics
por: Krellner, Florian, et al.
Publicado: (2025)
por: Krellner, Florian, et al.
Publicado: (2025)
Modern Computational Methods in Reinsurance Optimization: From Simulated Annealing to Quantum Branch & Bound
por: Woodman, George, et al.
Publicado: (2025)
por: Woodman, George, et al.
Publicado: (2025)
Robustness of quantum algorithms: Worst-case fidelity bounds and implications for design
por: Berberich, Julian, et al.
Publicado: (2025)
por: Berberich, Julian, et al.
Publicado: (2025)
A quadratic Grassmann manifold optimization problem arising from quantum embedding methods
por: Ayral, Thomas, et al.
Publicado: (2026)
por: Ayral, Thomas, et al.
Publicado: (2026)
Computation of entanglement for quantum states by a Consensus-Based Optimization method
por: Herty, Michael, et al.
Publicado: (2026)
por: Herty, Michael, et al.
Publicado: (2026)
SDP bounds on quantum codes
por: Munné, Gerard Anglès, et al.
Publicado: (2024)
por: Munné, Gerard Anglès, et al.
Publicado: (2024)
On encoded quantum gate generation by iterative Lyapunov-based methods
por: da Silva, Paulo Sergio Pereira, et al.
Publicado: (2024)
por: da Silva, Paulo Sergio Pereira, et al.
Publicado: (2024)
Interpolation-based coordinate descent method for parameterized quantum circuits
por: Lai, Zhijian, et al.
Publicado: (2025)
por: Lai, Zhijian, et al.
Publicado: (2025)
A comparison on constrain encoding methods for quantum approximate optimization algorithm
por: Liu, Yiwen, et al.
Publicado: (2024)
por: Liu, Yiwen, et al.
Publicado: (2024)
Certified bounds on optimization problems in quantum theory
por: Naceur, Younes, et al.
Publicado: (2025)
por: Naceur, Younes, et al.
Publicado: (2025)
On the convergence of the variational quantum eigensolver and quantum optimal control
por: Wiedmann, Marco, et al.
Publicado: (2025)
por: Wiedmann, Marco, et al.
Publicado: (2025)
Measurement incompatibility and quantum steering via linear programming
por: Porto, Lucas E. A., et al.
Publicado: (2025)
por: Porto, Lucas E. A., et al.
Publicado: (2025)
Distributed Implementation of Variational Quantum Eigensolver to Solve QUBO Problems
por: Hasanzadeh, Milad, et al.
Publicado: (2025)
por: Hasanzadeh, Milad, et al.
Publicado: (2025)
Solving The Vehicle Routing Problem via Quantum Support Vector Machines
por: Mohanty, Nishikanta, et al.
Publicado: (2023)
por: Mohanty, Nishikanta, et al.
Publicado: (2023)
Better bounds on finite-order Grothendieck constants
por: Designolle, Sébastien, et al.
Publicado: (2024)
por: Designolle, Sébastien, et al.
Publicado: (2024)
Solve Crude Oil Scheduling Problems by Using Quantum-Classical Hybrid Algorithms
por: Yang, Jian, et al.
Publicado: (2026)
por: Yang, Jian, et al.
Publicado: (2026)
A New Hybrid Quantum-Classical Algorithm for Solving the Unit Commitment Problem
por: Aboumrad, Willie, et al.
Publicado: (2025)
por: Aboumrad, Willie, et al.
Publicado: (2025)
Geometric optimization for quantum communication
por: Zhu, Chengkai, et al.
Publicado: (2025)
por: Zhu, Chengkai, et al.
Publicado: (2025)
Five Starter Problems: Solving Quadratic Unconstrained Binary Optimization Models on Quantum Computers
por: Mazumder, Arul, et al.
Publicado: (2024)
por: Mazumder, Arul, et al.
Publicado: (2024)
Extending quantum annealing to continuous domains: a hybrid method for quadratic programming
por: Djidjev, Hristo N.
Publicado: (2025)
por: Djidjev, Hristo N.
Publicado: (2025)
Feedback stabilization via a quantum projection filter
por: Amini, Nina H., et al.
Publicado: (2024)
por: Amini, Nina H., et al.
Publicado: (2024)
Enhancing the controllability of quantum systems via a static field
por: Liang, Ruikang, et al.
Publicado: (2025)
por: Liang, Ruikang, et al.
Publicado: (2025)
Model predictive quantum control: A modular approach for efficient and robust quantum optimal control
por: Guizani, Eya, et al.
Publicado: (2025)
por: Guizani, Eya, et al.
Publicado: (2025)
Robustness of optimal quantum annealing protocols
por: Funcke, Niklas, et al.
Publicado: (2024)
por: Funcke, Niklas, et al.
Publicado: (2024)
No quantum advantage implies improved bounds and classical algorithms for the binary paint shop problem
por: Goh, Mark, et al.
Publicado: (2026)
por: Goh, Mark, et al.
Publicado: (2026)
Random coordinate descent: a simple alternative for optimizing parameterized quantum circuits
por: Ding, Zhiyan, et al.
Publicado: (2023)
por: Ding, Zhiyan, et al.
Publicado: (2023)
Parallel splitting method for large-scale quadratic programs
por: Vandelli, Matteo, et al.
Publicado: (2025)
por: Vandelli, Matteo, et al.
Publicado: (2025)
Syndrome decoding by quantum approximate optimization
por: Lai, Ching-Yi, et al.
Publicado: (2022)
por: Lai, Ching-Yi, et al.
Publicado: (2022)
Globally optimal control of quantum dynamics
por: Bondar, Denys I., et al.
Publicado: (2022)
por: Bondar, Denys I., et al.
Publicado: (2022)
Approximation of diffeomorphisms for quantum state transfers
por: Pozzoli, Eugenio, et al.
Publicado: (2025)
por: Pozzoli, Eugenio, et al.
Publicado: (2025)
Tailored First-order and Interior-point methods and a new semidefinite programming hierarchy for entanglement detection
por: Pena, Javier, et al.
Publicado: (2025)
por: Pena, Javier, et al.
Publicado: (2025)
Gate generation for open quantum systems via a monotonic algorithm with time optimization
por: da Silva, Paulo Sergio Pereira, et al.
Publicado: (2024)
por: da Silva, Paulo Sergio Pereira, et al.
Publicado: (2024)
Ejemplares similares
-
Scalable iterative pruning of large language and vision models using block coordinate descent
por: Rosenberg, Gili, et al.
Publicado: (2024) -
Iteration Complexity of Variational Quantum Algorithms
por: Kungurtsev, Vyacheslav, et al.
Publicado: (2022) -
Solving General QUBOs with Warm-Start QAOA via a Reduction to Max-Cut
por: Bhattacharyya, Bikrant, et al.
Publicado: (2025) -
Standardization of Multi-Objective QUBOs
por: Lee, Loong Kuan, et al.
Publicado: (2025) -
Solving the semidefinite relaxation of QUBOs in matrix multiplication time, and faster with a quantum computer
por: Augustino, Brandon, et al.
Publicado: (2023)