Characterization of quantum computable decision problems by state discrimination
Karl Svozil
备注：
9 pages
发表信息：
AIP Conference Proceedings 810. Quantum Theory. Reconsideration of Foundations--3, ed. by Guillaume Adenier, Andrei Yu. Khrennikov and Theo M. Nieuwenhuizen (American Institute of Physics, Melville, NY, 2006), pp. 271-279
One advantage of quantum algorithms over classical computation is the possibility to spread out, process, analyse and extract information in multipartite configurations in coherent superpositions of classical states. This will be discussed in terms of quantum state identification problems based on a proper partitioning of mutually orthogonal sets of states. The question arises whether or not it is possible to encode equibalanced decision problems into quantum systems, so that a single invocation of a filter used for state discrimination suffices to obtain the result.
Efficiently Computable Strategies and Limits for Bosonic Channel Discrimination
School of Science, STEM College, RMIT University（斯威本科技大学理学院STEM学院）；Scuola Normale Superiore（比萨高等师范学院）；Korteweg–de Vries Institute for Mathematics, University of Amsterdam（阿姆斯特丹大学科特韦格-德弗里斯数学研究所）；Mathematical Quantum Information RIKEN Hakubi Research Team, RIKEN Pioneering Research Institute (PRI) and RIKEN Center for Quantum Computing (RQC)（理科院系量子信息RIKEN Hakubi研究团队，理化学研究所前沿研究院（PRI）和理化学研究所量子计算中心（RQC））；School of Electrical and Computer Engineering, Cornell University（康奈尔大学电气与计算机工程学院）
By combining the Minkowski inequality and the quantum Chernoff bound, we derive easy-to-compute upper bounds for the error probability affecting the optimal discrimination of Gaussian states. In particular, these bounds are useful when the Gaussian states are unitarily inequivalent, i.e., they differ in their symplectic invariants.
We introduce and study norms in the space of hermitian operators, obtained from base norms in positively generated subspaces. These norms are closely related to discrimination of so-called generalized quantum channels, including quantum states, channels and networks. We further introduce generalized quantum decision problems and show that the maximal average payoff of decision procedures is again given by these norms. We also study optimality of decision procedures, in particular, we obtain a necessary and sufficient condition under which an optimal 1-tester for discrimination of quantum chann…
State discrimination with the aim to minimize the error probability is a well studied problem. Instead, here the binary decision problem for operators with a given prior is investigated. A black box containing the unknown operator is probed by selected wave functions. The output is analyzed with conventional methods developed for state discrimination. An error probability bound for all binary operator choices is provided, and it is shown how probe entanglement enhances the result.
The problem of quantum state discrimination between two wave functions of a particle in a square well potential is considered. The optimal minimum-error probability for the state discrimination is known to be given by the Helstrom bound. A new strategy is introduced here whereby the square well is compressed isoenergetically, modifying the wave-functions. The new contracted chamber is then probed using the conventional optimal strategy, and the error probability is calculated. It is shown that in some cases the Helstrom bound can be violated, i.e. the state discrimination can be realized with …
We demonstrate an optical receiver that achieves the quantum Chernoff bound for discriminating coherent states from thermal states in the multi-copy scenario. In contrast, we find that repeated use of the receiver approaching the Helstrom bound for single-copy measurement is sub-optimal in this multi-copy case. Furthermore, for a large class of multi-copy discrimination tasks between a pure and a mixed state, we prove that any Helstrom-bound achieving single-copy receiver is suboptimal by a factor of at least two in error-probability exponent compared to the multi-copy quantum Chernoff bound. …
We present a mathematical construction of new quantum information measures that generalize the notion of logarithmic negativity. Our approach is based on formal group theory. We shall prove that this family of generalized negativity functions, due their algebraic properties, is suitable for studying entanglement in many-body systems. Under mild hypotheses, the new measures are computable entanglement monotones. Also, they are composable: their evaluation over tensor products can be entirely computed in terms of the evaluations over each factor, by means of a specific group law. In principle, t…
The problem of quantum state discrimination between two wave functions of a particle in a square well potential is considered. The optimal minimum-error probability is known to be given by the Helstrom bound. A new strategy is introduced by inserting an impenetrable barrier in the middle of the square well, which is either a nodal or non-nodal point of the wave function. The energy required to insert the barrier is dependent on the initial state. This enables the experimenter to gain additional information beyond the standard probing of the state envisaged by Helstrom and to improve the distin…
Quantum hypothesis testing is an important tool for quantum information processing. Two main strategies have been widely adopted: in a minimum error discrimination strategy, the average error probability is minimized; while in an unambiguous discrimination strategy, an inconclusive decision (abstention) is allowed to vanish any possibility of errors when a conclusive result is obtained. In both scenarios, the testing between quantum states are relatively well-understood, for example, the ultimate limits of the performance are established decades ago; however, the testing between quantum channe…
A fundamental problem in Quantum Information Processing is the discrimination amongst a set of quantum states of a system. In this paper, we address this problem on an open quantum system described by a graph, whose evolution is defined by a Quantum Stochastic Walk. In particular, the structure of the graph mimics those of neural networks, with the quantum states to discriminate encoded on input nodes and with the discrimination obtained on the output nodes. We optimize the parameters of the network to obtain the highest probability of correct discrimination. Numerical simulations show that af…
Generalized quantum measurements identifying non-orthogonal states without ambiguity often play an indispensable role in various quantum applications. For such unambiguous state discrimination scenario, we have a finite probability of obtaining inconclusive results and minimizing the probability of inconclusive results is of particular importance. In this paper, we experimentally demonstrate an adaptive generalized measurement that can unambiguously discriminate the quaternary phase-shift-keying coherent states with a near-optimal performance. Our scheme is composed of displacement operations,…
We address quantum decision theory as a convenient framework to analyze process discrimination and estimation in qubit systems. In particular we discuss the following problems: i) how to discriminate whether or not a given unitary perturbation has been applied to a qubit system; ii) how to determine the amplitude of the minimum detectable perturbation. In order to solve the first problem, we exploit the so-called Bayes strategy, and look for the optimal measurement to discriminate, with minimum error probability, whether or not the unitary transformation has been applied to a given signal. Con…
What is the ultimate performance for discriminating two arbitrary quantum channels acting on a finite-dimensional Hilbert space? Here we address this basic question by deriving a general and fundamental lower bound. More precisely, we investigate the symmetric discrimination of two arbitrary qudit channels by means of the most general protocols based on adaptive (feedback-assisted) quantum operations. In this general scenario, we first show how port-based teleportation can be used to simplify these adaptive protocols into a much simpler non-adaptive form, designing a new type of teleportation …
We examine how to distinguish between unitary operators, when the exact form of the possible operators is not known. Instead we are supplied with "programs" in the form of unitary transforms, which can be used as references for identifying the unknown unitary transform. All unitary transforms should be used as few times as possible. This situation is analoguous to programmable state discrimination. One difference, however, is that the quantum state to which we apply the unitary transforms may be entangled, leading to a richer variety of possible strategies. By suitable selection of an input st…
We consider decision problems on finite sets of hypotheses represented by pairwise different shift-invariant states on a quantum spin chain. The decision in favor of one of the hypotheses is based on outputs of generalized measurements performed on local states on blocks of finite size. We assume existence of the mean quantum Chernoff distances of any pair of states from the given set and refer to the minimum of them as the mean generalized quantum Chernoff distance. We establish that this minimum specifies an asymptotic bound on the exponential decay of the averaged probability of rejecting t…
Distinguishing assigned quantum states with assigned probabilities via quantum measurements is a crucial problem for the transmission of classical information through quantum channels. Measurement operators maximizing the probability of correct discrimination have been characterized by Helstrom, Holevo and Yuen since 1970's. On the other hand, closed--form solutions are available only for particular situations enjoying high degrees of symmetry. As a suboptimal solution to the problem, measurement operators, directly determined from states and probabilities and known as square root measurements…
Motivated by the recent discovery of a quantum Chernoff theorem for asymptotic state discrimination, we investigate the distinguishability of two bipartite mixed states under the constraint of local operations and classical communication (LOCC), in the limit of many copies. While for two pure states a result of Walgate et al. shows that LOCC is just as powerful as global measurements, data hiding states (DiVincenzo et al.) show that locality can impose severe restrictions on the distinguishability of even orthogonal states. Here we determine the optimal error probability and measurement to dis…
The problem of quantum state discrimination between two wave functions on a ring is considered. The optimal minimum-error probability is known to be given by the Helstrom bound. A new strategy is introduced by inserting either adiabatically or instantaneously an impenetrable barrier. The insertion point, independent of the shape of the initial wave function, becomes a node. The resulting modified wave functions can be, if the initial functions are judiciously chosen, distinguished with a smaller error probability, and as a consequence the Helstrom bound can be violated under idealised conditio…
We address the use of entanglement to improve the precision of generalized quantum interferometry, i.e. of binary measurements aimed to determine whether or not a perturbation has been applied by a given device. For the most relevant operations in quantum optics, we evaluate the optimal detection strategy and the ultimate bounds to the minimum detectable perturbation. Our results indicate that entanglement-assisted strategies improve the discrimination in comparison with conventional schemes. A concrete setup to approach performances of the optimal strategies is also suggested.
Robust multi-hypothesis quantum-state discrimination under unknown common unitary perturbations via least favorable priors
Graduate School of Engineering Science, The University of Osaka（大阪大学工程科学研究科）；Center for Education in Liberal Arts and Sciences, The University of Osaka（大阪大学通识教育中心）；Center for Quantum Information and Quantum Biology, The University of Osaka（大阪大学量子信息与量子生物学中心）
Postselection is the process of discarding outcomes from statistical trials that are not the event one desires. Postselection can be useful in many applications where the cost of getting the wrong event is implicitly high. However, unless this cost is specified exactly, one might conclude that discarding all data is optimal. Here we analyze the optimal decision rules and quantum measurements in a decision theoretic setting where a prespecified cost is assigned to discarding data. Our scheme interpolates between unambiguous state discrimination (when the cost of postselection is zero) and a min…
