skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Qubit state discrimination

Abstract

We show how one can solve the problem of discriminating between qubit states. We use the quantum state discrimination duality theorem and the Bloch sphere representation of qubits, which allows for an easy geometric and analytical representation of the optimal guessing strategies.

Authors:
 [1];  [2]
  1. Telecom ParisTech, 37/39 rue Dareau, F-75014 Paris (France)
  2. IBM Watson Research Center, Post Office Box 218, Yorktown Heights, New York 10598 (United States)
Publication Date:
OSTI Identifier:
21413190
Resource Type:
Journal Article
Resource Relation:
Journal Name: Physical Review. A; Journal Volume: 81; Journal Issue: 6; Other Information: DOI: 10.1103/PhysRevA.81.062304; (c) 2010 The American Physical Society
Country of Publication:
United States
Language:
English
Subject:
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; BLOCH THEORY; DUALITY; GEOMETRY; QUBITS; INFORMATION; MATHEMATICS; QUANTUM INFORMATION

Citation Formats

Deconinck, Matthieu E., and Terhal, Barbara M. Qubit state discrimination. United States: N. p., 2010. Web. doi:10.1103/PHYSREVA.81.062304.
Deconinck, Matthieu E., & Terhal, Barbara M. Qubit state discrimination. United States. doi:10.1103/PHYSREVA.81.062304.
Deconinck, Matthieu E., and Terhal, Barbara M. 2010. "Qubit state discrimination". United States. doi:10.1103/PHYSREVA.81.062304.
@article{osti_21413190,
title = {Qubit state discrimination},
author = {Deconinck, Matthieu E. and Terhal, Barbara M.},
abstractNote = {We show how one can solve the problem of discriminating between qubit states. We use the quantum state discrimination duality theorem and the Bloch sphere representation of qubits, which allows for an easy geometric and analytical representation of the optimal guessing strategies.},
doi = {10.1103/PHYSREVA.81.062304},
journal = {Physical Review. A},
number = 6,
volume = 81,
place = {United States},
year = 2010,
month = 6
}
  • We propose a protocol transferring an arbitrary unknown two-qubit state using the quantum channel of a four-qubit genuine entangled state. Simplifying the four-qubit joint measurement to the combination of Bell-state measurements, it can be realized more easily with currently available technologies.
  • Fast and accurate measurement is a highly desirable, if not vital, feature of quantum computing architectures. In this work we investigate the usefulness of adaptive measurements in improving the speed and accuracy of qubit measurement. We examine a particular class of quantum computing architectures, ones based on qubits coupled to well-controlled harmonic oscillator modes (reminiscent of cavity QED), where adaptive schemes for measurement are particularly appropriate. In such architectures, qubit measurement is equivalent to phase discrimination for a mode of the electromagnetic field, and we examine adaptive techniques for doing this. In the final section we present a concrete examplemore » of applying adaptive measurement to the particularly well-developed circuit-QED architecture.« less
  • Quantum state discrimination is a fundamental primitive in quantum statistics where one has to correctly identify the state of a system that is in one of two possible known states. A programmable discrimination machine performs this task when the pair of possible states is not a priori known but instead the two possible states are provided through two respective program ports. We study optimal programmable discrimination machines for general qubit states when several copies of states are available in the data or program ports. Two scenarios are considered: One in which the purity of the possible states is a priorimore » known, and the fully universal one where the machine operates over generic mixed states of unknown purity. We find analytical results for both the unambiguous and minimum error discrimination strategies. This allows us to calculate the asymptotic performance of programmable discrimination machines when a large number of copies are provided and to recover the standard state discrimination and state comparison values as different limiting cases.« less
  • No abstract prepared.
  • The number of entanglement classes in stochastic local operations and classical communication (SLOCC) classifications increases with the number of qubits and is already infinite for four qubits. Criteria for explicitly discriminating and classifying pure states of four and more qubits are highly desirable and therefore at the focus of intense theoretical research. We develop a general criterion for the discrimination of pure N-partite entangled states in terms of polynomial SL(d,C){sup xN} invariants. By means of this criterion, existing SLOCC classifications of four-qubit entanglement are reproduced. Based on this we propose a polynomial classification scheme in which entanglement types are identifiedmore » through 'tangle patterns'. This scheme provides a practicable way to classify states of arbitrary multipartite systems. Moreover, the use of polynomials induces a corresponding quantification of the different types of entanglement.« less