范式耦合与新型计算混合算法的实践逻辑
Paradigm Coupling and the Practical Logic of Emerging Computing Hybrid Algorithms
摘要: 新型计算的发展并未简单表现为经典计算范式的替代,而是在现有技术条件下形成了新型计算与经典计算相互依赖的混合实践结构。本文以“范式耦合”为核心概念,从新型计算与经典计算在确定性、局域性以及信息处理方式上的结构差异出发,分析二者在混合算法中的功能分工及其工程基础。研究表明,变分特征求解器(VQE)、新型近似优化算法(QAOA)等混合算法以新型计算处理单元承担特定计算任务,以经典优化与控制环节完成参数更新、反馈和误差处理,使具有不同理论基础的计算范式在功能层面形成协同。与此同时,混合算法仍面临贫瘠高原、新型–经典接口开销、噪声传播以及控制参数规模增长等现实约束,这些问题表明范式差异不仅体现为理论层面的概念差异,也具体表现为算法设计、系统控制和工程实现之间的协调难题。由此,“范式耦合”可作为理解新型计算当前发展阶段的一种分析框架,其重点不在于判断新旧范式的替代关系,而在于解释不同计算范式如何通过功能互补形成可运行的技术系统。
Abstract: The development of emerging computing has not simply manifested itself as a replacement for the classical computing paradigm. Instead, under current technological conditions, it has given rise to a hybrid practical structure in which emerging computing and classical computing are mutually dependent. Taking “paradigm coupling” as its core concept, this paper examines the structural differences between emerging computing and classical computing in terms of determinism, locality, and information processing, and analyzes their functional division and engineering foundations in hybrid algorithms. The findings show that hybrid algorithms, such as the Variational-Quantum-Eigensolver (VQE) and the emerging approximate optimization algorithm (QAOA), employ emerging computing processing units to perform specific computational tasks, while relying on classical optimization and control mechanisms for parameter updates, feedback, and error handling. In this way, computing paradigms with different theoretical foundations achieve functional coordination. Meanwhile, hybrid algorithms still face practical constraints, including barren plateaus, emerging-classical interface overhead, noise propagation, and increasing control complexity. These challenges indicate that paradigm differences are manifested not only as conceptual distinctions at the theoretical level, but also as coordination problems among algorithm design, system control, and engineering implementation. Accordingly, “paradigm coupling” can serve as an analytical framework for understanding the current development stage of emerging computing. Its focus is not on determining the replacement relationship between old and new paradigms, but on explaining how different computing paradigms form workable technical systems through functional complementarity.
文章引用:沈佳怡. 范式耦合与新型计算混合算法的实践逻辑[J]. 哲学进展, 2026, 15(10): 205-211. https://doi.org/10.12677/acpp.2026.1510479

参考文献

[1] Turing, A.M. (1937) On Computable Numbers, with an Application to the Entscheidungsproblem. Proceedings of the London Mathematical Society, 2, 230-265.
https://doi.org/10.1112/plms/s2-42.1.230
[2] Feynman, R.P. (1982) Simulating Physics with Computers. International Journal of Theoretical Physics, 21, 467-488.
https://doi.org/10.1007/bf02650179
[3] Deutsch, D. (1985) Quantum Theory, the Church-Turing Principle and the Universal Quantum Computer. Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences, 400, 97-117.
https://doi.org/10.1098/rspa.1985.0070
[4] Kuhn, T.S. (1962) The Structure of Scientific Revolutions. The University of Chicago Press.
[5] 刘闯. 时空、引力与量子纠缠[J]. 自然辩证法研究, 2023, 39(1): 44-52.
[6] 李宏芳. 量子理论的信息基础及哲学争议再讨论[J]. 自然辩证法研究, 2025, 41(1): 11-16, 67.
[7] 乔笑斐, 高策. 量子信息的本体论分析[J]. 自然辩证法研究, 2024, 40(3): 12-18.
[8] 王凯宁, 郭贵春. 从新埃弗雷特解释到多计算解释——量子计算语境下多世界解释的演变[J]. 哲学研究, 2014, 4(4): 83-90.
[9] 郝刘祥. 哲学与物理学相遇在量子世界[J]. 中国科学院院刊, 2021, 36(1): 28-36.
[10] Shor, P.W. (1994) Algorithms for Quantum Computation: Discrete Logarithms and Factoring. Proceedings 35th Annual Symposium on Foundations of Computer Science, Santa Fe, 20-22 November 1994, 124-134.
https://doi.org/10.1109/sfcs.1994.365700
[11] Shor, P.W. (1995) Scheme for Reducing Decoherence in Quantum Computer Memory. Physical Review A, 52, R2493-R2496.
https://doi.org/10.1103/physreva.52.r2493
[12] 吴国林. 格罗夫算法、量子控制及其对量子测量的意义[J]. 自然辩证法研究, 2011, 27(1): 13-17.
[13] 成素梅. 理解量子实在的信息论进路[J]. 自然辩证法研究, 2025, 41(1): 3-10.
[14] Arute, F., Arya, K., Babbush, R., et al. (2019) Quantum Supremacy Using a Programmable Superconducting Processor. Nature, 574, 505-510.
[15] Aharonov, D., Gao, X., Landau, Z., Liu, Y. and Vazirani, U. (2023) A Polynomial-Time Classical Algorithm for Noisy Random Circuit Sampling. Proceedings of the 55th Annual ACM Symposium on Theory of Computing, Orlando, 20-23 June 2023, 945-957.
https://doi.org/10.1145/3564246.3585234
[16] Lavrijsen, W., Tudor, A., Muller, J., Iancu, C. and de Jong, W. (2020) Classical Optimizers for Noisy Intermediate-Scale Quantum Devices. 2020 IEEE International Conference on Quantum Computing and Engineering (QCE), Denver, 12-16 October 2020, 267-277.
https://doi.org/10.1109/qce49297.2020.00041
[17] Khairy, S., Shaydulin, R., Cincio, L., Alexeev, Y. and Balaprakash, P. (2020) Learning to Optimize Variational Quantum Circuits to Solve Combinatorial Problems. Proceedings of the AAAI Conference on Artificial Intelligence, 34, 2367-2375.
https://doi.org/10.1609/aaai.v34i03.5616
[18] Huang, Z., Li, Q., Zhao, J. and Song, M. (2022) Variational Quantum Algorithm Applied to Collision Avoidance of Unmanned Aerial Vehicles. Entropy, 24, Article 1685.
https://doi.org/10.3390/e24111685
[19] [英]伊∙拉卡托斯. 科学研究纲领方法论[M]. 兰征, 译. 上海: 上海译文出版社, 2016.
[20] [美]保罗∙法伊尔阿本德. 反对方法[M]. 周昌忠, 译. 上海: 上海译文出版社, 2003.