Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1909.05596 · Quantum Machine Intelligence

Nondestructive classification of quantum states using an algorithmic quantum computer

Бабухин Данила Валерьевич, A. A. Zhukov, W. V. Pogosov

Published Nov 6, 2019• 7 citations
arXivHTMLPDF
DOI
10.1007/s42484-019-00010-9

Related papers

Experimental realization of nondestructive discrimination of Bell states using a five-qubit quantum computer

Mitali Sisodia, Abhishek Shukla, Anirban Pathak

arXiv:1705.00670•Physics Letters A•Oct 13, 2017•61 citations

Nondestructive discrimination of a new family of highly entangled states in IBM quantum computer

Saipriya Satyajit, Karthik Srinivasan, Bikash K. Behera +1 more

arXiv:1712.05485•Quantum Information Processing•Jul 15, 2018•40 citations

Phase estimation algorithm for quantum states classification with NISQ devices

Бабухин Данила Валерьевич, A. A. Zhukov, W. V. Pogosov

Methods of processing quantum data become more important as quantum computing devices improve their quality towards fault tolerant universal quantum computers. These methods include discrimination and filtering of quantum states given as an input to the device that may find numerous applications in quantum information technologies. In the present paper, we address a scheme of a classification of input states, which is nondestructive and deterministic for certain inputs, while probabilistic, in general case. This can be achieved by incorporating phase estimation algorithm into the hybrid quantum-classical computation scheme, where quantum block is trained classically. We perform proof-of-principle implementation of this idea using superconducting quantum processor of IBM Quantum Experience. Another aspect we are interested in is a mitigation of errors occurring due to the quantum device imperfections. We apply a series of heuristic tricks at the stage of classical postprocessing in order to improve raw experimental data and to recognize patterns in them. These ideas may find applications in other realization of hybrid quantum-classical computations with noisy quantum machines

AIP conference proceedings•Jan 1, 2020•1 citation

Entanglement detection in pure states with a quantum classifier algorithm

Joab M. Varela

Entangled states proved to be an essential resource for information processing, however, its classification is still an open problem. The objective of this work is to apply machine learning methods based on distance metrics to make a quantum state classification. The classification method implementation was made using classical and quantum algorithms also comparing the performance and efficiency of both. However, it should be noted that all quantum computation processes made in this work used simulators provided by the SDK Qiskit. No real quantum computers were used to implement the quantum methods due to the qubit quantity that exceeds the available open-access quantum computers of the IBM Q-Experience. The classical results obtained in this work make a good classification of quantum states with a precision rate between 70% and 80%. The quantum predictions may have a lower precision, due to some simplifications made in the data pre-processing step, showing that quantum algorithms for entanglement classification probably will require a higher number of qubits than the currently available ones.

•Dec 14, 2023•0 citations

Structure of Nondestructive Measurement for Discriminating Quantum States

남궁민

•Feb 1, 2020•0 citations

Exploring the State Vector Classification Algorithm and Its Quantum Equivalent

Ethan Hunt, Hieu Nguyen, Tu N. Nguyen

With the escalating demand for high-performance artificial intelligence, the domain of quantum machine learning emerges as a promising avenue for enhancing machine learning frameworks. This paper introduces two innovative algorithms: the State Vector Classification Algorithm (SVCA), inspired by quantum principles, and its hybrid counterpart, the Quantum State Vector Classification Algorithm (QSVCA). Both algorithms operate by mapping input data into a classification space and projecting it onto the basis vector with the largest component. This projection operation serves as the central for classifying elements within a dataset and introducing non-linearity without relying on an activation function. Specifically, the SVCA's classification process bears resemblance to measurements in quantum computing, facilitating a seamless transition of many SVCA processes into a quantum framework. Furthermore, extensive evaluation results show that the SVCA performs comparably with other classical classifiers and notably enhances accuracy on the tested elliptical dataset. Additionally, the QSVCA serves as a quantum counterpart to the classical SVCA, consistently demonstrating strong performance on simple relationships within datasets and even outperforming the Linear Support Vector Machine SVM and the Random Forest Classifier on a synthetic dataset. Both algorithms maintain consistent performance across multiple datasets, highlighting their reliability.

IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•0 citations
Methods of processing quantum data become more important as quantum computing devices improve their quality towards fault tolerant universal quantum computers. These methods include discrimination and filtering of quantum states given as an input to the device that may find numerous applications in quantum information technologies. In the present paper, we address a scheme of a classification of input states, which is nondestructive and deterministic for certain inputs, while probabilistic, in general case. This can be achieved by incorporating phase estimation algorithm into the hybrid quantum-classical computation scheme, where quantum block is trained classically. We perform proof-of-principle implementation of this idea using superconducting quantum processor of IBM Quantum Experience. Another aspect we are interested in is a mitigation of errors occurring due to the quantum device imperfections. We apply a series of heuristic tricks at the stage of classical postprocessing in order to improve raw experimental data and to recognize patterns in them. These ideas may find applications in other realization of hybrid quantum-classical computations with noisy quantum machines
Entangled states proved to be an essential resource for information processing, however, its classification is still an open problem. The objective of this work is to apply machine learning methods based on distance metrics to make a quantum state classification. The classification method implementation was made using classical and quantum algorithms also comparing the performance and efficiency of both. However, it should be noted that all quantum computation processes made in this work used simulators provided by the SDK Qiskit. No real quantum computers were used to implement the quantum methods due to the qubit quantity that exceeds the available open-access quantum computers of the IBM Q-Experience. The classical results obtained in this work make a good classification of quantum states with a precision rate between 70% and 80%. The quantum predictions may have a lower precision, due to some simplifications made in the data pre-processing step, showing that quantum algorithms for entanglement classification probably will require a higher number of qubits than the currently available ones.
With the escalating demand for high-performance artificial intelligence, the domain of quantum machine learning emerges as a promising avenue for enhancing machine learning frameworks. This paper introduces two innovative algorithms: the State Vector Classification Algorithm (SVCA), inspired by quantum principles, and its hybrid counterpart, the Quantum State Vector Classification Algorithm (QSVCA). Both algorithms operate by mapping input data into a classification space and projecting it onto the basis vector with the largest component. This projection operation serves as the central for classifying elements within a dataset and introducing non-linearity without relying on an activation function. Specifically, the SVCA's classification process bears resemblance to measurements in quantum computing, facilitating a seamless transition of many SVCA processes into a quantum framework. Furthermore, extensive evaluation results show that the SVCA performs comparably with other classical classifiers and notably enhances accuracy on the tested elliptical dataset. Additionally, the QSVCA serves as a quantum counterpart to the classical SVCA, consistently demonstrating strong performance on simple relationships within datasets and even outperforming the Linear Support Vector Machine SVM and the Random Forest Classifier on a synthetic dataset. Both algorithms maintain consistent performance across multiple datasets, highlighting their reliability.