相关论文: Shifts on a finite qubit string: A class of quantu…

The symmetries of a finite graph are described by its automorphism group; in the setting of Woronowicz's quantum groups, a notion of a quantum automorphism group has been defined by Banica capturing the quantum symmetries of the graph. In…

We show that the quantum baker's map, a prototypical map invented for theoretical studies of quantum chaos, has a very simple realization in terms of quantum gates. Chaos in the quantum baker's map could be investigated experimentally on a…

We determine explicit quantum seeds for classes of quantized matrix algebras. Furthermore, we obtain results on centers and block diagonal forms {of these algebras.} In the case where $q$ is {an arbitrary} root of unity, this further…

We introduce the concept of quantum supermap, describing the most general transformation that maps an input quantum operation into an output quantum operation. Since quantum operations include as special cases quantum states, effects, and…

We describe the notion of a quantum family of maps of a quantum space and that of a quantum commutant of such a family. Quantum commutants are quantum semigroups defined by a certain universal property. We give a few examples of these…

We suggest that a certain one-to-one parametrization of completely positive maps on the matrix algebra might be useful in the study of quantum channels. This is illustrated in the case of binary quantum channels. While the algorithm is…

A new quantum architecture for multiplying signed integers is presented based on Booth's algorithm, which is well known in classical computation. It is shown how a quantum binary chain might be encoded by its flank changes, giving the final…

We show that any stabilizer code over a finite field is equivalent to a graphical quantum code. Furthermore we prove that a graphical quantum code over a finite field is a stabilizer code. The technique used in the proof establishes a new…

We define a coupling of two baker maps through a pi/2 rotation both in position and in momentum. The classical trajectories thus exhibit spiraling, or loxodromic motion, which is only possible for conservative maps of at least two degrees…

A quantum bit encoding converter between qubits of different forms is experimentally demonstrated, paving the way to efficient networks for optical quantum computing and communication.

Using a quantumlike description for light propagation in nonhomogeneous optical fibers, quantum information processing can be implemented by optical means. Quantum-like bits (qulbits) are associated to light modes in the optical fiber and…

The quantum Frobenius map and it splitting are shown to descend to corresponding maps for generalized $q$-Schur algebras at a root of unity. We also define analogs of $q$-Schur algebras for any affine algebra, and prove the corresponding…

In this survey article we give basic introduction to the theory of quantum families of maps. We begin with a general look at non-commutative (or "quantum") topology. Then we formulate all our results in this language. Existence of quantum…

We show that quantum theory allows for transformations of black boxes that cannot be realized by inserting the input black boxes within a circuit in a pre-defined causal order. The simplest example of such a transformation is the classical…

The quantum baker map possesses two symmetries: a canonical "spatial" symmetry, and a time-reversal symmetry. We show that, even when these features are taken into account, the asymptotic entangling power of the baker's map does not always…

In the foreseeable future, toolchains for quantum computing should offer automatic means of transforming a high level problem formulation down to a hardware executable form. Thereby, it is crucial to find (multiple) transformation paths…

Quantum computing and quantum communication are remarkable examples of new information processing technologies that arise from the coherent manipulation of spins in nanostructures. We review our theoretical proposal for using electron spins…

The physics of quantum walks on graphs is formulated in Hamiltonian language, both for simple quantum walks and for composite walks, where extra discrete degrees of freedom live at each node of the graph. It is shown how to map between…

Baxter's Q-operator for the quantum transfer matrix of the XXZ spin-chain is constructed employing the representation theory of quantum groups. The spectrum of this Q-operator is discussed and novel functional relations which describe the…

We define a family of maps on lattice paths, called sweep maps, that assign levels to each step in the path and sort steps according to their level. Surprisingly, although sweep maps act by sorting, they appear to be bijective in general.…