Related papers: Exact universality from any entangling gate withou…
A proof is given, which relies on the commutator algebra of the unitary Lie groups, that quantum gates operating on just two bits at a time are sufficient to construct a general quantum circuit. The best previous result had shown the…
Tensor universality often implies that multi-partite quantum-state processing is determined by what happens in totally disentangled cases. In independent systems relative time direction for the parts is arbitrary. This hints that time may…
Based on the complementarity relation between entanglement of a composite system and the purity of a subsystem, we propose a simple method to measure the amount of entanglement. The method can be applied to a bipartite system in a pure…
We derive a general framework that connects every positive map with a corresponding witness for partial separability in multipartite quantum systems. We show that many previous approaches were intimately connected to the witnesses derived…
Quantum entanglement and nonlocality are inextricably linked. However, while entanglement is necessary for nonlocality, it is not always sufficient in the standard Bell scenario. We derive sufficient conditions for entanglement to give rise…
Efficient verification of the functioning of quantum devices is a key to the development of quantum technologies, but is a daunting task as the system size increases. Here we propose a simple and general framework for verifying unitary…
We show that the set of entries generated by any finite set of doubly stochastic matrices is nowhere dense, in contrast to the cases of stochastic matrices or unitary matrices. In other words, there is no finite universal set of doubly…
We present a criterion that serves as the basis for a polynomial-time algorithm to decide whether a finite set of qudit gates exponentiated by some Hamiltonians is universal. Our approach formulates universality in Lie algebraic terms and…
The gate version of quantum computation exploits several quantum key resources as superposition and entanglement to reach an outstanding performance. In the way, this theory was constructed adopting certain supposed processes imitating…
Properties of universality have essential relevance for the theory of random matrices usually called the Wigner ensemble. The issue was analysed up to recent years with detailed and relevant results. We present a slightly different view and…
Inspired by its fundamental importance in quantum mechanics, we define and study the notion of entanglement for abstract physical theories, investigating its profound connection with the concept of superposition. We adopt the formalism of…
We introduce a technique for applying quantum expanders in a distributed fashion, and use it to solve two basic questions: testing whether a bipartite quantum state shared by two parties is the maximally entangled state and disproving a…
We consider unambiguous discrimination of two separable bipartite states, one being pure and the other being a rank-2 mixed state. There is a gap between the optimal success probability under global measurements and the one achieved by…
Based on the residual entanglement [9] (Phys. Rev. A \textbf{71}, 044301 (2005)), we present the global entanglement for a multipartite quantum state. The measure is shown to be also obtained by the bipartite partitions of the multipartite…
A global quantum quench can be modeled by a quantum circuit with local unitary gates. In general, entanglement grows linearly at a rate given by entanglement velocity, which is upper bounded by the growth of the light cone. We show that the…
It is shown that every concretizable category can be fully embedded into the category of accessible set functors and natural transformations.
We prove the existence of a class of two--input, two--output gates any one of which is universal for quantum computation. This is done by explicitly constructing the three--bit gate introduced by Deutsch [Proc.~R.~Soc.~London.~A {\bf 425},…
The equivalence of arbitrary dimensional bipartite states under local unitary transformations (LUT) is studied. A set of invariants and ancillary invariants under LUT is presented. We show that two states are equivalent under LUT if and…
We study languages of unambiguous VASS, that is, Vector Addition Systems with States, whose transitions read letters from a finite alphabet, and whose acceptance condition is defined by a set of final states (i.e., the coverability…
It was shown by M.A. Nielsen and I.L. Chuang 1997, that it is impossible to build strictly universal programmable quantum gate array, that could perform any unitary operation precisely and it was suggested to use probabilistic gate arrays…