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

Chinese Physics B

General description of discriminating quantum operations

Kejia Zhang, Ping Zhu, Fei Gao, Fen-Zhuo Guo, Su‐Juan Qin, Qiaoyan Wen

Published Oct 1, 2011• 2 citations
Publisher

Abstract

The discrimination of quantum operations plays a key role in quantum information and computation. Unlike discriminating quantum states, it has some special properties which can be carried out in practice. In this paper, we provide a general description of discriminating quantum operations. Concretely speaking, we describe the distinguishability between quantum operations using a measure called operator fidelity. It is shown that, employing the theory of operator fidelity, we can not only verify some previous results to discriminate unitary operations, but also exhibit a more general discrimination condition. We further apply our results to analysing the security of some quantum cryptographic protocols and discuss the realization of our method using well-developed quantum algorithms.

DOI
10.1088/1674-1056/20/10/100304

Related papers

Unambiguous discrimination of general quantum operations

Weizhou Cai, Jing-Ning Zhang, Ziyue Hua +10 more

The discrimination of quantum operations has long been an intriguing challenge, with theoretical research notably advancing our understanding of the quantum features in discriminating quantum objects. This challenge is closely related to the discrimination of quantum states, and proof-of-principle demonstrations of the latter have already been realized using optical photons. However, the experimental demonstration of discriminating general quantum operations, including both unitary and nonunitary operations, has remained elusive. In general quantum systems, especially those with high dimensions, the preparation of arbitrary quantum states and the implementation of arbitrary quantum operations and generalized measurements are nontrivial tasks. Here, we experimentally demonstrate the optimal unambiguous discrimination of up to six displacement operators and the unambiguous discrimination of nonunitary quantum operations. Our results demonstrate powerful tools for experimental research in quantum information processing and are expected to stimulate a wide range of valuable applications in the field of quantum sensing.

arXiv:2404.13317•Science Advances•Nov 13, 2024•3 citations

Derivation of standard quantum theory via state discrimination

Hayato Arai, Masahito Hayashi

Abstract It is a key issue to characterize the model of standard quantum theory out of general models by an operational condition. The framework of general probabilistic theories (GPTs) is a new information theoretical approach to single out standard quantum theory. It is known that traditional properties, for example, Bell-CHSH inequality, are not sufficient to single out standard quantum theory among possible models in GPTs. As a more precise property, we focus on the bound of the performance for an information task called state discrimination in general models. We give an equivalent condition for outperforming the minimum discrimination error probability under the standard quantum theory given by the trace norm. Besides, by applying the equivalent condition, we characterize standard quantum theory out of general models in GPTs by the bound of the performance for state discrimination.

arXiv:2307.11271•New Journal of Physics•May 1, 2024•5 citations

Discrimination of two-qubit unitaries via local operations and classical communication

Joonwoo Bae

Distinguishability is a fundamental and operational measure generally connected to information applications. In quantum information theory, from the postulates of quantum mechanics it often has an intrinsic limitation, which then dictates and also characterises capabilities of related information tasks. In this work, we consider discrimination between bipartite two-qubit unitary transformations by local operations and classical communication (LOCC) and its relations to entangling capabilities of given unitaries. We show that a pair of entangling unitaries which do not contain local parts, if they are perfectly distinguishable by global operations, can also be perfectly distinguishable by LOCC. There also exist non-entangling unitaries, e.g. local unitaries, that are perfectly discriminated by global operations but not by LOCC. The results show that capabilities of LOCC are strictly restricted than global operations in distinguishing bipartite unitaries for a finite number of repetitions, contrast to discrimination of a pair of bipartite states and also to asymptotic discrimination of unitaries.

arXiv:1601.07256•Scientific Reports•Dec 15, 2015•14 citations

Optimal Perfect Distinguishability between Unitaries and Quantum Operations

Cheng Zhu Lu, Jianxin Chen, Runyao Duan

We study optimal perfect distinguishability between a unitary and a general quantum operation. In 2-dimensional case we provide a simple sufficient and necessary condition for sequential perfect distinguishability and an analytical formula of optimal query time. We extend the sequential condition to general d-dimensional case. Meanwhile, we provide an upper bound and a lower bound for optimal sequential query time. In the process a new iterative method is given, the most notable innovation of which is its independence to auxiliary systems or entanglement. Following the idea, we further obtain an upper bound and a lower bound of (entanglement-assisted) q-maximal fidelities between a unitary and a quantum operation. Thus by the recursion in [1] an upper bound and a lower bound for optimal general perfect discrimination are achieved. Finally our lower bound result can be extended to the case of arbitrary two quantum operations.

arXiv:1010.2298•Oct 12, 2010•3 citations

Optimal discrimination between quantum operations

Lvzhou Li, Daowen Qiu

In this paper, we address the problem of discriminating two given quantum operations. Firstly, based on the Bloch representation of single qubit systems, we give the exact minimum error probability of discriminating two single qubit quantum operations by unentangled input states. In particular, for the Pauli channels discussed in [Phys. Rev. A {\bf 71}, 062340 (2005)], we use a more intuitional and visual method to deal with their discrimination problem. Secondly, we consider the condition for perfect discrimination of two quantum operations. Specially, we get that two generalized Pauli channels are perfectly distinguishable if and only if their characteristic vectors are orthogonal.

arXiv:0705.2549•Journal of Physics A Mathematical and Theoretical•Jul 11, 2008•14 citations

Equivalence determination of unitary operations

Atsushi Shimbo, Akihito Soeda, Mio Murao

