Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:quant-ph/0204101 · Physical Review Letters

Quantum Computing by an Optimal Control Algorithm for Unitary Transformations

José P. Palao, Ronnie Kosloff

Published Oct 14, 2002• 346 citations
arXivHTMLPDF

Abstract

Quantum computation is based on implementing selected unitary transformations representing algorithms. A generalized optimal control theory is used to find the driving field that generates a prespecified unitary transformation. The approach is independent of the physical implementation of the quantum computer and it is illustrated for one and two qubit gates in model molecular systems, where only part of the Hilbert space is used for computation.

DOI
10.1103/physrevlett.89.188301

Related papers

Forcing a unitary transformation by an external field: comparing two approaches based on optimal control theory

José P. Palao, Ronnie Kosloff

A quantum gate is realized by specific unitary transformations operating on states representing qubits. Considering a quantum system employed as an element in a quantum computing scheme, the task is therefore to enforce the pre-specified unitary transformation. This task is carried out by an external time dependent field. Optimal control theory has been suggested as a method to compute the external field which alters the evolution of the system such that it performs the desire unitary transformation. This study compares two recent implementations of optimal control theory to find the field that induces a quantum gate. The first approach is based on the equation of motion of the unitary transformation. The second approach generalizes the state to state formulation of optimal control theory. This work highlight the formal relation between the two approaches.

arXiv:quant-ph/0208147•Aug 24, 2002•0 citations

Optimal control theory for unitary transformations

