相关论文: Condition and capability of quantum state separati…

We discuss how to reconstruct quantum theory from operational postulates. In particular, the following postulates are consistent only with for classical probability theory and quantum theory. Logical Sharpness: There is a one-to-one map…

The coherence of an individual quantum state can be meaningfully discussed only when referring to a preferred basis. This arbitrariness can however be lifted when considering sets of quantum states. Here we introduce the concept of set…

Quantum theory is consistent with a computational model permitting black-box operations to be applied in an indefinite causal order, going beyond the standard circuit model of computation. The quantum switch -- the simplest such example --…

We introduce the concept of a physical process that purifies a mixed quantum state, taken from a set of states, and investigate the conditions under which such a purification map exists. Here, a purification of a mixed quantum state is a…

We show that thresholds for fault-tolerant quantum computation are solely determined by the quality of single-system operations if one allows for d-dimensional systems with $8 \leq d \leq 32$. Each system serves to store one logical qubit…

Within context of quantum logic, it is possible to assign dispersion-free probabilities to experimental propositions pertaining to qubits. This makes qubits distinct from the rest of quantum systems since the latter do not admit…

According to quantum theory, pure physical states correspond to equivalence classes of state vectors, where any two members of one class differ by a complex factor. The point is that such a factor does not change the probability for the…

This paper considers the realizability of quantum gates from the perspective of information complexity. Since the gate is a physical device that must be controlled classically, it is subject to random error. We define the complexity of gate…

After introducing the partially separable concept, we proved the equivalence between the partial separability of a given $m$-partite subsystem with $m$ qubits and the purity of states of this $m$-partite subsystem for a pure state in…

We define the algorithmic complexity of a quantum state relative to a given precision parameter, and give upper bounds for various examples of states. We also establish a connection between the entanglement of a quantum state and its…

Due to the no-cloning theorem, the unknown quantum state can only be cloned approximately or exactly with some probability. There are two types of cloners: universal and state-dependent cloner. The optimal universal cloner has been found…

Quantum advantage is notoriously hard to find and even harder to prove. For example the class of functions computable with classical physics actually exactly coincides with the class computable quantum-mechanically. It is strongly believed,…

Two pure orthogonal quantum states can be perfectly distinguished by sequential local action of multiple pairs of parties. However, this process typically leads to the complete dissolution of entanglement in the states being discriminated.…

It is often stated that quantum mechanics only makes statistical predictions and that a quantum state is described by the various probability distributions associated with it. Can we describe a quantum state completely in terms of…

For two qubits and for general bipartite quantum systems, we give a simple spectral condition in terms of the ordered eigenvalues of the density matrix which guarantees that the corresponding state is separable.

We establish a sharp quantum advantage in determining the parity (even/odd) of an unknown permutation applied to any number $n \ge 3$ of particles. Classically, this is impossible with fewer than $n$ labels, being that the success is…

Clarifying the relation between the whole and its parts is crucial for many problems in science. In quantum mechanics, this question manifests itself in the quantum marginal problem, which asks whether there is a global pure quantum state…

We derive a necessary condition for the existence of a completely-positive, linear, trace-preserving map which deterministically transforms one finite set of pure quantum states into another. This condition is also sufficient for…

Quantum states with nonlinear squeezing are a necessary resource for deterministic implementation of high-order quadrature phase gates that are, in turn, sufficient for advanced quantum information processing. We demonstrate that this class…

We derive general discrimination of quantum states chosen from a certain set, given initial $M$ copies of each state, and obtain the matrix inequality, which describe the bound between the maximum probability of correctly determining and…