This is enhancement of standard one-way quantum computers (1WQC) by adding missing operation: "reversed" version (CPT symmetry analog) of state preparation (e.g. pull/push, negative/positive pressure, stimulated emission/absorption). There are many arguments it should be possible, but needs experimental confirmation.
In theory this enhancement allows to attack any NP problems, but it likely will be more difficult than Shor's factorization - so might be completely impractical (?)
There are many interesting new question - like of theoretical complexity class for such 2WQC, somewhere between NP and PSPACE?
jarekd|2 years ago
Article: https://www.researchgate.net/publication/372677599_Two-way_q...
This is enhancement of standard one-way quantum computers (1WQC) by adding missing operation: "reversed" version (CPT symmetry analog) of state preparation (e.g. pull/push, negative/positive pressure, stimulated emission/absorption). There are many arguments it should be possible, but needs experimental confirmation.
In theory this enhancement allows to attack any NP problems, but it likely will be more difficult than Shor's factorization - so might be completely impractical (?)
There are many interesting new question - like of theoretical complexity class for such 2WQC, somewhere between NP and PSPACE?
There might appear also different approaches to NP, so maybe it would be safer to start thinking of cryptography based on PSPACE? https://en.wikipedia.org/wiki/PSPACE-complete