Zobrazeno 1 - 10
of 23
pro vyhledávání: '"Moondra, Jai"'
We develop new approximate compilation schemes that significantly reduce the expense of compiling the Quantum Approximate Optimization Algorithm (QAOA) for solving the Max-Cut problem. Our main focus is on compilation with trapped-ion simulators usin
Externí odkaz:
http://arxiv.org/abs/2406.14330
Motivated by fairness concerns, we study the `portfolio problem': given an optimization problem with set $D$ of feasible solutions, a class $\mathbf{C}$ of fairness objective functions on $D$, and an approximation factor $\alpha \ge 1$, a set $X \sub
Externí odkaz:
http://arxiv.org/abs/2311.03230
Fair facility location problems try to balance access costs to open facilities borne by different groups of people by minimizing the $L_p$ norm of these group distances. However, there is no clear choice of "$p$" in the current literature. We present
Externí odkaz:
http://arxiv.org/abs/2211.14873
The cost due to delay in services may be intrinsically different for various applications of vehicle routing such as medical emergencies, logistical operations, and ride-sharing. We study a fundamental generalization of the Traveling Salesman Problem
Externí odkaz:
http://arxiv.org/abs/2208.04410
Publikováno v:
Quantum 7, 1121 (2023)
We generalize the Quantum Approximate Optimization Algorithm (QAOA) of Farhi et al. (2014) to allow for arbitrary separable initial states with corresponding mixers such that the starting state is the most excited state of the mixing Hamiltonian. We
Externí odkaz:
http://arxiv.org/abs/2112.11354
Optimization algorithms such as projected Newton's method, FISTA, mirror descent, and its variants enjoy near-optimal regret bounds and convergence rates, but suffer from a computational bottleneck of computing ``projections'' in potentially each ite
Externí odkaz:
http://arxiv.org/abs/2106.11943
Publikováno v:
Phys. Rev. A 106, 022606 (2022)
We present methods for constructing any target coupling graph using limited global controls in an Ising-like quantum spin system. Our approach is motivated by implementing the quantum approximate optimization algorithm (QAOA) on trapped ion quantum h
Externí odkaz:
http://arxiv.org/abs/2011.08165
Publikováno v:
Discrete Applied Mathematics 333 (2023), 32-42
The degree set of a finite simple graph $G$ is the set of distinct degrees of vertices of $G$. A theorem of Kapoor, Polimeni & Wall asserts that the least order of a graph with a given degree set $\mathscr D$ is $1+\max \mathscr D$. Tripathi & Vijay
Externí odkaz:
http://arxiv.org/abs/2009.10294
Publikováno v:
In Discrete Applied Mathematics 15 July 2023 333:32-42
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.