P A Zizzi 2007 J. Phys.: Conf. Ser. 67 012045 doi:10.1088/1742-6596/67/1/012045
P A Zizzi
Show affiliationsAs it is well known, quantum entanglement is one of the most important features of quantum computing, as it leads to massive quantum parallelism, hence to exponential computational speed-up. In a sense, quantum entanglement is considered as an implicit property of quantum computation itself. But... can it be made explicit? In other words, is it possible to find the connective "entanglement" in a logical sequent calculus for the machine language? And also, is it possible to "teach" the quantum computer to "mimic" the EPR "paradox"? The answer is in the affirmative, if the logical sequent calculus is that of the weakest possible logic, namely Basic logic. - A weak logic has few structural rules. But in logic, a weak structure leaves more room for connectives (for example the connective "entanglement"). Furthermore, the absence in Basic logic of the two structural rules of contraction and weakening corresponds to the validity of the no-cloning and no-erase theorems, respectively, in quantum computing.
03.67.Lx Quantum computation architectures and implementations
03.67.Mn Entanglement measures, witnesses, and other characterizations
Issue 1 (2007)
P A Zizzi 2007 J. Phys.: Conf. Ser. 67 012045
Yi-Zhong Huang et al 2008 Nanotechnology 19 015303
Clifford P. Burgess et al JHEP11(2004)069
Aude Gehrmann-De Ridder et al JHEP11(2007)058
E Minguzzi 2008 Class. Quantum Grav. 25 075015
Ruggero Ferrari and Andrea Quadri JHEP11(2004)019
Xiaorong Wang (for PHENIX Collaboration) 2008 J. Phys. G: Nucl. Part. Phys. 35 044069
R J Harris and G M Schütz J. Stat. Mech. (2007) P07020
G Ratel and C Michotte 2004 Metrologia 41 06014
Isak I Beilis 2009 Plasma Sources Sci. Technol. 18 014015