Related papers: Private Quantum Subsystems and Quasiorthogonal Ope…
We emphasize intertwining relations as a universal tool in constructing one-dimensional quasi-exactly solvable operators and offer their possible generalization to the multidimensional case. Considered examples include all quasi-exactly…
In the work we investigate some groupoids which are the Abelian algebras and the Hamiltonian algebras. An algebra is Abelian if for every polynomial operation and for all elements $a,b,\bar c,\bar d$ the implication $t(a,\bar c)=t(a,\bar…
Intrinsic symmetry of the existing protocols of quantum dialogue are explored. It is shown that if we have a set of mutually orthogonal $n$-qubit states {\normalsize $\{|\phi_{0}>,|\phi_{1}>,....,|\phi_{i}<,...,|\phi_{2^{n}-1}>\}$ and a set…
While quantum computing has strong potential in data-driven fields, the privacy issue of sensitive or valuable information involved in the quantum algorithm should be considered. Differential privacy (DP), which is a fundamental privacy…
We present a polynomial quantum algorithm for the Abelian stabilizer problem which includes both factoring and the discrete logarithm. Thus we extend famous Shor's results. Our method is based on a procedure for measuring an eigenvalue of a…
We give a survey of techniques from quantum group theory which can be used to show that some quantum spaces (objects of the category dual to the category of $\mathrm{C}^*$-algebras) do not admit any quantum group structure. We also provide…
When several inequivalent supercharges form a closed superalgebra in Quantum Mechanics it entails the appearance of hidden symmetries of a Super-Hamiltonian. We examine this problem in one-dimensional QM for the case of periodic potentials…
The hidden subgroup problem~(HSP) is one of the most important problems in quantum computation. Many problems for which quantum algorithm achieves exponential speedup over its classical counterparts can be reduced to the Abelian HSP.…
The hidden subgroup problem (HSP) plays an important role in quantum computation, because many quantum algorithms that are exponentially faster than classical algorithms can be casted in the HSP structure. In this paper, we present a new…
A family of maximally superintegrable systems containing the Coulomb atom as a special case is constructed in N-dimensional Euclidean space. Two different sets of N commuting second order operators are found, overlapping in the Hamiltonian…
One of the remarkable features of quantum mechanics is the ability to ensure secrecy. Private states embody this effect, as they are precisely those multipartite quantum states from which two parties can produce a shared secret that cannot…
This note presents a quantum protocol for private information retrieval, in the single-server case and with information-theoretical privacy, that has O(\sqrt{n})-qubit communication complexity, where n denotes the size of the database. In…
We provide a survey on the Hidden Subgroup Problem (HSP), which plays an important role in studying the security of public-key cryptosystems. We first review the abelian case, where Kitaev's algorithm yields an efficient quantum solution to…
Motivated by thermodynamic considerations, we analyse the variation of the quantum mutual information on a unitary orbit of a bipartite system's state, with and without global constraints such as energy conservation. We solve the full…
We undertake a study of the notion of a quantum graph over arbitrary finite-dimensional $C^*$-algebras $B$ equipped with arbitrary faithful states. Quantum graphs are realised principally as either certain operators on $L^2(B)$, the quantum…
Private inference refers to a two-party setting in which one has a model (e.g., a linear classifier), the other has data, and the model is to be applied over the data while safeguarding the privacy of both parties. In particular, models in…
We investigate quantum secret sharing schemes constructed from $[[n,k,\delta]]_D$ non-binary stabilizer quantum error correcting codes with carrier qudits of prime dimension $D$. We provide a systematic way of determining the access…
We propose an elegant formulation of parafermionic algebra and parasupersymmetry of arbitrary order in quantum many-body systems without recourse to any specific matrix representation of parafermionic operators and any kind of deformed…
A comprehensive graph theoretical and finite geometrical study of the commutation relations between the generalized Pauli operators of N-qudits is performed in which vertices/points correspond to the operators and edges/lines join commuting…
Encryption schemes often derive their power from the properties of the underlying algebra on the symbols used. Inspired by group theoretic tools, we use the centralizer of a subgroup of operations to present a private-key quantum…