I am trying to have a better understanding of the definition of the Quantum Turing Machine. My questions:If the output of a quantum program is the eigenvalue of the ground state of a Hamiltonian and is an irrational number, how do we finish writing it on the output tape?How do we deal with the gates / unitary matrices when we are supposed to write the shortest description of a quantum program? We can always squeeze a deep quantum circuit into a single unitary matrix.
Questions about the definition of the Quantum Turing Machine
quantum computing;automata theory;turing machines;kolmogorov complexity;descriptive complexity