We construct an efficient quantum algorithm to compute the quantum Schur-Weyl transform for any value of the quantum parameter $q \in [0,\infty]$. Our algorithm is a $q$-deformation of the Bacon-Chuang-Harrow algorithm, in the sense that it has the same structure and is identically equal when $q=1$. When $q=0$, our algorithm is the unitary realization of the Robinson-Schensted-Knuth (or RSK) algorithm, while when $q=\infty$ it is the dual RSK algorithm together with phase signs. Thus, we interpret a well-motivated quantum algorithm as a generalization of a well-known classical algorithm
After learning basic quantum computing concepts, it is desirable to reinforce the learning using an ...
AbstractThe quantum Fourier transform (QFT) is a powerful tool in quantum computing. The main ingred...
We give a short overview of quantum algorithms. Some famous algorithms such as Deutsch-Jozsa and Si...
We construct an efficient quantum algorithm to compute the quantum Schur-Weyl transform for...
The Schur transform is a unitary operator that block diagonalizes the action of the symmetric and un...
Quantum information offers the possibility to solve certain problems dramatically faster than is pos...
In this dissertation we study how efficiently quantum computers can solve various problems, and how ...
Recently (2009) a quantum algorithm for solving a system of linear equations has been proposed. The ...
Quantum mechanics requires the operation of quantum computers to be unitary, and thus makes it impor...
Quantum computing algorithms are considered for several problems in graph theory. Classical algorith...
The quantum algorithm of AJL [3] (following the work of Freedman et al. [10]) to approximate the Jon...
Many quantum computation algorithms, and processes like measurement based quantum computing, require...
Motivated by algorithmic problems arising in quantum field theories whose dynamical variables are ge...
Motivated by algorithmic problems arising in quantum field theories whose dynamical variables are ge...
This thesis’ aim is to explore improvements to, and applications of, a fundamental quantum algorithm...
After learning basic quantum computing concepts, it is desirable to reinforce the learning using an ...
AbstractThe quantum Fourier transform (QFT) is a powerful tool in quantum computing. The main ingred...
We give a short overview of quantum algorithms. Some famous algorithms such as Deutsch-Jozsa and Si...
We construct an efficient quantum algorithm to compute the quantum Schur-Weyl transform for...
The Schur transform is a unitary operator that block diagonalizes the action of the symmetric and un...
Quantum information offers the possibility to solve certain problems dramatically faster than is pos...
In this dissertation we study how efficiently quantum computers can solve various problems, and how ...
Recently (2009) a quantum algorithm for solving a system of linear equations has been proposed. The ...
Quantum mechanics requires the operation of quantum computers to be unitary, and thus makes it impor...
Quantum computing algorithms are considered for several problems in graph theory. Classical algorith...
The quantum algorithm of AJL [3] (following the work of Freedman et al. [10]) to approximate the Jon...
Many quantum computation algorithms, and processes like measurement based quantum computing, require...
Motivated by algorithmic problems arising in quantum field theories whose dynamical variables are ge...
Motivated by algorithmic problems arising in quantum field theories whose dynamical variables are ge...
This thesis’ aim is to explore improvements to, and applications of, a fundamental quantum algorithm...
After learning basic quantum computing concepts, it is desirable to reinforce the learning using an ...
AbstractThe quantum Fourier transform (QFT) is a powerful tool in quantum computing. The main ingred...
We give a short overview of quantum algorithms. Some famous algorithms such as Deutsch-Jozsa and Si...