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:1105.2186 · AIP conference proceedings

Non-Destructive Discrimination of arbitrary set of orthogonal quantum states by NMR using Quantum Phase Estimation

Manu Veliparambil Subrahmanian, Anil Kumar, Dipankar Home, Guruprasad Kar, Archan S. Majumda

Published Jan 1, 2011• 8 citations
arXivHTMLPDF

Abstract

An algorithm based on quantum phase estimation, which discriminates quantum states nondestructively within a set of arbitrary orthogonal states, is described and experimentally verified by a NMR quantum information processor. The procedure is scalable and can be applied to any set of orthogonal states. Scalability is demonstrated through Matlab simulation.

DOI
10.1063/1.3635867

Related papers

Experimental Demonstration of Non-Destructive Discrimination of Arbitrary Set of Orthogonal Quantum States Using 5-qubit IBM Quantum Computer on Cloud

Ayan Majumder, Anil Kumar

A protocol for non-destructive descrimination of arbitrary set of orthogonal quantum states was proposed by V. S. Manu et al., using an algorithm based on quantum phase estimation. IBM Corporation has released a superconductivity based 5-qubit (5-qubit transmon bowtie chip 3 and IBM 5-qubit real processor) quantum computer named Quantum Experience and placed it on cloud. In this paper we take advantage of the online availability of those real quantum processors(ibmqx2 amd ibmqx4) and carry out the above protocol that has experimentally demonstrated earlier using NMR quantum processor. Here, we set up experiments for arbitrary one-qubit and two-qubit orthogonal quantum states. The experiment confirmed that the arbitrary orthogonal quantum states can be discriminate in a nondestructive manner with a high fidelity. We compare the outcomes of those experiments which are done by ibmqx2 and ibmqx4 processors. Here, we also show the state tomography for the single qubit experiments.

arXiv:1803.06311•Mar 16, 2018•1 citation

Implementation of phase estimation and quantum counting algorithms on an NMR quantum-information processor

Jae‐Seung Lee, Jae‐Hyun Kim, Yongwook Cheong +1 more

The quantum Fourier transform is a key factor in achieving exponential speedup relative to classical algorithms. We implemented the phase estimation algorithm, which is the very basic application example of the quantum Fourier transform, on a three-bit nuclear magnetic resonance quantum-information processor. The algorithm was applied to one-bit Grover operators to estimate eigenvalues. We also demonstrated the counting algorithm with the same operators to obtain the number of the marked states. The results of projective measurements required by the algorithms were obtained from the split peak positions in the spectra.

Physical Review A•Oct 23, 2002•19 citations

Non-destructive discrimination of multiparticle cluster states for quantum computation

Sreraman Muralidharan, Sakshi Jain, Sriram Prasath E. +1 more

Discriminating between orthogonal quantum systems without destroying their entanglement is of interest to quantum computation and communication. In this paper, we explicate the schemes for the non-destructive discrimination (NDD) of 16 orthogonal four qubit cluster states and 32 orthogonal five qubit cluster states respectively. This technique will find its applications in various branches of quantum information theory.

arXiv:0906.2147•Jun 11, 2009•1 citation

Non-destructive Orthonormal State Discrimination

Manish K. Gupta, Anirban Pathak, R. Srikanth +1 more

We provide explicit quantum circuits for the non-destructive deterministic discrimination of Bell states in the Hilbert space $C^{d^{n}}$, where $d$ is qudit dimension. We discuss a method for generalizing this to non-destructive measurements on any set of orthogonal states distributed among $n$ parties. From the practical viewpoint, we show that such non-destructive measurements can help lower quantum communication complexity under certain conditions.

arXiv:quant-ph/0507096•Jul 11, 2005•4 citations

Discrimination of quantum states and probabilistic quantum algorithms

János A. Bergou

In quantum information and quantum computing, the carrier of information is some quantum system and information is encoded in its state. The state, however, is not an observable in quantum mechanics, thus a fundamental problem arises: after processing the information it has to be read out or, in other words, the state of the system must be determined. When the possible target states are orthogonal, this is a relatively simple task, provided the set of possible target states is known. But when the possible target states are not orthogonal their discrimination is far from being trivial even if their set is known. Thus the problem of discriminating among non-orthogonal states is ubiquitous in quantum information and quantum computing, underlying all communication and computing schemes. It is the subject of this talk to review recent theoretical and experimental advances in this field.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 25, 2004•0 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
An algorithm based on quantum phase estimation, which discriminates quantum states nondestructively within a set of arbitrary orthogonal states, is described and experimentally verified by a NMR quantum information processor. The procedure is scalable and can be applied to any set of orthogonal states. Scalability is demonstrated through Matlab simulation.
A protocol for non-destructive descrimination of arbitrary set of orthogonal quantum states was proposed by V. S. Manu et al., using an algorithm based on quantum phase estimation. IBM Corporation has released a superconductivity based 5-qubit (5-qubit transmon bowtie chip 3 and IBM 5-qubit real processor) quantum computer named Quantum Experience and placed it on cloud. In this paper we take advantage of the online availability of those real quantum processors(ibmqx2 amd ibmqx4) and carry out the above protocol that has experimentally demonstrated earlier using NMR quantum processor. Here, we set up experiments for arbitrary one-qubit and two-qubit orthogonal quantum states. The experiment confirmed that the arbitrary orthogonal quantum states can be discriminate in a nondestructive manner with a high fidelity. We compare the outcomes of those experiments which are done by ibmqx2 and ibmqx4 processors. Here, we also show the state tomography for the single qubit experiments.
The quantum Fourier transform is a key factor in achieving exponential speedup relative to classical algorithms. We implemented the phase estimation algorithm, which is the very basic application example of the quantum Fourier transform, on a three-bit nuclear magnetic resonance quantum-information processor. The algorithm was applied to one-bit Grover operators to estimate eigenvalues. We also demonstrated the counting algorithm with the same operators to obtain the number of the marked states. The results of projective measurements required by the algorithms were obtained from the split peak positions in the spectra.
We provide explicit quantum circuits for the non-destructive deterministic discrimination of Bell states in the Hilbert space CdnC^{d^{n}}Cdn, where ddd is qudit dimension. We discuss a method for generalizing this to non-destructive measurements on any set of orthogonal states distributed among nnn parties. From the practical viewpoint, we show that such non-destructive measurements can help lower quantum communication complexity under certain conditions.
In quantum information and quantum computing, the carrier of information is some quantum system and information is encoded in its state. The state, however, is not an observable in quantum mechanics, thus a fundamental problem arises: after processing the information it has to be read out or, in other words, the state of the system must be determined. When the possible target states are orthogonal, this is a relatively simple task, provided the set of possible target states is known. But when the possible target states are not orthogonal their discrimination is far from being trivial even if their set is known. Thus the problem of discriminating among non-orthogonal states is ubiquitous in quantum information and quantum computing, underlying all communication and computing schemes. It is the subject of this talk to review recent theoretical and experimental advances in this field.
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