Compare Papers
Paper 1
Improved error thresholds for measurement-free error correction
Daniel Crow, Robert Joynt, Mark Saffman
- Year
- 2015
- Journal
- arXiv preprint
- DOI
- arXiv:1510.08359
- arXiv
- 1510.08359
Motivated by limitations and capabilities of neutral atom qubits, we examine whether measurement-free error correction can produce practical error thresholds. We show that this can be achieved by extracting redundant syndrome information, giving our procedure extra fault tolerance and eliminating the need for ancilla verification. The procedure is particularly favorable when multi-qubit gates are available for the correction step. Simulations of the bit-flip, Bacon-Shor, and Steane codes indicate that coherent error correction can produce threshold error rates that are on the order of $10^{-3}$ to $10^{-4}$---comparable with or better than measurement-based values, and much better than previous results for other coherent error correction schemes. This indicates that coherent error correction is worthy of serious consideration for achieving protected logical qubits.
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