Zobrazeno 1 - 10
of 100
pro vyhledávání: '"Shaydulin, Ruslan"'
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
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
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
Autor:
DeCross, Matthew, Haghshenas, Reza, Liu, Minzhao, Rinaldi, Enrico, Gray, Johnnie, Alexeev, Yuri, Baldwin, Charles H., Bartolotta, John P., Bohn, Matthew, Chertkov, Eli, Cline, Julia, Colina, Jonhas, DelVento, Davide, Dreiling, Joan M., Foltz, Cameron, Gaebler, John P., Gatterman, Thomas M., Gilbreth, Christopher N., Giles, Joshua, Gresh, Dan, Hall, Alex, Hankin, Aaron, Hansen, Azure, Hewitt, Nathan, Hoffman, Ian, Holliman, Craig, Hutson, Ross B., Jacobs, Trent, Johansen, Jacob, Lee, Patricia J., Lehman, Elliot, Lucchetti, Dominic, Lykov, Danylo, Madjarov, Ivaylo S., Mathewson, Brian, Mayer, Karl, Mills, Michael, Niroula, Pradeep, Pino, Juan M., Roman, Conrad, Schecter, Michael, Siegfried, Peter E., Tiemann, Bruce G., Volin, Curtis, Walker, James, Shaydulin, Ruslan, Pistoia, Marco, Moses, Steven. A., Hayes, David, Neyenhuis, Brian, Stutz, Russell P., Foss-Feig, Michael
Empirical evidence for a gap between the computational powers of classical and quantum computers has been provided by experiments that sample the output distributions of two-dimensional quantum circuits. Many attempts to close this gap have utilized
Externí odkaz:
http://arxiv.org/abs/2406.02501
Variational quantum algorithms (VQAs) are a broad class of algorithms with many applications in science and industry. Applying a VQA to a problem involves optimizing a parameterized quantum circuit by maximizing or minimizing a cost function. A parti
Externí odkaz:
http://arxiv.org/abs/2405.10941
Autor:
Perlin, Michael A., Shaydulin, Ruslan, Hall, Benjamin P., Minssen, Pierre, Li, Changhao, Dubey, Kabir, Rines, Rich, Anschuetz, Eric R., Pistoia, Marco, Gokhale, Pranav
Combinatorial optimization problems that arise in science and industry typically have constraints. Yet the presence of constraints makes them challenging to tackle using both classical and quantum optimization algorithms. We propose a new quantum alg
Externí odkaz:
http://arxiv.org/abs/2403.05653
Suppression of diabatic transitions in quantum adiabatic evolution stands as a significant challenge for ground state preparations. Counterdiabatic driving has been proposed to compensate for diabatic losses and achieve shortcut to adiabaticity. Howe
Externí odkaz:
http://arxiv.org/abs/2403.01854
Autor:
Li, Changhao, Li, Boning, Amer, Omar, Shaydulin, Ruslan, Chakrabarti, Shouvanik, Wang, Guoqing, Xu, Haowei, Tang, Hao, Schoch, Isidor, Kumar, Niraj, Lim, Charles, Li, Ju, Cappellaro, Paola, Pistoia, Marco
Publikováno v:
Phys. Rev. Lett. 133, 120602 (2024)
Distributed quantum computing is a promising computational paradigm for performing computations that are beyond the reach of individual quantum devices. Privacy in distributed quantum computing is critical for maintaining confidentiality and protecti
Externí odkaz:
http://arxiv.org/abs/2310.12893