Pith. sign in

REVIEW 4 major objections 4 minor 38 references

Krein space quantization and New Quantum Algorithms

T0 review · 4 major / 4 minor · reviewed 2026-08-07 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read This paper claims that singular linear systems Ax=b with det A=0 can be regularized by embedding A in a Krein-space block matrix, solving the enlarged invertible system, and projecting back to the positive subspace.

desk verdict The Krein-space block ansatz reduces to shifted normal-equation regularization, and the paper's own appendix shows the projected solution does not solve the original system for finite μ; no quantum algorithm is actually supplied. read the letter →

arxiv 2505.19632 v1 pith:IKHK36AP submitted 2025-05-26 gr-qc

M.V. Takook This is my paper · ORCID
classification gr-qc MSC 46C2065F2281P68 PACS 03.67.Lx
keywords KreinspaceindefiniteinnerproductquantumalgorithmssingularlinearsystemsregularizationKrein-unitaryevolutionopenambientformalism
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper claims that the indefinite-metric methods developed for quantum Yang-Mills theory and quantum geometry can be turned into quantum algorithms. The specific target is a singular linear system $Ax=b$ with $\det A=0$: instead of inverting $A$ directly, one embeds it in a Krein space as the block matrix $A_K=\begin{pmatrix} A & \mu I \\ \mu I & A\end{pmatrix}$, solves the enlarged invertible system, and projects the solution back onto the positive subspace. Because $\det(A_K)=\det(A-\mu I)\det(A+\mu I)$, any $\mu$ that is not an eigenvalue of $A$ makes the extended problem regular, with $\mu$ acting as a tunable regularization parameter. The same Krein-space picture is offered as a way to handle non-unitary evolution and open quantum systems, where the Hilbert space is incomplete and negative-norm states supply the missing degrees of freedom. A sympathetic reader would care because this promises a single physical principle, an auxiliary sector with opposite metric signature, replacing several ad hoc dilation techniques in quantum computation.

What carries the argument

The load-bearing object is the Krein space $K\equiv H\oplus H^*$ together with its fundamental symmetry $J=P_+-P_-$, which turns the Hilbert inner product into an indefinite inner product $\langle x,y\rangle=(Jx,y)$. The algorithm's core is the block ansatz $A_K=\begin{pmatrix} A & \mu I \\ \mu I & A\end{pmatrix}$, whose off-diagonal coupling $\mu I$ between the positive and negative subspaces makes the determinant factor and vanish only for exceptional $\mu$. Solving the extended system and applying $P_+$ gives the regularized answer, and Krein-unitarity $U^\dagger J U=J$ provides the generalized notion of evolution that lets non-unitary open-system dynamics be represented on the enlarged space. The determinant factorization is the mechanism that carries the invertibility argument.

What would settle it

For the appendix example $A=\begin{pmatrix}1&1\\2&2\end{pmatrix}$, $b=(2,4)^T$, compute $v(\mu)=P_+A_K^{-1}(b,0)^T$ and evaluate the residual $\|Av(\mu)-b\|$ over a range of $\mu\ne0$. The paper's own $\mu=1$ case gives $Av=(2.25,4.5)^T$, so the claim that the system is effectively resolved is settled by whether any $\mu$ drives this residual to zero; if none does, the dilation does not deliver a solution to the original equation.

Watch

Extended reading notes

Core claim

On the paper's own terms, the central discovery is that an ill-posed linear problem can be regularized by changing the ambient inner product rather than by changing the operator. For a matrix $A$ acting on a Hilbert space $H$, the paper defines a Krein-space dilation $A_K=\begin{pmatrix} A & \mu I \\ \mu I & A\end{pmatrix}$ on $K=H\oplus H^*$, where $H^*$ carries the negative-norm sector. The identity $\det(A_K)=\det(A-\mu I)\det(A+\mu I)$ shows that $A_K$ is invertible whenever $\mu$ avoids the eigenvalues of $A$ and $-A$, even if $\det A=0$. The algorithm is to solve $A_K v_K=b_K$ with $b_K=(b,0)$ and set $v=P_+v_K$, where $P_+$ is the projection onto the positive subspace. The paper argues that the same construction covers non-unitary evolution, since a Krein-unitary operator $U$ with $U^\dagger J U=J$, where $J$ is the fundamental symmetry, replaces the ordinary unitary operator on the enlarged space, and it illustrates the whole procedure on a $2\times2$ singular example.

Load-bearing premise

