Krein space quantization and new quantum algorithms

Krein space quantization and the ambient space formalism have been successfully applied to address challenges in quantum geometry (e.g. quantum gravity) and the axiomatic formulation of quantum Yang–Mills theory, including phenomena such as color confinement and the mass gap. Building on these advancements, we aim to extend these methods to develop novel quantum algorithms for quantum computation, particularly targeting underdetermined or ill-conditioned linear systems of equations, as well as quantum systems characterized by non-unitary evolution and open quantum dynamics. This approach represents a significant step beyond commonly used techniques, such as Quantum Singular Value Decomposition, Sz.-Nagy dilation, and Unitary Operator Decomposition. The proposed algorithm has the potential to establish a unified framework for quantum algorithms.

Authors

Institutions

Publication Details

Journal
Modern Physics Letters A
Published
2025-05-19
DOI
https://doi.org/10.1142/s0217732325500889
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Krein space quantization and new quantum algorithms

M. V. Takook
Modern Physics Letters A
Quantum Computing Algorithms and Architecture
article

Krein space quantization and new quantum algorithms

M. V. Takook
article en

Abstract

Krein space quantization and the ambient space formalism have been successfully applied to address challenges in quantum geometry (e.g. quantum gravity) and the axiomatic formulation of quantum Yang–Mills theory, including phenomena such as color confinement and the mass gap. Building on these advancements, we aim to extend these methods to develop novel quantum algorithms for quantum computation, particularly targeting underdetermined or ill-conditioned linear systems of equations, as well as quantum systems characterized by non-unitary evolution and open quantum dynamics. This approach represents a significant step beyond commonly used techniques, such as Quantum Singular Value Decomposition, Sz.-Nagy dilation, and Unitary Operator Decomposition. The proposed algorithm has the potential to establish a unified framework for quantum algorithms.

Modern Physics Letters AVol. 40(25)
Université Paris Cité (FR), Sorbonne Paris Cité (FR)
Openalex Percentile: Top 95%
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.