This paper presents a quantum algorithm for solving general partial differential equations (PDEs) using the Schrödingerisation technique. The approach transforms general linear PDEs into Schrödinger-type equations, enabling the use of quantum algorithms designed for Schrödinger-type equations. The paper demonstrates the validity of the proposed quantum circuits through examples of the heat equation and the advection equation approximated by the upwind scheme. The heat equation is solved by transforming it into a Schrödinger-type equation using a warped phase transformation. The quantum circuit for the time evolution operator is constructed using a combination of quantum gates, including controlled rotations, Hadamard gates, and CNOT gates. The advection equation is also transformed into a Schrödinger-type equation, and the corresponding quantum circuit is implemented using similar techniques. The paper provides a detailed complexity analysis of the quantum circuits, showing that the quantum algorithm achieves exponential speedup over classical methods for high-dimensional PDEs. The complexity analysis demonstrates that the quantum algorithm requires a number of gates that is polynomial in the number of qubits and the time step, while classical methods require a number of operations that is exponential in the number of dimensions. The paper concludes that the Schrödingerisation technique provides a promising approach for solving general linear PDEs on quantum computers, with potential applications in scientific and engineering computing. The proposed quantum circuits are implemented using a combination of quantum gates and have been validated through numerical experiments. The results show that the quantum algorithm is effective in solving the heat and advection equations, with the quantum circuits demonstrating the potential for high-dimensional PDE simulations.This paper presents a quantum algorithm for solving general partial differential equations (PDEs) using the Schrödingerisation technique. The approach transforms general linear PDEs into Schrödinger-type equations, enabling the use of quantum algorithms designed for Schrödinger-type equations. The paper demonstrates the validity of the proposed quantum circuits through examples of the heat equation and the advection equation approximated by the upwind scheme. The heat equation is solved by transforming it into a Schrödinger-type equation using a warped phase transformation. The quantum circuit for the time evolution operator is constructed using a combination of quantum gates, including controlled rotations, Hadamard gates, and CNOT gates. The advection equation is also transformed into a Schrödinger-type equation, and the corresponding quantum circuit is implemented using similar techniques. The paper provides a detailed complexity analysis of the quantum circuits, showing that the quantum algorithm achieves exponential speedup over classical methods for high-dimensional PDEs. The complexity analysis demonstrates that the quantum algorithm requires a number of gates that is polynomial in the number of qubits and the time step, while classical methods require a number of operations that is exponential in the number of dimensions. The paper concludes that the Schrödingerisation technique provides a promising approach for solving general linear PDEs on quantum computers, with potential applications in scientific and engineering computing. The proposed quantum circuits are implemented using a combination of quantum gates and have been validated through numerical experiments. The results show that the quantum algorithm is effective in solving the heat and advection equations, with the quantum circuits demonstrating the potential for high-dimensional PDE simulations.