Unambiguous discrimination between mixed quantum states based on programmable quantum state discriminators

Hongfeng Gan; Daowen Qiu

Home/Archive/arXiv

arXiv · 0705.1564

Unambiguous discrimination between mixed quantum states based on programmable quantum state discriminators

Hongfeng Gan·Daowen Qiu

View original source ↗Read source document ↗Export metadata ↓

Abstract

We discuss the problem of designing an unambiguous programmable discriminator for mixed quantum states. We prove that there does not exist such a universal unambiguous programmable discriminator for mixed quantum states that has two program registers and one data register. However, we find that we can use the idea of programmable discriminator to unambiguously discriminate mixed quantum states. The research shows that by using such an idea, when the success probability for discrimination reaches the upper bound, the success probability is better than what we do not use the idea to do, except for some special cases.

Explore related subjects

quant-ph

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Hongfeng Gan, Daowen Qiu. 2007-05-10. Unambiguous discrimination between mixed quantum states based on programmable quantum state discriminators. https://arxiv.org/abs/0705.1564

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Computational reach of machine learning models is independent of untrained quantum resources

This paper proves that if an untrained quantum circuit is used as a resource in a machine learning model, then on average no resource quantum circuit is better than any other that can achieve the same set of computational effects. The paper also proves a supporting theorem that even if certain mild idealisations are omitted, the average quantum advantage remains negligible at best. These results cast serious doubt on several proposals to use untrained quantum circuits in machine learning models: at best such claims should be substantiated empirically, as this paper proves there is no a priori theoretical reason to suppose that introducing an untrained quantum circuit will increase performance.

quant-ph↗

arXiv2026

Operator quantum singular value transformation: Spectral mapping, design and topological invariants

Quantum singular value transformation (QSVT) provides a unifying framework for quantum algorithms by applying the polynomials of quantum signal processing (QSP) to block-encoded matrices. We connect this framework with spectral analysis, design and topological protection in condensed matter physics. Extending QSVT beyond matrices to possibly infinite-dimensional operators (operator QSVT), we establish the following. First, it transforms every block of the operator by the QSP polynomials; no singular value decomposition is needed. Second, a spectral mapping theorem determines the full spectrum of the QSVT operator, including continuous spectra, from the embedded operator through the QSP polynomial, allowing spectral analysis without translation invariance. Third, the spectral mapping turns QSP into spectral design: the QSP phases can stretch, fold and separate the bands and place the eigenvalues. Finally, the kernel sectors that conventional QSVT usually sets aside carry a topological index, invariant under the choice of QSP phases, local perturbations and gap-preserving deformations, which guarantees topologically protected states. These results unify two quantum walks: Szegedy's walk from quantum algorithms and the split-step walk from condensed matter physics. Their kernel sectors encode the graph's Euler characteristic and the difference of bulk winding numbers, respectively. For the split-step walk, QSP breaks chiral symmetry but not the topological protection, and can move the protected state into a continuous band to form a bound state in the continuum (BIC).

quant-ph↗

arXiv2026

Quantum theory of molecular orientation

We formulate a quantum phase space for rotational and nuclear-spin states of rigid molecules. For each nuclear spin isomer, we re-derive the isomer's admissible angular momentum states from molecular geometry and nuclear-spin data, introduce its angular position states using quantization theory, and develop a generalized Fourier transform converting between the two. We classify molecules into three types -- asymmetric, rotationally symmetric, and perrotationally symmetric -- with the last type having no macroscopic analogue due to nuclear-spin statistics constraints. We discuss two general features in perrotationally symmetric state spaces that are Hamiltonian-independent and induced solely by symmetry and spin statistics. First, we quantify when and how an isomer's state space is completely rotation-spin entangled, meaning that it does not admit any separable states. Second, we identify isomers whose position states house an internal pseudo-spin or "fiber" degree of freedom, and the fiber's Berry phase or matrix after adiabatic changes in position yields naturally robust operations, akin to braiding anyonic quasiparticles or realizing fault-tolerant quantum gates. We outline how the fiber can be used as a quantum error-correcting code and discuss scenarios where these features can be experimentally probed

quant-ph↗