Preparation of pure states on networks of quantum systems by controlled dissipative dynamics offers important advantages with respect to circuit-based schemes. Unlike in continuous-time scenarios, when discrete-time dynamics are considered, dead-beat stabilization becomes possible in principle. Here, we focus on pure states that can be stabilized by distributed, unsupervised dynamics in finite time on a network of quantum systems subject to realistic locality constraints. In particular, we define a class of quasi-locality notions, that we name “tree-like hypergraphs,” and show that the states that are robustly stabilizable in finite time are then unique ground states of a frustration-free, commuting quasi-local Hamiltonian. A structural characterization of such states is also provided, building on a simple yet relevant example.
In this technical note an extended scalability condition is proposed to achieve the ground-state stability for a class of multipartite quantum systems which may involve two-body interactions, and an explicit procedure to construct the dissipation control is presented. Moreover, we show that dissipation control can be used for automatic error correction in addition to stabilization. We demonstrate the stabilization and error correction of three-qubit repetition code states using dissipation control.
Noise-biased qubits have bit-flip errors that are exponentially suppressed relative to phase-flip errors, and offer a promising route toward fault-tolerant quantum computing. However, this bias can be compromised during gate operations with non-biased control qubits. To address this limitation, we propose a "0-n" Fock qubit architecture that maintains the noise bias by encoding information in the ground state and n-th excited state of a nonlinear multi-level system, such as a transmon. This encoding is achieved via a dissipative stabilization that acts as decay and gain for lower and upper intermediate levels, respectively. We first analytically demonstrate that bit-flip errors are exponentially suppressed with the number of levels. Then, we present a practical implementation using a multi-mode lossy filter to achieve the frequency-selective dissipation. Finally, we numerically demonstrate that bit-flip probabilities approaching
10−8 are achievable for controlled-X gates on cat qubits using the 0-n qubit as an ancilla with
n≥9 (i.e. ten or more levels), for realistic experimental parameters. Building on this, we simulate syndrome extraction in a repetition code, achieving logical error rates in the megaquop regime with only a distance of
d=9.