2 ms·

On point 1: I did not get your argument about NP hardness and equivalence to graph isomorphism. On the contrary, algorithms for efficiently simulating non-trivi

On point 1: I did not get your argument about NP hardness and equivalence to graph isomorphism. On the contrary, algorithms for efficiently simulating non-trivial QFTs on a non-relativistic quantum computers exist: https://arxiv.org/abs/1111.3633 https://arxiv.org/abs/1111.3633 Point 2: If "there is nothing fundamental about measuring" in the QFT case, I do not see what is so special about the QM case (you just take a partial trace over the "environment"). I (admittedly with humility as I am not as well versed in QFT) really do not see how your answer is any different from this (and I do not see how the path integral gives you anything new for this particular problem, albeit being a beautiful formalism). Point 3: QM has developed a lot of tools to deal with Marcovian and Non-marcovian non-unitary dynamics (the whole zoo of master equations available in it). Of course QFT can deal with density matrices if QM already can do that, but the sophistication of the toolkit used for that purpose in QM seems yet unsurpassed to me. And to your last point about creation of particles: Second quantization is already available in non-relativistic QM, so there is nothing weird about an a^dagger*b Hamiltonian in QM (I use it all the time for cavity-qubit interactions) - so, yes, you can not deal with the creation of arbitrary particles in QM, but you can still easily work with some restricted modes of a field, without involving QFT.

orbifold 7y ago
Regarding point 1: I should say that I'm not an expert in Quantum Computing, but reading the referenced paper leaves me unconvinced that such an algorithm exists in general. In the paper they show that they can simulate phi^4 efficiently and with arbitrary small discretisation error. My point regarding the graph isomorphism in this case is as follows: In order to carry out the discretisation, they employ a d-dimensional lattice and additionally introduce a discrete number of Q-bits per lattice site. Then they require to be able to evolve the state according to some time dependent hamiltonian (with interactions adiabatically switched on and off). All proposed realistic quantum computers only allow for a limited operator set of primitive operations, dictated by the physical geometry of the implementation (1d lattice of atoms in a trap etc.). My point was that more likely than not you will always be able to come up with theories for which a mapping respecting these physical constraints is hard (you won't easily be able to simulate a 3d lattice with multiple q-bits per lattice site on a 2-d lattice of q-bits). Also the article has to restrict itself to the case of massive particles and as you know lattice simulation of fermions is also a problem. Point 2 & 3: You are right of course, ultimately this is a question of what techniques are useful. My comment was mostly aimed at the situation where people start to discuss the philosophy of QM. There I find that QFT clarifies the situation more than any philosophical elaboration on "measurement" and things like that do.

orbifold 7y ago

Regarding point 1: I should say that I'm not an expert in Quantum Computing, but reading the referenced paper leaves me unconvinced that such an algorithm exists in general. In the paper they show that they can simulate phi^4 efficiently and with arbitrary small discretisation error. My point regarding the graph isomorphism in this case is as follows: In order to carry out the discretisation, they employ a d-dimensional lattice and additionally introduce a discrete number of Q-bits per lattice site. Then they require to be able to evolve the state according to some time dependent hamiltonian (with interactions adiabatically switched on and off). All proposed realistic quantum computers only allow for a limited operator set of primitive operations, dictated by the physical geometry of the implementation (1d lattice of atoms in a trap etc.). My point was that more likely than not you will always be able to come up with theories for which a mapping respecting these physical constraints is hard (you won't easily be able to simulate a 3d lattice with multiple q-bits per lattice site on a 2-d lattice of q-bits). Also the article has to restrict itself to the case of massive particles and as you know lattice simulation of fermions is also a problem. Point 2 & 3: You are right of course, ultimately this is a question of what techniques are useful. My comment was mostly aimed at the situation where people start to discuss the philosophy of QM. There I find that QFT clarifies the situation more than any philosophical elaboration on "measurement" and things like that do.