Compare Papers
Paper 1
Randomized benchmarking for qudit Clifford gates
Mahnaz Jafarzadeh, Ya-Dong Wu, Yuval R. Sanders, Barry C. Sanders
- Year
- 2019
- Journal
- arXiv preprint
- DOI
- arXiv:1911.08162
- arXiv
- 1911.08162
We introduce unitary-gate randomized benchmarking (URB) for qudit gates by extending single-and multi-qubit URB to single- and multi-qudit gates. Specifically, we develop a qudit URB procedure that exploits unitary 2-designs. Furthermore, we show that our URB procedure is not simply extracted from the multi-qubit case by equating qudit URB to URB of the symmetric multi-qubit subspace. Our qudit URB is elucidated by using pseudocode, which facilitates incorporating into benchmarking applications.
Open paperPaper 2
To break, or not to break: Symmetries in adaptive quantum simulations, a case study on the Schwinger model
Karunya Shailesh Shirali, Kyle Sherbert, Yanzhu Chen, Adrien Florio, Andreas Weichselbaum, Robert D. Pisarski, Sophia E. Economou
- Year
- 2025
- Journal
- arXiv preprint
- DOI
- arXiv:2510.03083
- arXiv
- 2510.03083
We investigate the role of symmetries in constructing resource-efficient operator pools for adaptive variational quantum eigensolvers. In particular, we focus on the lattice Schwinger model, a discretized model of $1+1$ dimensional electrodynamics, which we use as a proxy for spin chains with a continuum limit. We present an extensive set of simulations comprising a total of $11$ different operator pools, which all systematically and independently break or preserve a combination of discrete translations, the conservation of charge (magnetization) and the fermionic locality of the excitations. Circuit depths are the primary bottleneck in current quantum hardware, and we find that the most efficient ansätze in the near-term are obtained by pools that $\textit{break}$ translation invariance, conserve charge, and lead to shallow circuits. On the other hand, we anticipate the shot counts to be the limiting factor in future, error-corrected quantum devices; our findings suggest that pools $\textit{preserving}$ translation invariance could be preferable for such platforms.
Open paper