Sciweavers

117 search results - page 13 / 24
» On the power of quantum fingerprinting
Sort
View
BIOSYSTEMS
2007
95views more  BIOSYSTEMS 2007»
14 years 12 months ago
Physical limits of computation and emergence of life
The computational process is based on the activity linking mathematical equations to a materialized physical world. It consumes energy which lower limit is defined by the set of ...
Abir U. Igamberdiev
ICALP
2005
Springer
15 years 5 months ago
Quantum Complexity of Testing Group Commutativity
We consider the problem of testing the commutativity of a black-box group specified by its k generators. The complexity (in terms of k) of this problem was first considered by Pa...
Frédéric Magniez, Ashwin Nayak
PROCEDIA
2010
97views more  PROCEDIA 2010»
14 years 10 months ago
Ontological musings on how nature computes
Modern physical theory and modern computational techniques are used to provide conjecture on how nature computes. I utilize time-domain simulation of physical phenomena and build ...
J. F. Nystrom
STOC
2010
ACM
176views Algorithms» more  STOC 2010»
15 years 9 months ago
QIP = PSPACE
We prove that the complexity class QIP, which consists of all problems having quantum interactive proof systems, is contained in PSPACE. This containment is proved by applying a p...
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay and Jo...
CORR
2004
Springer
94views Education» more  CORR 2004»
14 years 11 months ago
Side-Information Coding with Turbo Codes and its Application to Quantum Key Distribution
Turbo coding is a powerful class of error correcting codes, which can achieve performances close to the Shannon limit. The turbo principle can be applied to the problem of side-in...
Kim-Chi Nguyen, Gilles Van Assche, Nicolas J. Cerf