Related papers: Orthogonality for Quantum Latin Isometry Squares
Quantum computing represents a revolutionary computational paradigm with the potential to address challenges beyond classical computers' capabilities. The development of robust quantum software is indispensable to unlock the full potential…
We show that k=w+2 mutually unbiased bases can be constructed in any square dimension d=s^2 provided that there are w mutually orthogonal Latin squares of order s. The construction combines the design-theoretic objects (k,s)-nets (which can…
Cyclic codes and their various generalizations, such as quasi-twisted (QT) codes, have a special place in algebraic coding theory. Among other things, many of the best-known or optimal codes have been obtained from these classes. In this…
Whether it is at the fabrication stage or during the course of the quantum computation, e.g. because of high-energy events like cosmic rays, the qubits constituting an error correcting code may be rendered inoperable. Such defects may…
Let $L$ be an order-$n$ Latin square. For $X, Y, Z \subseteq \{1, ... ,n\}$, let $L(X, Y. Z)$ be the number of triples $i\in X, j\in Y, k\in Z$ such that $L(i,j) = k$. We conjecture that asymptotically almost every Latin square satisfies…
Orthogonal Graph Representations are essential tools for testing existence of hidden variables in quantum theory. As required by the interpretation of Copenhaghe on the foundations of quantum mechanics, a physical observable is not…
PhD thesis investigating homological quantum codes derived from curved and higher dimensional geometries. In the first part we will consider closed surfaces with constant negative curvature. We show how such surfaces can be constructed and…
Quantum error correction (QEC) is a key concept in quantum computation as well as many areas of physics. There are fundamental tensions between continuous symmetries and QEC. One vital situation is unfolded by the Eastin--Knill theorem,…
We offer a piece of evidence that the problems of finding the number of mutually unbiased bases (MUB) and mutually orthogonal Latin squares (MOLS) might not be equivalent. We study a particular procedure which has been shown to relate the…
We discuss the problem of existence of latin squares without a substructure consisting of six elements $(r_1,c_2,l_3)$, $(r_2,c_3,l_1)$, $(r_3,c_1,l_2)$, $(r_2,c_1,l_3)$, $(r_3,c_2,l_1)$, $(r_1,c_3,l_2)$. Equivalently, the corresponding…
In this follow-up of the article: Quantum Group of Isometries in Classical and Noncommutative Geometry(arXiv:0704.0041) by Goswami, where quantum isometry group of a noncommutative manifold has been defined, we explicitly compute such…
We make a detailed analysis of error mechanisms, gate fidelity, and scalability of proposals for quantum computation with neutral atoms in addressable (large lattice constant) optical lattices. We have identified possible limits to the size…
In this note we point out the fact that the proper conceptual setting of quantum computation is the theory of Linear Time Invariant systems. To convince readers of the utility of the approach, we introduce a new model of computation based…
The quantum cohomology algebra of a projective manifold X is the cohomology H(X,Q) endowed with a different algebra structure, which takes into account the geometry of rational curves in X. We show that this algebra takes a remarkably…
We propose a scheme for translating metrological precision bounds into lower bounds on query complexity of quantum search algorithms. Within the scheme the link between quadratic performance enhancement in idealized quantum metrological and…
The classical combinatorial problem of $36$ officers has no solution, as there are no Graeco-Latin squares of order six. The situation changes if one works in a quantum setup and allows for superpositions of classical objects and admits…
In this work, we evaluate quantum coherence using the l_1-norm and convex-roof l_1-norm and obtain several new results. First, we provide some new general triangle-like inequalities of quantum coherence, with results better than existing…
Recently, it was realized that use of the properties of quantum mechanics might speed up certain computations dramatically. Interest in quantum computation has since been growing. One of the main difficulties of realizing quantum…
In a recent work I developed a formula for efficiently calculating the number of abelian squares of length $t+t$ over an alphabet of size $d$, where $d$ may be very large. Here I show how the expressiveness of a certain class of…
Several quantum algorithms for linear algebra problems, and in particular quantum machine learning problems, have been "dequantized" in the past few years. These dequantization results typically hold when classical algorithms can access the…