Abstract
Currently, a complexity-class problem is proving the existence of one-way permutations: one-to-one and onto maps that are computationally ‘easy’, while their inverses are computationally ‘hard’. In what follows, we make use of Bennett’s algorithm of the reversible Turing machine (quantum information heat engine) to perform a cascade of two controlled-NOT gates to physically create a permutation operation. We show that by running this input-saving (Turing) machine backwards the critical inequality of Landauer’s thermodynamic limit is reversed, which provokes the symmetry-breaking of the quantum circuit based on two successive controlled-NOT quantum gates. This finding reveals that a permutation of controlled-NOT gates becomes one-way, provided that adiabatically immersed in a heat bath, which determines the condition of existence of a thermodynamically non-invertible bijection in polynomial-time, that would otherwise be mathematically invertible. This one-way bijection can also be particularly important because it shows nonlinearities in quantum mechanics, which are detectable by watching that the mathematical reversibility of controlled-NOT gates does not work physically.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Physica A: Statistical Mechanics and its Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
