Related papers: Quantum Algorithm for Quantum State Discrimination…
Reconstructing the state of a complex quantum system represents a pivotal task for all quantum information applications, both for characterization purposes and for verification of quantum protocols. Recent technological developments have…
Quantum indistinguishability of non-orthogonal quantum states is a valuable resource in quantum information applications such as cryptography and randomness generation. In this article, we present a sequential state-discrimination scheme…
The reconstruction of quantum states from a sufficient set of experimental data can be achieved with arbitrarily weak measurement interactions. Since such weak measurements have negligible back-action, the quantum state reconstruction is…
The minimum error probability for distinguishing between two quantum states is bounded by the Helstrom limit, derived under the assumption that measurement strategies are restricted to positive operator-valued measurements. We explore…
The weak measurement (WM) and quantum measurement reversal (QMR) are crucial in protecting the collapse of quantum states. The idea of WM and QMR has recently been used to protect and enhance quantum correlations and universal quantum…
We consider the discrimination of two-party quantum states and provide a quantum data-hiding scheme using two-qubit separable states. We first provide a bound on the optimal local discrimination of two-party quantum states, and establish a…
The problem of discriminating with minimum error between two mixed quantum states is reviewed, with emphasize on the detection operators necessary for performing the measurement. An analytical result is derived for the minimum probability…
Quantum process tomography is an experimental technique to fully characterize an unknown quantum process. Standard quantum process tomography suffers from exponentially scaling of the number of measurements with the increasing system size.…
The impossibility to clone an unknown quantum state is a powerful principle to understand the nature of quantum mechanics, especially within the context of quantum computing and quantum information. This principle has been generalized to…
The presence of noise in quantum computers hinders their effective operation. Even though quantum error correction can theoretically remedy this problem, its practical realization is still a challenge. Testing and benchmarking noisy,…
We show a geometric formulation for minimum-error discrimination of qubit states, that can be applied to arbitrary sets of qubit states given with arbitrary a priori probabilities. In particular, when qubit states are given with equal…
We show how to optimally protect quantum states and quantum entanglement under non-zero temperature based on measurement reversal from weak measurement. In particular, we present explicit formulas of the protection.
The task of testing whether two uncharacterized quantum devices behave in the same way is crucial for benchmarking near-term quantum computers and quantum simulators, but has so far remained open for continuous-variable quantum systems. In…
We consider bipartite quantum state discrimination and present a quantum data-hiding scheme utilizing an orthogonal separable state ensemble. Using a bound on local minimum-error discrimination, we provide a sufficient condition for the…
We propose a way to measure the qubit state of an arbitrary sub-ensemble of atoms in an array without significantly disturbing the quantum information in the unmeasured atoms. The idea is to first site-selectively transfer atoms out of the…
Quantum devices use qubits to represent information, which allows them to exploit important properties from quantum physics, specifically superposition and entanglement. As a result, quantum computers have the potential to outperform the…
The ability to uniquely identify a quantum state is integral to quantum science, but for non-orthogonal states, quantum mechanics precludes deterministic, error-free discrimination. However, using the non-deterministic protocol of…
Near-term quantum computers are noisy, and therefore must run algorithms with a low circuit depth and qubit count. Here we investigate how noise affects a quantum neural network (QNN) for state discrimination, applicable on near-term…
We investigate quantum state discrimination with confidentiality. $N$ observers share a given quantum state belonging to a finite set of known states. The observers want to determine the state as accurately as possible and send a…
Quantifying the complexity of quantum states is a longstanding key problem in various subfields of science, ranging from quantum computing to the black-hole theory. The lower bound on quantum pure state complexity has been shown to grow…