The halting problem for universal quantum computers
classification
🪐 quant-ph
keywords
computershaltingquantumuniversalconstraintdynamicsincompatibleproblem
read the original abstract
The halting of universal quantum computers is shown to be incompatible with the constraint of unitarity of the dynamics.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.