A reductionistic approach to quantum computation
| dc.creator | Castagnoli, Giuseppe | |
| dc.creator | Monti, Dalida | |
| dc.date | 1997-11-20 | |
| dc.date.accessioned | 2026-07-07T06:14:34Z | |
| dc.date.available | 2026-07-07T06:14:34Z | |
| dc.description | In the reductionistic approach, mechanisms are divided into simpler parts interconnected in some standard way (e.g. by a mechanical transmission). We explore the possibility of porting reductionism in quantum operations. Conceptually, first parts are made independent of each other by assuming that all ``transmissions'' are removed. The overall state would thus become a superposition of tensor products of the eigenstates of the independent parts. Transmissions are restored by projecting off all the tensor products which violate them. This would be performed by particle statistics; the plausibility of this scheme is based on the interpretation of particle statistics as projection. The problem of the satisfiability of a Boolean network is approached in this way. This form of quantum reductionism appears to be able of taming the quantum whole without clipping its richness. | |
| dc.description | 1 figure | |
| dc.identifier | https://arxiv.org/abs/quant-ph/9711045 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/9711045 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/93512 | |
| dc.subject | Quantum Physics | |
| dc.title | A reductionistic approach to quantum computation | |
| dc.type | text |