Zobrazeno 1 - 10
of 5 405
pro vyhledávání: '"Pistoia, A."'
We study the critical system of $m\geq 2$ equations \begin{equation*} -\Delta u_i = u_i^5 + \sum_{j = 1,\,j\neq i}^m \beta_{ij} u_i^2 u_j^3\,, \quad u_i \gneqq 0 \quad \mbox{in } \mathbb{R}^3\,, \quad i \in \{1, \ldots, m\}\,, \end{equation*} where $
Externí odkaz:
http://arxiv.org/abs/2411.07951
Autor:
Chakrabarti, Shouvanik, Herman, Dylan, Ozgul, Guneykan, Zhu, Shuchen, Augustino, Brandon, Hao, Tianyi, He, Zichang, Shaydulin, Ruslan, Pistoia, Marco
We analyze generalizations of algorithms based on the short-path framework first proposed by Hastings [Quantum 2, 78 (2018)], which has been extended and shown by Dalzell et al. [STOC '22] to achieve super-Grover speedups for certain binary optimizat
Externí odkaz:
http://arxiv.org/abs/2410.23270
Autor:
Amer, Omar, Chakraborty, Kaushik, Cui, David, Kaleoglu, Fatih, Lim, Charles, Liu, Minzhao, Pistoia, Marco
Liu et al. (ITCS22) initiated the study of designing a secure position verification protocol based on a specific proof of quantumness protocol and classical communication. In this paper, we study this interesting topic further and answer some of the
Externí odkaz:
http://arxiv.org/abs/2410.03982
Autor:
Kon, Wen Yu, Chu, Jefferson, Loh, Kevin Han Yong, Alia, Obada, Amer, Omar, Pistoia, Marco, Chakraborty, Kaushik, Lim, Charles
Data privacy and authentication are two main security requirements for remote access and cloud services. While QKD has been explored to address data privacy concerns, oftentimes its use is separate from the client authentication protocol despite impl
Externí odkaz:
http://arxiv.org/abs/2409.16540
Quantum algorithms must be scaled up to tackle real-world applications. Doing so requires overcoming the noise present on today's hardware. The quantum approximate optimization algorithm (QAOA) is a promising candidate for scaling up due to its modes
Externí odkaz:
http://arxiv.org/abs/2409.12104
Autor:
Acharya, Atithi, Yalovetzky, Romina, Minssen, Pierre, Chakrabarti, Shouvanik, Shaydulin, Ruslan, Raymond, Rudy, Sun, Yue, Herman, Dylan, Andrist, Ruben S., Salton, Grant, Schuetz, Martin J. A., Katzgraber, Helmut G., Pistoia, Marco
Industrially relevant constrained optimization problems, such as portfolio optimization and portfolio rebalancing, are often intractable or difficult to solve exactly. In this work, we propose and benchmark a decomposition pipeline targeting portfoli
Externí odkaz:
http://arxiv.org/abs/2409.10301
We initiate the study of relativistic zero-knowledge quantum proof of knowledge systems with classical communication, formally defining a number of useful concepts and constructing appropriate knowledge extractors for all the existing protocols in th
Externí odkaz:
http://arxiv.org/abs/2409.03635
Autor:
He, Zichang, Shaydulin, Ruslan, Herman, Dylan, Li, Changhao, Raymond, Rudy, Sureshbabu, Shree Hari, Pistoia, Marco
Quantum Approximate Optimization Algorithm (QAOA) is one of the most promising quantum heuristics for combinatorial optimization. While QAOA has been shown to perform well on small-scale instances and to provide an asymptotic speedup over state-of-th
Externí odkaz:
http://arxiv.org/abs/2408.09538
The quantum approximate optimization algorithm (QAOA) is a quantum heuristic for combinatorial optimization that has been demonstrated to scale better than state-of-the-art classical solvers for some problems. For a given problem instance, QAOA perfo
Externí odkaz:
http://arxiv.org/abs/2408.00557
We consider the Lane-Emden problem on planar domains. When the exponent is large, the existence and multiplicity of solutions strongly depend on the geometric properties of the domain, which also deeply affect their qualitative behavior. Remarkably,
Externí odkaz:
http://arxiv.org/abs/2407.15742