103 citations · 133 across the 4 of their papers we have counts for
4 papers
Gelfand-Tsetlin basis for partially transposed permutations, with applications to quantum information
Dmitry Grinko, Adam Burchardt, Maris Ozols
We study representation theory of the partially transposed permutation matrix algebra, a matrix representation of the diagrammatic walled Brauer algebra. This algebra plays a promi…
Exact quantum query complexity of computing Hamming weight modulo powers of two and three
Arjan Cornelissen, Nikhil S. Mande, Maris Ozols +1
We study the problem of computing the Hamming weight of an -bit string modulo , for any positive integer whose only prime factors are 2 and 3. We show that the exa…
Unbounded number of channel uses are required to see quantum capacity
Toby Cubitt, David Elkouss, William Matthews +3
Transmitting data reliably over noisy communication channels is one of the most important applications of information theory, and well understood when the channel is accurately mod…
On the adiabatic condition and the quantum hitting time of Markov chains
Hari Krovi, Maris Ozols, Jérémie Roland
We present an adiabatic quantum algorithm for the abstract problem of searching marked vertices in a graph, or spatial search. Given a random walk (or Markov chain) on a graph…