Searcharxiv⌕ Search

arXiv subjects

Michael Schutzman

Publications and source records attributed to Michael Schutzman.

2 recordsLinked to original sources

Magic state cultivation with lattice-surgery escape on superconducting hardware

Magic state cultivation (MSC) is a low-overhead protocol for fault-tolerantly preparing logical magic states. In this work, we implement two MSC variants to prepare a magic state in a distance-5 code on a publicly available IBM Nighthawk processor. The first is a lattice-surgery escape, recently proposed by Hirano et al. and experimentally studied here for the first time. The second is a grafting escape, previously demonstrated by Rosenfeld et al., and extended here by incorporating a switch into a matchable code. Both protocols begin with fault-tolerant cultivation of a T state on a color code, followed by an escape into a larger code. We decode the results using minimum-weight perfect matching or Tesseract on circuit-level error models calibrated to the hardware noise. Compared with the previous experiment, our cultivated T state achieves a logical error probability of 2e-5 at the T-state injection angle, nearly 10x lower with about 3x the retainment. Moreover, our execution of the grafting escape has a 2x lower logical error rate per stabilizer round at a higher retainment. When comparing the two protocols under identical execution conditions and complementary gap postselection based on decoder confidence, lattice-surgery escape into the surface code preserves a T-state fidelity above 0.99 ten rounds after escape at about 5% retainment. By contrast, matchable-switched grafting drops below 0.95 fidelity at comparable retainment. Furthermore, the lattice-surgery escape reaches a logical error rate per stabilizer round of about 0.14% with around 11% average shot retainment. These results establish lattice-surgery escape as a practical MSC protocol that benefits from a direct transition into a surface code, and demonstrate the lowest MSC error and the highest surface-code magic-state fidelity reported to date, advancing the experimental realization of fault-tolerant non-Clifford gadgets.

quant-ph↗

Fast, accurate, high-resolution simulation of large-scale Fermi-Hubbard models on a digital quantum processor

We report experimental digital quantum simulation of the one-dimensional Fermi-Hubbard model on a superconducting quantum processor at a scale beyond the reach of exact statevector simulation and challenging for state-of-the-art tensor-network methods. We encode this problem using up to 120 qubits through an efficient mapping that reduces circuit complexity, and we improve accuracy through error suppression to simulate dynamical evolution using up to 90 Trotter steps. From a vacancy defect introduced in the middle of an $L=31$-site (62-qubit) Néel initial state, we directly observe spin-charge separation to $t=9$ in natural units and quantitatively extract velocities $v_c$, $v_s$, which match classical simulations across model parameters, and analytics in appropriate regimes. We then extend experiments to $L=60$ fermions (120 qubits) and evolution times to $t=6$ using 30 Trotter steps. Quantum-processor outputs agree quantitatively with approximate classical simulations performed using a time-dependent variational principle (TDVP) solver and we observe that increasing the TDVP bond dimension through $χ= 4096$ expands the range of evolution times within which agreement has RMSE $\sim 1\%$ before the approaches diverge. Owing to the large scale of the simulation and the use of overhead-free error-suppression techniques, for simulated evolution times at the limit of quantum/classical agreement ($t\gtrsim 5$ in natural hopping units), the wall-clock runtime of the quantum processor is nearly three orders of magnitude faster than TDVP simulations with $χ= 4096$ and implemented using the ITensor and TeNPy packages. These results establish contemporary digital quantum processors as a versatile, quantitatively accurate, and competitive platform for the study of fermionic many-body dynamics in regimes where leading classical methods can become prohibitively expensive.

quant-ph↗