Related papers: Constructing Mutually Unbiased Bases from Quantum …
The problem of security of quantum key protocols is examined. In addition to the distribution of classical keys, the problem of encrypting quantum data and the structure of the operators which perform quantum encryption is studied. It is…
A Latin square of order $n$ is an $n \times n$ matrix of $n$ symbols, such that each symbol occurs exactly once in each row and column. For an odd prime power $q$ let $\mathbb{F}_q$ denote the finite field of order $q$. A quadratic Latin…
Every Latin square has three attributes that can be even or odd, but any two of these attributes determines the third. Hence the parity of a Latin square has an information content of 2 bits. We extend the definition of parity from Latin…
Genuine entanglement is the strongest form of multipartite entanglement. Genuinely entangled pure states contain entanglement in every bipartition and as such can be regarded as a valuable resource in the protocols of quantum information…
Latin squares and hypercubes are combinatorial designs with several applications in statistics, cryptography and coding theory. In this paper, we generalize a construction of Latin squares based on bipermutive cellular automata (CA) to the…
A set of mutually unbiased bases (MUBs) is said to be unextendible if there does not exist another basis that is unbiased with respect to the given set. Here, we prove the existence of smaller sets of MUBs in prime-squared dimensions…
We relate the phenomenon of local indistinguishability of orthogonal states with the properties of unextendibility and uncompletability of entangled bases for bipartite and multipartite quantum systems. We prove that all two-qubit…
Regarding neighbor balance, we consider natural generalizations of $D$-complete Latin squares and Vatican squares from the finite to the infinite. We show that if $G$ is an infinite abelian group with $|G|$-many square elements, then it is…
We present Schmidt decomposition formulas for mutually orthogonal two-qubit pure states and classify orthonormal sets based on their entanglement structure. First, we derive explicit Schmidt decomposition formulas for any pure state and…
Adaptive construction of ansatz circuits offers a promising route towards applicable variational quantum eigensolvers on near-term quantum hardware. Those algorithms aim to build up optimal circuits for a certain problem and ansatz circuits…
With the advent of quantum computers, researchers are exploring if quantum mechanics can be leveraged to solve important problems in ways that may provide advantages not possible with conventional or classical methods. A previous work by…
Near-term quantum computers are primarily limited by errors in quantum operations (or gates) between two quantum bits (or qubits). A physical machine typically provides a set of basis gates that include primitive 2-qubit (2Q) and 1-qubit…
For a system of N qubits, spanning a Hilbert space of dimension d=2^N, it is known that there exists d+1 mutually unbiased bases. Different construction algorithms exist, and it is remarkable that different methods lead to sets of bases…
Certifying entanglement is an important step in the development of many quantum technologies, especially for higher-dimensional systems, where entanglement promises increased capabilities for quantum communication and computation. A key…
Designs for quantum error correction depend strongly on the connectivity of the qubits. For solid state qubits, the most straightforward approach is to have connectivity constrained to a planar graph. Practical considerations may also…
Two Latin squares of order $n$ are $r$-orthogonal if, when superimposed, there are exactly $r$ distinct ordered pairs. The spectrum of all values of $r$ for Latin squares of order $n$ is known. A Latin square $A$ of order $n$ is…
High-quality, large-scale datasets have played a crucial role in the development and success of classical machine learning. Quantum Machine Learning (QML) is a new field that aims to use quantum computers for data analysis, with the hope of…
A quantum Latin square is an $n \times n$ array of unit vectors where each row and column forms an orthonormal basis of a fixed complex vector space. We introduce the notion of $(G,G')$-invariant quantum Latin squares for finite groups $G$…
Recently [Karimipour and Memarzadeh, Phys. Rev. A 73, 012329 (2006)] studied the problem of finding a family of orthonormal bases in a bipartite space each of dimension $D$ with the following properties: (i) The family continuously…
In scattered data approximation, the span of a finite number of translates of a chosen radial basis function is used as approximation space and the basis of translates is used for representing the approximate. However, this natural choice…