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•62 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•36 citations

Phase estimation algorithm for quantum states classification with NISQ devices

Бабухин Данила Валерьевич, Andrei 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•0 citations

Structure of Nondestructive Measurement for Discriminating Quantum States

남궁민

•Feb 1, 2020•0 citations

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

Image Classification Based on Quantum KNN Algorithm

Yijie Dang, Nan Jiang, Hao Hu +2 more

Image classification is an important task in the field of machine learning and image processing. However, the usually used classification method --- the K Nearest-Neighbor algorithm has high complexity, because its two main processes: similarity computing and searching are time-consuming. Especially in the era of big data, the problem is prominent when the amount of images to be classified is large. In this paper, we try to use the powerful parallel computing ability of quantum computers to optimize the efficiency of image classification. The scheme is based on quantum K Nearest-Neighbor algorithm. Firstly, the feature vectors of images are extracted on classical computers. Then the feature vectors are inputted into a quantum superposition state, which is used to achieve parallel computing of similarity. Next, the quantum minimum search algorithm is used to speed up searching process for similarity. Finally, the image is classified by quantum measurement. The complexity of the quantum algorithm is only O((kM)^(1/2)), which is superior to the classical algorithms. Moreover, the measurement step is executed only once to ensure the validity of the scheme. The experimental results show that, the classification accuracy is 83.1% on Graz-01 dataset and 78% on Caltech-101 dataset, which is close to existing classical algorithms. Hence, our quantum scheme has a good classification performance while greatly improving the efficiency.

arXiv:1805.06260•May 16, 2018•6 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.
Image classification is an important task in the field of machine learning and image processing. However, the usually used classification method --- the K Nearest-Neighbor algorithm has high complexity, because its two main processes: similarity computing and searching are time-consuming. Especially in the era of big data, the problem is prominent when the amount of images to be classified is large. In this paper, we try to use the powerful parallel computing ability of quantum computers to optimize the efficiency of image classification. The scheme is based on quantum K Nearest-Neighbor algorithm. Firstly, the feature vectors of images are extracted on classical computers. Then the feature vectors are inputted into a quantum superposition state, which is used to achieve parallel computing of similarity. Next, the quantum minimum search algorithm is used to speed up searching process for similarity. Finally, the image is classified by quantum measurement. The complexity of the quantum algorithm is only O((kM)^(1/2)), which is superior to the classical algorithms. Moreover, the measurement step is executed only once to ensure the validity of the scheme. The experimental results show that, the classification accuracy is 83.1% on Graz-01 dataset and 78% on Caltech-101 dataset, which is close to existing classical algorithms. Hence, our quantum scheme has a good classification performance while greatly improving the efficiency.