The load-bearing premise is that solving the enlarged block system and then projecting onto the positive part of the Krein space gives a useful solution to the original singular equation; the paper asserts this by example rather than proving it.

Editorial extensions

If this is right

  • Singular linear systems of the form $Ax=b$ with $\det A=0$ acquire a one-parameter family of regularized inverses indexed by $\mu$, obtained from the inverse of the block matrix $A_K$, whenever $\mu$ is not an eigenvalue of $A$ or $-A$.
  • The regularization parameter $\mu$, usually the most costly part of standard approaches, becomes a single tunable coupling between the two sectors, and the paper proposes fixing it by a variational or empirical procedure.
  • Non-unitary evolution of open quantum systems can be represented as Krein-unitary evolution on $H\oplus H^*$, so quantum algorithms that require unitary gates could be extended to dissipative or open dynamics by encoding the Krein dilation.
  • The framework offers a unifying design principle: physical quantum algorithms are built by coupling the system Hilbert space to an auxiliary negative-norm copy, mirroring gauge fixing in quantum field theory.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Beyond the paper: a natural next step is to compute the residual $\|A P_+ A_K^{-1}(b,0)-b\|$ as a function of $\mu$ on random singular matrices; the paper does not analyze the $\mu\to 0$ limit, which would show how the regularized solution relates to the least-squares or pseudoinverse solution.
  • Beyond the paper: because the block dilation doubles the dimension, an implementation would need one auxiliary register whose state is discarded after projection; comparing circuit depth and conditioning with standard dilation methods is a testable extension.
  • Beyond the paper: the coupling $\mu$ between the positive and negative sectors is mathematically analogous to adding a small oscillator degree of freedom with opposite metric, so the stability of the solver as $\mu$ varies is a natural benchmark for numerical methods.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

4 major / 4 minor

Summary. The manuscript proposes to transfer Krein-space quantization methods from quantum field theory and quantum geometry to quantum computation. The concrete algorithmic proposal is to solve a singular or ill-conditioned linear system Ax=b by embedding A into the block matrix A_K = [[A, μI],[μI,A]], solving the extended linear system A_K v_K = b_K with b_K=(b,0), and then projecting v_K onto the positive subspace to obtain a regularized solution. The central claim, stated in Section 6, is that this Krein-space dilation effectively resolves systems with det(A)=0. The paper includes a two-dimensional example in Appendix A and presents a review of relevant material from gauge theory, Gribov ambiguity, pseudoinverses, and unitary dilation methods.

Significance. If the proposed regularization actually produced a useful solution of singular linear systems and led to a genuine quantum algorithm, the paper could be a significant step toward a unified framework for quantum algorithms. The paper also usefully assembles analogies between gauge fixing, Gribov ambiguity, and regularization in numerical linear algebra. However, the central algorithmic claim is not supported by the manuscript's own algebra and example; the projected solution is not a solution for any finite regularization parameter, and no quantum circuit, state encoding, or complexity analysis is provided. The review sections are standard textbook material, and the Krein-space formalism is not used to enforce any condition in the derivation. The significance is therefore currently limited to a suggestive but unsubstantiated research direction.

major comments (4)
  1. [Section 5.4 and Appendix A (Eqs. A.4–A.7)] The projected solution does not solve the original system for any finite μ. Block elimination in the extended system gives v = P_+ A_K^{-1} b_K = (A^2 − μ^2 I)^{-1} A b whenever A^2 − μ^2 I is invertible. For a singular A with b in its range, write A = Σ_i λ_i P_i; then the projected vector has components [λ_i^2/(λ_i^2 − μ^2)] x_i^* on nonzero modes and zero on null modes. Equality with a true solution would require μ = 0, in which case A_K is singular and the formula is undefined. The manuscript's own example confirms this: for A = [[1,1],[2,2]], b = (2,4), and μ=1, the projected vector is v = (0.75, 1.5), but A v = (2.25, 4.5) differs from b. Hence the Section 6 claim that such systems are 'effectively resolved' through Krein-space dilation is false as stated.
  2. [Section 5.4 and Eq. (A.5)] The determinant assertion is incorrect. The paper claims det(A_K) = det(A − μI) det(A + μI) ≠ 0 for any nonzero μ, but this fails whenever μ equals an eigenvalue of A (with the appropriate sign). The correct condition is that μ be chosen outside the spectrum of A. This particular defect is repairable, but the repair does not address the non-solution problem identified in the previous comment, because even with μ outside the spectrum the projected vector is not a solution.
  3. [Sections 5 and 6] No quantum algorithm is actually specified. The manuscript gives no state preparation procedure, no block-encoding or oracle model, no quantum circuit, no qubit count, no gate complexity, and no error analysis. The block construction A_K amounts to a shifted normal-equation regularization that is purely classical linear algebra, and the paper does not explain how one would implement the inverse of A_K or the projection P_+ on a quantum computer. Thus the advertised 'new quantum algorithms' content is unsupported.
  4. [Section 5.4 and Appendix A] The regularization parameter μ is a free parameter whose optimal value is to be determined empirically or variationally, with the details deferred to a forthcoming paper (reference [31]). Since the output depends explicitly on the fitted μ, the method is not a parameter-free resolution, and no criterion is supplied that would select μ so that the projected vector approximates the desired solution. Moreover, the Krein-space structure (fundamental symmetry, Krein-unitarity) plays no role in the derivation; the ansatz is simply a block matrix dilation, and the claimed conceptual link to Krein-space quantization is not operational.
