Related papers: Biunitary constructions in quantum information
We report some observations concerning two well-known approaches to construction of quantum groups. Thus, starting from a bialgebra of inhomogeneous type and imposing quadratic, cubic or quartic commutation relations on a subset of its…
In mathematical aspect, we introduce quantum algorithm and the mathematical structure of quantum computer. Quantum algorithm is expressed by linear algebra on a finite dimensional complex inner product space. The mathematical formulations…
Constructing four six-dimensional mutually unbiased bases (MUBs) is an open problem in quantum physics and measurement. We investigate the existence of four MUBs including the identity, and a complex Hadamard matrix (CHM) of Schmidt rank…
A proof is given that an invertible and a unitary operator can be used to reproduce the effect of a q-deformed commutator of annihilation and creation operators. In other words, the original annihilation and creation operators are mapped…
This is a brief overview of quantum holonomies in the context of quantum computation. We choose an adequate set of quantum logic gates, namely, a phase gate, the Hadamard gate, and a conditional-phase gate and show how they can be…
We give an algorithm allowing to construct bases of local unitary invariants of pure k-qubit states from the knowledge of polynomial covariants of the group of invertible local filtering operations. The simplest invariants obtained in this…
Following the B. Hiley belief that unresolved problems of conventional quantum mechanics could be the result of a wrong mathematical structure, an alternative basic structure is suggested. Critical part of the structure is modification of…
Fault-tolerant quantum computation critically depends on architectures uniting high encoding rates with physical implementability. Quantum low-density parity-check (qLDPC) codes, including bivariate bicycle (BB) codes, achieve dramatic…
We have extended the Paley constructions for Hadamard matrices and obtained some series of Hadamard matrices. Especially Paley construction-II is applicable for odd prime power q is congruent to 1(mod 4) however our method is applicable for…
Unitary $k$-designs are distributions of unitary gates that match the Haar distribution up to its $k$-th statistical moment. They are a crucial resource for randomized quantum protocols. However, their implementation on encoded logical…
This paper is dedicated to the problem of verification of matrices for unitary similarity. For the case of nonderogatory matrices, we have been able to present the new solution for this problem based on geometric approach. The main…
Ternary quantum systems are being studied because these provide more computational state space per unit of information, known as qutrit. A qutrit has three basis states, thus a qubit may be considered as a special case of a qutrit where the…
We outline refined versions of two major quantum algorithms for performing principal component analysis and solving linear equations. Our methods are exponentially faster than their classical counterparts and even previous quantum…
We show that a pair of complementary dagger-Frobenius algebras, equipped with a self-conjugate comonoid homomorphism onto one of the algebras, produce a nontrivial unitary morphism on the product of the algebras. This gives an abstract…
The Lie bialgebras of the (1+1) extended Galilei algebra are obtained and classified into four multiparametric families. Their quantum deformations are obtained, together with the corresponding deformed Casimir operators. For the coboundary…
Scalable quantum computation in realistic devices requires that precise control can be implemented efficiently in the presence of decoherence and operational errors. We propose a general constructive procedure for designing robust unitary…
We verify a conjecture on the structure of higher-rank numerical ranges for a wide class of unitary and normal matrices. Using analytic and geometric techniques, we show precisely how the higher-rank numerical ranges for a generic unitary…
We show that an n-th root of the Walsh-Hadamard transform (obtained from the Hadamard gate and a cyclic permutation of the qubits), together with two diagonal matrices, namely a local qubit-flip (for a fixed but arbitrary qubit) and a…
We use combinatorial and Fourier analytic arguments to prove various non-existence results on systems of real and complex unbiased Hadamard matrices. In particular, we prove that a complete system of complex mutually unbiased Hadamard…
Mutually unbiased bases (MUBs) are highly symmetric bases on complex Hilbert spaces, and the corresponding rank-1 projective measurements are ubiquitous in quantum information theory. In this work, we study a recently introduced…