Search complexity and resource scaling for the quantum optimal control
of unitary transformations
release_e5tvlvlmnjbaxgos6gamqynr3y
by
Katharine W. Moore, Raj Chakrabarti, Gregory Riviello, Herschel
Rabitz
2010
Abstract
The optimal control of unitary transformations is a fundamental problem in
quantum control theory and quantum information processing. The feasibility of
performing such optimizations is determined by the computational and control
resources required, particularly for systems with large Hilbert spaces. Prior
work on unitary transformation control indicates that (i) for controllable
systems, local extrema in the search landscape for optimal control of quantum
gates have null measure, facilitating the convergence of local search
algorithms; but (ii) the required time for convergence to optimal controls can
scale exponentially with Hilbert space dimension. Depending on the control
system Hamiltonian, the landscape structure and scaling may vary. This work
introduces methods for quantifying Hamiltonian-dependent and kinematic effects
on control optimization dynamics in order to classify quantum systems according
to the search effort and control resources required to implement arbitrary
unitary transformations.
In text/plain
format
Archived Files and Locations
application/pdf 576.2 kB
file_rd7jfn5si5cb3eidogtp3tn6re
|
arxiv.org (repository) web.archive.org (webarchive) |
application/pdf 557.8 kB
file_tuo7nsnswnhpxcu2pifhcjbera
|
archive.org (archive) arxiv.org (repository) web.archive.org (webarchive) core.ac.uk (web) |
1006.1829v2
access all versions, variants, and formats of this works (eg, pre-prints)