Related papers: Geometric Bloch Vector Solution to Minimum Error D…
Quantum state discrimination is a fundamental primitive in quantum statistics where one has to correctly identify the state of a system that is in one of two possible known states. A programmable discrimination machine performs this task…
Quantifying coherence and entanglement is extremely important in quantum information processing. Here, we present numerical and analytical results for the geometric measure of coherence, and also present numerical results for the geometric…
Performing experiments on small-scale quantum computers is certainly a challenging endeavor. Many parameters need to be optimized to achieve high-fidelity operations. This can be done efficiently for operations acting on single qubits as…
The problem addressed is to design a detector which is maximally sensitive to specific quantum states. Here we concentrate on quantum state detection using the worst-case a posteriori probability of detection as the design criterion. This…
We present an algebraic algorithm for quantum state tomography that leverages measurements of certain observables to estimate structured entries of the underlying density matrix. Under low-rank assumptions, the remaining entries can be…
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…
Geometric phase has been proposed as one of the promising methodologies to perform fault tolerant quantum computations. However, since decoherence plays a crucial role in such studies, understanding of mixed state geometric phase has become…
Statistical design of experiments is widely used in scientific and industrial investigations. A generalized minimum aberration (GMA) orthogonal array is optimum under the well-established, so-called GMA criterion, and such an array can…
We propose a generalized discrimination scheme for mixed quantum states. In the present scenario we allow for certain fixed fraction of inconclusive results and we maximize the success rate of the quantum-state discrimination. This protocol…
We investigate the performance of Grover's quantum search algorithm on a register which is subject to loss of the particles that carry the qubit information. Under the assumption that the basic steps of the algorithm are applied correctly…
The geometry of the Quantum State Space, described by Bloch vectors, is a very intricate one. A deeper understanding of this geometry could lead to the solution of some difficult problems in Quantum Foundations and Quantum Information such…
The study of genetic map linearization leads to a combinatorial hard problem, called the {\em minimum breakpoint linearization} (MBL) problem. It is aimed at finding a linearization of a partial order which attains the minimum breakpoint…
Nonlinear variants of quantum mechanics can solve tasks that are impossible in standard quantum theory, such as perfectly distinguishing nonorthogonal states. Here we derive the optimal protocol for distinguishing two states of a qubit…
In recent years, the detection of genuine multipartite entanglement (GME) via machine learning has received scant attention. Here, we employ convolutional neural networks (CNNs), as well as CNNs enhanced with squeeze-and-excitation (SE) to…
Based on our previous publication [U. Herzog and J. A. Bergou, Phys.Rev. A 71, 050301(R) (2005)] we investigate the optimum measurement for the unambiguous discrimination of two mixed quantum states that occur with given prior…
The task of learning a quantum circuit to prepare a given mixed state is a fundamental quantum subroutine. We present a variational quantum algorithm (VQA) to learn mixed states which is suitable for near-term hardware. Our algorithm…
A suitable generalized measurement described by a 4-element positive operator-valued measure (POVM) on each particle of a two-qubit system in the singlet state is, from the point of view of Einstein, Podolsky, and Rosen's (EPR's) criterion…
This paper is concerned with the phase estimation algorithm in quantum computing algorithms, especially the scenarios where (1) the input vector is not an eigenvector; (2) the unitary operator is not exactly implemented; (3) random…
Inspired by the decomposition in the hybrid quantum-classical optimization algorithm we introduced in arXiv:1902.04215, we propose here a new (fully classical) approach to solving certain non-convex integer programs using Graver bases. This…
An algorithm based on quantum phase estimation, which discriminates quantum states nondestructively within a set of arbitrary orthogonal states, is described and experimentally verified by a NMR quantum information processor. The procedure…