Zobrazeno 1 - 10
of 75
pro vyhledávání: '"Hadfield, Stuart"'
Quantum Fourier transformations are an essential component of many quantum algorithms, from prime factoring to quantum simulation. While the standard abelian QFT is well-studied, important variants corresponding to \emph{nonabelian} groups of interes
Externí odkaz:
http://arxiv.org/abs/2408.00075
Autor:
Hardy, Andrew, Mukhopadhyay, Priyanka, Alam, M. Sohaib, Konik, Robert, Hormozi, Layla, Rieffel, Eleanor, Hadfield, Stuart, Barata, João, Venugopalan, Raju, Kharzeev, Dmitri E., Wiebe, Nathan
We provide practical simulation methods for scalar field theories on a quantum computer that yield improved asymptotics as well as concrete gate estimates for the simulation and physical qubit estimates using the surface code. We achieve these improv
Externí odkaz:
http://arxiv.org/abs/2407.13819
Constructing Driver Hamiltonians and Mixing Operators such that they satisfy constraints is an important ansatz construction for quantum algorithms. We give general algebraic expressions for finding Hamiltonian terms and analogously unitary primitive
Externí odkaz:
http://arxiv.org/abs/2407.01975
Autor:
Rieffel, Eleanor G., Asanjan, Ata Akbari, Alam, M. Sohaib, Anand, Namit, Neira, David E. Bernal, Block, Sophie, Brady, Lucas T., Cotton, Steve, Izquierdo, Zoe Gonzalez, Grabbe, Shon, Gustafson, Erik, Hadfield, Stuart, Lott, P. Aaron, Maciejewski, Filip B., Mandrà, Salvatore, Marshall, Jeffrey, Mossi, Gianni, Bauza, Humberto Munoz, Saied, Jason, Suri, Nishchay, Venturelli, Davide, Wang, Zhihui, Biswas, Rupak
Publikováno v:
Future Generation Computer Systems (2024)
Quantum computing is one of the most enticing computational paradigms with the potential to revolutionize diverse areas of future-generation computational systems. While quantum computing hardware has advanced rapidly, from tiny laboratory experiment
Externí odkaz:
http://arxiv.org/abs/2406.15601
We present \emph{Noise-Directed Adaptive Remapping} (NDAR), a heuristic meta-algorithm for approximately solving binary optimization problems by leveraging certain types of noise. We consider access to a noisy quantum processor with dynamics that fea
Externí odkaz:
http://arxiv.org/abs/2404.01412
Autor:
Stollenwerk, Tobias, Hadfield, Stuart
Parameterized quantum circuits are attractive candidates for potential quantum advantage in the near term and beyond. At the same time, as quantum computing hardware not only continues to improve but also begins to incorporate new features such as mi
Externí odkaz:
http://arxiv.org/abs/2403.11514
Autor:
Abbas, Amira, Ambainis, Andris, Augustino, Brandon, Bärtschi, Andreas, Buhrman, Harry, Coffrin, Carleton, Cortiana, Giorgio, Dunjko, Vedran, Egger, Daniel J., Elmegreen, Bruce G., Franco, Nicola, Fratini, Filippo, Fuller, Bryce, Gacon, Julien, Gonciulea, Constantin, Gribling, Sander, Gupta, Swati, Hadfield, Stuart, Heese, Raoul, Kircher, Gerhard, Kleinert, Thomas, Koch, Thorsten, Korpas, Georgios, Lenk, Steve, Marecek, Jakub, Markov, Vanio, Mazzola, Guglielmo, Mensa, Stefano, Mohseni, Naeimeh, Nannicini, Giacomo, O'Meara, Corey, Tapia, Elena Peña, Pokutta, Sebastian, Proissl, Manuel, Rebentrost, Patrick, Sahin, Emre, Symons, Benjamin C. B., Tornow, Sabine, Valls, Victor, Woerner, Stefan, Wolf-Bauwens, Mira L., Yard, Jon, Yarkoni, Sheir, Zechiel, Dirk, Zhuk, Sergiy, Zoufal, Christa
Recent advances in quantum computers are demonstrating the ability to solve problems at a scale beyond brute force classical simulation. As such, a widespread interest in quantum algorithms has developed in many areas, with optimization being one of
Externí odkaz:
http://arxiv.org/abs/2312.02279
Autor:
Brady, Lucas T., Hadfield, Stuart
Quantum algorithms have been widely studied in the context of combinatorial optimization problems. While this endeavor can often analytically and practically achieve quadratic speedups, theoretical and numeric studies remain limited, especially compa
Externí odkaz:
http://arxiv.org/abs/2309.13110
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
The Quantum Approximate Optimization Algorithm and its generalization to Quantum Alternating Operator Ansatz (QAOA) is a promising approach for applying quantum computers to challenging problems such as combinatorial optimization and computational ch
Externí odkaz:
http://arxiv.org/abs/2305.04455