Zhihui Wang

Dr. Zhihui Wang


Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
12 February 2019 in Algorithms
Verified
Journal Article
Open access
PDF file
SHStuart Hadfield
Stuart Hadfield
ZWZhihui Wang
Zhihui Wang
BOBryan O’gorman
Bryan O’gorman
EREleanor Rieffel
Eleanor Rieffel
DVDavide Venturelli
Davide Venturelli
RBRupak Biswas
Rupak Biswas
The next few years will be exciting as prototype universal quantum processors emerge, enabling the implementation of a wider variety of algorithms. Of particular interest are quantum heuristics, which require experimentation on quantum hardware for their evaluation and which have the potential to significantly expand the breadth of applications for which quantum computers have an established advantage. A leading candidate is Farhi et al.’s quantum approximate optimization algorithm, which alternates between applying a cost function based Hamiltonian and a mixing Hamiltonian. Here, we extend this framework to allow alternation between more general families of operators. The essence of this extension, the quantum alternating operator ansatz, is the consideration of general parameterized families of unitaries rather than only those corresponding to the time evolution under a fixed local Hamiltonian for a time specified by the parameter. This ansatz supports the representation of a larger, and potentially more useful, set of states than the original formulation, with potential long-term impact on a broad array of application areas. For cases that call for mixing only within a desired subspace, refocusing on unitaries rather than Hamiltonians enables more efficiently implementable mixers than was possible in the original framework. Such mixers are particularly useful for optimization problems with hard constraints that must always be satisfied, defining a feasible subspace, and soft constraints whose violation we wish to minimize. More efficient implementation enables earlier experimental exploration of an alternating operator approach, in the spirit of the quantum approximate optimization algorithm, to a wide variety of approximate optimization, exact optimization, and sampling problems. In addition to introducing the quantum alternating operator ansatz, we lay out design criteria for mixing operators, detail mappings for eight problems, and provide a compendium with brief descriptions of mappings for a diverse array of problems.

14 January 2020 in Physical Review A
Verified
Journal Article
Closed access
PDF file
ZWZhihui Wang
Zhihui Wang
NRNicholas C. Rubin
Nicholas C. Rubin
JDJason M. Dominy
Jason M. Dominy
EREleanor G. Rieffel
Eleanor G. Rieffel
The quantum alternating operator ansatz (QAOA) is a promising gate-model metaheuristic for combinatorial optimization. Applying the algorithm to problems with constraints presents an implementation challenge for near-term quantum resources. This paper explores strategies for enforcing hard constraints by using XY Hamiltonians as mixing operators (mixers). Despite the complexity of simulating the XY model, we demonstrate that, for an integer variable admitting κ discrete values represented through one-hot encoding, certain classes of the mixer Hamiltonian can be implemented without Trotter error in depth O(κ). We also specify general strategies for implementing QAOA circuits on all-to-all connected hardware graphs and linearly connected hardware graphs inspired by fermionic simulation techniques. Performance is validated on graph-coloring problems that are known to be challenging for a given classical algorithm. The general strategy of using XY mixers is borne out numerically, demonstrating a significant improvement over the general X mixer, and moreover the generalized W state yields better performance than easier-to-generate classical initial states when XY mixers are used.

25 March 2021 in PRX Quantum
Verified
Journal Article
Open access
PDF file
JCJahan Claes
Jahan Claes
EREleanor Rieffel
Eleanor Rieffel
ZWZhihui Wang
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 Clifford group, that form a unitary 2-design. The recently introduced character RB can benchmark more general gates using techniques from representation theory; up to now, however, this method has only been applied to “multiplicity-free” groups, a mathematical restriction on these groups. In this paper, we extend the original character RB derivation to explicitly treat non-multiplicity-free groups, and derive several applications. First, we derive a rigorous version of the recently introduced subspace RB, which seeks to characterize a set of one- and two-qubit gates that are symmetric under swap. Second, we develop a new leakage RB protocol that applies to more general groups of gates. Finally, we derive a scalable RB protocol for the matchgate group, a group that like the Clifford group is nonuniversal but becomes universal with the addition of one additional gate. This example provides one of the few examples of a scalable non-Clifford RB protocol. In all three cases, compared to existing theories, our method requires similar resources, but either provides a more accurate estimate of gate fidelity, or applies to a more general group of gates. In conclusion, we discuss the potential, and challenges, of using non-multiplicity-free character RB to develop new classes of scalable RB protocols and methods of characterizing specific gates.

13 April 2021 in Physical Review A
Verified
Journal Article
Closed access
PDF file
MSMichael Streif
Michael Streif
MLMartin Leib
Martin Leib
FWFilip Wudarski
Filip Wudarski
EREleanor Rieffel
Eleanor Rieffel
ZWZhihui Wang
Zhihui Wang
Quantum circuits with local particle-number conservation restrict the quantum computation to a subspace of the Hilbert space of the qubit register. In a noiseless or fault-tolerant quantum computation, such quantities are preserved. In the presence of noise, however, the evolution's symmetry could be broken and nonvalid states could be sampled at the end of the computation. On the other hand, the restriction to a subspace in the ideal case suggests the possibility of more resource-efficient error-mitigation techniques for circuits preserving symmetries that are not possible for general circuits. Here, we analyze the probability of staying in such symmetry-preserved subspaces under noise, providing an exact formula for local depolarizing noise. We apply our findings to benchmark, under depolarizing noise, the symmetry robustness of the XY quantum alternating operator Ansatz, which has local particle-number conserving symmetries and is a special case of the quantum alternating operator Ansatz. We also analyze the influence of the choice of encoding the problem on the symmetry robustness of the algorithm and discuss a simple adaption of the bit-flip code to correct for symmetry-breaking errors with reduced resources.

8 October 2025 in Physical Review Applied
Verified
Journal Article
Closed access
BEBram Evert
Bram Evert
ZIZoe Gonzalez Izquierdo
Zoe Gonzalez Izquierdo
JSJames Sud
James Sud
HHHong-Ye Hu
Hong-Ye Hu
SGShon Grabbe
Shon Grabbe
ZWZhihui Wang
Zhihui Wang

15 July 2022 in Physical Review A
Verified
Journal Article
Closed access
PDF file
JSJames Sud
James Sud
JMJeffrey Marshall
Jeffrey Marshall
ZWZhihui Wang
Zhihui Wang
EREleanor Rieffel
Eleanor Rieffel
FWFilip A. Wudarski
Filip A. Wudarski
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 on these devices. In this paper, we present a method that faithfully reconstructs a marginal (local) approximation of the effective noise (MATEN) channel, that acts as a single layer at the end of the circuit. We first introduce a dual-map framework that allows us to analytically derive expectation values of observables with respect to noisy circuits. These findings are supported by numerical simulations of the quantum approximate optimization algorithm (QAOA) that also justify the MATEN, even in the presence of nonlocal errors that occur during a circuit. Finally, we demonstrate the performance of the method on Rigetti's Aspen-11 quantum computer for QAOA circuits up to six qubits, successfully predicting the observed measurements on a majority of the qubits.