Sciweavers

8 search results - page 1 / 2
» Algorithmic Randomness, Quantum Physics, and Incompleteness
Sort
View
MCU
2004
95views Hardware» more  MCU 2004»
13 years 6 months ago
Algorithmic Randomness, Quantum Physics, and Incompleteness
Abstract. Is randomness in quantum mechanics "algorithmically random"? Is there any relation between Heisenberg's uncertainty relation and G
Cristian Calude
SOFSEM
2009
Springer
13 years 9 months ago
Randomness and Determination, from Physics and Computing towards Biology
In this text we will discuss different forms of randomness in Natural Sciences and present some recent results relating them. In finite processes, randomness differs in various ...
Giuseppe Longo
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
13 years 10 months ago
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
Andris Ambainis, Ke Yang
ICS
2010
Tsinghua U.
13 years 8 months ago
Bounds on the Quantum Satisfiability Threshold
Quantum k-SAT is the problem of deciding whether there is a n-qubit state which is perpendicular to a set of vectors, each of which lies in the Hilbert space of k qubits. Equivale...
Sergey Bravyi, Cristopher Moore, Alexander Russell
STOC
2009
ACM
181views Algorithms» more  STOC 2009»
14 years 5 months ago
The detectability lemma and quantum gap amplification
The quantum analog of a constraint satisfaction problem is a sum of local Hamiltonians - each (term of the) Hamiltonian specifies a local constraint whose violation contributes to...
Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. V...