Graph-theoretic insights on the constructability of complex entangled states

Abstract

The most efficient automated way to construct a large class of quantum photonic experiments is via abstract representation of graphs with certain properties. While new directions were explored using Artificial intelligence and SAT solvers to find such graphs, it becomes computationally infeasible to do so as the size of the graph increases. So, we take an analytical approach and introduce the technique of local sparsification on experiment graphs, using which we answer a crucial open question in experimental quantum optics, namely whether certain complex entangled quantum states can be constructed. This provides us with more insights into quantum resource theory, the limitation of specific quantum photonic systems and initiates the use of graph-theoretic techniques for designing quantum physics experiments.

18 pages. Accepted in Quantum Journal

References in corpus (9)

• Single-photon quantum hardware: towards scalable photonic quantum technology with a quantum advantage
• Experimental access to higher-dimensional entangled quantum systems using integrated optics
• Multiphoton non-local quantum interference controlled by an undetected photon
• On-chip quantum interference between the origins of a multi-photon state
• Digital Discovery of 100 diverse Quantum Experiments with PyTheus
• Design of quantum optical experiments with logic artificial intelligence
• Information flow in parameterized quantum circuits
• Quantum-Inspired Perfect Matching under Vertex-Color Constraints
• Solving Quantum-Inspired Perfect Matching Problems via Tutte's Theorem-Based Hybrid Boolean Constraints