Abstract Entanglement is a fundamental aspect of quantum physics, both conceptually and for its many applications. Classifying an arbitrary multipartite state as entangled or separable—a task referred to as the separability problem—poses a significant challenge, since a state can be entangled with respect to many different of its partitions. We develop a certification pipeline that feeds the statistics of random local measurements into a non-linear dimensionality reduction algorithm, to determine with respect to which partitions a given quantum state is entangled. After training a model on randomly generated quantum states, entangled in different partitions and of varying purity, we verify the accuracy of its predictions on simulated test data, and finally apply it to states prepared on IBM quantum computing hardware.
Abstract Entanglement is a fundamental aspect of quantum physics, both conceptually and for its many applications. Classifying an arbitrary multipartite state as entangled or separable—a task referred to as the separability problem—poses a significant challenge, since a state can be entangled with respect to many different of its partitions. We develop a certification pipeline that feeds the statistics of random local measurements into a non-linear dimensionality reduction algorithm, to determine with respect to which partitions a given quantum state is entangled. After training a model on randomly generated quantum states, entangled in different partitions and of varying purity, we verify the accuracy of its predictions on simulated test data, and finally apply it to states prepared on IBM quantum computing hardware.
Introduction: The scalability of superconducting quantum processors is fundamentally limited by environmental noise and the exponential measurement overhead required for multi-qubit entanglement verification. Methods: In this work, we introduce a hybrid machine learning (ML) framework utilizing convolutional neural networks (CNNs) to simultaneously characterize decoherence channels and verify multipartite entanglement. The model is trained on synthetic noisy syndrome measurement data augmented with empirical SPAM models and applied to a 5-qubit superconducting device, where the neural network acts as a non-linear entanglement witness. Results: sweeps. Furthermore, it successfully verifies genuine multipartite entanglement with a fidelity prediction of 99.1%, while requiring only 12% of the measurement bases demanded by full quantum state tomography (QST). Discussion: Crucially, our methodology bypasses two distinct challenges: it drastically reduces the measurement complexity inherent in multi-qubit entanglement verification, and it inherently filters out state preparation and measurement (SPAM) errors without requiring noise-amplifying matrix inversions. These numerical results demonstrate that ML-assisted protocols provide a highly resource-efficient pathway for the characterization of noisy intermediate-scale quantum (NISQ) devices.
Entanglement plays a pivotal role in numerous quantum applications, and as technology progresses, entanglement systems continue to expand. However, quantifying entanglement is a complex problem, particularly for multipartite quantum states. The currently available entanglement measures suffer from high computational complexity, and for unknown multipartite entangled states, complete information about the quantum state is often necessary, further complicating calculations. In this paper, we train neural networks to quantify unknown multipartite entanglement using input features based on squared entanglement (SE) and outcome statistics data produced by locally measuring target quantum states. By leveraging machine learning techniques to handle non-linear relations between outcome statistics and entanglement measurement SE, we achieve high-precision quantification of unknown multipartite entanglement states with a linear number of measurements, avoiding the need for global measurements and quantum state tomography. The proposed method exhibits robustness against noise and extends its applicability to pure and mixed states, effectively scaling to large-scale multipartite entanglement systems. The results of the experiment show that the predicted entanglement measures are very close to the actual values, which confirms the effectiveness of the proposed method.
Entanglement depth quantifies how many qubits share genuine multipartite entanglement, but certification typically relies on tailored witnesses or full tomography, both of which scale poorly with system size. We recast entanglement-depth and non-k-separability certification as likelihood-based model selection among neural quantum states whose architecture enforces a chosen entanglement constraint. A hierarchy of separable neural quantum states is trained on finite-shot local Pauli outcomes and compared against an unconstrained reference model trained on the same data. When all constrained models are statistically disfavored, the data certify entanglement beyond the imposed limit directly from measurement statistics, without reconstructing the density matrix. We validate the method on simulated six- and ten-qubit datasets targeting GHZ, Dicke, and Bell-pair states, and demonstrate robustness for mixed states under local noise. Finally, we discuss lightweight interpretability diagnostics derived from trained parameters that expose coarse entanglement patterns and qubit groupings directly from bitstring statistics.
The onset of the era of fully-programmable error-corrected quantum computers will be marked by major breakthroughs in all areas of science and engineering. These devices promise to have significant technological and societal impact, notable examples being the analysis of big data through better machine learning algorithms and the design of new materials. Nevertheless, the capacity of quantum computers to faithfully implement quantum algorithms relies crucially on their ability to prepare specific high-dimensional and high-purity quantum states, together with suitable quantum measurements. Thus, the unambiguous certification of these requirements without assumptions on the inner workings of the quantum computer is critical to the development of trusted quantum processors. One of the most important approaches for benchmarking quantum devices is through the mechanism of self-testing that requires a pair of entangled non-communicating quantum devices. Nevertheless, although computation typically happens in a localized fashion, no local self-testing scheme is known to benchmark high dimensional states and measurements. Here, we show that the quantum self-testing paradigm can be employed to an individual quantum computer that is modelled as a programmable black box by introducing a noise-tolerant certification scheme. We substantiate the applicability of our scheme by providing a family of outcome statistics whose observation certifies that the computer is producing specific high-dimensional quantum states and implementing specific measurements.
Abstract With the rapid growth of controllable qubits in recent years, experimental multipartite entangled states can be created with high fidelity in various moderate‐ and large‐scale physical systems. However, the characterization of multipartite entanglement structure remains a formidable challenge, as traditionally it requires exponential number of local measurements to realize the identification. Machine learning is demonstrated to be an efficient tool to detect the underlying entanglement structure for ideal states, but it has non‐negligible underperformance when tackling imperfect experimental data in reality. Here, a modified classifier based on feed‐forward neural network to predict experimental entanglement structure in terms of entanglement intactness and depth is proposed. By preprocessing the input data, the classifier maintains efficiency and reliability against experimental noises, with the accuracy being enhanced from 69.7% to 91.2% for 6‐qubit entangled states in spin systems. This method is anticipated to shed light on future studies of entanglement structure, in particular when the number of controlled qubits reaches explosive growth in practice.
k-entanglement, including entanglement relative to full separability and genuinely multipartite entanglement, is a fundamental quantum resource in multipartite quantum systems. Its identification and quantification play essential roles in quantum information processing, quantum simulation, and quantum metrology. However, the practical computation of rigorous k-entanglement measures remains highly challenging due to the need for high-dimensional optimization. In this work, we propose a machine-learning-based surrogate framework for approximating the witness-based k-entanglement measure Ew(k,n). The numerical evaluation of the computationally realized quantity E˜w(k,n)(ρ) is reformulated as a supervised regression problem, where the input is the density matrix ρ and the labels are obtained from finite witness databases. The framework combines multilayer perceptrons (MLPs), convolutional neural networks (CNNs), and light gradient boosting machine (LightGBM) through a stacking ensemble. Numerical experiments are performed for 3- and 4-qubit systems as representative demonstrations of the proposed workflow. The results show that the learned models achieve high predictive accuracy in terms of MAE, MSE, and R2, while providing millisecond-level inference for single-state evaluation. Werner state tests serve as symmetric benchmark checks, and an additional four-qubit noisy circuit-generated state family, obtained from finite-depth circuit preparation followed by local amplitude-damping noise, is used as a structured physical test beyond random density matrices. Compared with the optimization-based evaluation, the trained surrogate model significantly reduces the computational time while maintaining accuracy within the tested system sizes and data distributions. These results show that the proposed framework provides an efficient numerical surrogate for rapid approximation of witness-based k-entanglement measures, while extensions to larger systems and experimental data require further validation.