Time complexity analysis of quantum algorithms via linear representations for nonlinear ordinary and partial differential equations (Q6158103): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jcp.2023.112149 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JCP.2023.112149 / rank | |||
Normal rank | |||
Latest revision as of 20:00, 30 December 2024
scientific article; zbMATH DE number 7690222
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Time complexity analysis of quantum algorithms via linear representations for nonlinear ordinary and partial differential equations |
scientific article; zbMATH DE number 7690222 |
Statements
Time complexity analysis of quantum algorithms via linear representations for nonlinear ordinary and partial differential equations (English)
0 references
31 May 2023
0 references
linear representation methods
0 references
Liouville representation
0 references
Koopman-von Neumann representation
0 references
semiclassical Schrödinger equation
0 references
quantum linear systems algorithms
0 references
0 references
0 references
0 references
0 references
0 references
0 references
