Related papers: Canonical Decompositions of n-qubit Quantum Comput…
TThe problem of finding the resource free, closest local unitary, to any bipartite unitary gate $U$ is addressed. Previously discussed as a measure of nonlocality, the distance $K_D(U)$ to the nearest product unitary has implications for…
We study generalized concurrences as a tool to detect the entanglement of bipartite quantum systems. By considering the case of 2 X 4 states of rank 2, we prove that generalized concurrences do not, in general, give a necessary and…
The probabilistic nature of single-photon sources and photon-photon interactions encourages encoding as much quantum information as possible in every photon for the purpose of photonic quantum information processing. Here, by encoding…
We present a lower bound of concurrence for arbitrary dimensional bipartite quantum states. This lower bound may be used to improve all the known lower bounds of concurrence. Moreover, the lower bound gives rise to an operational sufficient…
The generation of $k$-designs (pseudorandom distributions that emulate the Haar measure up to $k$ moments) with local quantum circuit ensembles is a problem of fundamental importance in quantum information and physics. Despite the extensive…
There has recently been a surge of new ideas and results for 2+1 dimensional gauge theories. We consider a recently proposed duality for 2+1 dimensional QCD, which predicts a symmetry-breaking phase. Using the F-theorem, we find bounds on…
S.L. Woronowicz proved in 1991 that quantum SU(1,1) does not exist as a locally compact quantum group. Results by L.I. Korogodsky in 1994 and more recently by Woronowicz gave strong indications that the normalizer N of SU(1,1) in SL(2,C) is…
The dynamics of a two-qubit system is considered with the aim of a general categorization of the different ways in which entanglement can disappear in the course of the evolution, e.g., entanglement sudden death. The dynamics is described…
It is generally believed that entanglement is essential for quantum computing. We present here a few simple examples in which quantum computing without entanglement is better than anything classically achievable, in terms of the reliability…
Motivated by recent development in quantum entanglement, we study relations among concurrence $C$, SU$_q$(2) algebra, quantum phase transition and correlation length at the zero temperature for the XXZ chain. We find that at the SU(2)…
We present the Quantum Paldus Transform: an efficient quantum algorithm for block-diagonalising fermionic, spin-free Hamiltonians in the second quantisation. Our algorithm implements an isometry between the occupation number basis of a…
The Gauss decomposition of quantum groups and supergroups are considered. The main attention is paid to the R-matrix formulation of the Gauss decomposition and its properties as well as its relation to the contraction procedure. Duality…
In a quantum computer, creating superpositions of quantum bits (qubits) in different states can lead to a speed-up over classical computers [1], but quantum mechanics also allows for the superposition of quantum circuits [2]. In fact, it…
The purpose of this paper is to introduce several basic theorems of coherent states and generalized coherent states based on Lie algebras su(2) and su(1,1), and to give some applications of them to quantum information theory for graduate…
In the context of entanglement in relativistic $2\to 2$ scattering described by a perturbative $S$-matrix, we derive analytically the concurrence for a mixed final state of two qubits corresponding to a discrete quantum number of the…
We show that higher order inter-group covariances involving even number of qubits are necessarily positive semidefinite for N qubit separable states, which are completely symmetric under permutations of the qubits. This identification leads…
We give a careful proof that a parallelized version of adiabatic quantum computation can efficiently simulate universal gate model quantum computation. The proof specifies an explicit parameter-dependent Hamiltonian $H({\lambda})$ that is…
Quantum annealing may provide advantages over simulated annealing on solving some problems such as Kth order binary optimization problem. No feasible architecture exists to implement the high-order optimization problem (K > 2) on current…
The discovery of integrable $N=2$ supersymmetric Landau-Ginzburg theories whose chiral rings are fusion rings suggests a close connection between fusion rings, the related Landau-Ginzburg superpotentials, and $N=2$ quantum integrability. We…
A variety of three-dimensional left-covariant differential calculi on the quantum group $SU_q(2)$ is considered using an approach based on global $ U(1) $ -covariance. Explicit representations of possible $q $-Lie algebras are constructed…