Comment on ``Testing integrability with a single bit of quantum information''
| dc.creator | Wiseman, Howard M. | |
| dc.date | 2003-05-25 | |
| dc.date.accessioned | 2026-07-07T06:06:50Z | |
| dc.date.available | 2026-07-07T06:06:50Z | |
| dc.description | In quant-ph/0303042, Poulin, Laflamme, Milburn and Paz consider the problem of distinguishing quantum chaos from quantum integrability for dynamics in an $N$-dimensional Hilbert space. They claim that this can be done by deterministic quantum computing with a single bit using $O(\sqrt{N})$ physical resources, compared to O(N) physical resources classically. I point out what seems to be a fatal flaw with their proposal. | |
| dc.description | 1/2 page, no equations | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0305153 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0305153 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/91124 | |
| dc.subject | Quantum Physics | |
| dc.title | Comment on ``Testing integrability with a single bit of quantum information'' | |
| dc.type | text |