We consider the problem of correctly identifying a malfunctioning quantum device that forms part of a network of N such devices, which can be considered as the quantum analog of classical anomaly detection. In the case where the devices in question are sources assumed to prepare identical quantum pure states, with the faulty source producing a different anomalous pure state, we show that the optimal probability of successful identification requires a global quantum measurement. We also put forth several local measurement strategies—both adaptive and nonadaptive—that achieve the same optimal probability of success in the limit where the number of devices to be checked is large. In the case where the faulty device performs a known unitary operation, we show that the use of entangled probes provides an improvement that even allows perfect identification for values of the unitary parameter that surpass a certain threshold. Finally, if the faulty device implements a known qubit channel, we find that the optimal probability for detecting the position of rank-one and rank-two Pauli channels can be achieved by product state inputs and separable measurements for any size of network, whereas for rank-three and general amplitude damping channels, optimal identification requires entanglement with N qubit ancillas. Published by the American Physical Society 2024
The accurate identification of faulty hardware is a fundamental requirement for reliable quantum information processing. We address this problem in a quantum setting, where a series of
n devices is intended to apply the same unitary operation, but
k malfunctioning devices among them apply a different, unknown unitary action. Under the assumption of complete ignorance regarding the specific unitary transformation applied, we model our hypotheses using representation-theoretic tools and study the zero-error protocol for identifying these faulty devices. We derive the optimal success probability for the single- and two-anomaly scenarios, demonstrating that it is independent of the total number of devices in the series. Furthermore, we present a simple protocol that makes use of ancillary systems that achieves this optimal limit. Notably, this protocol offers significant operational advantages, such as allowing us to test each device independently. Finally, we extend our analysis to the general scenario in which both the number of anomalies and the local dimension of the systems are arbitrary, evaluating our protocol's performance and conjecturing its global optimality in the general case.
Suppose we want to identify an input state with one of two unknown reference states, where the input state is guaranteed to be equal to one of the reference states. We assume that no classical knowledge of the reference states is given, but a certain number of copies of them are available instead. Two reference states are independently and randomly chosen from the state space in a unitary invariant way. This is called the quantum state identification problem, and the task is to optimize the mean identification success probability. In this paper, we consider the case where each reference state is pure and bipartite, and generally entangled. The question is whether the maximum mean identification success probability can be attained by means of a local operations and classical communication (LOCC) measurement scheme. Two types of identification problem are considered when a single copy of each reference state is available. We show that a LOCC scheme attains the globally achievable identification probability in the minimum-error identification problem. In the unambiguous identification problem, however, the maximal success probability by means of LOCC is shown to be less than the globally achievable identification probability.
The rapid advance of quantum information technology requires precise control and manipulation of quantum systems and of their properties; in particular, it is essential to certify that quantum processors truly work quantum mechanically, in order to validate experiments and their results. The problem of certification of quantum states and devices is a demanding one, thus many attempts have been put forward to find ways of efficiently test their basic functionalities, such as their entanglement properties. The main problems addressed in this thesis concern indeed finding optimal strategies for the estimation and characterization of quantum states and channels, with a special focus on entanglement correlations. In our first work we considered the certification of entanglement across a given partition of a multi-qubit system, when only partial information about the corresponding quantum state is available; we tackled the problem of finding the best measurement strategy introducing the statistics of lengths of measurement sequences, choosing multi-qubit Pauli-measurements as observables. Using a sample of random unknown states, we were able to identify the (on average) shortest, i.e. most efficient, measurement sequence to detect entanglement. The investigation was carried out with an algorithm based on the truncated moment sequences (tms) problem, which provides necessary and sufficient conditions for entanglement or separability of a quantum state of a finite dimensional system. This study results in a very efficient strategy especially for symmetric states, for which only a tiny fraction (
10−6) of randomly chosen entangled states are undetected for systems with 6 qubits or more. We continued in our second work with the problem of separability of quantum channels to answer the question whether a given quantum device is able to create entanglement or not. The Choi matrix representation, provided by the Choi–Jamiołkowski isomorphism, casts the problem in terms of systems and ancillas, giving different classes of separability depending on the cut considered between them. Once again, the tms framework turned out to be well suited for this study, giving a unifying approach for the different separability problems; a solution is found in terms of the tms associated to the coordinates of the Choi state, in a fixed basis, and semidefinite programming is used to get a separability certificate. We explored examples of families of 2-qubit and single-qutrit channels, for which our algorithm can give an answer in cases where other criteria remain inconclusive. In a further work we shifted our attention to a different direction, highlighting a connection between the fields of quantum information, Bose-Einstein condensation (BEC) and analogue gravity, thus showing the relevance of quantum information notions in a broader context. We studied the entanglement properties of a BEC analogue of a black hole, which is described by a three-mode Gaussian state; we investigated bipartite and tripartite entanglement measures based on the covariance matrix description, both at zero and finite temperature, providing the best experimental configuration for entanglement detection. In a final stage of this thesis, we started looking at different measurement strategies for testing quantum devices whose functionality can be described by a single parameter; we used a Bayesian approach to estimate this parameter, exploiting the information collected through measurements to update a conditional probability distribution, without the need of estimating expected values of observables. The problem of finding the optimal experimental design can be in this case translated in the optimization of a utility function, which usually guides the update process adaptively at each step; we tried to outperform this approach looking ahead not only at the next step, but at a few ones, in order to obtain an answer of correct or wrong functioning as soon as possible. Moreover, we chose the input state for the quantum channel considered minimizing the error probability given by the Chernoff distance between the outputs of an ideal and a faulty channel; finally, we considered two different final decision criteria and compared their efficiency.
We address a problem of identifying a given pure state with one of two reference pure states, when no classical knowledge on the reference states is given, but a certain number of copies of them are available. We assume the input state is guaranteed to be either one of the two reference states. This problem, which we call quantum pure state identification, is a natural generalization of the standard state discrimination problem. The two reference states are assumed to be independently distributed in a unitary invariant way in the whole state space. We give a complete solution for the averaged maximal success probability of this problem for an arbitrary number of copies of the reference states in general dimension. It is explicitly shown that the obtained mean identification probability approaches the mean discrimination probability as the number of the reference copies goes to infinity.
Port-based teleportation (PBT) is a form of quantum teleportation in which no corrective unitary is required on the part of the receiver. Two primary regimes exist—deterministic PBT in which teleportation is always successful, but is imperfect, and probabilistic PBT, in which teleportation succeeds with probability less than one, but teleportation is perfect upon a success. Two further regimes exist within each of these, in which the resource state used for the teleportation is fixed to a maximally entangled state or free to be optimized. Recent works have resolved the long-standing problem of efficiently implementing port-based teleportation, tackling the two deterministic cases for qudits. Here, we provide algorithms in all four regimes for qubits. Emphasis is placed on the practicality of these algorithms, where we give polynomial improvements in the known gate complexity for PBT, as well as an exponential improvement in the required number of ancillas (albeit in separate protocols). Our approach to the implementation of the square-root measurement in PBT can be directly generalized to other highly symmetric state ensembles. For certain families of states, such a framework yields efficient algorithms in the case in which the Petz-recovery algorithm for the square-root measurement runs in exponential time. Published by the American Physical Society 2024