Zobrazeno 1 - 10
of 43
pro vyhledávání: '"Wurtz, Jonathan"'
Autor:
Wilson, Blake A., Wurtz, Jonathan, Mkhitaryan, Vahagn, Bezick, Michael, Wang, Sheng-Tao, Kais, Sabre, Shalaev, Vladimir M., Boltasseva, Alexandra
Large-scale optimization problems are prevalent in several fields, including engineering, finance, and logistics. However, most optimization problems cannot be efficiently encoded onto a physical system because the existing quantum samplers have too
Externí odkaz:
http://arxiv.org/abs/2407.13830
Autor:
Kornjača, Milan, Hu, Hong-Ye, Zhao, Chen, Wurtz, Jonathan, Weinberg, Phillip, Hamdan, Majd, Zhdanov, Andrii, Cantu, Sergio H., Zhou, Hengyun, Bravo, Rodrigo Araiza, Bagnall, Kevin, Basham, James I., Campo, Joseph, Choukri, Adam, DeAngelo, Robert, Frederick, Paige, Haines, David, Hammett, Julian, Hsu, Ning, Hu, Ming-Guang, Huber, Florian, Jepsen, Paul Niklas, Jia, Ningyuan, Karolyshyn, Thomas, Kwon, Minho, Long, John, Lopatin, Jonathan, Lukin, Alexander, Macrì, Tommaso, Marković, Ognjen, Martínez-Martínez, Luis A., Meng, Xianmei, Ostroumov, Evgeny, Paquette, David, Robinson, John, Rodriguez, Pedro Sales, Singh, Anshuman, Sinha, Nandan, Thoreen, Henry, Wan, Noel, Waxman-Lenz, Daniel, Wong, Tak, Wu, Kai-Hsin, Lopes, Pedro L. S., Boger, Yuval, Gemelke, Nathan, Kitagawa, Takuya, Keesling, Alexander, Gao, Xun, Bylinskii, Alexei, Yelin, Susanne F., Liu, Fangli, Wang, Sheng-Tao
Quantum machine learning has gained considerable attention as quantum technology advances, presenting a promising approach for efficiently learning complex data patterns. Despite this promise, most contemporary quantum methods require significant res
Externí odkaz:
http://arxiv.org/abs/2407.02553
Combinatorial optimization is a challenging problem applicable in a wide range of fields from logistics to finance. Recently, quantum computing has been used to attempt to solve these problems using a range of algorithms, including parameterized quan
Externí odkaz:
http://arxiv.org/abs/2403.03153
Publikováno v:
Phys. Rev. A 109, 043111 (2024)
Classical simulation of quantum systems plays an important role in the study of many-body phenomena and in the benchmarking and verification of quantum technologies. Exact simulation is often limited to small systems because the dimension of the Hilb
Externí odkaz:
http://arxiv.org/abs/2311.18616
Autor:
Xu, Qian, Ataides, J. Pablo Bonilla, Pattison, Christopher A., Raveendran, Nithin, Bluvstein, Dolev, Wurtz, Jonathan, Vasic, Bane, Lukin, Mikhail D., Jiang, Liang, Zhou, Hengyun
Quantum low-density parity-check (qLDPC) codes can achieve high encoding rates and good code distance scaling, providing a promising route to low-overhead fault-tolerant quantum computing. However, the long-range connectivity required to implement su
Externí odkaz:
http://arxiv.org/abs/2308.08648
Autor:
Wurtz, Jonathan, Bylinskii, Alexei, Braverman, Boris, Amato-Grill, Jesse, Cantu, Sergio H., Huber, Florian, Lukin, Alexander, Liu, Fangli, Weinberg, Phillip, Long, John, Wang, Sheng-Tao, Gemelke, Nathan, Keesling, Alexander
The neutral-atom quantum computer "Aquila" is QuEra's latest device available through the Braket cloud service on Amazon Web Services (AWS). Aquila is a "field-programmable qubit array" (FPQA) operated as an analog Hamiltonian simulator on a user-con
Externí odkaz:
http://arxiv.org/abs/2306.11727
Autor:
Nguyen, Minh-Thi, Liu, Jin-Guo, Wurtz, Jonathan, Lukin, Mikhail D., Wang, Sheng-Tao, Pichler, Hannes
Publikováno v:
PRX Quantum 4, no. 1 (2023): 010316
Programmable quantum systems based on Rydberg atom arrays have recently been used for hardware-efficient tests of quantum optimization algorithms [Ebadi et al., Science, 376, 1209 (2022)] with hundreds of qubits. In particular, the maximum independen
Externí odkaz:
http://arxiv.org/abs/2209.03965
Publikováno v:
npj quantum information 9, 73 (2023)
In this work, we compare the performance of the Quantum Approximate Optimization Algorithm (QAOA) with state-of-the-art classical solvers such as Gurobi and MQLib to solve the combinatorial optimization problem MaxCut on 3-regular graphs. The goal is
Externí odkaz:
http://arxiv.org/abs/2206.03579
Autor:
Wurtz, Jonathan, Lopes, Pedro L. S., Gorgulla, Christoph, Gemelke, Nathan, Keesling, Alexander, Wang, Shengtao
Architectures for quantum computing based on neutral atoms have risen to prominence as candidates for both near and long-term applications. These devices are particularly well suited to solve independent set problems, as the combinatorial constraints
Externí odkaz:
http://arxiv.org/abs/2205.08500
Publikováno v:
In Proceedings of the Second International Workshop on Quantum Computing Software (in conjunction with SC21), 2021
Understanding the best known parameters, performance, and systematic behavior of the Quantum Approximate Optimization Algorithm (QAOA) remain open research questions, even as the algorithm gains popularity. We introduce QAOAKit, a Python toolkit for
Externí odkaz:
http://arxiv.org/abs/2110.05555