Related papers: Optimal state discrimination and unstructured sear…
We present two quantum interior point methods for semidefinite optimization problems, building on recent advances in quantum linear system algorithms. The first scheme, more similar to a classical solution algorithm, computes an inexact…
Quantum interferometry and quantum information processing have been proposed for Bose-Einstein condensates (BECs), but BECs are described in complicated ways such as using quantum field theory or using a nonlinear differential equation.…
The hardness to solve an unstructured quantum search problem by a standard quantum search algorithm mainly originates from the low efficiency to amplify the amplitude of the marked state by the oracle unitary operation associated with other…
We initially consider a quantum system consisting of two qubits, which can be in one of two nonorthogonal states, \Psi_0 or \Psi_1. We distribute the qubits to two parties, Alice and Bob. They each measure their qubit and then compare their…
Solving linear ordinary differential equations (ODE) is one of the most promising applications for quantum computers to demonstrate exponential advantages. The challenge of designing a quantum ODE algorithm is how to embed non-unitary…
There is great interest in generating and controlling entanglement in Bose-Einstein condensates and similar ensembles for use in quantum computation, simulation, and sensing. One class of entangled states useful for enhanced metrology are…
We derive the optimal measurement for quantum state discrimination without a priori probabilities, i.e. in a minimax strategy instead of the usually considered Bayesian one. We consider both minimal-error and unambiguous discrimination…
Quantum noise constitutes a fundamental obstacle to realizing practical quantum technologies. To address the pivotal challenge of identifying quantum systems least affected by noise, we introduce the purest quantum state identification,…
A long-standing problem at the interface of artificial intelligence and applied mathematics is to devise an algorithm capable of achieving human level or even superhuman proficiency in transforming observed data into predictive mathematical…
Many quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given by a black box. As in the classical version of decision trees, different kinds of quantum query algorithms are possible: exact,…
It is known that a party with access to a Deutschian closed timelike curve (D-CTC) can perfectly distinguish multiple non-orthogonal quantum states. In this paper, we propose a practical method for discriminating multiple non-orthogonal…
We present a reliable algorithm to evaluate quantum discord for general two--qubit states, amending and extending an approach recently put forward for the subclass of X--states. A closed expression for the discord of arbitrary states of two…
We consider the problem of designing a measurement to minimize the probability of a detection error when distinguishing between a collection of possibly non-orthogonal mixed quantum states. We show that if the quantum state ensemble…
We consider the optimal discrimination of nonorthogonal qubit states with post-measurement information and provide an analytic structure of the optimal measurements. We also show that there is always a null optimal measurement when…
Quantum algorithms use the principles of quantum mechanics, as for example quantum superposition, in order to solve particular problems outperforming standard computation. They are developed for cryptography, searching, optimisation,…
We consider the problem of designing an optimal quantum detector to minimize the probability of a detection error when distinguishing between a collection of quantum states, represented by a set of density operators. We show that the design…
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…
We consider the problem of determining the state of an unknown quantum sequence without error. The elements of the given sequence are drawn with equal probability from a known set of linearly independent pure quantum states with the…
Einstein-Podolsky-Rosen steering is a manifestation of quantum correlations exhibited by quantum systems, that allows for entanglement certification when one of the subsystems is not characterized. Detecting steerability of quantum states…
The standard quantum search algorithm lacks a feature, enjoyed by many classical algorithms, of having a fixed-point, i.e. a monotonic convergence towards the solution. Here we present two variations of the quantum search algorithm, which…