José P. Palao, Ronnie Kosloff

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 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 different scheme. The schemes are compared for the inversion of a two-qubit Fourier transform using as registers the vibrational levels of the $X{}^{1}{\ensuremath{\Sigma}}_{g}^{+}$ electronic state of ${\mathrm{Na}}_{2}.$ Raman-like transitions through the $A{}^{1}{\ensuremath{\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. Of the schemes studied, the square modulus scheme converges fastest. A study of the implementation of the Q qubit Fourier transform in the ${\mathrm{Na}}_{2}$ molecule was carried out for up to five 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.

arXiv:quant-ph/0309011•Physical Review A•Dec 9, 2003•313 citations

Search complexity and resource scaling for the quantum optimal control of unitary transformations

Katharine W. Moore, Raj Chakrabarti, Gregory Riviello +1 more

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 the 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.

arXiv:1006.1829•Physical Review A•Jan 31, 2011•54 citations

Molecular quantum computing: Implementation of global quantum gates applying optimal control theory

Regina de Vivie‐Riedle, Carmen M. Tesch

Vibrational modes are selected as qubit basis for a new concept of a molecular quantum computer. Optimal control theory is applied to find the optimized laser fields to realize the quantum gates between these qubits.

International Conference on Ultrafast Phenomena•Jan 1, 2002•0 citations

Local control theory for unitary transformations: Application to quantum computing without leakage

Shlomo E. Sklarz, David J. Tannor

We present a local optimal control strategy to produce desired unitary transformations. Unitary transformations are central to all quantum computational algorithms. Many realizations of quantum computation use a submanifold of states, comprising the quantum register, coupled by an external driving field to a collection of additional mediating excited states. Previous attempts to apply control theory to induce unitary transformations on the quantum register, while successful, produced pulses that drive the population out of the computational register at intermediate times. Leakage of population from the register is undesirable since often the states outside the register are prone to decay and decoherence, and populating them causes a decrease in the final fidelity. In this work we devise a local optimal control method for achieving target unitary transformations on a quantum register, while avoiding intermediate leakage out of the computational submanifold. The technique exploits a phase locking of the field to the system such as to eliminate the undesirable excitation. This method is then applied to produce an SU(6) Fourier transform on the vibrational levels of the ground electronic state of the Na$_2$ molecule. The emerging mechanism uses two photon resonances to create a transformation on the quantum register while blocking one photon resonances to excited states.

arXiv:quant-ph/0404081•Apr 13, 2004•13 citations

Quantum computation

This chapter introduces the basic principles of quantum computation. We shall adhere to the quantum circuit model of computation, with which it is easy to work and which is close to physical implementations. We shall not discuss the more abstract quantum Turing machine model, which, however, has been shown to be equivalent to the circuit model. The elementary unit of quantum information and the basic building block of quantum computation is the qubit, a two-level quantum system that can be prepared, manipulated and measured in a controlled way. A quantum computer can be seen as a collection of n qubits and therefore its wave function resides in a 2 n -dimensional complex Hilbert space. As far as coupling to the environment may be neglected, its evolution in time is unitary and governed by the Schrödinger equation. A quantum computation is composed of three basic steps: preparation of the input state, implementation of the desired unitary transformation acting on this state and measurement of the output state. The output of the measurement process is inherently probabilistic and the probabilities of the different possible outputs are set by the basic postulates of quantum mechanics. Therefore, in a quantum algorithm we must, in general, repeat several times the algorithm to obtain the correct solution of our problem with probability as close to one as desired. In this sense, quantum algorithms are analogous to classical probabilistic algorithms. However, the superposition principle and quantum entanglement open up new possibilities for computation. Quantum computers are potentially more powerful than classical (deterministic or probabilistic) computers due to quantum interference and entanglement. We show that, analogously to classical computation, there exists a small set of gates that are universal, that is, any unitary transformation can be decomposed into a sequence of these gates. We then discuss the implementation of the basic Boolean functions and arithmetic operations on a quantum computer.

WORLD SCIENTIFIC eBooks•Dec 1, 2018•0 citations
Quantum computation is based on implementing selected unitary transformations representing algorithms. A generalized optimal control theory is used to find the driving field that generates a prespecified unitary transformation. The approach is independent of the physical implementation of the quantum computer and it is illustrated for one and two qubit gates in model molecular systems, where only part of the Hilbert space is used for computation.
A quantum gate is realized by specific unitary transformations operating on states representing qubits. Considering a quantum system employed as an element in a quantum computing scheme, the task is therefore to enforce the pre-specified unitary transformation. This task is carried out by an external time dependent field. Optimal control theory has been suggested as a method to compute the external field which alters the evolution of the system such that it performs the desire unitary transformation. This study compares two recent implementations of optimal control theory to find the field that induces a quantum gate. The first approach is based on the equation of motion of the unitary transformation. The second approach generalizes the state to state formulation of optimal control theory. This work highlight the formal relation between the two approaches.
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 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 different scheme. The schemes are compared for the inversion of a two-qubit Fourier transform using as registers the vibrational levels of the $X{}^{1}{\ensuremath{\Sigma}}_{g}^{+}$ electronic state of Na2.{\mathrm{Na}}_{2}.Na2​. Raman-like transitions through the $A{}^{1}{\ensuremath{\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. Of the schemes studied, the square modulus scheme converges fastest. A study of the implementation of the Q qubit Fourier transform in the Na2{\mathrm{Na}}_{2}Na2​ molecule was carried out for up to five 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.
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 the 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.
We present a local optimal control strategy to produce desired unitary transformations. Unitary transformations are central to all quantum computational algorithms. Many realizations of quantum computation use a submanifold of states, comprising the quantum register, coupled by an external driving field to a collection of additional mediating excited states. Previous attempts to apply control theory to induce unitary transformations on the quantum register, while successful, produced pulses that drive the population out of the computational register at intermediate times. Leakage of population from the register is undesirable since often the states outside the register are prone to decay and decoherence, and populating them causes a decrease in the final fidelity. In this work we devise a local optimal control method for achieving target unitary transformations on a quantum register, while avoiding intermediate leakage out of the computational submanifold. The technique exploits a phase locking of the field to the system such as to eliminate the undesirable excitation. This method is then applied to produce an SU(6) Fourier transform on the vibrational levels of the ground electronic state of the Na2_22​ molecule. The emerging mechanism uses two photon resonances to create a transformation on the quantum register while blocking one photon resonances to excited states.
This chapter introduces the basic principles of quantum computation. We shall adhere to the quantum circuit model of computation, with which it is easy to work and which is close to physical implementations. We shall not discuss the more abstract quantum Turing machine model, which, however, has been shown to be equivalent to the circuit model. The elementary unit of quantum information and the basic building block of quantum computation is the qubit, a two-level quantum system that can be prepared, manipulated and measured in a controlled way. A quantum computer can be seen as a collection of n qubits and therefore its wave function resides in a 2 n -dimensional complex Hilbert space. As far as coupling to the environment may be neglected, its evolution in time is unitary and governed by the Schrödinger equation. A quantum computation is composed of three basic steps: preparation of the input state, implementation of the desired unitary transformation acting on this state and measurement of the output state. The output of the measurement process is inherently probabilistic and the probabilities of the different possible outputs are set by the basic postulates of quantum mechanics. Therefore, in a quantum algorithm we must, in general, repeat several times the algorithm to obtain the correct solution of our problem with probability as close to one as desired. In this sense, quantum algorithms are analogous to classical probabilistic algorithms. However, the superposition principle and quantum entanglement open up new possibilities for computation. Quantum computers are potentially more powerful than classical (deterministic or probabilistic) computers due to quantum interference and entanglement. We show that, analogously to classical computation, there exists a small set of gates that are universal, that is, any unitary transformation can be decomposed into a sequence of these gates. We then discuss the implementation of the basic Boolean functions and arithmetic operations on a quantum computer.