Distributed finite-time stabilization of entangled quantum states on tree-like hypergraphs

Abstract

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 quasi-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.

arXiv comment6 pages, 3 figures

References in corpus (11)

• An Open-System Quantum Simulator with Trapped Ions
• Preparation of Entangled States by Quantum Markov Processes
• Entanglement generated by dissipation and steady state entanglement of two macroscopic objects
• Dissipative production of a maximally entangled steady state
• Stabilizing entanglement autonomously between two superconducting qubits
• Sequential generation of entangled multi-qubit states
• Quantum simulation of open-system dynamical maps with trapped ions
• Quantum Channel Construction with Circuit Quantum Electrodynamics
• Dissipative entanglement of solid-state spins in diamond
• Exact stabilization of entangled states in finite time by dissipative quantum circuits
• Alternating Projections Methods for Discrete-time Stabilization of Quantum States