minor comments (4)
  1. [Throughout] The citation formatting is severely garbled, with placeholders like '[ /one.taboldstyle]' appearing in the text; the manuscript requires a thorough editorial pass to restore standard numbering.
  2. [Eq. (3.4)] The unitary dilation formula uses the defect operators sqrt(I − A A†) and sqrt(I − A† A) without specifying the assumptions on A (e.g., contractivity) or the branch of the square root; these conditions should be stated explicitly.
  3. [Section 3] The sentence 'the inverse of the matrix Σ does not exist, and consequently, the matrix A is not unitary' conflates non-invertibility with non-unitarity; since a singular matrix cannot be unitary, the conclusion is true but the stated reasoning is imprecise.
  4. [Appendix A] The phrase '1-qubit' is used for a two-dimensional system; this is acceptable, but the terminology could be clarified to avoid confusion between 'one qubit' and 'one level.'

Circularity Check

2 steps flagged · score 6.0 of 10

The Krein-space 'solution' is a μ-parametrized fit: block elimination gives v=(A^2−μ^2I)^{-1}A b, with μ to be chosen empirically/variationally and its selection deferred to a forthcoming self-citation; finite-μ projection does not solve Ax=b.

  1. fitted input called prediction [Section 5 (Eq. 5.4) and Appendix A (Eqs. A.4–A.7)]
    "The parameter μ is a free variable, referred to as the regularization parameter, which can be adjusted to ensure det A_K ≠ 0 ... The parameter μ can be optimized to achieve the best fit with observational data; this will be discussed in detail in a forthcoming paper [31]. ... The parameter μ acts as a tunable regularization parameter. Its optimal value can be determined empirically, or through variational techniques, depending on the physical or computational context."

    Block elimination of (5.4) with b_K=(b,0) gives v=P_+A_K^{-1}b_K=(A^2-μ^2I)^{-1}A b. Thus the 'physical solution' is literally a one-parameter family of regularized vectors indexed by μ. No equation in the paper selects μ so that Av=b; the Appendix's own example (μ=1, A=[[1,1],[2,2]], b=(2,4)) yields v=(0.75,1.5), Av=(2.25,4.5)≠b. The output is therefore determined by an empirically or variationally fitted parameter rather than derived from the problem data; calling it a solution or prediction reduces to the fit.

  2. self citation load bearing [Section 5, after Eq. (5.4); Reference [31]]
    "The parameter μ can be optimized to achieve the best fit with observational data; this will be discussed in detail in a forthcoming paper [31]. [31] M.V. Takook, A.M. Djafari, (2024) Quantum Computation Through Dilation into Krein Space, in preparation."

    The central algorithm needs a rule for choosing μ so that the projected vector solves Ax=b; that rule is not given, and the paper explicitly delegates it to a forthcoming paper by the same authors ([31]). The load-bearing step of the method is therefore supported only by an in-preparation self-citation. Since no external, machine-checked, or independently reproduced criterion is supplied, the claimed resolution of singular systems via Krein dilation depends on this self-citation chain.

full rationale

