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
508
search results - page 49 / 102
»
Poly-locality in quantum computing
Sort
relevance
views
votes
recent
update
View
thumb
title
19
click to vote
CSUR
2000
49
views
more
CSUR 2000
»
An introduction to quantum computing for non-physicists
13 years 8 months ago
Download
www.cs.montana.edu
Eleanor G. Rieffel, Wolfgang Polak
claim paper
Read More »
13
click to vote
IBMSJ
2000
44
views
more
IBMSJ 2000
»
Toward a table-top quantum computer
13 years 8 months ago
Download
edboyden.org
Yael Maguire, Edward S. Boyden III, Neil Gershenfe...
claim paper
Read More »
25
click to vote
EATCS
1998
66
views
more
EATCS 1998
»
An Introduction to Quantum Computing
13 years 8 months ago
Download
www.sci.brooklyn.cuny.edu
Mika Hirvensalo
claim paper
Read More »
20
click to vote
SIAMSC
2010
132
views
more
SIAMSC 2010
»
Computing Expectation Values for Molecular Quantum Dynamics
13 years 7 months ago
Download
www.zib.de
Caroline Lasser, Susanna Röblitz
claim paper
Read More »
31
click to vote
STOC
2007
ACM
98
views
Algorithms
»
more
STOC 2007
»
Negative weights make adversaries stronger
14 years 9 months ago
Download
www1.cs.columbia.edu
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
Peter Høyer, Troy Lee, Robert Spalek
claim paper
Read More »
« Prev
« First
page 49 / 102
Last »
Next »