BibTeX
CSL-JSON
MLA
Harvard
Testing integrability with a single bit of quantum information
release_k2h3ktxsuzctbkugf4yvy6rk7q
by
David Poulin,
Raymond Laflamme,
G.J. Milburn,
Juan Pablo Paz
Released
as a article
.
2003
Abstract
We show that deterministic quantum computing with a single bit (DQC1) can
determine whether the classical limit of a quantum system is chaotic or
integrable using O(N) 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.
In text/plain format
Archived Content
There are no accessible files associated with this release. You could check other releases for this work for an accessible version.
"Dark" Preservation Only
Save Paper Now!
Know of a fulltext copy of on the public web? Submit a URL and we will archive it
arXiv
quant-ph/0303042v1
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
access all versions, variants, and formats of this works (eg, pre-prints)
Cite This
Lookup Links