Sciweavers

Share
SODA
2012
ACM
227views Algorithms» more  SODA 2012»
7 years 4 months ago
Improved output-sensitive quantum algorithms for Boolean matrix multiplication
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...
François Le Gall
IACR
2011
120views more  IACR 2011»
8 years 1 months ago
Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies
We present new candidates for quantum-resistant public-key cryptosystems based on the conjectured difficulty of finding isogenies between supersingular elliptic curves. The main t...
David Jao, Luca De Feo
CORR
2010
Springer
192views Education» more  CORR 2010»
8 years 11 months ago
Constructing elliptic curve isogenies in quantum subexponential time
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...
Andrew M. Childs, David Jao, Vladimir Soukharev
WDAG
2010
Springer
206views Algorithms» more  WDAG 2010»
8 years 12 months ago
Scalable Quantum Consensus for Crash Failures
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...
Bogdan S. Chlebus, Dariusz R. Kowalski, Michal Str...
ECCC
2008
107views more  ECCC 2008»
9 years 1 months ago
A Quantum Time-Space Lower Bound for the Counting Hierarchy
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...
Dieter van Melkebeek, Thomas Watson
STACS
1999
Springer
9 years 5 months ago
On Quantum Algorithms for Noncommutative Hidden Subgroups
Quantum algorithms for factoring and finding discrete logarithms have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the ...
Mark Ettinger, Peter Høyer
GECCO
2003
Springer
121views Optimization» more  GECCO 2003»
9 years 6 months ago
Evolving Hogg's Quantum Algorithm Using Linear-Tree GP
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...
André Leier, Wolfgang Banzhaf
ISCAS
2003
IEEE
126views Hardware» more  ISCAS 2003»
9 years 6 months ago
High-speed processor for quantum-computing emulation and its applications
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...
Minoru Fujishima, Kaoru Saito, M. Onouchi, Koichir...
CEC
2003
IEEE
9 years 6 months ago
Exploring the search space of quantum programs
Here we present a first study of search spaces and fitness landscapes in the context of the evolution of quantum programs. We consider small instances of the Deutsch-Jozsa proble...
André Leier, Wolfgang Banzhaf
STACS
2009
Springer
9 years 8 months ago
Quantum Query Complexity of Multilinear Identity Testing
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 finite ring by an add...
Vikraman Arvind, Partha Mukhopadhyay
books