Related papers: From reversible computation to quantum computation…
We show, within the circuit model, how any quantum computation can be efficiently performed using states with only real amplitudes (a result known within the Quantum Turing Machine model). This allows us to identify a 2-qubit (in fact…
Based on our previous work on the recursive fermion system in the Cuntz algebra, it is shown that a nonlinear transformation group of the CAR fermion algebra is induced from a $U(2^p)$ action on the Cuntz algebra ${\cal O}_{2^p}$ with an…
We demonstrate that a tensor product structure and optical analogy of quantum entanglement can be obtained by introducing pseudorandom phase sequences into classical fields with two orthogonal modes. Using the classical analogy, we discuss…
We suggest an efficient scheme for quantum computation with linear optical elements utilizing "linked" photon states. The linked states are designed according to the particular quantum circuit one wishes to process. Once a linked-state has…
The problem of simulating complex quantum processes on classical computers gave rise to the field of quantum simulations. Quantum simulators solve problems, such as Boson sampling, where classical counterparts fail. In another field of…
In this work, we present straightforward and concrete computations of the unitary irreducible representations of the Euclidean motion group $M(2)$ employing the methods of deformation quantization. Deformation quantization is a quantization…
An algorithm for quantum computing Hamiltonian cycles of simple, cubic, bipartite graphs is discussed. It is shown that it is possible to evolve a quantum computer into an entanglement of states which map onto the set of all possible paths…
Many standard linear algebra problems can be solved on a quantum computer by using recently developed quantum linear algebra algorithms that make use of block encodings and quantum eigenvalue/singular value transformations. A block encoding…
We consider quantum two-block group algebra (2BGA) codes, a previously unstudied family of smallest lifted-product (LP) codes. These codes are related to generalized-bicycle (GB) codes, except a cyclic group is replaced with an arbitrary…
We develop a combinatorial approach to the quantum permutation algebras, as Hopf images of representations of type $\pi:A_s(n)\to B(H)$. We discuss several general problems, including the commutativity and cocommutativity ones, the…
We defined a non-commutative algebra representation for quantum systems whose phase space is the cotangent bundle of the Lorentz group, and the non-commutative Fourier transform ensuring the unitary equivalence with the standard group…
The quantum Fourier transform (QFT), a quantum analog of the classical Fourier transform, has been shown to be a powerful tool in developing quantum algorithms. However, in classical computing there is another class of unitary transforms,…
Quantum-mechanical concepts can be formulated in constructive finite terms without loss of their empirical content if we replace a general unitary group by a unitary representation of a finite group. Any linear representation of a finite…
The quantum Fourier transform (QFT) is a powerful tool in quantum computing. The main ingredients of QFT are formed by the Walsh-Hadamard transform H and phase shifts P(.), both of which are 2x2 unitary matrices as operators on the…
Quantum computing has attracted much attention in recent decades, since it is believed to solve certain problems substantially faster than traditional computing methods. Theoretically, such an advance can be obtained by networks of the…
Systems of linear equations are used to model a wide array of problems in all fields of science and engineering. Recently, it has been shown that quantum computers could solve linear systems exponentially faster than classical computers,…
Recently, it was shown that when reference frames are associated to quantum systems, the transformation laws between such quantum reference frames need to be modified to take into account the quantum and dynamical features of the reference…
As a unified theory of integer and fractional quantum Hall plateau transitions, a nonperturbative theory of the two-parameter scaling renormalization group function is presented. By imposing global symmetries known as ``the law of…
We examine the number of cycles of length k in a permutation, as a function on the symmetric group. We write it explicitly as a combination of characters of irreducible representations. This allows to study formation of long cycles in the…
Let $p$ be a prime number. We consider diagonal $p$-permutation functors over a (commutative, unital) ring $\mathsf{R}$ in which all prime numbers different from $p$ are invertible. We first determine the finite groups $G$ for which the…