output
19992025
most citedQuantum random walks - an introductory overview

1.4k citations

researchers with a paper here
collaborating institutions
Showing 2001Show all

6 papers · 1 filter

quant-ph2001★ 54 cited

Exact gate-sequences for universal quantum computation using the XY-interaction alone

J. Kempe, K. B. Whaley

In a previous publication [1] we showed that it is possible to implement universal quantum computation with the anisotropic XY-Heisenberg exchange acting as a single interaction. T…

cs.DM2001

Depth-3 Arithmetic Circuits for S^2_n(X) and Extensions of the Graham-Pollack Theorem

Jaikumar Radhakrishnan, Pranab Sen, Sundar Vishwanathan

We consider the problem of computing the second elementary symmetric polynomial S^2_n(X) using depth-three arithmetic circuits of the form "sum of products of linear forms". We con…

quant-ph2001★ 168 cited

Robustness of Multi-Party Entanglement

Christoph Simon, Julia Kempe

How common is large-scale entanglement in nature? As a first step towards addressing this question, we study the robustness of multi-party entanglement under local decoherence, mod…

math.CO2001★ 1 cited

Palindrome complexity

Jean-Paul Allouche, Michael Baake, Julien Cassaigne +1

We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We sur…

cs.LO2001

Polymorphic type inference for the relational algebra

Jan Van den Bussche, Emmanuel Waller

We give a polymorphic account of the relational algebra. We introduce a formalism of ``type formulas'' specifically tuned for relational algebra expressions, and present an algorit…

quant-ph2001★ 2 cited

Efficient quantum algorithms for some instances of the non-Abelian hidden subgroup problem

Gabor Ivanyos, Frederic Magniez, Miklos Santha

In this paper we show that certain special cases of the hidden subgroup problem can be solved in polynomial time by a quantum algorithm. These special cases involve finding hidden…