Quantum topological data analysis via the estimation of the density of states

• URL: http://arxiv.org/abs/2312.07115v1
• Date: Tue, 12 Dec 2023 09:43:04 GMT
• Title: Quantum topological data analysis via the estimation of the density of states
• Authors: Stefano Scali, Chukwudubem Umeano, Oleksandr Kyriienko
• Abstract summary: We develop a quantum topological data analysis protocol based on the estimation of the density of states (DOS) of the Laplacian. We test our protocol on noiseless and noisy quantum simulators and run examples on IBM quantum processors.
• Score: 17.857341127079305
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We develop a quantum topological data analysis (QTDA) protocol based on the estimation of the density of states (DOS) of the combinatorial Laplacian. Computing topological features of graphs and simplicial complexes is crucial for analyzing datasets and building explainable AI solutions. This task becomes computationally hard for simplicial complexes with over sixty vertices and high-degree topological features due to a combinatorial scaling. We propose to approach the task by embedding underlying hypergraphs as effective quantum Hamiltonians and evaluating their density of states from the time evolution. Specifically, we compose propagators as quantum circuits using the Cartan decomposition of effective Hamiltonians and sample overlaps of time-evolved states using multi-fidelity protocols. Next, we develop various post-processing routines and implement a Fourier-like transform to recover the rank (and kernel) of Hamiltonians. This enables us to estimate the Betti numbers, revealing the topological features of simplicial complexes. We test our protocol on noiseless and noisy quantum simulators and run examples on IBM quantum processors. We observe the resilience of the proposed QTDA approach to real-hardware noise even in the absence of error mitigation, showing the promise to near-term device implementations and highlighting the utility of global DOS-based estimators.

Related papers

• Simulating the Fermi-Hubbard model with long-range hopping on a quantum computer [0.0]
  We provide quantum circuits to perform ground and excited states calculations. We benchmark our approach on a chain with L=6 sites and periodic boundary conditions.
  arXiv  Detail & Related papers  (2024-10-10T10:19:02Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [63.733312560668274]
  Given a quantum circuit containing d tunable RZ gates and G-d Clifford gates, can a learner perform purely classical inference to efficiently predict its linear properties? We prove that the sample complexity scaling linearly in d is necessary and sufficient to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d. We devise a kernel-based learning model capable of trading off prediction error and computational complexity, transitioning from exponential to scaling in many practical settings.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Higher-order topological kernels via quantum computation [68.8204255655161]
  Topological data analysis (TDA) has emerged as a powerful tool for extracting meaningful insights from complex data. We propose a quantum approach to defining Betti kernels, which is based on constructing Betti curves with increasing order.
  arXiv  Detail & Related papers  (2023-07-14T14:48:52Z)
• Importance sampling for stochastic quantum simulations [68.8204255655161]
  We introduce the qDrift protocol, which builds random product formulas by sampling from the Hamiltonian according to the coefficients. We show that the simulation cost can be reduced while achieving the same accuracy, by considering the individual simulation cost during the sampling stage. Results are confirmed by numerical simulations performed on a lattice nuclear effective field theory.
  arXiv  Detail & Related papers  (2022-12-12T15:06:32Z)
• Resource-frugal Hamiltonian eigenstate preparation via repeated quantum phase estimation measurements [0.0]
  Preparation of Hamiltonian eigenstates is essential for many applications in quantum computing. We adopt ideas from variants of this method to implement a resource-frugal iterative scheme. We characterise an extension involving a modification of the target Hamiltonian to increase overall efficiency.
  arXiv  Detail & Related papers  (2022-12-01T20:07:36Z)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43:16Z)
• Efficient protocol for solving combinatorial graph problems on neutral-atom quantum processors [0.0]
  We propose a novel protocol for solving hard graph problems that combines variational quantum computing and machine learning. Our numerical simulations show that the proposed protocol can reduce dramatically the number of iterations to be run on the quantum device.
  arXiv  Detail & Related papers  (2022-07-26T16:40:14Z)
• Efficient and robust estimation of many-qubit Hamiltonians [0.0]
  Characterizing the interactions and dynamics of quantum mechanical systems is an essential task in development of quantum technologies. We propose an efficient protocol for characterizing the underlying Hamiltonian dynamics and the noise of a multi-qubit device. This protocol can be used to parallelize to learn the Hamiltonian, rendering it applicable for the characterization of both current and future quantum devices.
  arXiv  Detail & Related papers  (2022-05-19T13:52:32Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Quantum Sampling Algorithms, Phase Transitions, and Computational Complexity [0.0]
  Drawing independent samples from a probability distribution is an important computational problem with applications in Monte Carlo algorithms, machine learning, and statistical physics. The problem can in principle be solved on a quantum computer by preparing a quantum state that encodes the entire probability distribution followed by a projective measurement. We investigate the complexity of adiabatically preparing such quantum states for the Gibbs distributions of various models including the Ising chain, hard-sphere models on different graphs, and a model encoding the unstructured search problem.
  arXiv  Detail & Related papers  (2021-09-07T11:43:45Z)
• Gaussian Process States: A data-driven representation of quantum many-body physics [59.7232780552418]
  We present a novel, non-parametric form for compactly representing entangled many-body quantum states. The state is found to be highly compact, systematically improvable and efficient to sample. It is also proven to be a universal approximator' for quantum states, able to capture any entangled many-body state with increasing data set size.
  arXiv  Detail & Related papers  (2020-02-27T15:54:44Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.