Use este identificador para citar ou linkar para este item: http://www.alice.cnptia.embrapa.br/alice/handle/doc/994523
Registro completo de metadados
Campo DCValorIdioma
dc.contributor.authorCASTRO, A. dept_BR
dc.date.accessioned2014-09-09T11:11:11Zpt_BR
dc.date.available2014-09-09T11:11:11Zpt_BR
dc.date.created2014-09-09pt_BR
dc.date.issued2014pt_BR
dc.identifier.citationPhysica A: statistical mechanics and its applications, Amsterdam, v. 415, p. 473-478, 2014.pt_BR
dc.identifier.urihttp://www.alice.cnptia.embrapa.br/alice/handle/doc/994523pt_BR
dc.descriptionCurrently, 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.pt_BR
dc.language.isoengeng
dc.rightsopenAccesseng
dc.subjectComplexidade computacionalpt_BR
dc.subjectPrincípio de Landauerpt_BR
dc.subjectMáquina de Turingpt_BR
dc.subjectPermutação one waypt_BR
dc.subjectComputational complexitypt_BR
dc.subjectLandauer's principlept_BR
dc.subjectTuring machinept_BR
dc.subjectOne-way permutationpt_BR
dc.titleOne-way-ness in the input-saving (Turing) machine.pt_BR
dc.typeArtigo de periódicopt_BR
dc.date.updated2014-09-17T11:11:11Zpt_BR
riaa.ainfo.id994523pt_BR
riaa.ainfo.lastupdate2014-09-17pt_BR
dc.identifier.doi10.1016/j.physa.2014.08.021pt_BR
dc.contributor.institutionALEXANDRE DE CASTRO, CNPTIA.pt_BR
Aparece nas coleções:Artigo em periódico indexado (CNPTIA)

Arquivos associados a este item:
Arquivo Descrição TamanhoFormato 
onewaness.pdf489,5 kBAdobe PDFThumbnail
Visualizar/Abrir
Mostrar registro simples do item Visualizar estatísticas

FacebookTwitterDeliciousLinkedInGoogle BookmarksMySpace