保里相关编码（PCE）能否通过优化解决因式分解问题？
Can PCE solve the factorisation problem via optimisation?
AI总结：
研究整数因式分解问题，探讨保里相关编码（PCE）算法对其适用性，利用其压缩能力减少所需量子比特数，通过探索PCE框架结构和动力学编码分析候选因式关系，为量子计算中因式分解研究提供新视角。
AI中文摘要：
量子技术的不断进步激发了对其在各领域潜在应用的持续探索，尤其是在经典系统难以处理的计算问题上。整数因式分解因与RSA等广泛使用的加密方案相关而备受关注。一种因式分解方法是将其转化为二元优化问题，但当前方案所需大量量子比特，在现有硬件上不可行。本文研究保里相关编码（PCE）算法对因式分解问题的适用性，因其压缩能力可大幅减少所需量子比特数。该方法探索如何利用PCE框架的结构和动力学在量子计算环境中编码和分析候选因式关系。本研究旨在初步检验该适用性的可行性和局限性，讨论算法设计、与现有量子方法的概念关系以及当前或近期量子硬件实现的实际约束。初步观察表明，该方法可能为量子计算中因式分解研究提供新视角，虽未提及计算优势，但这些结果主要是对量子算法和计算数论研究的探索性贡献。
英文摘要：
The ongoing progress in quantum technologies has fueled a sustained exploration of their potential applications across various domains, particularly in computational problems that are considered intractable for classical systems. Among these problems, integer factorisation remains of special interest due to its relevance to widely used cryptographic schemes such as RSA. Among the different possibilities, one approach to factorisation is to convert the problem into a binary optimisation problem. However, current proposals usually need a large number of qubits that make them unfeasible within the current hardware. In this work, we investigate a possible adaptation of the Pauli Correlation Encoding (PCE) algorithm to the factorisation problem. Due to its compression capability, it can drastically reduce the number of needed qubits. The proposed approach explores how the structure and dynamics of the PCE framework may be employed to encode and analyze candidate factor relations within a quantum computational setting. Rather than presenting a replacement for established quantum factorisation methods, this study aims to provide a preliminary examination of the feasibility and limitations of the proposed adaptation. We discuss the algorithmic design, its conceptual relationship with existing quantum approaches, and the practical constraints associated with implementation on current or near-term quantum hardware. Initial observations suggest that the method may offer an alternative perspective for studying factorisation within the broader context of quantum computation, although no claim is made regarding computational advantage. These results are intended primarily as an exploratory contribution to ongoing research in quantum algorithms and computational number theory.
