Related papers: Canonical Decompositions of n-qubit Quantum Comput…
The CANDECOMP/PARAFAC (CP) decomposition is a generalization of the spectral decomposition of matrices to higher-order tensors. In this paper we use the CP decomposition to study unitary equivalence of higher order tensors and construct…
In a recent study (Ref. [1]), quantum annealing was reported to exhibit a scaling advantage for approximately solving Quadratic Unconstrained Binary Optimization (QUBO). However, this claim critically depends on the choice of classical…
We investigate a two-qubit system to understand the relationship between concurrence and mutual information, where the former determines the amount of quantum entanglement, whereas the latter is its classical residue after performing local…
In this paper, we consider a subclass of quantum states in the multipartite system, namely, the supersymmetric states. We investigate the problem whether they admit the symmetrically separable decomposition, i.e., each term in this…
Stochastic Unit Commitment (SUC) has been proposed to manage the uncertainties driven by renewable integration, but it leads to significant computational complexity. When accelerated by Benders Decomposition (BD), the master problem becomes…
We classify, up to local unitary equivalence, the set of $n$-qubit states that is stabilized by the diagonal subgroup of the local unitary group. We exhibit a basis for this set, parameterized by diagrams of nonintersecting chords…
Based on the Wu's scheme[1], We prepare the general N-qubit W state. We find that the concurrence of two qubits in general N-qubit W state is only related to their coefficients and we successfully apply the general N-qubit W state to…
We study the dynamics of quantum coherence and quantum correlations in two semiconductor double-dot molecules separated by a distance and indirectly coupled via a transmission line resonator. Dominant dissipation processes are considered.…
Motivated by understanding the power of quantum computation with restricted number of qubits, we give two complete characterizations of unitary quantum space bounded computation. First we show that approximating an element of the inverse of…
Kutasov-Schwimmer (KS) dualities involve a rank-$2$ field with a polynomial superpotential. We derive KS-like dualities via deconfinement, that is assuming only Seiberg-like dualities, which instead just involve fundamental matter. Our…
Canonical Polyadic Decomposition (CPD) of a third-order tensor is decomposition in a minimal number of rank-$1$ tensors. We call an algorithm algebraic if it is guaranteed to find the decomposition when it is exact and if it only relies on…
The Cartan control problem of the quantum circuits discussed from the differential geometry point of view. Abstract unitary transformations of $SU(2^n)$ are realized physically in the projective Hilbert state space $CP(2^n-1)$ of the…
Quantum computing (QC) is at the cusp of a revolution. Machines with 100 quantum bits (qubits) are anticipated to be operational by 2020 [googlemachine,gambetta2015building], and several-hundred-qubit machines are around the corner.…
The deterministic quantum computing with one qubit (DQC1) is a mixed-state quantum computation algorithm that evaluates the normalized trace of a unitary matrix and is more powerful than the classical counterpart. We find that the…
We investigate the generation of multipartite entangled SU(k+1) coherent states using a quantum network involving a sequence of k beam splitters. We particularly investigate the entanglement in multipartite SU(2) coherent states (k = 1). We…
The classical theory for a massive free particle moving on the group manifold $AdS_3 \cong SL(2, \mathbb{R})$ is analysed in detail. In particular a symplectic structure and two different sets of canonical coordinates are explicitly found,…
There are various statements in the physics literature about the stratification of quantum states, for example into orbits of a unitary group, and about generalized differentiable structures on it. Our aim is to clarify and make precise…
Suzuki-Trotter decompositions of exponential operators like $\exp(Ht)$ are required in almost every branch of numerical physics. Often the exponent under consideration has to be split into more than two operators $H=\sum_k A_k$, for…
The canonical Schmidt decomposition of quantum states is discussed and its implementation to the Quantum Computation Simulator is outlined. In particular, the semiorder relation in the space of quantum states induced by the lexicographic…
We investigate the amount of noise required to turn a universal quantum gate set into one that can be efficiently modelled classically. This question is useful for providing upper bounds on fault tolerant thresholds, and for understanding…