Dilation Theorem Via Schrödingerization, With Applications to the Quantum Simulation of Differential Equations

ABSTRACT Nagy's unitary dilation theorem in the operator theory asserts the possibility of dilating a contraction into a unitary operator. When used in quantum computing, its practical implementation primarily relies on block‐encoding techniques, based on finite‐dimensional scenarios. In this study, we delve into the recently devised Schrödingerization approach and demonstrate its viability as an alternative dilation technique. This approach is applicable to operators in the form of , which arises in wide‐ranging applications, particularly in solving linear ordinary and partial differential equations. Importantly, the Schrödingerization approach is adaptable to both finite‐ and infinite‐dimensional cases, in both countable and uncountable domains. For quantum systems lying in infinite‐dimensional Hilbert space, the dilation involves adding a single infinite dimensional mode, and this is the continuous‐variable version of the Schrödingerization procedure which makes it suitable for analog quantum computing. Furthermore, by discretizing continuous variables, the Schrödingerization method can also be effectively employed in finite‐dimensional scenarios suitable for qubit‐based quantum computing.

Authors

Institutions

Publication Details

Journal
Studies in Applied Mathematics
Published
2025-04-01
DOI
https://doi.org/10.1111/sapm.70047
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dilation Theorem Via Schrödingerization, With Applications to the Quantum Simulation of Differential Equations

Junpeng Hu, Shi Jin, Nana Liu, Lei Zhang
Studies in Applied Mathematics
Quantum Computing Algorithms and Architecture
article

Dilation Theorem Via Schrödingerization, With Applications to the Quantum Simulation of Differential Equations

Junpeng Hu, Shi Jin, Nana Liu, Lei Zhang
article en

Abstract

ABSTRACT Nagy's unitary dilation theorem in the operator theory asserts the possibility of dilating a contraction into a unitary operator. When used in quantum computing, its practical implementation primarily relies on block‐encoding techniques, based on finite‐dimensional scenarios. In this study, we delve into the recently devised Schrödingerization approach and demonstrate its viability as an alternative dilation technique. This approach is applicable to operators in the form of , which arises in wide‐ranging applications, particularly in solving linear ordinary and partial differential equations. Importantly, the Schrödingerization approach is adaptable to both finite‐ and infinite‐dimensional cases, in both countable and uncountable domains. For quantum systems lying in infinite‐dimensional Hilbert space, the dilation involves adding a single infinite dimensional mode, and this is the continuous‐variable version of the Schrödingerization procedure which makes it suitable for analog quantum computing. Furthermore, by discretizing continuous variables, the Schrödingerization method can also be effectively employed in finite‐dimensional scenarios suitable for qubit‐based quantum computing.

Studies in Applied MathematicsVol. 154(4)
Shanghai Jiao Tong University (CN), Beijing Academy of Artificial Intelligence (CN), Shanghai Artificial Intelligence Laboratory (CN)
National Natural Science Foundation of China, Shanghai Jiao Tong University, Fundamental Research Funds for the Central Universities
Openalex Percentile: Top 97%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.