Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
7486
search results - page 70 / 1498
»
The Limits of Quantum Computers
Sort
relevance
views
votes
recent
update
View
thumb
title
26
click to vote
TAMC
2007
Springer
95
views
Applied Computing
»
more
TAMC 2007
»
Quantum Multiparty Communication Complexity and Circuit Lower Bounds
14 years 2 months ago
Download
www.lri.fr
Iordanis Kerenidis
claim paper
Read More »
33
click to vote
STOC
2004
ACM
152
views
Algorithms
»
more
STOC 2004
»
Exponential separation of quantum and classical one-way communication complexity
14 years 9 months ago
Download
webee.technion.ac.il
Abstract. We give the first exponential separation between quantum and bounded-error randomized one-way communication complexity. Specifically, we define the Hidden Matching Proble...
Ziv Bar-Yossef, T. S. Jayram, Iordanis Kerenidis
claim paper
Read More »
23
click to vote
ISVD
2007
IEEE
77
views
Theoretical Computer Science
»
more
ISVD 2007
»
Error Analysis of a Numerical Calculation about One-qubit Quantum Channel Capacity
14 years 3 months ago
Download
www-imai.is.s.u-tokyo.ac.jp
Kimikazu Kato, Hiroshi Imai, Keiko Imai
claim paper
Read More »
20
click to vote
SPAA
2005
ACM
84
views
Distributed And Parallel Com...
»
more
SPAA 2005
»
Is partial quantum search of a database any easier?
14 years 2 months ago
Download
physics.princeton.edu
Lov K. Grover, Jaikumar Radhakrishnan
claim paper
Read More »
22
click to vote
FOCS
2003
IEEE
122
views
Theoretical Computer Science
»
more
FOCS 2003
»
A Lower Bound for the Bounded Round Quantum Communication Complexity of Set Disjointness
14 years 2 months ago
Download
www.comp.nus.edu.sg
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
claim paper
Read More »
« Prev
« First
page 70 / 1498
Last »
Next »