arXiv:2410.21258
Quantum computing and persistence in topological data analysis
원문 초록
Topological data analysis (TDA) aims to extract noise-robust features from a data set by examining the number and persistence of holes in its topology. We show that a computational problem closely related to a core task in TDA -- determining whether a given hole persists across different length scales -- is $\mathsf{BQP}_1$-hard and contained in $\mathsf{BQP}$. This result implies an exponential quantum speedup for this problem under standard complexity-theoretic assumptions. Our approach relies on encoding the persistence of a hole in a variant of the guided sparse Hamiltonian problem, where the guiding state is constructed from a harmonic representative of the hole.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Comparing the Effects of Persistence Barcodes Aggregation and Feature Concatenation on Medical Imaging
Topological Machine Learning for Protein-Nucleic Acid Binding Affinity Changes Upon Mutation
Topology across Scales on Heterogeneous Cell Data
Short-PHD: Detecting Short LLM-generated Text with Topological Data Analysis After Off-topic Content Insertion
A Topological Data Analysis Framework for Quantifying Necrosis in Glioblastomas
Persistent Homology-induced Graph Ensembles for Time Series Regressions
토론
이 논문과 연결된 포럼 글이 아직 없습니다.