This work introduces a new paradigm for quantum computation, here termed Geometric Quantum Computing (GQC), in which entangling gates arise not from local physical interactions but from global geometric modes encoded in a Unified Effective Average Action (UEAA). Building on recent optical experiments demonstrating entanglement without interaction—notably the path-identity schemes of Krenn et al. (2017) and Wang et al. (2024)—the paper shows that such processes are naturally described by a bilocal kernel in the UEAA, activated by geometric constraints rather than Hamiltonian coupling. A scalar quantity termed entanglement curvature is derived from the bilocal kernel and shown to be equivalent to concurrence in the single-photon subspace. This suggests a method for designing quantum processors in which entanglement is generated through engineered geometric overlap of mode functions, potentially reducing resource requirements for distributed quantum networks. The framework extends techniques from the IGM–RG program (Medina Albarenga, 2025) to quantum information science and offers a unified geometric viewpoint on entanglement generation, error mechanisms, and network architecture.
This work introduces a new paradigm for quantum computation, here termed Geometric Quantum Computing (GQC), in which entangling gates arise not from local physical interactions but from global geometric modes encoded in a Unified Effective Average Action (UEAA). Building on recent optical experiments demonstrating entanglement without interaction—notably the path-identity schemes of Krenn et al. (2017) and Wang et al. (2024)—the paper shows that such processes are naturally described by a bilocal kernel in the UEAA, activated by geometric constraints rather than Hamiltonian coupling. A scalar quantity termed entanglement curvature is derived from the bilocal kernel and shown to be equivalent to concurrence in the single-photon subspace. This suggests a method for designing quantum processors in which entanglement is generated through engineered geometric overlap of mode functions, potentially reducing resource requirements for distributed quantum networks. The framework extends techniques from the IGM–RG program (Medina Albarenga, 2025) to quantum information science and offers a unified geometric viewpoint on entanglement generation, error mechanisms, and network architecture.
Recent experiments have demonstrated that two distant photons can become entangled even when they originate from independent sources and never interact nor share a traditional Bell-state measurement. This class of experiments—known as entanglement by path identity (Wang et al., 2024; Krenn et al., 2017)—reveals a mode of entanglement generation fundamentally different from the usual interactionbased or measurement-induced protocols. This work develops a fully geometric formulation of such effects using a Unified Effective Average Action (UEAA), originally introduced in the context of the Integrated Geometric Model with Renormalization Group (IGM–RG). The UEAA provides a natural language to describe optical modes, path indistinguishability, and nonlocal correlations via a bilocal kernel constrained by a geometric exclusion principle (GEP). The paper constructs a minimal UEAA for two remote optical modes, derives an entanglement curvature scalar from the bilocal kernel, and shows that this curvature is a monotonic entanglement measure equivalent to concurrence in the single-excitation subspace. As a consequence, the path-identity experiments are interpreted as the activation of a geometric mode of the quantum state, rather than as a mysterious 1nonlocal interaction. This formalism suggests a new paradigm of geometric quantum computing, where entangling gates are implemented through global geometric constraints rather than physical interaction. The results unify quantum optics, quantum information, and geometric field theory within a single effective-action framework and open a pathway toward novel architectures for distributed quantum networks.
This work introduces a complete framework for Geometric Entanglement Networks (GEN): distributed quantum architectures in which nonlocal entanglement between distant nodes is generated, stabilized, and routed through geometric modes of a Unif ied Effective Average Action (UEAA). Unlike standard approaches based on physical interaction, photon exchange, or entanglement swapping, GEN employs bilocal kernels constrained by a geometric exclusion principle (GEP) to activate nonlocal correlations between remote optical nodes. Recent experimental demonstrations of entanglement without interaction (Wang et al., 2024; Krenn et al., 2017) provide empirical foundations for this mechanism. The paper generalizes previous UEAA models to full networks, derives the entanglement-curvature matrix governing global correlations, and shows that network-wide entanglement can be engineered purely through geometric overlap of path-identity modes. The resulting network operations—entanglement routing, multi-node Bell generation, geometric GHZ preparation, and repeaterless longdistance entanglement—arise naturally from UEAA kernels and require neither shared sources nor quantum memories. GEN thus provides a scalable, resource-efficient framework for distributed quantum computing, long-distance quantum communication, and photonic cluster-state generation
We propose a fundamentally new paradigm for quantum computation based on the intrinsic geometry of quantum state space. Rather than specifying computation as a sequence of discrete gates applied over external time, Geometric Quantum Computing (GQC) defines computation as geodesic evolution through Hilbert space, where the computational 'time' emerges from the Fubini-Study metric itself. This framework inverts the standard relationship between quantum dynamics and time: instead of viewing decoherence as degradation of quantum information over time, we recognize that decoherence is time—the environment's information processing. We derive the theoretical foundations of GQC, demonstrate that it naturally circumvents barren plateaus by operating directly in state space rather than parameter space, and propose experimental protocols for implementation. The framework suggests that optimal quantum computation is achieved not by fighting decoherence but by engineering the effective geometry of state space to make desired computations correspond to natural geodesic flow.
Quantum entanglement, a cornerstone of quantum mechanics, holds immense potential for revolutionizing computation. This paper explores the application of non-linear geometry to quantum entanglement, aiming to unlock its transformative capabilities beyond classical computation. We propose a new quantum computation model that leverages geometric constraints to manipulate and enhance entanglement, leading to a deeper understanding of quantum correlations. This research will investigate how carefully crafted geometric structures can be employed to mitigate decoherence and promote the exploration of unique entanglement properties. The core claim is that developing this framework will significantly advance the potential for quantum computation and provide a path towards surpassing the limitations of traditional algorithms.
Encoding quantum information within bosonic modes offers a promising direction for hardware-efficient and fault-tolerant quantum information processing. However, achieving high-fidelity universal control over bosonic encodings using native photonic hardware remains a significant challenge. We establish a quantum control framework to prepare and perform universal logical operations on arbitrary multimode multi-photon states using a quantum photonic neural network. Central to our approach is the optical nonlinearity, which is realized through strong light-matter interaction with a three-level Λ atomic system. The dynamics of this passive interaction are asymptotically confined to the single-mode subspace, enabling the construction of deterministic entangling gates and overcoming limitations faced by many nonlinear optical mechanisms. Using this nonlinearity as the element-wise activation function, we show that the proposed architecture is able to deterministically prepare a wide array of multimode multi-photon states, including essential resource states. We demonstrate universal code-agnostic control of bosonic encodings by preparing and performing logical operations on symmetry-protected error-correcting codes. Our architecture is not constrained by symmetries imposed by evolution under a system Hamiltonian such as purely χ (2) and χ (3) processes, and is naturally suited to implement non-transversal gates on photonic logical qubits. Additionally, we propose an error-correction scheme based on non-demolition measurements that is facilitated by the optical nonlinearity as a building block. Our results pave the way for near-term quantum photonic processors that enable error-corrected quantum computation, and can be achieved using present-day integrated photonic hardware.
Quantum Entanglement Geometric Modeling explores the intersection of quantum mechanics and geometric computation, aiming to create complex geometrical structures and optimize quantum information processing. This paper proposes a novel approach by leveraging the unique properties of quantum entanglement to simulate geometric phenomena and utilize quantum computation for complex geometric operations. The core mechanism involves mapping entangled states to geometric representations, enabling the exploration of intricate geometrical patterns and ultimately, the optimization of quantum information handling. It introduces a new framework for understanding and manipulating geometric structures, potentially driving advancements in both quantum computing and information processing. This research contributes to a deeper understanding of the fundamental relationship between entanglement, geometry, and computation.