We conduct an analysis of ideal error correcting codes for randomized unitary channels determined by two unitary error operators – what we call “binary unitary channels” – on multipartite quantum systems. In a wide variety of cases we give a complete description of the code structure for such channels. Specifically, we find a practical geometric technique to determine the existence of codes of ...

By applying an idea of Borodin and Olshanski [J. Algebra 313 (2007), 40–60], we study various scaling limits of determinantal point processes with trace class projection kernels given by spectral projections of selfadjoint Sturm–Liouville operators. Instead of studying the convergence of the kernels as functions, the method directly addresses the strong convergence of the induced integral opera...

Constructing appropriate unitary matrix operators for new quantum algorithms and finding the minimum cost gate sequences for the implementation of these unitary operators is of fundamental importance in the field of quantum information and quantum computation. Evolution of quantum circuits faces two major challenges: complex and huge search space and the high costs of simulating quantum circuit...

Typically, quantum mechanics is thought of as a linear theory with unitary evolution governedby the Schrödinger equation. While this is technically true and useful for a physicist, with regardsto computation it is an unfortunately narrow point of view. Just as a classical computer can simu-late highly nonlinear functions of classical states, so too can the more general quantum c...

Constructing appropriate unitary matrix operators for new quantum algorithms and finding the minimum cost gate sequences for the implementation of these unitary operators is of fundamental importance in the field of quantum information and quantum computation. Evolution of quantum circuits faces two major challenges: complex and huge search space and the high costs of simulating quantum circuit...