31 December 2024 in Advanced Quantum Technologies
Quantum machine learning (QML) shows promise for analyzing quantum data. A notable example is the use of quantum convolutional neural networks (QCNNs), implemented as specific types of quantum circuits, to recognize phases of matter. In this approach, ground states of many‐body Hamiltonians are prepared to form a quantum dataset and classified in a supervised manner using only a few labeled examples. However, this type of dataset and model differs fundamentally from typical QML paradigms based on feature maps and parameterized circuits. In this study, how models utilizing quantum data can be interpreted through hidden feature maps, where physical features are implicitly embedded via ground‐state feature maps is demonstrated. By analyzing selected examples as case studies for understanding QCNNs, it is shown that high performance in quantum phase recognition comes from generating a highly effective basis set with sharp features at critical points. The learning process adapts the measurement to create sharp decision boundaries. The analysis highlights improved generalization when working with quantum data, particularly in the limited‐shots regime. Furthermore, translating these insights into the domain of quantum scientific machine learning, it is demonstrated that ground‐state feature maps can be applied to fluid dynamics problems, expressing shock wave solutions with good generalization and proven trainability.
15 October 2024 in Physical Review A
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 data sets and building explainable artificial intelligence solutions. This task becomes computationally hard for simplicial complexes with over 60 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 multifidelity protocols. Next we develop various postprocessing 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 for near-term device implementations and highlighting the utility of global DOS-based estimators. Published by the American Physical Society 2024
4 March 2025 in Physical Review Materials
We develop a quantum simulation-based approach for studying properties of strongly correlated magnetic materials at increasing scale. We consider a paradigmatic example of a quantum spin liquid (QSL) state hosted by the honeycomb Kitaev model and use a trainable, symmetry-guided ansatz for preparing its ground state. Applying the tools of quantum subspace expansion (QSE), Hamiltonian operator approximation, and overlap measurements, we simulate the QSL at zero temperature and finite magnetic field, thus moving outside of the symmetric subspace. Next, we implement a protocol for quantum subspace expansion-based measurement of spin-spin correlation functions. Finally, we perform QSE-based simulation of the dynamical structure factor obtained from Green's functions of the finite field Kitaev model. Our results show that quantum simulators offer an insight into quasiparticle properties of strongly correlated magnets and can become a valuable tool for studying material science.
4 February 2026 in APL Quantum
We introduce a quantum data embedding protocol based on the preparation of a ground state of a parameterized Hamiltonian. We analyze the corresponding quantum feature map, recasting it as an adiabatic state preparation procedure with Trotterized evolution. We compare the properties of underlying quantum models with ubiquitous Fourier-type quantum models and show that ground state embeddings can be described effectively by a spectrum with a degree that grows rapidly with the number of qubits, corresponding to a large model capacity. We observe that the spectrum contains massive frequency degeneracies and the weighting coefficients for the modes are highly structured, thus limiting model expressivity. Our results provide a step toward understanding models based on quantum data and contribute to fundamental knowledge needed for building efficient quantum machine learning (QML) protocols. As non-trivial embeddings are crucial for designing QML protocols that cannot be simulated classically, our findings guide the search for high-capacity quantum models that can largely outperform classical models.
11 July 2024 in APL Quantum
We provide a quantum protocol to perform topological data analysis (TDA) via the distillation of quantum thermal states. Recent developments in quantum thermal state preparation algorithms reveal their characteristic scaling, defined by the properties of dissipative Lindbladians. This contrasts with protocols based on unitary evolution, which have a scaling depending on the properties of the combinatorial Laplacian. To leverage quantum thermal state preparation algorithms, we translate quantum TDA from a real-time to an imaginary-time picture, shifting the paradigm from a unitary approach to a dissipative one. Starting from an initial state overlapping with the ground state of the system, one can dissipate its energy via channels unique to the dataset, naturally distilling its information. Therefore, calculating Betti numbers translates into a purity estimation. Alternatively, this can be interpreted as the evaluation of the Rényi two-entropy, Uhlmann fidelity, or Hilbert–Schmidt distance relative to thermal states with the embedded topology of simplicial complexes. Our work opens the field of TDA toward a more physical interpretation of the topology of data.
12 November 2025 in Physical Review A
We propose a quantum algorithm for calculating the structural properties of complex networks and graphs. The corresponding protocol——is designed to perform large-scale community and botnet detection, where a specific subgraph of a larger graph is identified based on its properties. We construct a workflow relying on ground state preparation of the network modularity matrix or graph Laplacian. The corresponding maximum modularity vector is encoded into a log 2 ( N ) -qubit register that contains community information. We develop a strategy for “signing” this vector via quantum signal processing, such that it closely resembles a hypergraph state, and project it onto a suitable linear combination of such states to detect botnets. As part of the workflow, and of potential independent interest, we present a readout technique that allows filtering out the incorrect solutions deterministically. This can reduce the scaling for the number of samples from exponential to polynomial. The approach serves as a building block for graph analysis with quantum speedup and enables the cybersecurity of large-scale networks.