We study equivalence determination of unitary operations, a task analogous to quantum state discrimination. The candidate states are replaced by unitary operations given as a quantum sample, i.e., a black-box device implementing a candidate unitary operation, and the discrimination target becomes another black-box. The task is an instance of higher-order quantum computation with the black-boxes as input. The optimal error probability is calculated by semidefinite programs. Arbitrary quantum operations applied between the black-boxes in a general protocol provide advantages over protocols restricted to parallelized use of the black-boxes. We provide a numerical proof of such an advantage. In contrast, a parallelized scheme is analytically shown to exhibit the optimal performance of general schemes for a particular number of quantum samples of the candidates. We find examples of finite-sample equivalence determination that achieve the same performance as when a classical description of the candidates are provided, although an exact classical description cannot be obtained from finite quantum samples.

arXiv:1803.11414•Mar 30, 2018•9 citations
The discrimination of quantum operations plays a key role in quantum information and computation. Unlike discriminating quantum states, it has some special properties which can be carried out in practice. In this paper, we provide a general description of discriminating quantum operations. Concretely speaking, we describe the distinguishability between quantum operations using a measure called operator fidelity. It is shown that, employing the theory of operator fidelity, we can not only verify some previous results to discriminate unitary operations, but also exhibit a more general discrimination condition. We further apply our results to analysing the security of some quantum cryptographic protocols and discuss the realization of our method using well-developed quantum algorithms.
The discrimination of quantum operations has long been an intriguing challenge, with theoretical research notably advancing our understanding of the quantum features in discriminating quantum objects. This challenge is closely related to the discrimination of quantum states, and proof-of-principle demonstrations of the latter have already been realized using optical photons. However, the experimental demonstration of discriminating general quantum operations, including both unitary and nonunitary operations, has remained elusive. In general quantum systems, especially those with high dimensions, the preparation of arbitrary quantum states and the implementation of arbitrary quantum operations and generalized measurements are nontrivial tasks. Here, we experimentally demonstrate the optimal unambiguous discrimination of up to six displacement operators and the unambiguous discrimination of nonunitary quantum operations. Our results demonstrate powerful tools for experimental research in quantum information processing and are expected to stimulate a wide range of valuable applications in the field of quantum sensing.
Abstract It is a key issue to characterize the model of standard quantum theory out of general models by an operational condition. The framework of general probabilistic theories (GPTs) is a new information theoretical approach to single out standard quantum theory. It is known that traditional properties, for example, Bell-CHSH inequality, are not sufficient to single out standard quantum theory among possible models in GPTs. As a more precise property, we focus on the bound of the performance for an information task called state discrimination in general models. We give an equivalent condition for outperforming the minimum discrimination error probability under the standard quantum theory given by the trace norm. Besides, by applying the equivalent condition, we characterize standard quantum theory out of general models in GPTs by the bound of the performance for state discrimination.
Distinguishability is a fundamental and operational measure generally connected to information applications. In quantum information theory, from the postulates of quantum mechanics it often has an intrinsic limitation, which then dictates and also characterises capabilities of related information tasks. In this work, we consider discrimination between bipartite two-qubit unitary transformations by local operations and classical communication (LOCC) and its relations to entangling capabilities of given unitaries. We show that a pair of entangling unitaries which do not contain local parts, if they are perfectly distinguishable by global operations, can also be perfectly distinguishable by LOCC. There also exist non-entangling unitaries, e.g. local unitaries, that are perfectly discriminated by global operations but not by LOCC. The results show that capabilities of LOCC are strictly restricted than global operations in distinguishing bipartite unitaries for a finite number of repetitions, contrast to discrimination of a pair of bipartite states and also to asymptotic discrimination of unitaries.
We study optimal perfect distinguishability between a unitary and a general quantum operation. In 2-dimensional case we provide a simple sufficient and necessary condition for sequential perfect distinguishability and an analytical formula of optimal query time. We extend the sequential condition to general d-dimensional case. Meanwhile, we provide an upper bound and a lower bound for optimal sequential query time. In the process a new iterative method is given, the most notable innovation of which is its independence to auxiliary systems or entanglement. Following the idea, we further obtain an upper bound and a lower bound of (entanglement-assisted) q-maximal fidelities between a unitary and a quantum operation. Thus by the recursion in [1] an upper bound and a lower bound for optimal general perfect discrimination are achieved. Finally our lower bound result can be extended to the case of arbitrary two quantum operations.
In this paper, we address the problem of discriminating two given quantum operations. Firstly, based on the Bloch representation of single qubit systems, we give the exact minimum error probability of discriminating two single qubit quantum operations by unentangled input states. In particular, for the Pauli channels discussed in [Phys. Rev. A {\bf 71}, 062340 (2005)], we use a more intuitional and visual method to deal with their discrimination problem. Secondly, we consider the condition for perfect discrimination of two quantum operations. Specially, we get that two generalized Pauli channels are perfectly distinguishable if and only if their characteristic vectors are orthogonal.
We study equivalence determination of unitary operations, a task analogous to quantum state discrimination. The candidate states are replaced by unitary operations given as a quantum sample, i.e., a black-box device implementing a candidate unitary operation, and the discrimination target becomes another black-box. The task is an instance of higher-order quantum computation with the black-boxes as input. The optimal error probability is calculated by semidefinite programs. Arbitrary quantum operations applied between the black-boxes in a general protocol provide advantages over protocols restricted to parallelized use of the black-boxes. We provide a numerical proof of such an advantage. In contrast, a parallelized scheme is analytically shown to exhibit the optimal performance of general schemes for a particular number of quantum samples of the candidates. We find examples of finite-sample equivalence determination that achieve the same performance as when a classical description of the candidates are provided, although an exact classical description cannot be obtained from finite quantum samples.