A proof of the nonexistence of trapped single-qubit with specified superposition coefficient pair (α, β) which is equivalent to the nonexistence of quantum computers

The topic of this paper is the nonexistence of trapped single-qubit Q(Ψ a,b ) with specified superposition coefficient pair (α, β). The subtopic of this paper is the nonexistence of quantum computers, which is an application attached to the topic. Trapping a single quantum system involves the human ability to manipulate quantum systems. One of the most characteristic tasks for manipulating quantum systems is to point out what cannot be manipulated. This paper proves two theorems about the limits of the human ability to manipulate quantum systems. We prove the theorem of the uncertainty relation for trapping a single-qubit Q(Ψ a,b ) that parallels Heisenberg's uncertainty principle, which expresses the impossibility of simultaneously knowing paired canonical physical properties. The theorem of the uncertainty relation for trapping a single-qubit expresses the mutual exclusion between the existence of trapped single-qubit with specified superposition coefficient pair (α, β) and the existence of the extractable form of the pair (α, β). For trapped-qubit sequence {Q(Ψ a,b )}. If the experimenter confirms the existence of the assigned identity recognition indicator of the trapped-qubit sequence, then the existence of the extractable form of statistical coefficient pair (α, β) must be lost. We prove the Banach fixed-point theorem on the contraction mapping characteristic of the state space, which expresses the limits of the huma ability to manipulate space processes: the contraction mapping of the observation space to itself is interrupted at the contraction parameter θ S . For quantum physics, the highest priority experiments are the contraction mapping experiments at the nanoscale, which determines the ultimate limitation of humans’ spatial ability to manipulate quantum systems. The theorem of the uncertainty relation effectively delegitimizes the theory of quantum computers. In quantum computing theory, the experimenters are hypothesized to have the ability to repeatedly output regenerated qubits in exactly the same way via some artificial devices; to assign a number, a classical clock time and a separable projection to every element of the regenerated qubit-set; and to generate the desired statistical coefficient pair (α, β). The two key points that refute quantum computing theory are that it is illegal to wash away the identity recognition indicators of {Q(Ψ a,b )} for changing the sequence of projection state vectors to a common state vector, i.e., a matter-wave system, and that the sum of the regeneration time-gaps for hundreds (or thousands) of regenerated qubits conflicts with the relative decoherence time. Our proof does not need to take into account the possible impacts of the literature on the output probability of quantum computing, because the literature has no jurisdiction over the theorem of the uncertainty relation. Our proof shows that the existence of quantum computers ultimately leads to a conceptual crisis in quantum physics: the addition of principles outside the existing quantum mechanical framework, which violates Occam's Razor. To avoid a physics crisis, the failure of quantum computers is a must.