The paper's advertised result, that singular linear systems Ax=b, det A=0, are 'effectively resolved' by Krein-space dilation, is not supported by an independent derivation. The actual map from the construction is v=(A^2−μ^2I)^{-1}A b, a standard shifted normal-equation regularization. In the paper's own example the projected vector does not satisfy Ax=b for the chosen μ, and algebraically no finite μ with A_K invertible can make v solve Ax=b when b is in the range of A; the residual is O(μ^2) on nonzero modes. The only proposed way to fix μ is empirical or variational fitting, so the 'solution' reduces to a fitted parameter rather than a predicted one. The crucial fitting procedure is additionally deferred to a forthcoming self-citation [31], making the central premise depend on a self-citation chain. The Krein-space physics citations are mostly decorative and not themselves load-bearing, and the false claim that det A_K≠0 for every nonzero μ (it fails when μ is an eigenvalue of A) is a repairable algebraic error rather than circularity. No quantum circuit, encoding, complexity bound, error analysis, or external benchmark is provided, so the paper cannot be credited with an independent algorithm result. Score 6 reflects central-claim reduction to a fit plus a load-bearing self-citation.

Assumptions & free parameters 1 free parameters · 3 assumptions · 0 invented entities

The central construction depends on one free parameter μ and on an unproved ansatz linking singular systems to a block matrix. The paper does not derive the ansatz from Krein-space principles; it labels a matrix dilation as Krein quantization.

free parameters (1)
  • μ (regularization/coupling parameter) = unspecified; empirical or variational
    Controls invertibility of A_K and the projected solution; the paper says the optimal value is determined empirically or variationally, so results depend on a fitted number.
assumptions (3)
  • standard math det [[A, μI],[μI,A]] = det(A-μI)det(A+μI), and choosing μ avoids zero determinants
    Used in Section 5, Eq. (5.4) area, to claim invertibility; the factorization is standard for commuting blocks, but the paper overstates it by saying any nonzero μ works.
  • ad hoc to paper The extended system with b_K=(b,0) and projection P_+ gives a meaningful regularized solution to Ax=b
    Central ansatz (Eqs. 5.4, A.4, A.7); no theorem supports it, and the Appendix example contradicts it for finite μ.
  • domain assumption Krein-unitary and Krein-Hermitian conditions (Eqs. 5.2-5.3) are relevant to constructing the quantum algorithm
    The paper introduces these definitions but the final construction never enforces them, so the link is asserted rather than used.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Krein space quantization and New Quantum Algorithms." pith.science (2026). https://pith.science/paper/IKHK36AP

@misc{pith2026250519632,
  author       = {Pith},
  title        = {Pith review of: Krein space quantization and New Quantum Algorithms},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/IKHK36AP}},
  note         = {Machine review of arXiv:2505.19632}
}
read the original 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.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

