Related papers: Exact universality from any entangling gate withou…
It is demonstrated that a C^1-unipotent map is globally equivalent to the linear translation T(x,y)=(x+1,y), if the map is fixed point free Similarly, it is proved not only that the fixed point set induced by a C^1-unipotent has no isolated…
The universality phenomenon asserts that the distribution of the eigenvalues of random matrix with i.i.d. zero mean, unit variance entries does not depend on the underlying structure of the random entries. For example, a plot of the…
This study presents a roadmap towards utilizing a single arbitrary gate for universal quantum computing. Since two decades ago, it has been widely accepted that almost any single arbitrary gate with qubit number $>2$ is universal. Utilizing…
We show that the ability to create entanglement is necessary for execution of bipartite quantum gates even when they are applied to unentangled states and create no entanglement. Starting with a simple example we demonstrate that to execute…
Generic high-dimensional bipartite pure states are overwhelmingly likely to be highly entangled. Remarkably, this ubiquitous phenomenon can already arise in finite-dimensional systems. However, unlike the bipartite setting, the entanglement…
A subspace of a multipartite Hilbert space is completely entangled if it contains no product states. Such subspaces can be large with a known maximum size, S, approaching the full dimension of the system, D. We show that almost all…
The paper puts into discussion the concept of universality, in particular for structures not of the power of Turing computability. The question arises if for such structures a universal structure of the same kind exists or not. For that the…
Matchgates are a restricted set of two-qubit gates known to be classically simulable when acting on nearest-neighbor qubits on a path, but universal for quantum computation when the qubits are arranged on certain other graphs. Here we…
We describe a very simple condition that is necessary for the universal rigidity of a complete bipartite framework $(K(n,m),p,q)$. This condition is also sufficient for universal rigidity under a variety of weak assumptions, such as general…
We provide an analytic way to implement any arbitrary two-qubit unitary operation, given an entangling two-qubit gate together with local gates. This is shown to provide explicit construction of a universal quantum circuit that exactly…
$\mathsf{QMA}_1$ is $\mathsf{QMA}$ with perfect completeness, i.e., the prover must accept with a probability of exactly $1$ in the YES-case. Whether $\mathsf{QMA}_1$ and $\mathsf{QMA}$ are equal is still a major open problem. It is not…
We prove, in a multipartite setting, that it's always feasible to exactly transform a genuinely $m$-partite entangled state with sufficient many copies to any other $m$-partite state via local quantum operation and classical communication.…
Universality has been an important concept in computable structure theory. A class $\mathcal{C}$ of structures is universal if, informally, for any structure, of any kind, there is a structure in $\mathcal{C}$ with the same…
We introduce the (logarithmic) bipartite fidelity of a quantum system $A\cup B$ as the (logarithm of the) overlap between its ground-state wave function and the ground-state one would obtain if the interactions between two complementary…
We study when a multipartite non--local unitary operation can deterministically or probabilistically simulate another one when local operations of a certain kind -in some cases including also classical communication- are allowed. In the…
We extend to any maximally entangled state of a bipartite system whose constituents are arbitrarily (but finite) dimensional the result, recently derived for two-dimensional constituents, that hidden variable theories cannot have local…
Understanding what can be inferred about a multi-particle quantum system from only the knowledge of its subparts is a highly non-trivial task. Clearly, if the global system doesn't contain any information resource, nor do its subparts.…
For any bipartite systems, a universal entanglement witness of rank-4 for pure states is obtained and a class of finite rank entanglement witnesses is constructed. In addition, a method of detecting entanglement of a state only by entries…
We prove that every polytope described by algebraic coordinates is the face of a projectively unique polytope. This provides a universality property for projectively unique polytopes. Using a closely related result of Below, we construct a…
The most general structure (in matrix form) of a single-qubit gate is presented. Subsequently, used that to obtain a set of conditions for testing (a) whether a given 2-qubit gate is genuinely a 2-qubit gate, i.e., not decomposable into two…