153 citations · 336 across the 12 of their papers we have counts for
12 papers
Simulating plasma wave propagation on a superconducting quantum chip
Bhuvanesh Sundar, Bram Evert, Vasily Geyko +3
Quantum computers may one day enable the efficient simulation of strongly coupled plasmas that lie beyond the reach of classical computation in regimes where quantum effects are im…
Simulating nonlinear optical processes on a superconducting quantum device
Yuan Shi, Bram Evert, Amy F. Brown +8
Simulating plasma physics on quantum computers is difficult because most problems of interest are nonlinear, but quantum computers are not naturally suitable for nonlinear operatio…
Benchmarking Quantum Optimization for the Maximum-Cut Problem on a Superconducting Quantum Computer
Maxime Dupont, Bhuvanesh Sundar, Bram Evert +4
Achieving high-quality solutions faster than classical solvers on computationally hard problems is a challenge for quantum optimization to deliver utility. Using a superconducting…
Syncopated Dynamical Decoupling for Suppressing Crosstalk in Quantum Circuits
Bram Evert, Zoe Gonzalez Izquierdo, James Sud +5
Theoretically understanding and experimentally characterizing and modifying the underlying Hamiltonian of a quantum system is of utmost importance in achieving high-fidelity quantu…
Design and execution of quantum circuits using tens of superconducting qubits and thousands of gates for dense Ising optimization problems
Filip B. Maciejewski, Stuart Hadfield, Benjamin Hall +13
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 Hami…
Quantum-Enhanced Greedy Combinatorial Optimization Solver
Maxime Dupont, Bram Evert, Mark J. Hodson +13
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 challen…
Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits
Yujin Cho, Kristin M. Beck, Alessandro R. Castelli +4
Advanced simulations and calculations on quantum computers require high-fidelity implementations of quantum operations. The universal gateset approach builds complex unitaries from…
Navigating the noise-depth tradeoff in adiabatic quantum circuits
Daniel Azses, Maxime Dupont, Bram Evert +2
Adiabatic quantum algorithms solve computational problems by slowly evolving a trivial state to the desired solution. On an ideal quantum computer, the solution quality improves mo…
Architectural considerations in the design of a third-generation superconducting quantum annealing processor
Kelly Boothby, Colin Enderud, Trevor Lanting +46
Early generations of superconducting quantum annealing processors have provided a valuable platform for studying the performance of a scalable quantum computing technology. These s…
Scaling advantage in quantum simulation of geometrically frustrated magnets
Andrew D. King, Jack Raymond, Trevor Lanting +51
The promise of quantum computing lies in harnessing programmable quantum devices for practical applications such as efficient simulation of quantum materials and condensed matter s…
Demonstration of nonstoquastic Hamiltonian in coupled superconducting flux qubits
I. Ozfidan, C. Deng, A. Y. Smirnov +45
Quantum annealing (QA) is a heuristic algorithm for finding low-energy configurations of a system, with applications in optimization, machine learning, and quantum simulation. Up t…
Experimental demonstration of perturbative anticrossing mitigation using non-uniform driver Hamiltonians
Trevor Lanting, Andrew D. King, Bram Evert +1
Perturbative anticrossings have long been identified as a potential computational bottleneck for quantum annealing. This bottleneck can appear, for example, when a uniform transver…