相关论文: A mathematical proof for a ground-state identifica…

We introduce an entanglement criterion to exclude full separability of quantum states. We present numerical evidence that the criterion is necessary and sufficient for the class of GHZ diagonal three-qubit states and estimate the volume of…

Taking the view that computation is after all physical, we argue that physics, particularly quantum physics, could help extend the notion of computability. Here, we list the important and unique features of quantum mechanics and then…

We present a numerical method for solving the separability problem of Gaussian quantum states in continuous-variable quantum systems. We show that the separability problem can be cast as an equivalent problem of determining the feasibility…

This thesis seeks to develop a general method for solving so-called quantum realizability problems, which are questions of the following form: under which conditions does there exist a quantum state exhibiting a given collection of…

We construct a probabilistic quantum cloning machine by a general unitary-reduction operation. With a postselection of the measurement results, the machine yields faithful copies of the input states. It is shown that the states secretly…

The problem of quantum state classification asks how accurately one can identify an unknown quantum state that is promised to be drawn from a known set of pure states. In this work, we introduce the notion of $k$-learnability, which…

Entanglement, or quantum inseparability, is a crucial resource in quantum information applications, and therefore the experimental generation of separated yet entangled systems is of paramount importance. Experimental demonstrations of…

Any rule for identifying a quantum system's state within a set of two non-orthogonal pure states by a single measurement is flawed. It has a non-zero probability of either yielding the wrong result or leaving the query undecided. This also…

A new simple proof of the adiabatic theorem is given in the finite dimensional case for nondegenerate as well as degenerate states. The explicitly integrable two level system is considered as an example. It is demonstrated that the error…

Matrix product states provide a natural entanglement basis to represent a quantum register and operate quantum gates on it. This scheme can be materialized to simulate a quantum adiabatic algorithm solving hard instances of a NP-Complete…

For many systems with quenched disorder the study of ground states can crucially contribute to a thorough understanding of the physics at play, be it for the critical behavior if that is governed by a zero-temperature fixed point or for…

Motivated by the Kronecker product approximation technique, we have developed a very simple method to assess the inseparability of bipartite quantum systems, which is based on a realigned matrix constructed from the density matrix. For any…

We give an update on a quantum adiabatic algorithm for the Turing noncomputable Hilbert's tenth problem, and briefly go over some relevant issues and misleading objections to the algorithm.

We study the Hamiltonian associated with the quantum adiabatic algorithm with a random cost function. Because the cost function lacks structure we can prove results about the ground state. We find the ground state energy as the number of…

We realize the probabilistic cloning and identifying linear independent quantum states of multi-particles system, given prior probability, with universal quantum logic gates using the method of unitary representation. Our result is…

We investigate the ability of a quantum measurement device to discriminate two states or, generically, two hypothesis. In full generality, the measurement can be performed a number $n$ of times, and arbitrary pre-processing of the states…

Probabilistic quantum state transformations can be characterized by the degree of state separation they provide. This, in turn, sets limits on the success rate of these transformations. We consider optimum state separation of two known pure…

We derive an analytical lower bound for the concurrence of a bipartite quantum state in arbitrary dimension. A functional relation is established relating concurrence, the Peres-Horodecki criterion and the realignment criterion. We…

In this paper, we consider the problem of unambiguous discrimination between a set of mixed quantum states. We first divide the density matrix of each mixed state into two parts by the fact that it comes from ensemble of pure quantum…

We formalize the hidden measurement approach within the very general notion of an interactive probability model. We narrow down the model by assuming the state space of a physical entity is a complex Hilbert space and introduce the…