Related papers: Programmable unknown quantum-state discriminators …
We consider the problem of designing an optimal quantum detector that distinguishes unambiguously between a collection of mixed quantum states. Using arguments of duality in vector space optimization, we derive necessary and sufficient…
To effectively utilize quantum incompatibility as a resource in quantum information processing, it is crucial to evaluate how incompatible a set of devices is. In this study, we propose an ordering to compare incompatibility and reveal its…
We try to find an optimal quantum measurement for generalized quantum state discrimination problems, which include the problem of finding an optimal measurement maximizing the average correct probability with and without a fixed rate of…
We consider a fixed quantum measurement performed over $n$ identical copies of quantum states. Using a rigorous notion of distinguishability We consider a fixed quantum measurement performed over $n$ identical copies of quantum states.…
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…
In the standard homodyne configuration, an unknown optical state is combined with a local oscillator (LO) on a beam splitter (BS). Good quadrature measurements require a high-amplitude LO and two high-efficiency photodiodes whose signals…
We propose a notion of state distinguishability that does not refer to probabilities, but rather to the ability of a set of states to serve as programs for a desired set of gates. Using this notion, we reconstruct the structural features of…
Quantum algorithms are typically understood in terms of the evolution of a multi-qubit quantum system under a prescribed sequence of unitary transformations. The input to the algorithm prescribes some of the unitary transformations in the…
A quantum processor is a programmable quantum circuit in which both the data and the program, which specifies the operation that is carried out on the data, are quantum states. We study the situation in which we want to use such a processor…
Reaching agreement in the presence of arbitrary faults is a fundamental problem in distributed computation, which has been shown to be unsolvable if one-third of the processes can fail, unless signed messages are used. In this paper, we…
Two pure orthogonal quantum states can be perfectly distinguished by sequential local action of multiple pairs of parties. However, this process typically leads to the complete dissolution of entanglement in the states being discriminated.…
Recently, a novel framework for semi-device-independent quantum prepare-and-measure protocols has been proposed, based on the assumption of a limited distinguishability between the prepared quantum states. Here, we discuss the problem of…
Quantum state estimation for continuously monitored dynamical systems involves assigning a quantum state to an individual system at some time, conditioned on the results of continuous observations. The quality of the estimation depends on…
Given two quantum channels, we examine the task of determining whether they are compatible - meaning that one can perform both channels simultaneously but, in the future, choose exactly one channel whose output is desired (while forfeiting…
An important task for quantum information processing is optimal discrimination between two non-orthogonal quantum states, which until now has only been realized optically. Here, we present and compare experimental realizations of optimal…
Distinguishing physical processes is one of the fundamental problems in quantum physics. Although distinguishability of quantum preparations and quantum channels have been studied considerably, distinguishability of quantum measurements…
Acquiring information about an unknown qubit in a superposition of two states is essential in any computation process. Quantum measurement, or sharp measurement, is usually used to read the information contents of that unknown qubit system.…
Dense coding with non-maximally entangled states has been investigated in many different scenarios. We revisit this problem for protocols adopting the standard encoding scheme. In this case, the set of possible classical messages cannot be…
In the processing of quantum computation, analyzing and learning the pattern of the quantum data are essential for many tasks. Quantum machine learning algorithms can not only deal with the quantum states generated in the preceding quantum…
A quantum state is called concordant if it has zero quantum discord with respect to any part. By extension, a concordant computation is one such that the state of the computer, at each time step, is concordant. In this paper, I describe a…