Matches in SemOpenAlex for { <https://semopenalex.org/work/W4380136670> ?p ?o ?g. }
Showing items 1 to 67 of
67
with 100 items per page.
- W4380136670 abstract "We consider an inverse problem for a finite graph $(X,E)$ where we are given a subset of vertices $Bsubset X$ and the distances $d_{(X,E)}(b_1,b_2)$ of all vertices $b_1,b_2in B$. The distance of points $x_1,x_2in X$ is defined as the minimal number of edges needed to connect two vertices, so all edges have length 1. The inverse problem is a discrete version of the boundary rigidity problem in Riemannian geometry or the inverse travel time problem in geophysics. We will show that this problem has unique solution under certain conditions and develop quantum computing methods to solve it. We prove the following uniqueness result: when $(X,E)$ is a tree and $B$ is the set of leaves of the tree, the graph $(X,E)$ can be uniquely determined in the class of all graphs having a fixed number of vertices. We present a quantum computing algorithm which produces a graph $(X,E)$, or one of those, which has a given number of vertices and the required distances between vertices in $B$. To this end we develop an algorithm that takes in a qubit representation of a graph and combine it with Grover's search algorithm. The algorithm can be implemented using only $O(|X|^2)$ qubits, the same order as the number of elements in the adjacency matrix of $(X,E)$. It also has a quadratic improvement in computational cost compared to standard classical algorithms. Finally, we consider applications in theory of computation, and show that a slight modification of the above inverse problem is NP-complete: all NP-problems can be reduced to a discrete inverse problem we consider." @default.
- W4380136670 created "2023-06-10" @default.
- W4380136670 creator A5014787639 @default.
- W4380136670 creator A5033210905 @default.
- W4380136670 creator A5043736349 @default.
- W4380136670 creator A5052627284 @default.
- W4380136670 creator A5089271145 @default.
- W4380136670 date "2023-06-08" @default.
- W4380136670 modified "2023-09-24" @default.
- W4380136670 title "Quantum computing algorithms for inverse problems on graphs and an NP-complete inverse problem" @default.
- W4380136670 doi "https://doi.org/10.48550/arxiv.2306.05253" @default.
- W4380136670 hasPublicationYear "2023" @default.
- W4380136670 type Work @default.
- W4380136670 citedByCount "0" @default.
- W4380136670 crossrefType "posted-content" @default.
- W4380136670 hasAuthorship W4380136670A5014787639 @default.
- W4380136670 hasAuthorship W4380136670A5033210905 @default.
- W4380136670 hasAuthorship W4380136670A5043736349 @default.
- W4380136670 hasAuthorship W4380136670A5052627284 @default.
- W4380136670 hasAuthorship W4380136670A5089271145 @default.
- W4380136670 hasBestOaLocation W43801366701 @default.
- W4380136670 hasConcept C11413529 @default.
- W4380136670 hasConcept C114614502 @default.
- W4380136670 hasConcept C118615104 @default.
- W4380136670 hasConcept C121332964 @default.
- W4380136670 hasConcept C132525143 @default.
- W4380136670 hasConcept C137019171 @default.
- W4380136670 hasConcept C148364342 @default.
- W4380136670 hasConcept C149530733 @default.
- W4380136670 hasConcept C180356752 @default.
- W4380136670 hasConcept C203776342 @default.
- W4380136670 hasConcept C207467116 @default.
- W4380136670 hasConcept C2524010 @default.
- W4380136670 hasConcept C33923547 @default.
- W4380136670 hasConcept C62520636 @default.
- W4380136670 hasConcept C84114770 @default.
- W4380136670 hasConceptScore W4380136670C11413529 @default.
- W4380136670 hasConceptScore W4380136670C114614502 @default.
- W4380136670 hasConceptScore W4380136670C118615104 @default.
- W4380136670 hasConceptScore W4380136670C121332964 @default.
- W4380136670 hasConceptScore W4380136670C132525143 @default.
- W4380136670 hasConceptScore W4380136670C137019171 @default.
- W4380136670 hasConceptScore W4380136670C148364342 @default.
- W4380136670 hasConceptScore W4380136670C149530733 @default.
- W4380136670 hasConceptScore W4380136670C180356752 @default.
- W4380136670 hasConceptScore W4380136670C203776342 @default.
- W4380136670 hasConceptScore W4380136670C207467116 @default.
- W4380136670 hasConceptScore W4380136670C2524010 @default.
- W4380136670 hasConceptScore W4380136670C33923547 @default.
- W4380136670 hasConceptScore W4380136670C62520636 @default.
- W4380136670 hasConceptScore W4380136670C84114770 @default.
- W4380136670 hasLocation W43801366701 @default.
- W4380136670 hasOpenAccess W4380136670 @default.
- W4380136670 hasPrimaryLocation W43801366701 @default.
- W4380136670 hasRelatedWork W1590993247 @default.
- W4380136670 hasRelatedWork W2000352218 @default.
- W4380136670 hasRelatedWork W2006315978 @default.
- W4380136670 hasRelatedWork W2064563419 @default.
- W4380136670 hasRelatedWork W2081426440 @default.
- W4380136670 hasRelatedWork W2090130267 @default.
- W4380136670 hasRelatedWork W2143000384 @default.
- W4380136670 hasRelatedWork W2950826653 @default.
- W4380136670 hasRelatedWork W3164874884 @default.
- W4380136670 hasRelatedWork W4280510305 @default.
- W4380136670 isParatext "false" @default.
- W4380136670 isRetracted "false" @default.
- W4380136670 workType "article" @default.