In quantum cryptography, a one-way permutation is a bounded unitary operator U : H → H on a Hilbert space H that is easy to compute on every input, but hard to invert given the image of a random input. Levin [Probl. Inf. Transm., vol. 39 (1): 92-103 (2003)] has conjectured that the unitary transformation g(a, x) = (a, f(x) + ax), where f is any length-preserving function and a, x ∈ GF2‖x‖ , is ...

Abstract To find the discrete symmetries of a Hamilton operator Ĥ is of central importance in quantum theory. Here we describe and implement a brute force method to determine the discrete symmetries given by permutation matrices for Hamilton operators acting in a finite-dimensional Hilbert space. Spin and Fermi systems are considered as examples. A computer algebra implementation in SymbolicC++...

Quantum information theory is an exciting, inter-disciplinary field, combining elements of condensed matter theory, quantum mechanics and information theory. In this thesis, I shall make a modest contribution to this field by examining entanglement in many-body systems with more than two levels. In the first section, I consider the dynamics of a system of qutrits—three-level quantum systems— wh...

This paper focuses on the basic operations of Chomsky’s languages. The validity and the effectiveness of some closure operations, such as union operator, product operator and Kleene Closure operator, are discussed in detail. The crosstalk problems in Context-Sensitive Languages (CSL) and Phrase Structure Languages (PSL) are analyzed, and a valuable method to solve this problem is presented by s...

Grover’s operator in the two-qubit case can transform a basis into its conjugated basis. A permutation operator can transform a state in the two conjugated bases into its orthogonal state. These properties are included in a threshold quantum protocol. The proposed threshold quantum protocol is secure based the proof that the legitimate participators can only eavesdrop 2 bits of 3 bits operation...

We provide an overview of the Permutation in a Haystack problem, which serves as a tool for fitness landscape analysis, as well as in search algorithm design. The Permutation in a Haystack enables defining a search landscape for permutation optimization problems that abstracts the permutation features, which impact solution fitness, such as absolute element positions, edges, and pairwise elemen...

We obtain the operator algebra of each twisted sector of all WZW orbifolds, including the general twisted current algebra and the algebra of the twisted currents with the twisted affine primary fields. Surprisingly, the twisted right and left mover current algebras are not a priori copies of each other. Using the operator algebra we also derive world-sheet differential equations for the twisted...

We present a computationally-efficient matrix-vector expression for the solution of a matrix linear least squares problem that arises in multistatic antenna array processing. Our derivation relies on an explicit new relation between Kronecker, Khatri-Rao and Schur-Hadamard matrix products, which involves a selection matrix (i.e., a subset of the columns of a permutation matrix). Moreover, we sh...