SODA

2012

ACM

11 years 9 months ago
2012

ACM

We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our resu...

IACR

2011

12 years 6 months ago
2011

We present new candidates for quantum-resistant public-key cryptosystems based on the conjectured diﬃculty of ﬁnding isogenies between supersingular elliptic curves. The main t...

CORR

2010

Springer

13 years 4 months ago
2010

Springer

Given two elliptic curves over a finite field having the same cardinality and endomorphism ring, it is known that the curves admit an isogeny between them, but finding such an isog...

WDAG

2010

Springer

13 years 5 months ago
2010

Springer

We present a scalable quantum algorithm to solve binary consensus in a system of n crash-prone quantum processes. The algorithm works in O(polylog n) time sending O(n polylog n) qu...

ECCC

2008

13 years 7 months ago
2008

We obtain the first nontrivial time-space lower bound for quantum algorithms solving problems related to satisfiability. Our bound applies to MajSAT and MajMajSAT, which are compl...

STACS

1999

Springer

13 years 11 months ago
1999

Springer

Quantum algorithms for factoring and ﬁnding discrete logarithms have previously been generalized to ﬁnding hidden subgroups of ﬁnite Abelian groups. This paper explores the ...

GECCO

2003

Springer

14 years 9 days ago
2003

Springer

Intermediate measurements in quantum circuits compare to conditional branchings in programming languages. Due to this, quantum circuits have a natural linear-tree structure. In thi...

ISCAS

2003

IEEE

14 years 11 days ago
2003

IEEE

A high-speed and large-scale processor dedicated to quantum computing is proposed, which has the minimum operation function needed for execution of a quantum algorithm. In this pr...

CEC

2003

IEEE

14 years 12 days ago
2003

IEEE

Here we present a ﬁrst study of search spaces and ﬁtness landscapes in the context of the evolution of quantum programs. We consider small instances of the Deutsch-Jozsa proble...

STACS

2009

Springer

14 years 1 months ago
2009

Springer

Motivated by the quantum algorithm for testing commutativity of black-box groups (Magniez and Nayak, 2007), we study the following problem: Given a black-box ﬁnite ring by an add...