A broader view on the limitations of information processing and communication by nature
type: Item
instance of: scholarly article
title: A broader view on the limitations of information processing and communication by nature
zbMATH Open document ID: 1120.68053
published in: Natural Computing
publication date: 2007-06-14T00:00:00Z
Mathematics Subject Classification ID: 68Q10
Mathematics Subject Classification ID: 81P68
zbMATH DE Number: 5164682
zbMATH Keywords: frontiers and barriers of information processing
zbMATH Keywords: information processing by nature
zbMATH Keywords: quantum information processing
zbMATH Keywords: feasibility
zbMATH Keywords: security
zbMATH Keywords: Church-Turing barrier
author: Jozef Gruska
MaRDI profile type: Publication
full work available at URL: s11047-006-9016-6
OpenAlex ID: W2075550330
cites work: Multilinear formulas and skepticism of quantum computing
cites work: Quantum computing, postselection, and probabilistic polynomial-time
cites work: Dense quantum coding and a lower bound for 1-way quantum automata
cites work: Q3996675
cites work: Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
cites work: Limit on Nonlocality in Any World in Which Communication Complexity Is Not Trivial
cites work: Q4542521
cites work: Implications of superstrong non-locality for cryptography
cites work: Characterizing quantum theory in terms of information-theoretic constraints
cites work: Q3426489
cites work: Quantum theory, the Church–Turing principle and the universal quantum computer
cites work: Non-Turing computations via Malament--Hogarth space-times
cites work: Q4496240
cites work: Quantum entanglement as a new information processing resource
cites work: Infinite time Turing machines
cites work: Q4526985
cites work: Quantum Multiparty Communication Complexity and Circuit Lower Bounds
cites work: Quantum algorithm for Hilbert's tenth problem
cites work: Communication Complexity
cites work: Why quantum bit commitment and ideal quantum coin tossing are impossible.
cites work: Relativistic computers and the Turing barrier
cites work: Q2706552
cites work: Causality and nonlocality as axioms for quantum mechanics
cites work: Quantum information and the PCP theorem
cites work: The speed of quantum information and the preferred frame: analysis of experimental data
cites work: A Mathematical Theory of Communication
cites work: The physics of no-bit-Commitment: Generalized quantum non-locality versus oblivious transfer
cites work: Q3838828
cites work: Implausible consequences of superstrong nonlocality
cites work: Q2762165
cites work: Q4437108
cites work: Q3150942
DOI: 10.1007/S11047-006-9016-6
description: scientific article; zbMATH DE number 5164682