Sciweavers

2661 search results - page 16 / 533
» Quantum Complexity Classes
Sort
View
CDES
2008
130views Hardware» more  CDES 2008»
15 years 2 months ago
A Quantum Algorithm for Finding Minimum Exclusive-Or Expressions for Multi-Output Incompletely Specified Boolean Functions
This paper presents a quantum algorithm for finding minimal ESCT (Exclusive-or Sum of Complex Terms) or ESOP (Exclusive-or Sum Of Products) expressions for any arbitrary multi-outp...
Marinos Sampson, Dimitrios Voudouris, George K. Pa...
CORR
2011
Springer
156views Education» more  CORR 2011»
14 years 7 months ago
Impossibility of Succinct Quantum Proofs for Collision-Freeness
We show that any quantum algorithm to decide whether a function f : [n] → [n] is a permutation or far from a permutation must make Ω n1/3 /w queries to f, even if the algorith...
Scott Aaronson
117
Voted
FOCS
2002
IEEE
15 years 5 months ago
Graph Isomorphism is in SPP
We show that Graph Isomorphism is in the complexity class SPP, and hence it is in ⊕P (in fact, it is in ModkP for each k ≥ 2). We derive this result as a corollary of a more g...
Vikraman Arvind, Piyush P. Kurur
128
Voted
ESORICS
2012
Springer
13 years 3 months ago
Dismantling iClass and iClass Elite
With more than 300 million cards sold, HID iClass is one of the most popular contactless smart cards on the market. It is widely used for access control, secure login and payment s...
Flavio D. Garcia, Gerhard de Koning Gans, Roel Ver...
115
Voted
COCO
2009
Springer
126views Algorithms» more  COCO 2009»
15 years 7 months ago
New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques
—Consider the following Simultaneous Message Passing (SMP) model for computing a relation f ⊆ X ×Y ×Z. In this model Alice, on input x ∈ X and Bob, on input y ∈ Y, send o...
Rahul Jain, Hartmut Klauck