2005
DOI: 10.1016/j.jmr.2004.11.004
|View full text |Cite
|
Sign up to set email alerts
|

Optimal control of coupled spin dynamics: design of NMR pulse sequences by gradient ascent algorithms

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

7
1,752
0
1

Year Published

2007
2007
2016
2016

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 1,595 publications
(1,805 citation statements)
references
References 40 publications
7
1,752
0
1
Order By: Relevance
“…The most common approach is to rely on open-loop quantum control techniques, including optimal control algorithms, based on analytical [1] or numerical [2] solutions, Lyapunov design [3] and Hamiltonian engineering [4]. An alternative strategy, inspired by the success of classical control, is feedback control [5].…”
mentioning
confidence: 99%
“…The most common approach is to rely on open-loop quantum control techniques, including optimal control algorithms, based on analytical [1] or numerical [2] solutions, Lyapunov design [3] and Hamiltonian engineering [4]. An alternative strategy, inspired by the success of classical control, is feedback control [5].…”
mentioning
confidence: 99%
“…To overcome this problem, optimized pulse engineering techniques inspired by optimal control theory for NMR quantum computing have been developed in recent years. Here we primarily focus on the GRadient Ascent Pulse Engineering (GRAPE) techniques [17].…”
Section: Universal Gatesmentioning
confidence: 99%
“…This can be decomposed into two CNOT gates and three single qubit Hadamard gates. A GRAPE pulse [17] with the length 1.5ms was designed to implement this encoding operation, and was rectified by pulse fixing in experiment. The estimation of the average fidelity before and after the rectification is 86.3% and 97.3%, respectively.…”
Section: Characterization Of Clifford Gatesmentioning
confidence: 99%
See 1 more Smart Citation
“…We find it advantageous to supplement these with a modified version [23] of the numerically efficient GRAPE algorithm for the calculation of gradients [24]. With this we find optimization of individual waveforms to be straightforward on a desktop computer, and the design of large numbers of waveforms to be feasible on a high-performance cluster [25].…”
mentioning
confidence: 99%