14 January 2022 in PRX Quantum
Quantum computers are promising for simulations of chemical and physical systems, but the limited capabilities of today’s quantum processors permit only small, and often approximate, simulations. Here we present a method, classical entanglement forging, that harnesses classical resources to capture quantum correlations and double the size of the system that can be simulated on quantum hardware. Shifting some of the computation to classical postprocessing allows us to represent ten spin orbitals of the water molecule on five qubits of an IBM Quantum processor in the most accurate variational simulation of the ground-state energy using quantum hardware to date. We discuss conditions for applicability of classical entanglement forging and present a roadmap for scaling to larger problems.
29 June 2023 in PRX Quantum
Superconducting qubit lifetimes must be both long and stable to provide an adequate foundation for quantum computing. This stability is imperiled by two-level systems (TLSs), currently a dominant loss mechanism, which exhibit slow spectral dynamics that destabilize qubit lifetimes on hour time scales. Stability is also threatened at millisecond time scales, where ionizing radiation has recently been found to cause bursts of correlated multiqubit decays, complicating quantum error correction. Here, we study both ionizing radiation and TLS dynamics on a 27-qubit processor, repurposing the standard transmon qubits as sensors of both radiation impacts and TLS dynamics. Unlike prior literature, we observe resilience of the qubit lifetimes to the transient quasiparticles generated by the impact of radiation. However, we also observe a new interaction between these two processes, “TLS scrambling,” in which a radiation impact causes multiple TLSs to jump in frequency, which we suggest is due to the same charge rearrangement sensed by qubits near a radiation impact. As TLS scrambling brings TLSs out of or into resonance with the qubit, the lifetime of the qubit increases or decreases. Our findings thus identify radiation as a new contribution to fluctuations in qubit lifetimes, with implications for efforts to characterize and improve device stability.
20 January 2026 in Nature Physics
3 September 2026 in PRX Quantum
To successfully perform quantum computations, it is often necessary to first accurately characterize the noise in the underlying hardware. However, it is well known that fundamental limitations prevent the unique identification of the noise model. This raises the question of whether these limitations impact the ability to predict noisy dynamics and mitigate errors. Here, we show, both theoretically and experimentally, that when learnable parameters are self-consistently characterized, the (gauge) degrees of freedom do not impact predictions of noisy dynamics or error mitigation. We use the recently introduced framework of gate set Pauli noise learning to efficiently and self-consistently characterize and mitigate noise of a complete gate set, including state preparation, measurements, single-qubit gates and multi-qubit entangling Clifford gates. We validate our approach through experiments with up to 92 qubits and show that, while the gauge choice does not affect error-mitigated observables, optimizing it reduces sampling overhead.
6 September 2024 in arXiv
Quantum error mitigation (QEM) can recover accurate expectation values from a noisy quantum computer by trading off bias for variance, such that an averaged result is more accurate but takes longer to converge. Probabilistic error cancellation (PEC) stands out among QEM methods as an especially robust means of controllably eliminating bias. However, PEC often exhibits a much larger variance than other methods, inhibiting application to large problems for a given error rate. Recent analyses have shown that the variance of PEC can be reduced by not mitigating errors lying outside the causal lightcone of the desired observable. Here, we improve the lightcone approach by classically computing tighter bounds on how much each error channel in the circuit can bias the final result. This set of bounds, which we refer to as a "shaded lightcone," enables a more targeted application of PEC, improving the tradespace of bias and variance, while illuminating how the structure of a circuit determines the difficulty of error-mitigated computation. Although a tight shaded lightcone is exponentially hard to compute, we present an algorithm providing a practical benefit for some problems even with modest classical resources, leveraging the ease of evolving an error instead of the state or the observable. The algorithm reduces the runtime that would be needed to apply PEC for a target accuracy in an example 127-qubit Trotter circuit by approximately two orders of magnitude compared to standard lightcone-PEC, expanding the domain of problems that can be computed via direct application of PEC on noisy hardware.