Entangled states from simple quantum graphs

Abstract

Entanglement is a fundamental resource for many applications in quantum information processing. Here, we investigate how quantum transport in simple quantum graphs, modeled as controlled two-level quantum systems, can be utilized to generate entangled states through coherent control operations between two simple quantum graphs. A controlled operation is defined such that the scattering behavior of one quantum graph dynamically modifies the other. Our analysis reveals the precise conditions under which maximal entanglement or separability arises, including configurations that can be implemented via phase shifts in graph structures. Our findings demonstrate that the maximal entanglement in this system is closely related to recent results on randomized quantum graphs. These results provide new pathways for engineering entanglement using simple quantum graphs and suggest experimental feasibility using microwave networks.

11 pages, 7 figures

References in corpus (12)

• Quantum entanglement
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Experimental simulation of quantum graphs by microwave networks
• Transport and dynamics on open quantum graphs
• Green's function approach for quantum graphs: an overview
• Distributions of the Wigner reaction matrix for microwave networks with symplectic symmetry in the presence of absorption
• Unitary equivalence between the Green's function and Schrödinger approaches for quantum graphs
• An ultra-high gain single-photon transistor in the microwave regime
• A spectral duality in graphs and microwave networks
• Quantum graphs and microwave networks as narrow band filters for quantum and microwave devices
• Average scattering entropy of quantum graphs
• Quantum transport in randomized quantum graphs