Related papers: Quantum hashing. Group approach
We consider categorical logic on the category of Hilbert spaces. More generally, in fact, any pre-Hilbert category suffices. We characterise closed subobjects, and prove that they form orthomodular lattices. This shows that quantum logic is…
In our model a fixed Hamiltonian acts on the joint Hilbert space of a quantum system and its controller. We show under which conditions measurements, state preparations, and unitary implementations on the system can be performed by quantum…
A quantum algorithm for combinatorial search is presented that provides a simple framework for utilizing search heuristics. The algorithm is evaluated in a new case that is an unstructured version of the graph coloring problem. It performs…
A universal quantum computer can be constructed using abelian anyons. Two qubit quantum logic gates such as controlled-NOT operations are performed using topological effects. Single-anyon operations such as hopping from site to site on a…
L. K. Grover's search algorithm in quantum computing gives an optimal, quadratic speedup in the search for a single object in a large unsorted database. In this paper, we generalize Grover's algorithm in a Hilbert-space framework for both…
We prove a general form of bit flip formula for the quantum Fourier transform on finite abelian groups and use it to encode some general CSS codes on these groups.
We generalize a recently discovered example of a private quantum subsystem to find private subsystems for Abelian subgroups of the $n$-qubit Pauli group, which exist in the absence of private subspaces. In doing so, we also connect these…
Quantum computers are designed to outperform standard computers by running quantum algorithms. Areas in which quantum algorithms can be applied include cryptography, search and optimisation, simulation of quantum systems, and solving large…
Quantum mechanics requires the operation of quantum computers to be unitary, and thus makes it important to have general techniques for developing fast quantum algorithms for computing unitary transforms. A quantum routine for computing a…
We present a universal framework for quantum error-correcting codes, i.e., the one that applies for the most general quantum error-correcting codes. This framework is established on the group algebra, an algebraic notation for the nice…
We consider in general terms dynamical systems with finite-dimensional, non-simply connected configuration-spaces. The fundamental group is assumed to be finite. We analyze in full detail those ambiguities in the quantization procedure that…
We find a combinatorial formula for the Haar functional of the orthogonal and unitary quantum groups. As an application, we consider diagonal coefficients of the fundamental representation, and we investigate their spectral measures.
As the connection between classical and quantum worlds, quantum measurements play a unique role in the era of quantum information processing. Given an arbitrary function of quantum measurements, how to obtain its optimal value is often…
We consider three types of entities for quantum measurements. In order of generality, these types are: observables, instruments and measurement models. If $\alpha$ and $\beta$ are entities, we define what it means for $\alpha$ to be a part…
Lie groups and quantum algebras are connected through their common universal enveloping algebra. The adjoint action of Lie group on its algebra is naturally extended to related q-algebra and q-coalgebra. In such a way, quantum structure can…
We discuss three applications of efficient quantum algorithms to determining properties of permutations and group automorphisms. The first uses the Bernstein-Vazirani algorithm to determine an unknown homomorphism from $Z_{p-1}^{m}$ to…
In this paper we develop the theory of homogeneous functions between finite abelian groups. Here, a function $f:G\longrightarrow H$ between finite abelian groups is homogeneous of degree $d$ if $f(nx)=n^df(x)$ for all $x\in G$ and all $n$…
We initiate the systematic study of experimental quantum physics from the perspective of computational complexity. To this end, we define the framework of quantum algorithmic measurements (QUALMs), a hybrid of black box quantum algorithms…
A finite quantum hypergroup is a finite-dimensional unital algebra $A$ over the field of complex numbers. There is a coproduct on $A$, a coassociative map from $A$ to $A\otimes A$ assumed to be unital, but it is not required to be an…
Cryptographic hash functions are fundamental primitives widely used in practice. For such a function $f:\{0, 1\}^n\to\{0, 1\}^m$, it is nearly impossible for an adversary to produce the hash $f(x)$ without knowing the secret message…