Zobrazeno 1 - 10
of 5 249
pro vyhledávání: '"Conic programming"'
We present a unified quantum-classical framework for addressing NP-complete constrained combinatorial optimization problems, generalizing the recently proposed Quantum Conic Programming (QCP) approach. Accordingly, it inherits many favorable properti
Externí odkaz:
http://arxiv.org/abs/2411.00435
In this paper we prove a conjecture by Wocjan, Elphick and Anekstein (2018) which upper bounds the sum of the squares of the positive (or negative) eigenvalues of the adjacency matrix of a graph by an expression that behaves monotonically in terms of
Externí odkaz:
http://arxiv.org/abs/2411.08184
Autor:
Hayashi, Masahito, Ouyang, Yingkai
Publikováno v:
npj Quantum Information volume 10, Article number: 111 (2024)
The aim of the channel estimation is to estimate the parameters encoded in a quantum channel. For this aim, it is allowed to choose the input state as well as the measurement to get the outcome. Various precision bounds are known for the state estima
Externí odkaz:
http://arxiv.org/abs/2401.05886
Primal-dual hybrid gradient (PDHG) is a first-order method for saddle-point problems and convex programming introduced by Chambolle and Pock. Recently, Applegate et al.\ analyzed the behavior of PDHG when applied to an infeasible or unbounded instanc
Externí odkaz:
http://arxiv.org/abs/2309.15009
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.
Autor:
Masahito Hayashi, Yingkai Ouyang
Publikováno v:
npj Quantum Information, Vol 10, Iss 1, Pp 1-12 (2024)
Abstract The ultimate precision in quantum sensing could be achieved using optimal quantum probe states. However, current quantum sensing protocols do not use probe states optimally. Indeed, the calculation of optimal probe states remains an outstand
Externí odkaz:
https://doaj.org/article/763accf77dd94d8989a7b9170e916928
In a previous paper [R. Andreani, G. Haeser, L. M. Mito, H. Ram\'irez, T. P. Silveira. First- and second-order optimality conditions for second-order cone and semidefinite programming under a constant rank condition. Mathematical Programming, 2023. D
Externí odkaz:
http://arxiv.org/abs/2304.13881
We propose an early termination technique for mixed integer conic programming for use within branch-and-bound based solvers. Our approach generalizes previous early termination results for ADMM-based solvers to a broader class of primal-dual algorith
Externí odkaz:
http://arxiv.org/abs/2303.09337
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.
Autor:
Hayashi, Masahito, Ouyang, Yingkai
Publikováno v:
Quantum 7, 1094 (2023)
In the quest to unlock the maximum potential of quantum sensors, it is of paramount importance to have practical measurement strategies that can estimate incompatible parameters with best precisions possible. However, it is still not known how to fin
Externí odkaz:
http://arxiv.org/abs/2209.05218