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
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
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
94
Voted
CSUR
2000
49
views
more
CSUR 2000
»
An introduction to quantum computing for non-physicists
15 years 2 months ago
Download
www.cs.montana.edu
Eleanor G. Rieffel, Wolfgang Polak
claim paper
Read More »
66
Voted
IBMSJ
2000
44
views
more
IBMSJ 2000
»
Toward a table-top quantum computer
15 years 2 months ago
Download
edboyden.org
Yael Maguire, Edward S. Boyden III, Neil Gershenfe...
claim paper
Read More »
82
Voted
EATCS
1998
66
views
more
EATCS 1998
»
An Introduction to Quantum Computing
15 years 2 months ago
Download
www.sci.brooklyn.cuny.edu
Mika Hirvensalo
claim paper
Read More »
81
click to vote
SIAMSC
2010
132
views
more
SIAMSC 2010
»
Computing Expectation Values for Molecular Quantum Dynamics
15 years 1 months ago
Download
www.zib.de
Caroline Lasser, Susanna Röblitz
claim paper
Read More »
137
Voted
STOC
2007
ACM
98
views
Algorithms
»
more
STOC 2007
»
Negative weights make adversaries stronger
16 years 3 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 »