All existing quantum computing paradigms take substantial qubits as basic units and realize state evolution through quantum gate operations. Essentially, they simulate quantum effects within the framework of classical architecture, and persistently face three core bottlenecks: extreme decoherence sensitivity, huge error correction overhead, and extremely high scaling difficulty. The root cause lies in the failure to grasp the relational essence of quantum phenomena at the ontological level. Based on the path-rule duality principle of Gradient-Relational Ontology and the path-state essence of quantum states, this paper proposes gradient quantum computing as a native quantum computing paradigm. The basic unit of computation is not binary qubits, but multi-dimensional parallel conductive gradient paths; the computing process is not the sequential operation of quantum gates, but the self-organized evolution of path superposition, interference and condensation; measurement is not a special operation triggering collapse, but the spontaneous condensation of paths into rule states. The study demonstrates that this paradigm possesses endogenous decoherence suppression and native error correction capabilities. It can maintain computational stability through structural steady states without external quantum error correction codes. Its parallelism grows exponentially with path scale, and the scaling bottleneck is far lower than that of traditional qubit architectures. This paper further presents a four-layer hardware system architecture for gradient quantum computers, clarifies the core technical path of physical implementation, and proves its natural computational advantages in combinatorial optimization, quantum simulation and other problems. This study extends relational ontology to the field of quantum computing, providing a brand-new ontological path and architectural scheme for breaking through the engineering bottlenecks of existing quantum computing and realizing large-scale general-purpose quantum computing.
Y Cao (Sat,) studied this question.