pith. sign in

arxiv: quant-ph/0309011 · v1 · submitted 2003-08-31 · 🪐 quant-ph

Optimal control theory for unitary transformations

classification 🪐 quant-ph
keywords transformationunitaryfourierquantumstatetransformalgorithmcomputation
0
0 comments X
read the original abstract

The dynamics of a quantum system driven by an external field is well described by a unitary transformation generated by a time dependent Hamiltonian. The inverse problem of finding the field that generates a specific unitary transformation is the subject of study. The unitary transformation which can represent an algorithm in a quantum computation is imposed on a subset of quantum states embedded in a larger Hilbert space. Optimal control theory (OCT) is used to solve the inversion problem irrespective of the initial input state. A unified formalism, based on the Krotov method is developed leading to a new scheme. The schemes are compared for the inversion of a two-qubit Fourier transform using as registers the vibrational levels of the $X^1\Sigma^+_g$ electronic state of Na$_2$. Raman-like transitions through the $A^1\Sigma^+_u$ electronic state induce the transitions. Light fields are found that are able to implement the Fourier transform within a picosecond time scale. Such fields can be obtained by pulse-shaping techniques of a femtosecond pulse. Out of the schemes studied the square modulus scheme converges fastest. A study of the implementation of the $Q$ qubit Fourier transform in the Na$_2$ molecule was carried out for up to 5 qubits. The classical computation effort required to obtain the algorithm with a given fidelity is estimated to scale exponentially with the number of levels. The observed moderate scaling of the pulse intensity with the number of qubits in the transformation is rationalized.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.