Testing integrability with a single bit of quantum information
We show that deterministic quantum computing with a single bit can determine whether the classical limit of a quantum system is chaotic or integrable using [Formula Presented] physical resources, where N is the dimension of the Hilbert space of the system under study. This is a square-root improveme...
| Autores: | , , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión publicada |
| Fecha de publicación: | 2003 |
| País: | Argentina |
| Institución: | Consejo Nacional de Investigaciones Científicas y Técnicas |
| Repositorio: | CONICET Digital (CONICET) |
| Idioma: | inglés |
| OAI Identifier: | oai:ri.conicet.gov.ar:11336/72059 |
| Acceso en línea: | http://hdl.handle.net/11336/72059 |
| Access Level: | acceso abierto |
| Palabra clave: | DECOHERENCE QUANTUM CHAOS QUANTUM INFORMATION https://purl.org/becyt/ford/1.3 https://purl.org/becyt/ford/1 |
| Sumario: | We show that deterministic quantum computing with a single bit can determine whether the classical limit of a quantum system is chaotic or integrable using [Formula Presented] physical resources, where N is the dimension of the Hilbert space of the system under study. This is a square-root improvement over all known classical procedures. Our study relies strictly on the random matrix conjecture. We also present numerical results for the nonlinear kicked top. |
|---|