Zobrazeno 1 - 10
of 363
pro vyhledávání: '"Hodson, Mark P."'
Autor:
Agrawal, Anjali A., Job, Joshua, Wilson, Tyler L., Saadatmand, S. N., Hodson, Mark J., Mutus, Josh Y., Caesura, Athena, Johnson, Peter D., Elenewski, Justin E., Morrell, Kaitlyn J., Kemper, Alexander F.
Understanding the physics of strongly correlated materials is one of the grand challenge problems for physics today. A large class of scientifically interesting materials, from high-$T_c$ superconductors to spin liquids, involve medium to strong corr
Externí odkaz:
http://arxiv.org/abs/2406.06511
Autor:
Saadatmand, S. N., Wilson, Tyler L., Field, Mark, Vijayan, Madhav Krishnan, Le, Thinh P., Ruh, Jannis, Maan, Arshpreet Singh, Moflic, Ioana, Caesura, Athena, Paler, Alexandru, Hodson, Mark J., Devitt, Simon J., Mutus, Josh Y.
The development of fault-tolerant quantum computers (FTQCs) is gaining increased attention within the quantum computing community. Like their digital counterparts, FTQCs, equipped with error correction and large qubit numbers, promise to solve some o
Externí odkaz:
http://arxiv.org/abs/2406.06015
Autor:
Dupont, Maxime, Sundar, Bhuvanesh, Evert, Bram, Neira, David E. Bernal, Peng, Zedong, Jeffrey, Stephen, Hodson, Mark J.
Achieving high-quality solutions faster than classical solvers on computationally hard problems is a challenge for quantum optimization to deliver utility. Using a superconducting quantum computer, we experimentally investigate the performance of a h
Externí odkaz:
http://arxiv.org/abs/2404.17579
Autor:
Maciejewski, Filip B., Hadfield, Stuart, Hall, Benjamin, Hodson, Mark, Dupont, Maxime, Evert, Bram, Sud, James, Alam, M. Sohaib, Wang, Zhihui, Jeffrey, Stephen, Sundar, Bhuvanesh, Lott, P. Aaron, Grabbe, Shon, Rieffel, Eleanor G., Reagor, Matthew J., Venturelli, Davide
We develop a hardware-efficient ansatz for variational optimization, derived from existing ansatze in the literature, that parametrizes subsets of all interactions in the Cost Hamiltonian in each layer. We treat gate orderings as a variational parame
Externí odkaz:
http://arxiv.org/abs/2308.12423
Autor:
Dupont, Maxime, Evert, Bram, Hodson, Mark J., Sundar, Bhuvanesh, Jeffrey, Stephen, Yamaguchi, Yuki, Feng, Dennis, Maciejewski, Filip B., Hadfield, Stuart, Alam, M. Sohaib, Wang, Zhihui, Grabbe, Shon, Lott, P. Aaron, Rieffel, Eleanor G., Venturelli, Davide, Reagor, Matthew J.
Publikováno v:
Science Advances 9, 45 (2023)
Combinatorial optimization is a broadly attractive area for potential quantum advantage, but no quantum algorithm has yet made the leap. Noise in quantum hardware remains a challenge, and more sophisticated quantum-classical algorithms are required t
Externí odkaz:
http://arxiv.org/abs/2303.05509
Publikováno v:
Phys. Rev. A 106, 022423 (2022)
Many quantum algorithms seek to output a specific bitstring solving the problem of interest--or a few if the solution is degenerate. It is the case for the quantum approximate optimization algorithm (QAOA) in the limit of large circuit depth, which a
Externí odkaz:
http://arxiv.org/abs/2206.07024
Publikováno v:
PRX Quantum 3, 040339 (2022)
Trading fidelity for scale enables approximate classical simulators such as matrix product states (MPS) to run quantum circuits beyond exact methods. A control parameter, the so-called bond dimension $\chi$ for MPS, governs the allocated computationa
Externí odkaz:
http://arxiv.org/abs/2206.06348
Developing quantum computers for real-world applications requires understanding theoretical sources of quantum advantage and applying those insights to design more powerful machines. Toward that end, we introduce a high-fidelity gate set inspired by
Externí odkaz:
http://arxiv.org/abs/2108.01652
Autor:
Alam, M. Sohaib, Wudarski, Filip A., Reagor, Matthew J., Sud, James, Grabbe, Shon, Wang, Zhihui, Hodson, Mark, Lott, P. Aaron, Rieffel, Eleanor G., Venturelli, Davide
Publikováno v:
Phys. Rev. Applied 17, 024026, 9 February 2022
In order to assess whether quantum resources can provide an advantage over classical computation, it is necessary to characterize and benchmark the non-classical properties of quantum algorithms in a practical manner. In this paper, we show that usin
Externí odkaz:
http://arxiv.org/abs/2105.01639
This paper establishes the tractability of finding the optimal Nash equilibrium, as well as the optimal social solution, to a discrete congestion game using a gate-model quantum computer. The game is of the type originally posited by Rosenthal in the
Externí odkaz:
http://arxiv.org/abs/2008.09505