Entanglement detection with quantum support vector machine(QSVM) on near-term quantum devices
- URL: http://arxiv.org/abs/2503.23443v2
- Date: Wed, 09 Apr 2025 11:13:35 GMT
- Title: Entanglement detection with quantum support vector machine(QSVM) on near-term quantum devices
- Authors: M. Mahdian, Z. Mousavi,
- Abstract summary: This study presents the implementation of quantum support vector machines (QSVMs) on IBM quantum devices to identify and classify entangled states.<n>Our results demonstrate that the QSVM framework achieves over 90% accuracy in distinguishing entangled states, despite hardware noise.<n>This work marks a significant advancement in quantum machine learning for entanglement detection.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Detecting and quantifying quantum entanglement remain significant challenges in the noisy intermediate-scale quantum (NISQ) era. This study presents the implementation of quantum support vector machines (QSVMs) on IBM quantum devices to identify and classify entangled states. By employing quantum variational circuits, the proposed framework achieves a runtime complexity of $O(\frac{N t}{\epsilon^2})$, where $N$ is the number of qubits, $t$ is the number of iterations, and $\epsilon$ is the acceptable error margin. We investigate various quantum circuits with multiple blocks and obtain the accuracy of QSVM as measures of expressibility and entangling capability. Our results demonstrate that the QSVM framework achieves over 90\% accuracy in distinguishing entangled states, despite hardware noise such as decoherence and gate errors. Benchmarks across superconducting qubit platforms (e.g., IBM Perth, Lagos, and Nairobi) highlight the robustness of the model. Furthermore, the QSVM framework effectively classifies two-qubit states and extends its predictive capabilities to three-qubit entangled states. This work marks a significant advancement in quantum machine learning for entanglement detection.
Related papers
- Simultaneous estimations of quantum state and detector through multiple quantum processes [4.782967012381978]
We introduce a framework, in two different bases, that utilizes multiple quantum processes to simultaneously identify a quantum state and a detector.<n>We prove that the mean squared error (MSE) scales as $O(1/N) $ for both QST and QDT, where $N $ denotes the total number of state copies.
arXiv Detail & Related papers (2025-02-17T13:02:36Z) - Extending Quantum Perceptrons: Rydberg Devices, Multi-Class Classification, and Error Tolerance [67.77677387243135]
Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML)
At the core of QNC is the quantum perceptron (QP), which leverages the analog dynamics of interacting qubits to enable universal quantum computation.
arXiv Detail & Related papers (2024-11-13T23:56:20Z) - Quantum subspace expansion in the presence of hardware noise [0.0]
Finding ground state energies on current quantum processing units (QPUs) continues to pose challenges.
Hardware noise severely affects both the expressivity and trainability of parametrized quantum circuits.
We show how to integrate VQE with a quantum subspace expansion, allowing for an optimal balance between quantum and classical computing capabilities and costs.
arXiv Detail & Related papers (2024-04-14T02:48:42Z) - Mitigating Errors on Superconducting Quantum Processors through Fuzzy
Clustering [38.02852247910155]
A new Quantum Error Mitigation (QEM) technique uses Fuzzy C-Means clustering to specifically identify measurement error patterns.
We report a proof-of-principle validation of the technique on a 2-qubit register, obtained as a subset of a real NISQ 5-qubit superconducting quantum processor.
We demonstrate that the FCM-based QEM technique allows for reasonable improvement of the expectation values of single- and two-qubit gates based quantum circuits.
arXiv Detail & Related papers (2024-02-02T14:02:45Z) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - Delegated variational quantum algorithms based on quantum homomorphic
encryption [69.50567607858659]
Variational quantum algorithms (VQAs) are one of the most promising candidates for achieving quantum advantages on quantum devices.
The private data of clients may be leaked to quantum servers in such a quantum cloud model.
A novel quantum homomorphic encryption (QHE) scheme is constructed for quantum servers to calculate encrypted data.
arXiv Detail & Related papers (2023-01-25T07:00:13Z) - Iterative Qubits Management for Quantum Index Searching in a Hybrid
System [56.39703478198019]
IQuCS aims at index searching and counting in a quantum-classical hybrid system.
We implement IQuCS with Qiskit and conduct intensive experiments.
Results demonstrate that it reduces qubits consumption by up to 66.2%.
arXiv Detail & Related papers (2022-09-22T21:54:28Z) - Universal expressiveness of variational quantum classifiers and quantum
kernels for support vector machines [0.0]
We show that variational quantum classifiers (VQC) and support vector machines with quantum kernels (QSVM) can solve a classification problem based on the k-Forrelation problem.
Our results imply that there exists a feature map and a quantum kernel that make VQC and QSVM efficient solvers for any BQP problem.
arXiv Detail & Related papers (2022-07-12T22:03:31Z) - Quantum Support Vector Machine without Iteration [17.384061512750158]
This paper proposes a quantum support vector machine (LS-QSVM) based on the generalized quantum amplitude estimation (AE-QSVM)
Experiments demonstrate that AE-QSVM is advantageous in terms of training matrix, the number of iterations, space complexity, and time complexity.
arXiv Detail & Related papers (2022-06-02T07:57:39Z) - Efficient Bipartite Entanglement Detection Scheme with a Quantum
Adversarial Solver [89.80359585967642]
Proposal reformulates the bipartite entanglement detection as a two-player zero-sum game completed by parameterized quantum circuits.
We experimentally implement our protocol on a linear optical network and exhibit its effectiveness to accomplish the bipartite entanglement detection for 5-qubit quantum pure states and 2-qubit quantum mixed states.
arXiv Detail & Related papers (2022-03-15T09:46:45Z) - Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
We propose a resource and runtime efficient scheme termed quantum architecture search (QAS)
QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates.
We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
arXiv Detail & Related papers (2020-10-20T12:06:27Z)
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.