Zobrazeno 1 - 10
of 113
pro vyhledávání: '"Sawaya, Nicolas"'
Estimating expectation values on near-term quantum computers often requires a prohibitively large number of measurements. One widely-used strategy to mitigate this problem has been to partition an operator's Pauli terms into sets of mutually commutin
Externí odkaz:
http://arxiv.org/abs/2408.11898
Autor:
Gustafson, Erik J., Tiihonen, Juha, Chamaki, Diana, Sorourifar, Farshud, Mullinax, J. Wayne, Li, Andy C. Y., Maciejewski, Filip B., Sawaya, Nicolas PD, Krogel, Jaron T., Neira, David E. Bernal, Tubman, Norm M.
Variational quantum eigensolvers are touted as a near-term algorithm capable of impacting many applications. However, the potential has not yet been realized, with few claims of quantum advantage and high resource estimates, especially due to the nee
Externí odkaz:
http://arxiv.org/abs/2404.02951
Autor:
Bahrami, Sina, Sawaya, Nicolas
Constrained problems are frequently encountered in classical and quantum optimization. Particle conservation, in particular, is commonly imposed when studying energy spectra of chemical and solid state systems. Though particle number-constraining tec
Externí odkaz:
http://arxiv.org/abs/2402.18768
We introduce a notion of commutativity between operators on a tensor product space, nominally Pauli strings on qubits, that interpolates between qubit-wise commutativity and (full) commutativity. We apply this notion, which we call $k$-commutativity,
Externí odkaz:
http://arxiv.org/abs/2312.11840
Autor:
Jumade, Raghav, Sawaya, Nicolas PD
Though there has been substantial progress in developing quantum algorithms to study classical datasets, the cost of simply \textit{loading} classical data is an obstacle to quantum advantage. When the amplitude encoding is used, loading an arbitrary
Externí odkaz:
http://arxiv.org/abs/2309.13108
Autor:
Sawaya, Nicolas PD, Marti-Dafcik, Daniel, Ho, Yang, Tabor, Daniel P, Neira, David E Bernal, Magann, Alicia B, Premaratne, Shavindra, Dubey, Pradeep, Matsuura, Anne, Bishop, Nathan, de Jong, Wibe A, Benjamin, Simon, Parekh, Ojas D, Tubman, Norm, Klymko, Katherine, Camps, Daan
In order to characterize and benchmark computational hardware, software, and algorithms, it is essential to have many problem instances on-hand. This is no less true for quantum computation, where a large collection of real-world problem instances wo
Externí odkaz:
http://arxiv.org/abs/2306.13126
Autor:
Schmitz, Albert T., Ibrahim, Mohannad, Sawaya, Nicolas P. D., Guerreschi, Gian Giacomo, Paykin, Jennifer, Wu, Xin-Chuan, Matsuura, A. Y.
The Pauli-based Circuit Optimization, Analysis and Synthesis Toolchain (PCOAST) was recently introduced as a framework for optimizing quantum circuits. It converts a quantum circuit to a Pauli-based graph representation and provides a set of optimiza
Externí odkaz:
http://arxiv.org/abs/2305.09843
Autor:
Sawaya, Nicolas PD, Huh, Joonsuk
Publikováno v:
Advanced Quantum Technologies 6 (9), 2300042 (2023)
Transition amplitudes and transition probabilities are relevant to many areas of physics simulation, including the calculation of response properties and correlation functions. These quantities can also be related to solving linear systems of equatio
Externí odkaz:
http://arxiv.org/abs/2206.14213
Autor:
Sawaya, Nicolas PD
Preparing problems for execution on quantum computers can require many compilation steps. Automated compilation software is useful not only for easier and faster problem execution, but also for facilitating the comparison between different algorithmi
Externí odkaz:
http://arxiv.org/abs/2205.09776
Publikováno v:
Quantum 7, 1111 (2023)
Challenging combinatorial optimization problems are ubiquitous in science and engineering. Several quantum methods for optimization have recently been developed, in different settings including both exact and approximate solvers. Addressing this fiel
Externí odkaz:
http://arxiv.org/abs/2203.14432