Abstract: Quantum signal processing (QSP) provides a mathematically economical mechanism for transforming the spectral information of a block-encoded operator through carefully phased single-qubit rotations. Photonic quantum computing, meanwhile, offers high-bandwidth operation, network compatibility and substantial room-temperature functionality, yet remains constrained by optical loss, probabilistic state preparation, finite squeezing, detector imperfections and the resource overhead of logical error correction. This paper develops an integrated analytical framework that connects QSP polynomial synthesis to fault-tolerant photonic execution and to a broader construct termed quantum-enhanced scientific intelligence: the reliable extraction of predictive, explanatory and decision-relevant knowledge from complex scientific operators and data. The study adopts a theory-building and model-based research design. It combines block encoding, QSP and quantum singular-value transformation with open-system dynamics, logical-error modelling, constrained multi-objective optimization and risk-adjusted outcome scoring. The proposed QSP-FTSI framework treats algorithmic approximation error, photonic component quality, decoder performance, logical reliability, resource intensity, uncertainty calibration and scientific utility as coupled rather than independent variables. An illustrative normalized model yields a baseline benefit index of 7.942, a composite risk index of 2.640 and a risk-adjusted score of 6.358 on a ten-point scale; an improved low-loss, high-QEC scenario reaches 7.858, whereas a stressed configuration falls to 3.754. These values are demonstrations, not experimental findings. The principal contribution is a publication-ready mathematical architecture for evaluating when QSP-enabled photonic systems can support scientifically meaningful simulation, inverse modelling, spectral filtering and inference under explicit fault-tolerance and reproducibility constraints. The framework also identifies measurable pathways for experimental validation, hardware–algorithm co-design and responsible scientific deployment. Keywords quantum signal processing; quantum singular-value transformation; fault-tolerant photonic computing; block encoding; Gottesman–Kitaev–Preskill codes; fusion-based quantum computation; logical error suppression; Hamiltonian simulation; scientific machine learning; quantum-enhanced inference; photonic integrated circuits; spectral transformation; quantum error correction; risk-adjusted scientific intelligence; hardware–algorithm co-design
Abstract: Quantum signal processing (QSP) provides a mathematically economical mechanism for transforming the spectral information of a block-encoded operator through carefully phased single-qubit rotations. Photonic quantum computing, meanwhile, offers high-bandwidth operation, network compatibility and substantial room-temperature functionality, yet remains constrained by optical loss, probabilistic state preparation, finite squeezing, detector imperfections and the resource overhead of logical error correction. This paper develops an integrated analytical framework that connects QSP polynomial synthesis to fault-tolerant photonic execution and to a broader construct termed quantum-enhanced scientific intelligence: the reliable extraction of predictive, explanatory and decision-relevant knowledge from complex scientific operators and data. The study adopts a theory-building and model-based research design. It combines block encoding, QSP and quantum singular-value transformation with open-system dynamics, logical-error modelling, constrained multi-objective optimization and risk-adjusted outcome scoring. The proposed QSP-FTSI framework treats algorithmic approximation error, photonic component quality, decoder performance, logical reliability, resource intensity, uncertainty calibration and scientific utility as coupled rather than independent variables. An illustrative normalized model yields a baseline benefit index of 7.942, a composite risk index of 2.640 and a risk-adjusted score of 6.358 on a ten-point scale; an improved low-loss, high-QEC scenario reaches 7.858, whereas a stressed configuration falls to 3.754. These values are demonstrations, not experimental findings. The principal contribution is a publication-ready mathematical architecture for evaluating when QSP-enabled photonic systems can support scientifically meaningful simulation, inverse modelling, spectral filtering and inference under explicit fault-tolerance and reproducibility constraints. The framework also identifies measurable pathways for experimental validation, hardware–algorithm co-design and responsible scientific deployment. Keywords quantum signal processing; quantum singular-value transformation; fault-tolerant photonic computing; block encoding; Gottesman–Kitaev–Preskill codes; fusion-based quantum computation; logical error suppression; Hamiltonian simulation; scientific machine learning; quantum-enhanced inference; photonic integrated circuits; spectral transformation; quantum error correction; risk-adjusted scientific intelligence; hardware–algorithm co-design
Despite rapid advances in quantum hardware, noise remains a central obstacle to deploying quantum algorithms on near-term devices. In particular, random coherent errors that accumulate during circuit execution constitute a dominant and fundamentally challenging noise source. We introduce a noise-resilient framework for Quantum Signal Processing (QSP) that mitigates such coherent errors without increasing circuit depth or ancillary qubit requirements. Our approach uses ensembles of noisy QSP circuits combined with measurement-level averaging to suppress random phase errors in Z rotations. Building on this framework, we develop robust QSP algorithms for implementing polynomial functions of Hermitian matrices and for estimating observables, with applications to Hamiltonian simulation, quantum linear systems, and ground-state preparation. We analyze the trade-off between approximation error and hardware noise, which is essential for practical implementation under the stringent depth and coherence constraints of current quantum hardware. Our results establish a practical pathway for integrating error mitigation seamlessly into algorithmic design, advancing the development of robust quantum computing, and enabling the discovery of scientific applications with near- and mid-term quantum devices.
Abstract: Autonomous cyber-physical networks increasingly combine distributed sensing, edge intelligence, networked control, and safety-critical actuation, yet their reliability is constrained by correlated cyber faults, communication loss, model drift, hardware degradation, and the fragility of emerging quantum resources. This paper develops a fault-tolerant distributed quantum-intelligence architecture that couples photonic circuit emulation, quantum error-aware computation, AI-augmented control, distributed consensus, and deterministic safety fallback. The purpose is to formalize how heterogeneous quantum, photonic, AI, and control subsystems can jointly preserve mission-level stability when individual components fail or become uncertain. The study adopts a model-based systems methodology, synthesizes the supplied literature on fault-tolerant photonic quantum computing, distributed autonomous control, cyber-physical resilience, AI-native edge systems, and quantum-assisted optimization, and formulates a multi-layer state-space and reliability model. A composite Fault-Tolerant Quantum Intelligence Resilience Index (FTQIRI) integrates quantum reliability, photonic emulation fidelity, AI robustness, network resilience, closed-loop stability, and cyber assurance. An illustrative 0–10 numerical model yields an integrated score of 8.49 for the proposed architecture versus 6.34 for a conventional hybrid baseline, indicating the expected value of cross-layer redundancy and adaptive orchestration rather than empirical superiority. The paper further specifies an invention-oriented architecture, independent system and method claim drafts, and dependent claim concepts around digital-twin emulation, syndrome-informed control, consensus-based failover, cryptographic verification, and safety envelopes. The principal contribution is a unified mathematical and engineering framework that treats quantum fault tolerance and cyber-physical fault tolerance as coupled control problems, thereby connecting photonic quantum hardware, distributed intelligence, and autonomous network safety within one verifiable decision loop. Keywords: fault-tolerant quantum computing; distributed quantum intelligence; photonic circuit emulation; autonomous cyber-physical systems; AI-augmented control; quantum error correction; resilient edge intelligence; distributed consensus; safe reinforcement learning; digital twin; quantum–classical co-design; cyber resilience; multi-agent control; reliability optimization; verifiable AI
Modern quantum algorithms are increasingly formulated as coherent procedures for implementing polynomial transformations of operators and singular values. This perspective provides a powerful and unifying language for quantum algorithm design, connecting a wide range of distinct problems through five closely related key tools: block-encoding, qubitization, QSP, QSVT and GQSP. Block-encoding embeds non-unitary matrices into larger unitaries; qubitization converts block-encodings into structured operators; QSP, QSVT and GQSP enable polynomial transformations with near-optimal query complexity. Together, these techniques form a general toolkit for transforming matrix functions into implementable quantum circuits. This paper develops these techniques from first principles as a unified framework for constructing quantum algorithms. We apply this framework to representative applications to highlight design principles and demonstrate how distinct algorithms can be constructed from a unified sequence of operator transformations.
A central contribution is a systematic decision workflow for selecting the appropriate approach according to the operator structure and the desired transformation polynomial. This perspective clarifies when direct GQSP or through qubitization, or Laurent expansion, or QSVT is most appropriate. We organize algorithmic design into an end-to-end pipeline: identifying the target matrix function, constructing an appropriate block-encoding, determining the relevant spectral domain, designing a polynomial or Laurent-polynomial approximation, synthesizing the phase factors, and translating the transformation into an executable quantum circuit. By applying this unified framework to example applications, we showcase a practical methodology for reasoning, designing, and implementing quantum algorithms based on polynomial transformations.
Scalable quantum computation is expected to rely on fault-tolerant quantum computation (FTQC), in which quantum error correction (QEC) suppresses physical errors sufficiently to support reliable logical operations. This requires quantum compilation to move beyond general-purpose circuit optimization toward encoding-aware and protocol-structured compilation across the full stack of fault-tolerant quantum computers. Beyond circuit synthesis and hardware mapping, an FTQC compiler must lower algorithm-level operations into the logical gate set supported by the chosen code, coordinate encoded data and ancilla resources, realize logical operations together with repeated syndrome extraction under hardware constraints, and provide the resulting measurement stream to real-time decoding.
This survey presents a full-stack view of compiler design for QEC-protected quantum computation. We organize existing work into three interacting layers: logical-level QEC compilation, physical-level QEC realization, and decoder runtime integration. At the logical level, we review surface-code lattice-surgery compilers, beyond-surface-code code-surgery frameworks including emerging qLDPC approaches, and compilation support for non-Clifford operations such as magic-state distillation and code switching. At the physical level, we survey hardware-aware QEC realization on superconducting, trapped-ion, and neutral-atom platforms. We further examine decoder models, real-time decoding systems, and frame-management mechanisms that close the feedback loop during fault-tolerant execution. Finally, we identify open challenges in cross-layer optimization, qLDPC compilation, compiler-decoder co-design, runtime adaptivity, and the development of integrated and benchmarkable FTQC compilation stacks. An actively maintained paper list is available at: github.com/chenghongz/QEC-compiler-design.
Abstract: This study investigates a topological quantum error-correction framework for scalable photonic quantum-computing architectures in which fusion-based entangling primitives are combined with tensor-network optimization. The central problem addressed is the gap between high-fidelity photonic components and the stringent logical-error rates required for fault-tolerant quantum computation. Photonic platforms offer room-temperature operation, manufacturable silicon-photonic process flows, high-bandwidth optical interconnects and natural compatibility with measurement-based computation; however, photon loss, probabilistic fusion and decoder latency impose architectural constraints that cannot be resolved by hardware fidelity alone. The proposed framework therefore treats hardware metrics, code geometry and decoding as a coupled optimization problem rather than as separate engineering layers. The manuscript develops a mathematically grounded model of surface-code and cluster-state error correction under photonic loss and fusion noise, then evaluates tensor-network contraction as a decoder and resource-allocation method. The data section explicitly uses published real-data-based benchmark inputs from contemporary photonic and quantum-error-correction literature, supplemented by transparent, domain-plausible projections where complete open photonic logical-QEC datasets are not yet available. Results show that tensor-network optimization improves the logical-error index relative to matching-based baselines in the modelled photonic regime, while the feasibility boundary remains dominated by loss, fusion infidelity and real-time decoding latency. The contribution is a reproducible evaluation framework that links topological protection, photonic architecture constraints and decoder design for future scalable fault-tolerant systems. Keywords: topological quantum error correction; surface code; photonic quantum computing; fusion-based quantum computation; tensor-network decoding; loss tolerance; scalable quantum architecture; measurement-based quantum computing; fault tolerance; silicon photonics.
Quantum signal processing (QSP) and quantum singular value transformation (QSVT) currently stand as the most efficient techniques for implementing functions of block-encoded matrices, a central task that lies at the heart of most prominent quantum algorithms. However, current QSP approaches face several challenges, such as the restrictions imposed on the family of achievable polynomials and the difficulty of calculating the required phase angles for specific transformations. In this paper, we present a generalized quantum signal processing (GQSP) approach, employing general SU(2) rotations as our signal-processing operators, rather than relying solely on rotations in a single basis. Our approach lifts all practical restrictions on the family of achievable transformations, with the sole remaining condition being that |P|≤1 , a restriction necessary due to the unitary nature of quantum computation. Furthermore, GQSP provides a straightforward recursive formula for determining the rotation angles needed to construct the polynomials in cases where P and Q are known. In cases where only P is known, we provide an efficient optimization algorithm capable of identifying in under a minute of GPU time, a corresponding Q for polynomials of degree on the order of 107 . We further illustrate GQSP simplifies QSP-based strategies for Hamiltonian simulation, offer an optimal solution to the ϵ -approximate fractional query problem that requires O((1/δ)+log(1/ϵ)) queries to perform where O(1/δ) is a proved lower bound, and introduces novel approaches for implementing bosonic operators. Moreover, we propose a novel framework for the implementation of normal matrices, demonstrating its applicability through synthesis of diagonal matrices, as well as the development of a new algorithm for convolution through synthesis of circulant matrices using only O(dlogN+log2N) 1 and 2-qubit gates for a filter of lengths d . Published by the American Physical Society 2024