activity
20112023
most citedQuantum annealing with more than one hundred qubits

831 citations · 2.8k across the 24 of their papers we have counts for

collaborators

24 papers

quant-ph2023★ 1 cited

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…

quant-ph2023★ 38 cited

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…

quant-ph2022★ 3 cited

Towards solving the Fermi-Hubbard model via tailored quantum annealers

Ryan Levy, Zoe Gonzalez Izquierdo, Zhihui Wang +8

The Fermi-Hubbard model (FHM) on a two dimensional square lattice has long been an important testbed and target for simulating fermionic Hamiltonians on quantum hardware. We presen…

quant-ph2022★ 10 cited

Advantage of pausing: parameter setting for quantum annealers

Zoe Gonzalez Izquierdo, Shon Grabbe, Husni Idris +3

Prior work showed the efficacy of pausing midanneal: such a pause improved the probability of success by orders of magnitude in a class of native problem instances and improved the…

quant-ph2022

Logical shadow tomography: Efficient estimation of error-mitigated observables

Hong-Ye Hu, Ryan LaRose, Yi-Zhuang You +2

We introduce a technique to estimate error-mitigated expectation values on noisy quantum computers. Our technique performs shadow tomography on a logical state to produce a memory-…

quant-ph2021★ 1 cited

Dual Map Framework for Noise Characterization of Quantum Computers

James Sud, Jeffrey Marshall, Zhihui Wang +2

In order to understand the capabilities and limitations of quantum computers, it is necessary to develop methods that efficiently characterize and benchmark error channels present…

quant-ph2021★ 19 cited

Practical Verification of Quantum Properties in Quantum Approximate Optimization Runs

M. Sohaib Alam, Filip A. Wudarski, Matthew J. Reagor +7

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 quan…

physics.atom-ph2020★ 5 cited

Rapid production of defect-free beryllium ion Coulomb crystals

Qiming Wu, Melina Filzinger, Yue Shi +2

Trapped atomic ions find wide applications ranging from precision measurement to quantum information science and quantum computing. Among the different atomic species employed, ber…

quant-ph2020★ 33 cited

Quantum algorithms with local particle number conservation: noise effects and error correction

Michael Streif, Martin Leib, Filip Wudarski +2

Quantum circuits with local particle number conservation (LPNC) restrict the quantum computation to a subspace of the Hilbert space of the qubit register. In a noiseless or fault-t…

quant-ph2020★ 32 cited

Character randomized benchmarking for non-multiplicity-free groups with applications to subspace, leakage, and matchgate randomized benchmarking

Jahan Claes, Eleanor Rieffel, Zhihui Wang

Randomized benchmarking (RB) is a powerful method for determining the error rate of experimental quantum gates. Traditional RB, however, is restricted to gatesets, such as the Clif…

quant-ph2020★ 18 cited

Ferromagnetically shifting the power of pausing

Zoe Gonzalez Izquierdo, Shon Grabbe, Stuart Hadfield +3

We study the interplay between quantum annealing parameters in embedded problems, providing both deeper insights into the physics of these devices and pragmatic recommendations to…

quant-ph2020★ 7 cited

Planning for Compilation of a Quantum Algorithm for Graph Coloring

Minh Do, Zhihui Wang, Bryan O'Gorman +3

The problem of compiling general quantum algorithms for implementation on near-term quantum processors has been introduced to the AI community. Previous work demonstrated that temp…

quant-ph2019★ 11 cited

From Ansätze to Z-gates: a NASA View of Quantum Computing

Eleanor G. Rieffel, Stuart Hadfield, Tad Hogg +12

For the last few years, the NASA Quantum Artificial Intelligence Laboratory (QuAIL) has been performing research to assess the potential impact of quantum computers on challenging…

quant-ph2019★ 191 cited

-mixers: analytical and numerical results for QAOA

Zhihui Wang, Nicholas C. Rubin, Jason M. Dominy +1

The Quantum Alternating Operator Ansatz (QAOA) is a promising gate-model meta-heuristic for combinatorial optimization. Applying the algorithm to problems with constraints presents…

quant-ph2017★ 768 cited

From the Quantum Approximate Optimization Algorithm to a Quantum Alternating Operator Ansatz

Stuart Hadfield, Zhihui Wang, Bryan O'Gorman +3

The next few years will be exciting as prototype universal quantum processors emerge, enabling implementation of a wider variety of algorithms. Of particular interest are quantum h…

quant-ph2017★ 17 cited

Measurement of complete and continuous Wigner functions for discrete atomic systems

Yali Tian, Zhihui Wang, Pengfei Zhang +3

We measure complete and continuous Wigner functions of a two-level cesium atom in both a nearly pure state and highly mixed states. We apply the method [T. Tilma et al., Phys. Rev.…

quant-ph2017★ 360 cited

Quantum Approximate Optimization Algorithm for MaxCut: A Fermionic View

Zhihui Wang, Stuart Hadfield, Zhang Jiang +1

Farhi et al. recently proposed a class of quantum algorithms, the Quantum Approximate Optimization Algorithm (QAOA), for approximately solving combinatorial optimization problems.…

quant-ph2017★ 101 cited

A NASA Perspective on Quantum Computing: Opportunities and Challenges

Rupak Biswas, Zhang Jiang, Kostya Kechezhi +10

In the last couple of decades, the world has seen several stunning instances of quantum algorithms that provably outperform the best classical algorithms. For most problems, howeve…

quant-ph2017★ 146 cited

Near-optimal quantum circuit for Grover's unstructured search using a transverse field

Zhang Jiang, Eleanor G. Rieffel, Zhihui Wang

Inspired by a class of algorithms proposed by Farhi et al. (arXiv:1411.4028), namely the quantum approximate optimization algorithm (QAOA), we present a circuit-based quantum algor…

quant-ph2016★ 11 cited

Loss-based Experimental Test of Bohr's Complementarity Principle with Single Neutral Atom

Zhihui Wang, Yali Tian, Chen Yang +3

An experimental test of quantum complementarity principle based on single neutral atom trapped in a blue detuned bottle trap was here performed. A Ramsey interferometer was used to…

quant-ph2015★ 111 cited

Optimizing a Dynamical Decoupling Protocol for Solid-State Electronic Spin Ensembles in Diamond

Demitry Farfurnik, Andrey Jarmola, Linh M. Pham +5

We demonstrate significant improvements of the spin coherence time of a dense ensemble of nitrogen-vacancy (NV) centers in diamond through optimized dynamical decoupling (DD). Cool…

quant-ph2013★ 23 cited

Comment on: "Classical signature of quantum annealing"

Lei Wang, Troels F. Rønnow, Sergio Boixo +6

In a recent preprint (arXiv:1305.4904) entitled "Classical signature of quantum annealing" Smolin and Smith point out that a bimodal distribution presented in (arXiv:1304.4595) for…

quant-ph2013★ 831 cited

Quantum annealing with more than one hundred qubits

Sergio Boixo, Troels F. Rønnow, Sergei V. Isakov +5

Quantum technology is maturing to the point where quantum devices, such as quantum communication systems, quantum random number generators and quantum simulators, may be built with…

hep-ph2011★ 34 cited

Phenomenology of a lepton triplet

Antonio Delgado, Camilo Garcia Cely, Tao Han +1

The most general phenomenological model involving a lepton triplet with hypercharge is constructed. A distinctive feature of this model is the prediction of a doubly charge…