A broader view on the limitations of information processing and communication by nature

DOI10.1007/S11047-006-9016-6zbMath1120.68053OpenAlexW2075550330MaRDI QIDQ885681

Jozef Gruska

Publication date: 14 June 2007

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11047-006-9016-6

zbMATH Keywords

securityfeasibilityquantum information processingChurch-Turing barrierfrontiers and barriers of information processinginformation processing by nature

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Quantum computation (81P68)

Related Items (1)

COMPLEXITY, INFORMATION, ENERGY

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A Mathematical Theory of Communication
• Implausible consequences of superstrong nonlocality
• Characterizing quantum theory in terms of information-theoretic constraints
• Quantum information and the PCP theorem
• The physics of no-bit-Commitment: Generalized quantum non-locality versus oblivious transfer
• Quantum algorithm for Hilbert's tenth problem
• Why quantum bit commitment and ideal quantum coin tossing are impossible.
• Quantum entanglement as a new information processing resource
• Relativistic computers and the Turing barrier
• The speed of quantum information and the preferred frame: analysis of experimental data
• Dense quantum coding and a lower bound for 1-way quantum automata
• Limit on Nonlocality in Any World in Which Communication Complexity Is Not Trivial
• Implications of superstrong non-locality for cryptography
• Multilinear formulas and skepticism of quantum computing
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
• Infinite time Turing machines
• Communication Complexity
• Quantum Multiparty Communication Complexity and Circuit Lower Bounds
• Quantum computing, postselection, and probabilistic polynomial-time
• Non-Turing computations via Malament--Hogarth space-times

This page was built for publication: A broader view on the limitations of information processing and communication by nature