Quantum distance approximation for persistence diagrams
Topological data analysis (TDA) methods can be useful for classification and clustering tasks in many different fields as they can provide two dimensional persistence diagrams that summarize important information about the shape of potentially complex and high dimensional data sets. The space of per...
Saved in:
| Main Authors: | Bernardo Ameneyro, Rebekah Herrman, George Siopsis, Vasileios Maroulas |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IOP Publishing
2025-01-01
|
| Series: | Journal of Physics: Complexity |
| Subjects: | |
| Online Access: | https://doi.org/10.1088/2632-072X/ad9fca |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
On the Bootstrap for Persistence Diagrams and Landscapes
by: F. Chazal, et al.
Published: (2013-12-01) -
Two architectures of neural networks in distance approximation
by: Wiktor Wojtyna, et al.
Published: (2025-07-01) -
Parallelizing Quantum Simulation With Decision Diagrams
by: Shaowen Li, et al.
Published: (2024-01-01) -
Solving the Independent Domination Problem by the Quantum Approximate Optimization Algorithm
by: Haoqian Pan, et al.
Published: (2024-12-01) -
Quantum Approximate Optimization Algorithm for the Max-Cut Problem: JavaScript Programming Language Implementation
by: Dmytro Sapozhnyk
Published: (2024-11-01)