38 extracted references · 29 canonical work pages

  1. [31]

    Takook, A.M

    M.V. Takook, A.M. Djafari, (2024) Quantum Computation Through Dilation into Krein Space, in preparation

    work page 2024

  2. [1]

    Quantum states and quantum computing

    M.V. Takook, A.M. Djafari, MaxEnt2024 https://easychair.org/publications/preprint/V7LP (2024) Quantum states and quantum computing, [arXiv:2409.15285] https://arxiv.org/abs/2409.15285

    work page Pith review arXiv 2024

  3. [2]

    Scalar and vector gauges unification in de Sitter ambient space formalism

    M.V. Takook, https://www.sciencedirect.com/science/article/pii/S0550321322003170 Nucl. Phys. B 984 115966 (2022) Scalar and vector gauges unification in de Sitter ambient space formalism, [arXiv:2204.00314] https://arxiv.org/abs/2204.00314

    work page Pith review arXiv 2022

  4. [3]

    Axiomatic de Sitter quantum Yang-Mills theory with color confinement and mass gap

    M.V. Takook, Europhys. Lett. 1410 22003 (2023) Axiomatic de Sitter quantum Yang-Mills theory with color confinement and mass gap, [arXiv:2211.16060 https://arxiv.org/abs/2211.16060]

    work page Pith review arXiv 2023

  5. [4]

    Quantum de Sitter geometry

    M.V. Takook, https://www.mdpi.com/2218-1997/10/2/70 Universe 10 70 (2024) Quantum de Sitter geometry, [arXiv:2304.05608] https://arxiv.org/abs/2304.05608

    work page Pith review arXiv 2024

  6. [5]

    Takook, J.P

    M.V. Takook, J.P. Gazeau, https://doi.org/10.1016/j.nuclphysb.2022.115811 Nucl. Phys. B 980 115811 (2022) Quantum Yang-Mills theory in de Sitter ambient space formalism, [arXiv:2112.02651v2 https://arxiv.org/abs/2112.02651v2]

    work page arXiv 2022

  7. [6]

    Gupta-Bleuler quantization for minimally coupled scalar fields in de Sitter space

    J.P. Gazeau, J. Renaud, M.V. Takook, Class. Quant. Grav. 17 , 1415 (2000) Gupta-Bleuler quantization for a minimally coupled scalar field in de Sitter space, [gr-qc/9904023 http://arxiv.org/abs/gr-qc/9904023]

    work page Pith review arXiv 2000

  8. [7]

    Quantum Field Theory in de Sitter Universe: Ambient Space Formalism

    M.V. Takook, (2014) Quantum Field Theory in de Sitter Universe: Ambient Space Formalism, [arXiv:1403.1204v3 http://arxiv.org/abs/1403.1204v3]

    work page Pith review arXiv 2014

Show all 38 references
  1. [8]

    Antoniadis, E

    I. Antoniadis, E. Mottola, Phys. Rev. D 45 2013 (1992) Four-dimensional quantum gravity in the conformal sector

    1992

  2. [9]

    Antoniadis, P.O

    I. Antoniadis, P.O. Mazur, E. Mottola, Phys. Rev. D 55 4770 (1997) Physical States of the Quantum Conformal Factor , [hep-th/9509169 https://arxiv.org/abs/hep-th/9509169]

    1997 arXiv

  3. [10]

    Weinberg, The University of Chicago Press (1984) Gravitation and Cosmology: Principles and Applications of the General Theory of Relativity

    S. Weinberg, The University of Chicago Press (1984) Gravitation and Cosmology: Principles and Applications of the General Theory of Relativity

    1984

  4. [11]

    Birrell, P.C.W

    N.D. Birrell, P.C.W. Davies, Cambridge University Press (1982) Quantum Fields in Curved Space

    1982

  5. [12]

    Takook, J.P

    M.V. Takook, J.P. Gazeau, E. Huget, https://www.mdpi.com/2218-1997/9/9/379 Universe 9 379 (2023) Asymptotic states and S-matrix operator in de Sitter ambient space formalism , [arXiv:2304.04756] https://arxiv.org/abs/2304.04756

    2023 arXiv

  6. [13]

    Takook, Mod

    M.V. Takook, Mod. Phys. Lett. A 37 , 2250059 (2022) Krein regularization method , [arXiv:2112.05390 https://arxiv.org/abs/2112.05390]

    2022 arXiv

  7. [14]

    Portugal (2023) Basic Quantum Algorithms [arXiv:2201.10574] https://arxiv.org/abs/2201.10574

    R. Portugal (2023) Basic Quantum Algorithms [arXiv:2201.10574] https://arxiv.org/abs/2201.10574

    2023 arXiv

  8. [15]

    Baulieu, J

    L. Baulieu, J. Iliopoulos, R. Senior, Oxford University Press (2017) Quantum field theory From Classical to Quantum Fields

    2017

  9. [16]

    Strocchi, World Scientific Publishing (1993) General properties of quantum field theory

    F. Strocchi, World Scientific Publishing (1993) General properties of quantum field theory

    1993

  10. [17]

    Nielsen, I.L

    M.A. Nielsen, I.L. Chuang, Cambridge University Press (2010) Quantum Computation and Quantum Information

    2010

  11. [18]

    Schlimgen et al., Phys

    A.W. Schlimgen et al., Phys. Rev. 106 , 022414 (2022) Quantum state preparation and nonunitary evolution with diagonal operators, [arXiv:2205.02826] https://arxiv.org/abs/2205.02826

    2022 arXiv

  12. [19]

    Delgado-Granados et al., (2024) Quantum Algorithms and Applications for Open Quantum Systems, [arXiv:2406.05219] https://arxiv.org/abs/2406.05219

    L.H. Delgado-Granados et al., (2024) Quantum Algorithms and Applications for Open Quantum Systems, [arXiv:2406.05219] https://arxiv.org/abs/2406.05219

    2024 arXiv

  13. [20]

    M.V. Takook, (2020) Conceptual Challenges of Quantum Engineering Technology, paper is available in research gate, DOI:10.13140/RG.2.2.25566.05449 https://www.researchgate.net/publication/343797258_Conceptual_Challenges_of_Quantum_Engineering_Technology

    2020

  14. [21]

    Weinberg, Cambridge University Press (1995) The Quantum Theory of Fields I

    S. Weinberg, Cambridge University Press (1995) The Quantum Theory of Fields I

    1995

  15. [22]

    Iliopoulos, T.N

    J. Iliopoulos, T.N. Tomaras, N.C. Tsamis, R.P. Woodard, Nucl. Phys. B 534 419 (1998) Perturbative Quantum Gravity And Newton's Law On A Flat Robertson-Walker Background, [arXiv:gr-qc/9801028] https://arxiv.org/abs/gr-qc/9801028

    1998 arXiv

  16. [23]

    Takook, (2017) de Sitter super-gravity in ambient space formalism, [arXiv:1712.09735v1] http://arxiv.org/abs/1712.09735v1

    M.V. Takook, (2017) de Sitter super-gravity in ambient space formalism, [arXiv:1712.09735v1] http://arxiv.org/abs/1712.09735v1

    2017 arXiv

  17. [24]

    A. Gily\'en et al., (2018) Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics, [arXiv:1806.01838v1] http://arxiv.org/abs/1806.01838v1

    2018 arXiv

  18. [25]

    Martyn et al., PRX Quantum 2 040203 (2021) A Grand Unification of Quantum Algorithms, [arXiv: 2105.02859v5] https://arxiv.org/abs/2105.02859

    J.M. Martyn et al., PRX Quantum 2 040203 (2021) A Grand Unification of Quantum Algorithms, [arXiv: 2105.02859v5] https://arxiv.org/abs/2105.02859

    2021 arXiv

  19. [26]

    Harrow, A

    A.W. Harrow, A. Hassidim, and S. Lloyd, Phys. Rev. Lett. 15 150502 (2009) Quantum algorithm for linear systems of equations, [arXiv:0811.3171v3] https://arxiv.org/abs/0811.3171v3

    2009 arXiv

  20. [27]

    E. K. Oh et al., ACS Physical Chemistry Au 4 393 (2024) Singular value decomposition quantum algorithm for quantum biology [arXiv:2309.17391] https://arxiv.org/abs/2309.17391

    2024 arXiv

  21. [28]

    Schlimgen et al., Phys

    A.W. Schlimgen et al., Phys. Rev. Lett. 127 270503 (2021) Quantum Simulation of Open Quantum Systems Using a Unitary Decomposition of Operators, [arXiv:2106.12588] https://arxiv.org/abs/2106.12588

    2021 arXiv

  22. [29]

    Djafari, (2000) Problemes inverse, Cours du DEA Automatique et Traitement du Signal

    A.M. Djafari, (2000) Problemes inverse, Cours du DEA Automatique et Traitement du Signal

    2000

  23. [30]

    Shao and H

    C. Shao and H. Xiang, (2018) Quantum Regularized Least Squares Solver with Parameter Estimate [arXiv:1812.09934v1] https://arxiv.org/abs/1812.09934v1

    2018 arXiv

  24. [32]

    Lee, H.-S

    D. Lee, H.-S. Lee, J. Yi (2025) Synaptic Field Theory for Neural Networks, [arXiv.2503.08827] https://arxiv.org/abs/2503.08827

    2025 arXiv

  25. [33]

    M.V. Takook, www.researchgate.net/publication/381672845 https://www.researchgate.net/publication/381672845_Fundamental_concepts_of_quantum_theory (2020) Fundamental concepts of quantum theory

    2020

  26. [34]

    F. Swiadek et al, (2023) Enhancing Dispersive Readout of Superconducting Qubits Through Dynamic Control of the Dispersive Shift: Experiment and Theory , [arXiv:2307.07765] https://arxiv.org/abs/2307.07765

    2023 arXiv

  27. [35]

    Kadu and T

    A. Kadu and T. van Leeuwen, (2018) A Convex Formulation for Binary Tomography, arXiv:1807.09196v3

    2018 arXiv

  28. [36]

    Schuld and N

    M. Schuld and N. Killoran, PRL (2019) Quantum machine learning in feature Hilbert spaces, [arXiv:1803.07128v1] https://arxiv.org/abs/1803.07128

    2019 arXiv

  29. [37]

    Zihua Chai et al., (2024) Quantum Anomaly Detection with a Spin Processor in Diamond, arXiv:2201.10263v2

    2024 arXiv

  30. [38]

    Bowles, S

    J. Bowles, S. Ahmed, and M. Schuld (2024) Better than classical? The subtle art of benchmarking quantum machine learning models, arXiv:2403.07059v2

    2024 arXiv

Pith tools

Reviewed August 7, 2026 · model on record in the stance chip above.